Uses of Class
de.lmu.ifi.dbs.elki.algorithm.itemsetmining.SparseItemset

Packages that use SparseItemset

Package	Description
de.lmu.ifi.dbs.elki.algorithm.itemsetmining	Algorithms for frequent itemset mining such as APRIORI.

Uses of SparseItemset in de.lmu.ifi.dbs.elki.algorithm.itemsetmining

Methods in de.lmu.ifi.dbs.elki.algorithm.itemsetmining that return types with arguments of type SparseItemset

Modifier and Type	Method and Description
protected List<SparseItemset>	APRIORI.buildFrequentTwoItemsets(List<OneItemset> oneitems, Relation<BitVector> relation, int dim, int needed, DBIDs ids, ArrayModifiableDBIDs survivors) Build the 2-itemsets.
protected List<SparseItemset>	APRIORI.frequentItemsetsSparse(List<SparseItemset> candidates, Relation<BitVector> relation, int needed, DBIDs ids, ArrayModifiableDBIDs survivors, int length) Returns the frequent BitSets out of the given BitSets with respect to the given database.

Methods in de.lmu.ifi.dbs.elki.algorithm.itemsetmining with parameters of type SparseItemset

Modifier and Type	Method and Description
private int	APRIORI.binarySearch(List<SparseItemset> candidates, SparseItemset scratch, int begin, int end) Binary-search for the next-larger element.
boolean	SparseItemset.prefixTest(SparseItemset other) Perform the prefix test for sparse itemset.

Method parameters in de.lmu.ifi.dbs.elki.algorithm.itemsetmining with type arguments of type SparseItemset

Modifier and Type	Method and Description
private int	APRIORI.binarySearch(List<SparseItemset> candidates, SparseItemset scratch, int begin, int end) Binary-search for the next-larger element.
protected List<SparseItemset>	APRIORI.frequentItemsetsSparse(List<SparseItemset> candidates, Relation<BitVector> relation, int needed, DBIDs ids, ArrayModifiableDBIDs survivors, int length) Returns the frequent BitSets out of the given BitSets with respect to the given database.