Search Java Classes and Packages
#Org.knime.base.node.mine.subgroupminer.apriori Classes and Interfaces - 9 results found.
| Name | Description | Type | Package | Framework |
| AprioriAlgorithm | This is an interface to hide the different implementations of the apriori algorithm to the Nodes. | Interface | org.knime.base.node.mine.subgroupminer.apriori | KNIME |
| AprioriAlgorithmFactory | To hide the different implementations of the apriori algorithm to the NodeModel, the NodeDialog simply displays the registered | Class | org.knime.base.node.mine.subgroupminer.apriori | KNIME |
| AprioriAlgorithmFactory .AlgorithmDataStructure | Register here possible implementations of the apriori algorithm to be provided by the subgroup miner node (SubgroupMinerModel2). | Class | org.knime.base.node.mine.subgroupminer.apriori | KNIME |
| ArrayApriori | The array apriori uses the ArrayPrefixTreeNode | Class | org.knime.base.node.mine.subgroupminer.apriori | KNIME |
| ArrayPrefixTreeNode | An ArrayPrefixTreeNode contains an array containing the counter for the items, where the array position serves as the item identifier. | Class | org.knime.base.node.mine.subgroupminer.apriori | KNIME |
| TIDApriori | The TIDApriori algorithm is actually an Eclat implementation, since it realizes a depth first search. | Class | org.knime.base.node.mine.subgroupminer.apriori | KNIME |
| 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. | Class | org.knime.base.node.mine.subgroupminer.apriori | KNIME |
| TIDItemSet | The TIDItemSet contains of some TIDItems and a BitSet with their common transaction ids. | Class | org.knime.base.node.mine.subgroupminer.apriori | KNIME |
| TIDPrefixTreeNode | An TIDPrefixTreeNode consists of a TIDItemset, the items in the node, and a list of children of this node. | Class | org.knime.base.node.mine.subgroupminer.apriori | KNIME |