#include <CandGenInfreqRemoveNopruneMerge.hpp>
Inheritance diagram for Bodon::sequence::inhomogeneous_trie::CandGenInfreqRemoveNopruneMerge< DF_D, TRIE, LEAF, LEAF_ALLOCATOR >:


Public Member Functions | |
| CandGenInfreqRemoveNopruneMerge (TRIE &main_trie, DF_D &df_decoder, LEAF_ALLOCATOR &s_alloc) | |
| void | generateCandidate (unsigned int candidate_size) |
| Generates candidates. | |
| void | deleteInfrequent (const counter_t min_supp, unsigned int candidate_size) |
| void | afterWorkDel () |
| void | afterWorkCandGen () |
| bool | isThereAnyCandidate () const |
Protected Member Functions | |
| void | delete_infrequent_subtrie (TRIE *subtrie, const counter_t min_supp, unsigned int step_to_cand_par) |
| Deletes the tries that represent infrequent itemstd::sets. | |
| void | generateCandidateAtParent (TRIE *trie) |
| void | generateCandidateFindParent (TRIE *trie, unsigned int step_to_freq_par) |
| Generates candidate of size more than two. | |
Protected Attributes | |
| unsigned int | nr_of_deleted |
| unsigned int | total_nr_of_deleted |
| std::vector< Edge > | extenders |
| unsigned int | nr_of_new_candidates |
| unsigned int | nr_of_all_candidates |
| std::vector< Edge > | replace_list |
| LEAF_ALLOCATOR & | s_alloc |
| TRIE & | main_trie |
| Trie to store the candidates. | |
| DF_D & | df_decoder |
| The depth-first decoder. | |
Private Types | |
| typedef CandidateGeneratorNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR > | PARENT |
Definition at line 22 of file inhomogeneous_trie/trie_manipulators/sequence/CandGenInfreqRemoveNopruneMerge.hpp.
|
|||||
|
Reimplemented from Bodon::sequence::inhomogeneous_trie::CandidateGeneratorNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR >. Definition at line 26 of file inhomogeneous_trie/trie_manipulators/sequence/CandGenInfreqRemoveNopruneMerge.hpp. |
|
||||||||||||||||||||
|
Definition at line 31 of file inhomogeneous_trie/trie_manipulators/sequence/CandGenInfreqRemoveNopruneMerge.hpp. |
|
|||||||||
|
Definition at line 76 of file inhomogeneous_trie/trie_manipulators/sequence/CandidateGeneratorNoprune.hpp. |
|
|||||||||
|
||||||||||||||||||||
|
||||||||||||||||
|
||||||||||
|
Generates candidates. Generates candidates and writes frequent itemset that are obtained in the previous iteration to disk. Reimplemented from Bodon::sequence::inhomogeneous_trie::CandidateGeneratorNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR >. Definition at line 63 of file inhomogeneous_trie/trie_manipulators/sequence/CandGenInfreqRemoveNopruneMerge.hpp. References Bodon::sequence::inhomogeneous_trie::CandidateGeneratorNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR >::generateCandidateFindParent(), Bodon::sequence::inhomogeneous_trie::CandidateGeneratorNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR >::nr_of_all_candidates, and Bodon::sequence::inhomogeneous_trie::CandidateGeneratorNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR >::nr_of_new_candidates. |
|
||||||||||
|
||||||||||||||||
|
|||||||||
|
Definition at line 27 of file trie/trie_manipulators/ManipulatorBase.hpp. |
|
|||||
|
|||||
|
|||||
|
|||||
|
|||||
|
|||||
|
|||||
|
|||||
|
|||||
1.4.4