| Package | Description | 
|---|---|
| de.lmu.ifi.dbs.elki.algorithm.itemsetmining | 
 Algorithms for frequent itemset mining such as APRIORI. 
 | 
| Modifier and Type | Method and Description | 
|---|---|
protected java.util.List<SparseItemset> | 
APRIORI.buildFrequentTwoItemsets(java.util.List<OneItemset> oneitems,
                        Relation<BitVector> relation,
                        int dim,
                        int needed,
                        DBIDs ids,
                        ArrayModifiableDBIDs survivors)
Build the 2-itemsets. 
 | 
protected java.util.List<SparseItemset> | 
APRIORI.frequentItemsetsSparse(java.util.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. 
 | 
| Modifier and Type | Method and Description | 
|---|---|
private int | 
APRIORI.binarySearch(java.util.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. 
 | 
| Modifier and Type | Method and Description | 
|---|---|
private int | 
APRIORI.binarySearch(java.util.List<SparseItemset> candidates,
            SparseItemset scratch,
            int begin,
            int end)
Binary-search for the next-larger element. 
 | 
protected java.util.List<SparseItemset> | 
APRIORI.frequentItemsetsSparse(java.util.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. 
 | 
Copyright © 2019 ELKI Development Team. License information.