ca.pfv.spmf.algorithms.frequentpatterns.aprioriTID

Class AlgoAprioriTID_Bitset

java.lang.Object

ca.pfv.spmf.algorithms.frequentpatterns.aprioriTID.AlgoAprioriTID_Bitset

public class AlgoAprioriTID_Bitset
extends java.lang.Object

This is an implementation of the AprioriTID algorithm. This version is very fast because it uses bit vector for representing TID SETS (transaction id sets).

The AprioriTID algorithm finds all the frequents itemsets and their support in a transaction database and save them to file.

AprioriTID was originally proposed in :

Agrawal R, Srikant R. "Fast Algorithms for Mining Association Rules", VLDB. Sep 12-15 1994, Chile, 487-99,

See Also:

Itemset

Constructor Summary

Constructors

Constructor and Description
AlgoAprioriTID_Bitset() Default constructor

Method Summary

Modifier and Type	Method and Description
void	printStats() Print statistics about the algorithm execution to System.out.
void	runAlgorithm(java.lang.String input, java.lang.String output, double minsup)
void	setMaxItemsetSize(int maxItemsetSize) Set the maximum itemset size of itemsets to be found

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

AlgoAprioriTID_Bitset

public AlgoAprioriTID_Bitset()

Default constructor

Method Detail

runAlgorithm

public void runAlgorithm(java.lang.String input,
                         java.lang.String output,
                         double minsup)
                  throws java.lang.NumberFormatException,
                         java.io.IOException

Throws:

java.lang.NumberFormatException

java.io.IOException

setMaxItemsetSize

public void setMaxItemsetSize(int maxItemsetSize)

Set the maximum itemset size of itemsets to be found

Parameters:

maxItemsetSize - maximum itemset size.

printStats

public void printStats()

Print statistics about the algorithm execution to System.out.