| Package | Description | 
|---|---|
| de.lmu.ifi.dbs.elki.algorithm.itemsetmining | 
 Algorithms for frequent itemset mining such as APRIORI. 
 | 
| Modifier and Type | Class and Description | 
|---|---|
static class  | 
FPGrowth.FPTree
FP-Tree data structure 
 | 
| Modifier and Type | Field and Description | 
|---|---|
(package private) FPGrowth.FPNode[] | 
FPGrowth.FPNode.children
Children. 
 | 
(package private) static FPGrowth.FPNode[] | 
FPGrowth.FPNode.EMPTY_CHILDREN
Constant for leaf nodes. 
 | 
(package private) FPGrowth.FPNode[] | 
FPGrowth.FPTree.header
Header table 
 | 
(package private) FPGrowth.FPNode | 
FPGrowth.FPNode.parent
Parent node and next in sequence. 
 | 
(package private) FPGrowth.FPNode | 
FPGrowth.FPNode.sibling
Parent node and next in sequence. 
 | 
| Modifier and Type | Method and Description | 
|---|---|
FPGrowth.FPNode | 
FPGrowth.FPTree.newNode(FPGrowth.FPNode parent,
       int label)
Create a new node of the FP-tree, linking it into the header table. 
 | 
| Modifier and Type | Method and Description | 
|---|---|
FPGrowth.FPNode | 
FPGrowth.FPTree.newNode(FPGrowth.FPNode parent,
       int label)
Create a new node of the FP-tree, linking it into the header table. 
 | 
| Constructor and Description | 
|---|
FPNode(FPGrowth.FPNode parent,
      int key)
Constructor. 
 | 
Copyright © 2019 ELKI Development Team. License information.