msapriori__trie_8hpp-source.html
来自「Aprior的C++实现算法」· HTML 代码 · 共 93 行
HTML
93 行
<!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: MSApriori_Trie.hpp Source File</title><link href="doxygen.css" rel="stylesheet" type="text/css"></head><body><!-- Generated by Doxygen 1.3.5 --><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>MSApriori_Trie.hpp</h1><a href="MSApriori__Trie_8hpp.html">Go to the documentation of this file.</a><div class="fragment"><pre>00001 <span class="comment">/***************************************************************************</span>00002 <span class="comment"> MSApriori_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@mit.bme.hu</span>00007 <span class="comment"> ***************************************************************************/</span>00008 00009 <span class="preprocessor">#ifndef MSApriori_Trie_HPP</span>00010 <span class="preprocessor"></span><span class="preprocessor">#define MSApriori_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="l00032"></a><a class="code" href="classMSApriori__Trie.html">00032</a> <span class="keyword">class </span><a class="code" href="classMSApriori__Trie.html">MSApriori_Trie</a>00033 {00034 <span class="keyword">public</span>:00035 00036 <a class="code" href="classMSApriori__Trie.html#a0">MSApriori_Trie</a>( <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> counter_of_emptyset, <span class="keyword">const</span> vector<double>& <a class="code" href="classMSApriori__Trie.html#p2">mis_abs</a> );00037 00039 <span class="keywordtype">void</span> <a class="code" href="classMSApriori__Trie.html#a1">insert_frequent_items</a>( <span class="keyword">const</span> set< pair<itemtype, unsigned long> >& counters );00040 00041 00043 <span class="keywordtype">void</span> <a class="code" href="classMSApriori__Trie.html#a2">candidate_generation</a>( <span class="keyword">const</span> <a class="code" href="common_8hpp.html#a0">itemtype</a>& frequent_size );00044 00046 <span class="keywordtype">void</span> <a class="code" href="classMSApriori__Trie.html#a3">find_candidate</a>( <span class="keyword">const</span> vector<itemtype>& basket, <span class="keyword">const</span> <a class="code" href="common_8hpp.html#a0">itemtype</a> candidate_size, <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> counter=1 );00047 00049 <span class="keywordtype">void</span> <a class="code" href="classMSApriori__Trie.html#a4">delete_infrequent</a>( <span class="keyword">const</span> <a class="code" href="common_8hpp.html#a0">itemtype</a> candidate_size );00050 00052 <span class="keywordtype">void</span> <a class="code" href="classMSApriori__Trie.html#a5">association</a>( <span class="keyword">const</span> <span class="keywordtype">double</span> min_conf, <a class="code" href="classInput__Output__Manager.html">Input_Output_Manager</a>& input_output_manager ) <span class="keyword">const</span>;00053 00055 <a class="code" href="common_8hpp.html#a0">itemtype</a> <a class="code" href="classMSApriori__Trie.html#a6">longest_path</a>() <span class="keyword">const</span>;00056 00058 <span class="keywordtype">void</span> <a class="code" href="classMSApriori__Trie.html#a7">write_content_to_file</a>( <a class="code" href="classInput__Output__Manager.html">Input_Output_Manager</a>& input_output_manager ) <span class="keyword">const</span>;00059 00061 <span class="keywordtype">void</span> <a class="code" href="classMSApriori__Trie.html#a8">show_content_preorder</a>( ) <span class="keyword">const</span>;00062 00063 <a class="code" href="classMSApriori__Trie.html#a9">~MSApriori_Trie</a>();00064 00065 <span class="keyword">protected</span>:00066 00068 <span class="keywordtype">bool</span> <a class="code" href="classMSApriori__Trie.html#b0">is_all_subset_frequent</a>( <span class="keyword">const</span> set<itemtype>& maybe_candidate ) <span class="keyword">const</span>;00069 00071 <span class="keywordtype">void</span> <a class="code" href="classMSApriori__Trie.html#b1">candidate_generation_two</a>( );00072 00074 <span class="keywordtype">void</span> <a class="code" href="classMSApriori__Trie.html#b2">candidate_generation_assist</a>( <a class="code" href="classTrie.html">Trie</a>* <a class="code" href="classTrie.html">Trie</a>, <span class="keyword">const</span> <a class="code" href="common_8hpp.html#a0">itemtype</a> distance_from_generator,00075 set<itemtype>& maybe_candidate );00076 00078 <span class="keywordtype">void</span> <a class="code" href="classMSApriori__Trie.html#b3">find_candidate_two</a>( <span class="keyword">const</span> vector<itemtype>& basket, <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> counter=1 );00079 00081 <span class="keywordtype">void</span> <a class="code" href="classMSApriori__Trie.html#b4">delete_infrequent_two</a>( );00082 00083 00084 <span class="keywordtype">void</span> <a class="code" href="classMSApriori__Trie.html#b5">assoc_rule_find</a>( <span class="keyword">const</span> <span class="keywordtype">double</span> min_conf, set<itemtype>& condition_part, set<itemtype>& consequence_part, <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> union_support, <a class="code" href="classInput__Output__Manager.html">Input_Output_Manager</a>& input_output_manager ) <span class="keyword">const</span>;00085 00086 <span class="keywordtype">void</span> <a class="code" href="classMSApriori__Trie.html#b6">assoc_rule_assist</a>( <span class="keyword">const</span> <span class="keywordtype">double</span> min_conf, <span class="keyword">const</span> Trie* Trie, set<itemtype>& consequence_part, <a class="code" href="classInput__Output__Manager.html">Input_Output_Manager</a>& input_output_manager ) <span class="keyword">const</span>;00087 00089 <span class="keywordtype">void</span> <a class="code" href="classMSApriori__Trie.html#b7">write_content_to_file_assist</a>( <a class="code" href="classInput__Output__Manager.html">Input_Output_Manager</a>& input_output_manager, <span class="keyword">const</span> Trie* actual_state, <span class="keyword">const</span> <a class="code" href="common_8hpp.html#a0">itemtype</a> distance_from_frequent, set<itemtype>& frequent_itemset ) <span class="keyword">const</span>;00090 <span class="keyword">private</span>:00091 <span class="comment">// No private methods</span>00092 00093 <span class="keyword">public</span>:00094 <span class="comment">// No public members</span>00095 00096 <span class="keyword">protected</span>:<a name="l00098"></a><a class="code" href="classMSApriori__Trie.html#p0">00098</a> Trie <a class="code" href="classMSApriori__Trie.html#p0">main_trie</a>;00099 <a name="l00106"></a><a class="code" href="classMSApriori__Trie.html#p1">00106</a> vector< vector<unsigned long> > <a class="code" href="classMSApriori__Trie.html#p1">temp_counter_array</a>;00107 <a name="l00113"></a><a class="code" href="classMSApriori__Trie.html#p2">00113</a> vector<double> <a class="code" href="classMSApriori__Trie.html#p2">mis_abs</a>;00114 };00115 00116 <span class="preprocessor">#endif</span></pre></div><hr size="1"><address style="align: right;"><small>Generated on Sun Jun 20 23:41:08 2004 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.5 </small></address></body></html>⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?