Class implementing the FP-growth algorithm for finding large item sets without candidate generation. Iteratively reduces the minimum support until it finds the required number of rules with the given minimum metric. For more information see: J. Han, J.Pei, Y. Yin: Mining frequent patterns without candidate generation. In: Proceedings of the 2000 ACM-SIGMID International Conference on Management of Data, 1-12, 2000.
(based on WEKA 3.6)
For further options, click the 'More' - button in the dialog.
All weka dialogs have a panel where you can specify associator-specific parameters.
The Preliminary Attribute Check tests the underlying classifier against the DataTable specification at the inport of the node. Columns that are compatible with the classifier are marked with a green 'ok'. Columns which are potentially not compatible are assigned a red error message.
Important: If a column is marked as 'incompatible', it does not necessarily mean that the classifier cannot be executed! Sometimes, the error message 'Cannot handle String class' simply means that no nominal values are available (yet). This may change during execution of the predecessor nodes.
Capabilities: [Binary attributes, Unary attributes, Empty nominal attributes, Missing values, No class] Dependencies:  min # Instance: 1
P: Set the index of the attribute value to consider as 'positive' for binary attributes in normal dense instances. Index 2 is always used for sparse instances. (default = 2)
I: The maximum number of items to include in large items sets (and rules). (default = -1, i.e. no limit.)
N: The required number of rules. (default = 10)
T: The metric by which to rank rules. (default = confidence)
C: The minimum metric score of a rule. (default = 0.9)
U: Upper bound for minimum support as a fraction or number of instances. (default = 1.0)
M: The lower bound for the minimum support as a fraction or number of instances. (default = 0.1)
D: The delta by which the minimum support is decreased in each iteration as a fraction or number of instances. (default = 0.05)
S: Find all rules that meet the lower bound on minimum support and the minimum metric constraint. Turning this mode on will disable the iterative support reduction procedure to find the specified number of rules.
transactions: Only consider transactions that contain these items (default = no restriction)
rules: Only print rules that contain these items. (default = no restriction)
use-or: Use OR instead of AND for must contain list(s). Use in conjunction with -transactions and/or -rules
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.
A zipped version of the software site can be downloaded here.
Do you have feedback, questions, comments about NodePit, want to support this platform, or want your own nodes or workflows listed here as well? Do you think, the search results could be improved or something is missing? Then please get in touch! Alternatively, you can send us an email to email@example.com, follow @NodePit on Twitter, or chat on Gitter!
Please note that this is only about NodePit. We do not provide general support for KNIME — please use the KNIME forums instead.