📄 apriori__trie_8hpp-source.html
字号:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"><html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1"><title>APRIORI algorithm: Apriori_Trie.hpp Source File</title><link href="doxygen.css" rel="stylesheet" type="text/css"></head><body><!-- Generated by Doxygen 1.3.9.1 --><div class="qindex"><a class="qindex" href="index.html">Main Page</a> | <a class="qindex" href="namespaces.html">Namespace List</a> | <a class="qindex" href="annotated.html">Class List</a> | <a class="qindex" href="files.html">File List</a> | <a class="qindex" href="functions.html">Class Members</a> | <a class="qindex" href="globals.html">File Members</a></div><h1>Apriori_Trie.hpp</h1><a href="Apriori__Trie_8hpp.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment">00001 <span class="comment">/***************************************************************************</span>00002 <span class="comment"> Apriori_Trie.hpp - description</span>00003 <span class="comment"> -------------------</span>00004 <span class="comment"> begin : cs dec 26 2002</span>00005 <span class="comment"> copyright : (C) 2002 by Ferenc Bodon</span>00006 <span class="comment"> email : bodon@cs.bme.hu</span>00007 <span class="comment"> ***************************************************************************/</span>00008 00009 <span class="preprocessor">#ifndef Apriori_Trie_HPP</span>00010 <span class="preprocessor"></span><span class="preprocessor">#define Apriori_Trie_HPP</span>00011 <span class="preprocessor"></span>00016 <span class="preprocessor">#include "<a class="code" href="Trie_8hpp.html">Trie.hpp</a>"</span>00017 <span class="preprocessor">#include "<a class="code" href="Input__Output__Manager_8hpp.html">Input_Output_Manager.hpp</a>"</span>00018 <span class="preprocessor">#include <fstream></span>00019 <span class="preprocessor">#include <set></span>00020 <span class="preprocessor">#include <vector></span>00021 <span class="preprocessor">#include <cstdio></span>00022 <span class="keyword">using</span> <span class="keyword">namespace </span>std;00023 00024 <a name="l00035"></a><a class="code" href="classApriori__Trie.html">00035</a> <span class="keyword">class </span><a class="code" href="classApriori__Trie.html">Apriori_Trie</a>00036 {00037 <span class="keyword">public</span>:00038 <a name="l00043"></a><a class="code" href="classApriori__Trie.html#a0">00043</a> <a class="code" href="classApriori__Trie.html">Apriori_Trie</a>( <span class="keyword">const</span> countertype counter_of_emptyset ):00044 main_trie(counter_of_emptyset){}00045 00047 <span class="keywordtype">void</span> insert_frequent_items(<span class="keyword">const</span> vector<countertype>& counters );00048 00054 <span class="keywordtype">void</span> candidate_generation( <span class="keyword">const</span> itemtype& frequent_size,00055 <a class="code" href="classInput__Output__Manager.html">Input_Output_Manager</a>& input_output_manager );00056 00059 <span class="keywordtype">void</span> find_candidate( <span class="keyword">const</span> vector<itemtype>& basket, 00060 <span class="keyword">const</span> itemtype candidate_size, 00061 <span class="keyword">const</span> countertype counter=1 );00062 00064 <span class="keywordtype">void</span> delete_infrequent( <span class="keyword">const</span> <span class="keywordtype">double</span> min_occurrence, 00065 <span class="keyword">const</span> itemtype candidate_size );00066 00067 <a name="l00069"></a><a class="code" href="classApriori__Trie.html#a5">00069</a> <span class="keywordtype">bool</span> is_there_any_candidate()<span class="keyword"> const</span>00070 <span class="keyword"> </span>{00071 <span class="keywordflow">return</span> !main_trie.edgevector.empty();00072 }00073 <a name="l00074"></a><a class="code" href="classApriori__Trie.html#a6">00074</a> ~<a class="code" href="classApriori__Trie.html">Apriori_Trie</a>(){}00075 00076 <span class="keyword">protected</span>:00077 00079 <span class="keywordtype">bool</span> is_all_subset_frequent( <span class="keyword">const</span> set<itemtype>& maybe_candidate ) <span class="keyword">const</span>;00080 00082 <span class="keywordtype">void</span> candidate_generation_two();00083 00085 <span class="keywordtype">void</span> candidate_generation_assist( 00086 <a class="code" href="classTrie.html">Trie</a>* trie, 00087 set<itemtype>& maybe_candidate, 00088 <a class="code" href="classInput__Output__Manager.html">Input_Output_Manager</a>& input_output_manager);00089 00091 <span class="keywordtype">void</span> find_candidate_two( <span class="keyword">const</span> vector<itemtype>& basket, 00092 <span class="keyword">const</span> countertype counter=1 );00093 00095 <span class="keywordtype">void</span> delete_infrequent_two( <span class="keyword">const</span> <span class="keywordtype">double</span> min_occurrence );00096 00097 <span class="keyword">private</span>:00098 <span class="comment">// No private methods</span>00099 00100 <span class="keyword">public</span>:00101 <span class="comment">// No public members</span>00102 00103 <span class="keyword">protected</span>:<a name="l00105"></a><a class="code" href="classApriori__Trie.html#p0">00105</a> <a class="code" href="classTrie.html">Trie</a> main_trie;00106 <a name="l00113"></a><a class="code" href="classApriori__Trie.html#p1">00113</a> vector< vector<countertype> > temp_counter_array;00114 };00115 00116 <span class="preprocessor">#endif</span></pre></div><hr size="1"><address style="align: right;"><small>Generated on Fri Mar 11 14:48:06 2005 for APRIORI algorithm by <a href="http://www.doxygen.org/index.html"><img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.3.9.1 </small></address></body></html>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -