Uses of Interface
org.knime.base.node.mine.subgroupminer.apriori.AprioriAlgorithm

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

Uses of AprioriAlgorithm in org.knime.base.node.mine.subgroupminer.apriori
 

Classes in org.knime.base.node.mine.subgroupminer.apriori that implement AprioriAlgorithm
 class ArrayApriori
          The array apriori uses the ArrayPrefixTreeNode data structure to find frequent itemsets.
 class TIDApriori
          The TIDApriori algorithm is actually an Eclat implementation, since it realizes a depth first search.
 

Methods in org.knime.base.node.mine.subgroupminer.apriori that return AprioriAlgorithm
static AprioriAlgorithm AprioriAlgorithmFactory.getAprioriAlgorithm(AprioriAlgorithmFactory.AlgorithmDataStructure type, int bitSetLength, int dbsize)
          Returns an instance of the AprioriAlgorithm interface according to the passed type.
 



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.