| AlgoPrefixSpan |
This is a 2016 implementation of the PrefixSpan algorithm.
|
| AlgoTRuleGrowth |
This is the original implementation of the TRULEGROWTH algorithm for mining sequential rules
with a window size constraint.
|
| ArraysAlgos |
This class provides a set of basic methods that can be used with itemsets
represented as arrays of integers.
|
| Itemset |
This class represents an itemset from a sequence where
the itemset is a list of strings ordered by lexical order and does not
contain an item twice, and the support of the itemset is not stored.
|
| Itemset2 |
|
| Itemsets |
This class represents a set of itemsets, where an itemset is an array of integers
with an associated support count.
|
| MemoryLogger |
This class is used to record the maximum memory usaged of an algorithm during
a given execution.
|
| Occurence |
This class represent a set of occurences in a sequence, as defined
in the TRuleGrowth algorithm.
|
| PatternSequenceDatabase |
Implementation of a sequence database, where each sequence is implemented
as a list of integers and should have a unique id.
|
| PseudoSequence |
This represents a sequence from a projected database (as based in PrefixSpan).
|
| Sequence |
Implementation of a sequence as a list of itemsets, where an itemset is a list of integers.
|
| SequenceDatabaseRule |
Implementation of a sequence database, where each sequence is implemented
as a list of integers and should have a unique id.
|
| SequentialPattern |
This class represents a sequential pattern.
|
| SequentialPatterns |
A set of sequential patterns grouped by their size (how many items they have).
|