Skip navigation links

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

This package contains two algorithm implementations for the SubgroupMinerNode.

See: Description

Package org.knime.base.node.mine.subgroupminer.apriori Description

This package contains two algorithm implementations for the SubgroupMinerNode. The ArrayApriori algorithm realizes the apriori algorithm with the help of a prefix tree, where the nodes are arrays, each containing a counter at the corresponding position. The TIDAprioriAlgorithm is indeed an Eclat implementation, since it realizes the subgroup mining in a depth-first-search manner by combining the transaction ids of each item with the other ones.
Skip navigation links

Copyright, 2003 - 2016. All rights reserved.
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.