ca.pfv.spmf.algorithms.frequentpatterns.relim

Class AlgoRelim

java.lang.Object

ca.pfv.spmf.algorithms.frequentpatterns.relim.AlgoRelim

public class AlgoRelim
extends java.lang.Object

This is an implementation of the RELIM algorithm for mining frequent itemsets. RELIM is proposed by :

Borgelt, C. (2005) Keeping Things Simple: Finding Frequent Item Sets by Recursive Elimination Workshop Open Source Data Mining Software (OSDM'05, Chicago, IL), 66-70. ACM Press, New York, NY, USA 2005

RELIM is not a very efficient frequent itemset mining algorithm, but I decided to implement it because it is simple.

Note that it might not be implemented in a very optimized way. One reason is that in the original article there is no pseudo-code for the algorithm.

See Also:

DatabaseStructureRelim

Constructor Summary

Constructors

Constructor and Description
AlgoRelim() Default constructor

Method Summary

Modifier and Type	Method and Description
void	printStatistics() Print statistics about the latest execution of the algorithm to System.out
void	runAlgorithm(double minsupp, java.lang.String input, java.lang.String output) Run the algorithm

Methods inherited from class java.lang.Object

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

Constructor Detail

AlgoRelim

public AlgoRelim()

Default constructor

Method Detail

runAlgorithm

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

Run the algorithm

Parameters:

minsupp - minimum support threshold

input - the file path of the input file

output - the file path of the desired output file

Throws:

java.io.IOException - exception if error reading/writing files

printStatistics

public void printStatistics()

Print statistics about the latest execution of the algorithm to System.out