Package | Description |
---|---|
weka.associations |
Modifier and Type | Field and Description |
---|---|
protected FPGrowth.BinaryItem |
FPGrowth.FPTreeNode.m_item
item at this node
|
Modifier and Type | Field and Description |
---|---|
protected Map<FPGrowth.BinaryItem,FPGrowth.FPTreeNode> |
FPGrowth.FPTreeNode.m_children
the children of this node
|
protected Collection<FPGrowth.BinaryItem> |
FPGrowth.AssociationRule.m_consequence
The consequence of the rule
|
protected ArrayList<FPGrowth.BinaryItem> |
FPGrowth.FrequentBinaryItemSet.m_items
The list of items in the item set
|
protected Collection<FPGrowth.BinaryItem> |
FPGrowth.AssociationRule.m_premise
The premise of the rule
|
Modifier and Type | Method and Description |
---|---|
FPGrowth.BinaryItem |
FPGrowth.FPTreeNode.getItem()
Get the item at this node.
|
FPGrowth.BinaryItem |
FPGrowth.FrequentBinaryItemSet.getItem(int index)
Get a particular item from this item set.
|
Modifier and Type | Method and Description |
---|---|
Collection<FPGrowth.BinaryItem> |
FPGrowth.AssociationRule.getConsequence()
Get the consequence of this rule.
|
Collection<FPGrowth.BinaryItem> |
FPGrowth.FrequentBinaryItemSet.getItems()
Get the items in this item set.
|
Collection<FPGrowth.BinaryItem> |
FPGrowth.AssociationRule.getPremise()
Get the premise of this rule.
|
protected ArrayList<FPGrowth.BinaryItem> |
FPGrowth.getSingletons(Instances data)
Get the singleton items in the data
|
Modifier and Type | Method and Description |
---|---|
void |
FPGrowth.FrequentBinaryItemSet.addItem(FPGrowth.BinaryItem i)
Add an item to this item set.
|
int |
FPGrowth.BinaryItem.compareTo(FPGrowth.BinaryItem comp)
Ensures that items will be sorted in descending order of frequency.
|
Modifier and Type | Method and Description |
---|---|
void |
FPGrowth.FPTreeNode.addItemSet(Collection<FPGrowth.BinaryItem> itemSet,
Map<FPGrowth.BinaryItem,FPGrowth.FPTreeRoot.Header> headerTable,
int incr)
Insert an item set into the tree at this node.
|
void |
FPGrowth.FPTreeNode.addItemSet(Collection<FPGrowth.BinaryItem> itemSet,
Map<FPGrowth.BinaryItem,FPGrowth.FPTreeRoot.Header> headerTable,
int incr)
Insert an item set into the tree at this node.
|
protected weka.associations.FPGrowth.FPTreeRoot |
FPGrowth.buildFPTree(ArrayList<FPGrowth.BinaryItem> singletons,
Instances data,
int minSupport)
Construct the frequent pattern tree by inserting each transaction
in the data into the tree.
|
Constructor and Description |
---|
FPTreeNode(FPGrowth.FPTreeNode parent,
FPGrowth.BinaryItem item)
Construct a new node with the given parent link and item.
|
Constructor and Description |
---|
AssociationRule(Collection<FPGrowth.BinaryItem> premise,
Collection<FPGrowth.BinaryItem> consequence,
FPGrowth.AssociationRule.METRIC_TYPE metric,
int premiseSupport,
int consequenceSupport,
int totalSupport,
int totalTransactions)
Construct a new association rule.
|
AssociationRule(Collection<FPGrowth.BinaryItem> premise,
Collection<FPGrowth.BinaryItem> consequence,
FPGrowth.AssociationRule.METRIC_TYPE metric,
int premiseSupport,
int consequenceSupport,
int totalSupport,
int totalTransactions)
Construct a new association rule.
|
FrequentBinaryItemSet(ArrayList<FPGrowth.BinaryItem> items,
int support)
Constructor
|
Copyright © 2015 University of Waikato, Hamilton, NZ. All rights reserved.