Apriori_Trie.hpp

Go to the documentation of this file.

/***************************************************************************
                          Apriori_Trie.hpp  -  description
                             -------------------
    begin                : cs dec 26 2002
    copyright            : (C) 2002 by Ferenc Bodon
    email                : bodon@cs.bme.hu
 ***************************************************************************/

#ifndef Apriori_Trie_HPP
#define Apriori_Trie_HPP

#include "Trie.hpp"
#include "Input_Output_Manager.hpp"
#include <fstream>
#include <set>
#include <vector>
#include <cstdio>
using namespace std;


class Apriori_Trie
{
public:

   Apriori_Trie( const countertype counter_of_emptyset ):
      main_trie(counter_of_emptyset){}
   
   void insert_frequent_items(const vector<countertype>& counters );
   
   void candidate_generation( const itemtype& frequent_size,
                              Input_Output_Manager& input_output_manager );

   void find_candidate( const vector<itemtype>& basket, 
                        const itemtype candidate_size, 
                        const countertype counter=1 );

   void delete_infrequent( const double min_occurrence, 
                           const itemtype candidate_size );


   bool is_there_any_candidate() const
   {
      return !main_trie.edgevector.empty();
   }

   ~Apriori_Trie(){}

protected:

   bool is_all_subset_frequent( const set<itemtype>& maybe_candidate ) const;

   void candidate_generation_two();

   void candidate_generation_assist( 
      Trie* trie, 
      set<itemtype>& maybe_candidate, 
      Input_Output_Manager& input_output_manager);

   void find_candidate_two( const vector<itemtype>& basket, 
                            const countertype counter=1 );

   void delete_infrequent_two( const double min_occurrence );

private:
   // No private methods

public:
   // No public members

protected:
   Trie main_trie;

   vector< vector<countertype> > temp_counter_array;
};

#endif

---