Uses of Package
org.knime.base.node.mine.subgroupminer.apriori

Packages that use org.knime.base.node.mine.subgroupminer.apriori
org.knime.base.node.mine.subgroupminer.apriori This package contains two algorithm implementations for the SubgroupMinerNode. 
 

Classes in org.knime.base.node.mine.subgroupminer.apriori used by org.knime.base.node.mine.subgroupminer.apriori
AprioriAlgorithm
          This is an interface to hide the different implementations of the apriori algorithm to the Nodes.
AprioriAlgorithmFactory.AlgorithmDataStructure
          Register here possible implementations of the apriori algorithm to be provided by the subgroup miner node (SubgroupMinerModel).
ArrayPrefixTreeNode
          An ArrayPrefixTreeNode contains an array containing the counter for the items, where the array position serves as the item identifier.
TIDItem
          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.
TIDItemSet
          The TIDItemSet contains of some TIDItems and a BitSet with their common transaction ids.
TIDPrefixTreeNode
          An TIDPrefixTreeNode consists of a TIDItemset, the items in the node, and a list of children of this node.
 



Copyright, 2003 - 2010. All rights reserved.
University of Konstanz, Germany.
Chair for Bioinformatics and Information Mining, Prof. Dr. Michael R. Berthold.
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.