package ca.pfv.spmf.algorithms.sequentialpatterns.BIDE_and_prefixspan_with_strings;
/* This file is copyright (c) 2008-2013 Philippe Fournier-Viger
*
* 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 <http://www.gnu.org/licenses/>.
*/
import java.util.ArrayList;
import java.util.List;
import ca.pfv.spmf.patterns.itemset_list_integers_without_support.Itemset;
/**
* This class represents a set of sequential patterns found either by the PrefixSpan or BIDE+ algorithms,
* grouped by their size (how many items they have).
*
* @see Itemset
* @see AlgoPrefixSpan_with_Strings
* @see AlgoBIDEPlus_withStrings
* @author Philippe Fournier-Viger
*/
public class SequentialPatterns {
/** A list of list is used to stored the sequential patterns.
// At position i, a list of sequential patterns contains
// all sequential patterns of size i. */
private final List<List<SequentialPattern>> levels = new ArrayList<List<SequentialPattern>>(); // itemset class� par taille
/** the total number of sequential patterns **/
private int sequenceCount=0;
/** a name that is given to this set of sequential patterns */
private final String name;
/**
* Constructor
* @param name a name to give to this set of patterns
*/
public SequentialPatterns(String name){
this.name = name;
levels.add(new ArrayList<SequentialPattern>()); // on cr�� le niveau z�ro vide par d�faut.
}
/**
* Print all sequential patterns to System.out.
* @param nbObject the size of the original database in terms of sequences.
*/
public void printSequencesFrequentes(int nbObject){
System.out.println(toString(nbObject));
}
/**
* Get a string representation of this set of sequential patterns.
* @param nbObject the number of sequences in the database where these patterns were found.
* @return a string
*/
public String toString(int nbObject){
StringBuilder r = new StringBuilder(200);
r.append(" ----------");
r.append(name);
r.append(" -------\n");
int levelCount=0;
for(List<SequentialPattern> level : levels){
r.append(" L");
r.append(levelCount);
r.append(" \n");
for(SequentialPattern sequence : level){
r.append(" pattern ");
r.append(sequence.getId());
r.append(": ");
r.append(sequence.toString());
r.append("support : ");
r.append(sequence.getRelativeSupportFormated(nbObject));
r.append(" (" );
r.append(sequence.getAbsoluteSupport());
r.append('/');
r.append(nbObject);
r.append(") \n");
}
levelCount++;
}
r.append(" -------------------------------- Patterns count : ");
r.append(sequenceCount);
return r.toString();
}
/**
* Add a sequential pattern to this set of sequential patterns.
* @param sequence the sequential pattern
* @param k the size of the sequential pattern in temrs of itemset.
*/
void addSequence(SequentialPattern sequence, int k){
while(levels.size() <= k){
levels.add(new ArrayList<SequentialPattern>());
}
levels.get(k).add(sequence);
sequenceCount++;
}
/**
* Get all the sequential patterns of a given size.
* @param index the size in terms of items.
* @return a list of sequential patterns.
*/
public List<SequentialPattern> getLevel(int index){
return levels.get(index);
}
/**
* Get the maximum size of sequential patterns + 1.
* @return the maximum size.
*/
public int getLevelCount(){
return levels.size();
}
/**
* Get a list of list of sequential patterns such that
* at position i, there is a list of sequential patterns
* containing i items.
* @return the list of pattern lists.
*/
public List<List<SequentialPattern>> getLevels() {
return levels;
}
}