ca.pfv.spmf.algorithms.frequentpatterns.fin_prepost

Class FIN

java.lang.Object

ca.pfv.spmf.algorithms.frequentpatterns.fin_prepost.FIN

public class FIN
extends java.lang.Object

Java implementation of the FIN algorithm. This implementation was obtained by converting the original C++ code of FIN provided by ZHIHONG DENG, to Java. The code is copyright by Zhihong Deng.

Field Summary

Fields

Modifier and Type	Field and Description
int[][]	bf
int	bf_col
int	bf_currentSize
int	bf_cursor
int	bf_size
int	firstNlistBegin
ca.pfv.spmf.algorithms.frequentpatterns.fin_prepost.FIN.Item[]	item
int[]	itemsetCount
int	minSupport
int[]	nlistBegin
int	nlistCol
int[]	nlistLen
int	nlLenSum
int	nlNodeCount
ca.pfv.spmf.algorithms.frequentpatterns.fin_prepost.FIN.NodeListTreeNode	nlRoot
int	numOfFItem
int	PPCNodeCount
ca.pfv.spmf.algorithms.frequentpatterns.fin_prepost.FIN.PPCTreeNode	ppcRoot
int[]	result
int	resultCount
int	resultLen
int[]	sameItems
int[]	SupportDict

Constructor Summary

Constructors

Constructor and Description
FIN()

Method Summary

Modifier and Type	Method and Description
void	printStats() Print statistics about the latest execution of the algorithm to System.out.
void	runAlgorithm(java.lang.String filename, double minsup, java.lang.String output) Run the algorithm
void	traverse(ca.pfv.spmf.algorithms.frequentpatterns.fin_prepost.FIN.NodeListTreeNode curNode, ca.pfv.spmf.algorithms.frequentpatterns.fin_prepost.FIN.NodeListTreeNode curRoot, int level, int sameCount) Recursively traverse the tree to find frequent itemsets

Methods inherited from class java.lang.Object

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

Field Detail

bf

public int[][] bf

bf_cursor

public int bf_cursor

bf_size

public int bf_size

bf_col

public int bf_col

bf_currentSize

public int bf_currentSize

numOfFItem

public int numOfFItem

minSupport

public int minSupport

item

public ca.pfv.spmf.algorithms.frequentpatterns.fin_prepost.FIN.Item[] item

result

public int[] result

resultLen

public int resultLen

resultCount

public int resultCount

nlLenSum

public int nlLenSum

ppcRoot

public ca.pfv.spmf.algorithms.frequentpatterns.fin_prepost.FIN.PPCTreeNode ppcRoot

nlRoot

public ca.pfv.spmf.algorithms.frequentpatterns.fin_prepost.FIN.NodeListTreeNode nlRoot

itemsetCount

public int[] itemsetCount

nlistBegin

public int[] nlistBegin

nlistCol

public int nlistCol

nlistLen

public int[] nlistLen

firstNlistBegin

public int firstNlistBegin

PPCNodeCount

public int PPCNodeCount

SupportDict

public int[] SupportDict

sameItems

public int[] sameItems

nlNodeCount

public int nlNodeCount

Constructor Detail

FIN

public FIN()

Method Detail

runAlgorithm

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

Run the algorithm

Parameters:

filename - the input file path

minsup - the minsup threshold

output - the output file path

Throws:

java.io.IOException - if error while reading/writting to file

traverse

public void traverse(ca.pfv.spmf.algorithms.frequentpatterns.fin_prepost.FIN.NodeListTreeNode curNode,
                     ca.pfv.spmf.algorithms.frequentpatterns.fin_prepost.FIN.NodeListTreeNode curRoot,
                     int level,
                     int sameCount)
              throws java.io.IOException

Recursively traverse the tree to find frequent itemsets

Parameters:

curNode -

curRoot -

level -

sameCount -

Throws:

java.io.IOException - if error while writing itemsets to file

printStats

public void printStats()

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