Package ca.pfv.spmf.algorithms.sequentialpatterns.BIDE_and_prefixspan
-
Class Summary Class Description AlgoBIDEPlus This is a modified version of the BIDE algorithm so that it discovers the set of maximal sequential patterns instead of the set of all closed sequential patterns.AlgoFEAT This is an implementation of the FEAT algorithm.AlgoFSGP This is an implementation of the FSGP algorithm.AlgoMaxSP This is the MaxSP algorithm that discovers the set of maximal sequential patterns instead of the set of all closed sequential patterns.AlgoPrefixSpan This is an implementation of the PrefixSpan algorithm.AlgoTSP_nonClosed This is an implementation of the "PrefixSpanWithSupportRising" algorithm, described in this article (the TSP algorithm for mining all sequential patterns instead of only closed sequential patterns).Candidate PseudoSequence This represents a sequence from a projected database (as based in PrefixSpan).PseudoSequenceBIDE This represents a sequence from a projected database (as based in BIDE+).SequentialPattern This class represents a sequential pattern.SequentialPatterns A set of sequential patterns grouped by their size (how many items they have). -
Enum Summary Enum Description AlgoFEAT.ProjectionEnum
DMelt 3.0 © DataMelt by jWork.ORG