ca.pfv.spmf.algorithms.sequentialpatterns.gsp_AGP.items

Class CandidateInSequenceFinder

java.lang.Object

ca.pfv.spmf.algorithms.sequentialpatterns.gsp_AGP.items.CandidateInSequenceFinder

public class CandidateInSequenceFinder
extends java.lang.Object

In this class a particular pattern is searched in a sequence. This class is a tool of the class that implements the phase that check the support for a candidate set. 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 .

Constructor Summary

Constructors

Constructor and Description
CandidateInSequenceFinder(AbstractionCreator creator) Standard constructor.

Method Summary

Modifier and Type	Method and Description
void	isCandidatePresentInTheSequence_qualitative(Pattern candidate, Sequence sequence, int k, int length, java.util.List<int[]> position) Recursive method to search for a candidate in a sequence.
boolean	isPresent() It answers if the candidate appears in the sequence
void	setPresent(boolean present) Setter of the "present" flag

Methods inherited from class java.lang.Object

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

Constructor Detail

CandidateInSequenceFinder

public CandidateInSequenceFinder(AbstractionCreator creator)

Standard constructor. It only needs the abstraction creator.

Parameters:

creator -

Method Detail

isCandidatePresentInTheSequence_qualitative

public void isCandidatePresentInTheSequence_qualitative(Pattern candidate,
                                                        Sequence sequence,
                                                        int k,
                                                        int length,
                                                        java.util.List<int[]> position)

Recursive method to search for a candidate in a sequence. If the candidate appears in the sequence, set the flag present to true

Parameters:

candidate - to find in the sequence

sequence - the sequence where we will search for the candidate

k - the level in which we are in the main loop of GSP, i.e. the number of items of the candidate

length - the current element with which we are dealing with.

position - List of the positions of all of the elements of the candidate in the sequence

isPresent

public boolean isPresent()

It answers if the candidate appears in the sequence

Returns:

true if it appears otherwise flase

setPresent

public void setPresent(boolean present)

Setter of the "present" flag

Parameters:

present - the present flag value