SeqFrequent2Filter< IT_R > Class Template Reference

This class finds the frequent sequences of size 2 with the array technique. More...

Collaboration diagram for SeqFrequent2Filter< IT_R >:


Public Member Functions
	SeqFrequent2Filter (IT_R *it_r)
void	findFrequentPairs (std::vector< std::pair< counter_t, std::pair< item_t, item_t > > > &freq_pairs_with_counters, counter_t min_supp)
Private Attributes
IT_R *	it_r
const item_t	largest_item_p1

Detailed Description

This class finds the frequent sequences of size 2 with the array technique.

Parameters:

IT_R

the type of the transaction reader.

Definition at line 20 of file SeqFrequent2Filter.cpp.

template<class IT_R>

SeqFrequent2Filter< IT_R >::SeqFrequent2Filter ( IT_R * it_r ) [inline]

template<class IT_R>

void SeqFrequent2Filter< IT_R >::findFrequentPairs ( std::vector< std::pair< counter_t, std::pair< item_t, item_t > > > & freq_pairs_with_counters,

counter_t min_supp

) [inline]

Parameters:

freq_pairs_with_counters the vector that stores the frequent sequences of size two. Each element of a vector is a pair, where the first element is the counter, and the second element stores the elements of the sequence.

min_supp the support threshold

Determining the support of the ipairs
Finding the frequent pairs
Definition at line 43 of file SeqFrequent2Filter.cpp.
References SeqFrequent2Filter< IT_R >::it_r, and SeqFrequent2Filter< IT_R >::largest_item_p1.
Referenced by SeqAprioriSelector< TRIE, LEAF, T_R, DF_D >::SeqAprioriSelector().

template<class IT_R>

IT_R* SeqFrequent2Filter< IT_R >::it_r [private]

Definition at line 33 of file SeqFrequent2Filter.cpp.
Referenced by SeqFrequent2Filter< IT_R >::findFrequentPairs().

The documentation for this class was generated from the following file:

Generated on Sun Sep 17 17:55:29 2006 for FIM environment by

1.4.4