ca.pfv.spmf.algorithms.sequentialpatterns.clasp_AGP

Class FrequentPatternEnumeration_ClaSP

java.lang.Object

ca.pfv.spmf.algorithms.sequentialpatterns.clasp_AGP.FrequentPatternEnumeration_ClaSP

public class FrequentPatternEnumeration_ClaSP
extends java.lang.Object

This is an implementation of the main method of ClaSP algorithm. We can use different kind of IdList although we only makes a implementation: IDListStandard_Mapkeep. However, if we make another new IdList implementing the IDList interface, we can define another different. NOTE: This implementation saves the pattern to a file as soon as they are found or can keep the pattern into memory, depending on what the user choose. Copyright Antonio Gomariz Peñalver 2013 This file is part of the SPMF DATA MINING SOFTWARE (http://www.philippe-fournier-viger.com/spmf). SPMF is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. SPMF is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with SPMF. If not, see .

Field Summary

Fields

Modifier and Type	Field and Description
long	joinCount

Constructor Summary

Constructors

Constructor and Description
FrequentPatternEnumeration_ClaSP(AbstractionCreator abstractionCreator, double minSupAbsolute, Saver saver, boolean findClosedPatterns, boolean executePruningMethods) Standard constructor

Method Summary

Modifier and Type	Method and Description
void	clear()
void	dfsPruning(Pattern patron, Trie trie, boolean verbose, java.util.Map<java.lang.Integer,java.util.Map<java.lang.Integer,java.lang.Integer>> coocMapAfter, java.util.Map<java.lang.Integer,java.util.Map<java.lang.Integer,java.lang.Integer>> coocMapEquals) Execution of the search of frequent patterns.
int	getFrequentPatterns() It returns the number of frequent patterns found by the last execution of the algorithm.
void	setPatronesFrecuentes(int patronesFrecuentes)

Methods inherited from class java.lang.Object

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

Field Detail

joinCount

public long joinCount

Constructor Detail

FrequentPatternEnumeration_ClaSP

public FrequentPatternEnumeration_ClaSP(AbstractionCreator abstractionCreator,
                                        double minSupAbsolute,
                                        Saver saver,
                                        boolean findClosedPatterns,
                                        boolean executePruningMethods)

Standard constructor

Parameters:

abstractionCreator - the abstraction creator

minSupAbsolute - The absolute minimum support

saver - The saver for correctly save the results where the user wants

findClosedPatterns - flag to indicate if we are interesting in only finding the closed sequences

Method Detail

dfsPruning

public void dfsPruning(Pattern patron,
                       Trie trie,
                       boolean verbose,
                       java.util.Map<java.lang.Integer,java.util.Map<java.lang.Integer,java.lang.Integer>> coocMapAfter,
                       java.util.Map<java.lang.Integer,java.util.Map<java.lang.Integer,java.lang.Integer>> coocMapEquals)

Execution of the search of frequent patterns.

Parameters:

equivalenceClass - The equivalence class from we start to search for.

keepPatterns - Flag to indicate if we want to keep the patterns found.

verbose - Flag for debugging purposes

coocMapBefore -

-

getFrequentPatterns

public int getFrequentPatterns()

It returns the number of frequent patterns found by the last execution of the algorithm.

Returns:

setPatronesFrecuentes

public void setPatronesFrecuentes(int patronesFrecuentes)

clear

public void clear()