ca.pfv.spmf.algorithms.sequentialpatterns.spade_spam_AGP

Class FrequentPatternEnumeration

java.lang.Object

ca.pfv.spmf.algorithms.sequentialpatterns.spade_spam_AGP.FrequentPatternEnumeration

public class FrequentPatternEnumeration
extends java.lang.Object

This is an implementation of the main methods of SPADE algorithm. We keep open the decision of which IdList to use. We have implemented three different kinds of IdList so far: 1) One based on hash map with arraylist (IDListStandard_Map) 2) One based on hash map with bitsets (IDListBitMap) 3) One based on a big bitmap with all the information kept inside (IDListFatBitmap) 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
static int	INTERSECTION_COUNTER

Constructor Summary

Constructors

Constructor and Description
FrequentPatternEnumeration(CandidateGenerator candidateGenerator, double minSupportAbsolute, Saver saver) Standard constructor of the class.

Method Summary

Modifier and Type	Method and Description
void	execute(EquivalenceClass eq, boolean dfs, boolean keepPatterns, 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	setFrequentPatterns(int patronesFrecuentes)

Methods inherited from class java.lang.Object

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

Field Detail

INTERSECTION_COUNTER

public static int INTERSECTION_COUNTER

Constructor Detail

FrequentPatternEnumeration

public FrequentPatternEnumeration(CandidateGenerator candidateGenerator,
                                  double minSupportAbsolute,
                                  Saver saver)

Standard constructor of the class.

Parameters:

candidateGenerator - The candidate generator used by SPADE

minSupportAbsolute - The absolute minimum support threshold

saver - Saver object to decide where the user want to save the results, if it the case

Method Detail

execute

public void execute(EquivalenceClass eq,
                    boolean dfs,
                    boolean keepPatterns,
                    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:

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

dfs - Flag indicating if we are interested in a depth-first search if activated. Otherwise, we understand that we are interested in a breadth-first search

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:

setFrequentPatterns

public void setFrequentPatterns(int patronesFrecuentes)