This is an interface to hide the different implementations of the apriori algorithm to the Nodes.
To hide the different implementations of the apriori algorithm to the NodeModel, the NodeDialog simply displays the registered AlgorithmDataStructure's and the NodeModel passes it to this factory.
The array apriori uses the
An ArrayPrefixTreeNode contains an array containing the counter for the items, where the array position serves as the item identifier.
The TIDApriori algorithm is actually an Eclat implementation, since it realizes a depth first search.
The TIDItem consists of an id and a BitSet, where each bit corresponds to a transaction id and is set, if this item is present in the transaction.
The TIDItemSet contains of some TIDItems and a BitSet with their common transaction ids.
An TIDPrefixTreeNode consists of a TIDItemset, the items in the node, and a list of children of this node.
Register here possible implementations of the apriori algorithm to be provided by the subgroup miner node (SubgroupMinerModel2).
KNIME GmbH, Konstanz, Germany
You may not modify, publish, transmit, transfer or sell, reproduce, create derivative works from, distribute, perform, display, or in any way exploit any of the content, in whole or in part, except as otherwise expressly permitted in writing by the copyright owner or as specified in the license file distributed with this product.