- Apriori (Agrawal et al. 1993)
- FPgrowth (frequent pattern growth, Han et al 2000)
- RElim (recursive elimination)
- SaM (Split and Merge)
- JIM (Jaccard Item Set Mining)
Apriori: The apriori algorithm (Agrawal et al. 1993) carries out a breadth first search on the subset lattice and determines the support of item sets by subset tests. This is a pretty fast implementation that uses a prefix tree to organize the counters for the item sets. The census data set may be used to test the program.
FPgrowth: The FPgrowth algorithm (frequent pattern growth, Han et al 2000) represents the transaction database as a prefix tree which is enhanced with pointers that organize the nodes into lists referring to the same item. The search is carried out by projecting the prefix tree, working recursively on the result, and pruning the original tree. Since version 1.2 this implementation also contains the alpha-pruning of the FP-Bonsai techniques.
RElim: The RElim algorithm (recursive elimination) is inspired by the FP-growth algorithm, but does its work without prefix trees or any other complicated data structures. The main strength of this algorithm is not its speed (although it is not slow, but even outperforms apriori and eclat on some data sets), but the simplicity of its structure. Basically all the work is done in one recursive function of fairly few lines of code.
SaM: The split and merge algorithm (Split and Merge) combines a depth-first traversal of the subset lattice with a horizontal transaction representation. The main strength of this algorithm is not its speed (although it is not slow, but even outperforms apriori and Eclat on some data sets), but the simplicity of its structure. Basically all the work is done in one recursive function of about fairly few lines of code. In addition, it only uses a simple array as the only data structure.
JIM: Finds Jaccard item sets with an extension of the Eclat algorithm. In analogy to frequent item set mining, where one tries to find item sets the support of which exceeds a user-specified threshold (minimum support) in a database of transactions, a Jaccard item set is an item set for which the (generalized) Jaccard index of its item covers exceeds a user-specified threshold. This measure yields a much better assessment of the association strength of the items than simple support. Since the (generalized) Jaccard index is, like the support, also anti-monotone, the same basic approach can be used for the search, provided it is extended to compute the denominator of the Jaccard index.
Dice: Finds Dice item sets with an extension of the Eclat algorithm. In analogy to frequent item set mining, where one tries to find item sets the support of which exceeds a user-specified threshold (minimum support) in a database of transactions, a Dice item set is an item set for which the Dice index of its item covers exceeds a user-specified threshold.
Tanimoto: Finds Tanimoto item sets with an extension of the Eclat algorithm. In analogy to frequent item set mining, where one tries to find item sets the support of which exceeds a user-specified threshold (minimum support) in a database of transactions, a Tanimoto item set is an item set for which the Tanimoto index of its item covers exceeds a user-specified threshold.
Options
Advanced Settings
Popular Predecessors
File Reader7 %Joiner5 %Excel Reader (XLS)4 %CSV Reader4 %- Column Aggregator3 %
- Rule-based Row Filter3 %
- Create Collection Column3 %
Row Splitter (deprecated)3 %- GroupBy3 %
- Table Creator3 %
- Cache3 %
- Association Rule Learner2 %
Row Filter (deprecated)2 %- Number to String2 %
- Try (Data Ports)2 %
- Split Collection Column2 %
- Create Bit Vector2 %
- Column Combiner2 %
- Excel Reader2 %
- Column Filter1 %
- Partitioning1 %
Column Rename1 %- Statistics1 %
- Association Rule Learner (Borgelt)1 %
- Item Set Finder (Borgelt)1 %
- Cell Splitter1 %
- Document Vector1 %
- CSV Reader1 %
- Term Vector1 %
- Column Expressions (legacy)1 %
- Missing Value1 %
- Color Manager1 %
- Parallel Chunk Start1 %
Strings To Document1 %- Auto-Binner1 %
- Group Loop Start< 1 %
- Table Transposer< 1 %
- Pivot< 1 %
- Rule Engine< 1 %
Table Reader< 1 %Naive Bayes Learner< 1 %- Concatenate< 1 %
Number To String< 1 %- Domain Calculator< 1 %
- Subset Matcher< 1 %
- RowID< 1 %
Cell Replacer< 1 %- Category to Number< 1 %
- Normalizer< 1 %
- Timer Info< 1 %
- Discretise< 1 %
- Benchmark Start (Memory Monitoring)< 1 %
- ARFF Reader< 1 %
Table Row to Variable< 1 %- Chunk Loop Start< 1 %
Cell Splitter< 1 %- Column Merger< 1 %
- String Manipulation< 1 %
- String Replacer< 1 %
- Data Generator< 1 %
- Case Converter< 1 %
- Dictionary Filter< 1 %
- Double Input (legacy)< 1 %
- Combine Columns by Header< 1 %
Database Reader< 1 %Counting Loop Start< 1 %- k-Means< 1 %
- Logistic Regression Learner< 1 %
- Create Byte Vector< 1 %
String To Number< 1 %Column Appender< 1 %- Nominal Value Row Filter< 1 %
- Row Sampling< 1 %
- Unpivot< 1 %
Rank Correlation< 1 %- Counter Generation< 1 %
- Math Formula< 1 %
- SAS7BDAT Reader< 1 %
- Category to Class< 1 %
- Snowball Stemmer< 1 %
Bag of Words Creator< 1 %- Bag Of Words Creator< 1 %
- JSON Column Combiner< 1 %
- Multiobjective Subset Selection (NSGA-II)< 1 %
- Benchmark Start (2 ports)< 1 %
- Benchmark Start< 1 %
- Benchmark Start (Memory Monitoring) (3 ports)< 1 %
- Collection Size< 1 %
- File Reader< 1 %
- Column Appender< 1 %
- Missing Value Column Filter< 1 %
- Joiner< 1 %
- Ungroup< 1 %
- One Rule Inserter< 1 %
- Term Co-Occurrence Counter< 1 %
- Window Loop Start< 1 %
- Find Elements< 1 %
Views
- This node has no views
Workflows
02_Working_with_Collection_Supported_NodesKNIME Hub- 05_DrugBank_Network_analysisKNIME Hub
- Collection CookbookKNIME Hub
- finalProjectKNIME Hub
- finalProjectKNIME Hub
- Show all 12 workflows
Links
- No links available
Developers
You want to see the source code for this node? Click the following button and we’ll use our super-powers to find it for you.