Package | Description |
---|---|
weka.associations |
Modifier and Type | Field and Description |
---|---|
protected ArrayList<FPGrowth.FrequentBinaryItemSet> |
FPGrowth.FrequentItemSets.m_sets
The list of frequent item sets
|
Modifier and Type | Method and Description |
---|---|
FPGrowth.FrequentBinaryItemSet |
FPGrowth.FrequentItemSets.getItemSet(int index)
Get an item set.
|
Modifier and Type | Method and Description |
---|---|
Iterator<FPGrowth.FrequentBinaryItemSet> |
FPGrowth.FrequentItemSets.iterator()
Get an iterator that can be used to access all the item sets.
|
Modifier and Type | Method and Description |
---|---|
void |
FPGrowth.FrequentItemSets.addItemSet(FPGrowth.FrequentBinaryItemSet setToAdd)
Add an item set.
|
protected void |
FPGrowth.mineTree(weka.associations.FPGrowth.FPTreeRoot tree,
FPGrowth.FrequentItemSets largeItemSets,
int recursionLevel,
FPGrowth.FrequentBinaryItemSet conditionalItems,
int minSupport)
Find large item sets in the FP-tree.
|
Modifier and Type | Method and Description |
---|---|
void |
FPGrowth.FrequentItemSets.sort(Comparator<FPGrowth.FrequentBinaryItemSet> comp)
Sort the item sets according to the supplied comparator.
|
Copyright © 2015 University of Waikato, Hamilton, NZ. All rights reserved.