|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectorg.knime.base.node.mine.subgroupminer.apriori.TIDApriori
public class TIDApriori
The TIDApriori algorithm is actually an Eclat implementation, since it realizes a depth first search. First of all, the frequent items are determined and stored with the transaction ids. Then, in a depth-first-search manner, the items are combined to larger itemsets by taking the next item from the frequent ones and join their transaction ids until the support is less than the minimum support.
Constructor Summary | |
---|---|
TIDApriori()
|
Method Summary | |
---|---|
void |
findFrequentItems(List<BitVectorValue> transactions,
ExecutionMonitor exec)
Identify those items which occur in a sufficient, that is the minimum support, number of transactions and stores them with the ids of the transactions they appear in. |
void |
findFrequentItemSets(List<BitVectorValue> transactions,
double minSupport,
int maxDepth,
FrequentItemSet.Type type,
ExecutionMonitor exec)
This is the method to start with when mining for frequent itemsets. |
List<AssociationRule> |
getAssociationRules(double confidence)
Returns the association rules generated from the found frequent itemsets with the passed minimal confidence. |
List<FrequentItemSet> |
getFrequentItemSets(FrequentItemSet.Type type)
Returns the found frequent itemsets according to their type, which can either be FREE, CLOSED or MAXIMAL. |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public TIDApriori()
Method Detail |
---|
public void findFrequentItems(List<BitVectorValue> transactions, ExecutionMonitor exec) throws CanceledExecutionException
transactions
- the database containing the transactions as BitSetsexec
- the execution monitor
CanceledExecutionException
- if user cancels executionpublic void findFrequentItemSets(List<BitVectorValue> transactions, double minSupport, int maxDepth, FrequentItemSet.Type type, ExecutionMonitor exec) throws CanceledExecutionException
findFrequentItemSets
in interface AprioriAlgorithm
transactions
- a list of BitSets representing the bitvectors, thus,
corresponding to the whole databaseminSupport
- the minimum support as an absolute valuemaxDepth
- the maximal length of an itemsettype
- the desired type of the frequent itemsetsexec
- the execution monitor
CanceledExecutionException
- if the execution was cancelledpublic List<FrequentItemSet> getFrequentItemSets(FrequentItemSet.Type type)
getFrequentItemSets
in interface AprioriAlgorithm
type
- the desired type, either free, closed or maximal
public List<AssociationRule> getAssociationRules(double confidence)
getAssociationRules
in interface AprioriAlgorithm
confidence
- the desired minimal confidence of the rules
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |