classmsapriori__trie.html

Aprior的C++实现算法

        </tr>

      </table>
    </td>
  </tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
  <tr>
    <td>
      &nbsp;
    </td>
    <td>

<p>
Returns the length of the longest path in the Apriori_Trie. 
<p>

<p>
Definition at line <a class="el" href="MSApriori__Trie_8cpp-source.html#l00091">91</a> of file <a class="el" href="MSApriori__Trie_8cpp-source.html">MSApriori_Trie.cpp</a>.
<p>
References <a class="el" href="common_8hpp-source.html#l00022">itemtype</a>, <a class="el" href="MSApriori__Trie_8hpp-source.html#l00098">main_trie</a>, and <a class="el" href="Trie_8hpp-source.html#l00091">Trie::maxpath</a>.
<p>
Referenced by <a class="el" href="MSApriori_8cpp-source.html#l00068">MSApriori::MSAPRIORI_alg()</a>.    </td>
  </tr>
</table>
<a class="anchor" name="a8" doxytag="MSApriori_Trie::show_content_preorder" ></a><p>
<table class="mdTable" width="100%" cellpadding="2" cellspacing="0">
  <tr>
    <td class="mdRow">
      <table cellpadding="0" cellspacing="0" border="0">
        <tr>
          <td class="md" nowrap valign="top"> void MSApriori_Trie::show_content_preorder </td>
          <td class="md" valign="top">(&nbsp;</td>
          <td class="mdname1" valign="top" nowrap>          </td>
          <td class="md" valign="top">&nbsp;)&nbsp;</td>
          <td class="md" nowrap> const</td>
        </tr>

      </table>
    </td>
  </tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
  <tr>
    <td>
      &nbsp;
    </td>
    <td>

<p>
This procedure shows the Apriori_Trie in a preorde. 
<p>

<p>
Definition at line <a class="el" href="MSApriori__Trie_8cpp-source.html#l00108">108</a> of file <a class="el" href="MSApriori__Trie_8cpp-source.html">MSApriori_Trie.cpp</a>.
<p>
References <a class="el" href="MSApriori__Trie_8hpp-source.html#l00098">main_trie</a>, and <a class="el" href="Trie_8cpp-source.html#l00117">Trie::show_content_preorder()</a>.    </td>
  </tr>
</table>
<a class="anchor" name="a7" doxytag="MSApriori_Trie::write_content_to_file" ></a><p>
<table class="mdTable" width="100%" cellpadding="2" cellspacing="0">
  <tr>
    <td class="mdRow">
      <table cellpadding="0" cellspacing="0" border="0">
        <tr>
          <td class="md" nowrap valign="top"> void MSApriori_Trie::write_content_to_file </td>
          <td class="md" valign="top">(&nbsp;</td>
          <td class="md" nowrap valign="top"><a class="el" href="classInput__Output__Manager.html">Input_Output_Manager</a> &amp;&nbsp;</td>
          <td class="mdname1" valign="top" nowrap> <em>input_output_manager</em>          </td>
          <td class="md" valign="top">&nbsp;)&nbsp;</td>
          <td class="md" nowrap> const</td>
        </tr>

      </table>
    </td>
  </tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
  <tr>
    <td>
      &nbsp;
    </td>
    <td>

<p>
Writes the content (frequent itemsets) to the file. 
<p>

<p>
Definition at line <a class="el" href="MSApriori__Trie_8cpp-source.html#l00096">96</a> of file <a class="el" href="MSApriori__Trie_8cpp-source.html">MSApriori_Trie.cpp</a>.
<p>
References <a class="el" href="Trie_8hpp-source.html#l00082">Trie::counter</a>, <a class="el" href="common_8hpp-source.html#l00022">itemtype</a>, <a class="el" href="MSApriori__Trie_8hpp-source.html#l00098">main_trie</a>, <a class="el" href="Trie_8hpp-source.html#l00091">Trie::maxpath</a>, and <a class="el" href="MSApriori__Trie_8cpp-source.html#l00278">write_content_to_file_assist()</a>.
<p>
Referenced by <a class="el" href="MSApriori_8cpp-source.html#l00068">MSApriori::MSAPRIORI_alg()</a>.    </td>
  </tr>
</table>
<a class="anchor" name="b7" doxytag="MSApriori_Trie::write_content_to_file_assist" ></a><p>
<table class="mdTable" width="100%" cellpadding="2" cellspacing="0">
  <tr>
    <td class="mdRow">
      <table cellpadding="0" cellspacing="0" border="0">
        <tr>
          <td class="md" nowrap valign="top"> void MSApriori_Trie::write_content_to_file_assist </td>
          <td class="md" valign="top">(&nbsp;</td>
          <td class="md" nowrap valign="top"><a class="el" href="classInput__Output__Manager.html">Input_Output_Manager</a> &amp;&nbsp;</td>
          <td class="mdname" nowrap> <em>input_output_manager</em>, </td>
        </tr>
        <tr>
          <td></td>
          <td></td>
          <td class="md" nowrap>const <a class="el" href="classTrie.html">Trie</a> *&nbsp;</td>
          <td class="mdname" nowrap> <em>actual_state</em>, </td>
        </tr>
        <tr>
          <td></td>
          <td></td>
          <td class="md" nowrap>const <a class="el" href="common_8hpp.html#a0">itemtype</a>&nbsp;</td>
          <td class="mdname" nowrap> <em>distance_from_frequent</em>, </td>
        </tr>
        <tr>
          <td></td>
          <td></td>
          <td class="md" nowrap>set&lt; <a class="el" href="common_8hpp.html#a0">itemtype</a> &gt; &amp;&nbsp;</td>
          <td class="mdname" nowrap> <em>frequent_itemset</em></td>
        </tr>
        <tr>
          <td></td>
          <td class="md">)&nbsp;</td>
          <td class="md" colspan="2"> const<code> [protected]</code></td>
        </tr>

      </table>
    </td>
  </tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
  <tr>
    <td>
      &nbsp;
    </td>
    <td>

<p>
Writes out the content of the Apriori_Trie (frequent itemset and counters). 
<p>

<p>
Definition at line <a class="el" href="MSApriori__Trie_8cpp-source.html#l00278">278</a> of file <a class="el" href="MSApriori__Trie_8cpp-source.html">MSApriori_Trie.cpp</a>.
<p>
References <a class="el" href="Trie_8hpp-source.html#l00082">Trie::counter</a>, <a class="el" href="Trie_8hpp-source.html#l00088">Trie::edgevector</a>, <a class="el" href="common_8hpp-source.html#l00022">itemtype</a>, and <a class="el" href="Input__Output__Manager_8cpp-source.html#l00156">Input_Output_Manager::write_out_basket_and_counter()</a>.
<p>
Referenced by <a class="el" href="MSApriori__Trie_8cpp-source.html#l00096">write_content_to_file()</a>.    </td>
  </tr>
</table>
<hr><h2>Member Data Documentation</h2>
<a class="anchor" name="p0" doxytag="MSApriori_Trie::main_trie" ></a><p>
<table class="mdTable" width="100%" cellpadding="2" cellspacing="0">
  <tr>
    <td class="mdRow">
      <table cellpadding="0" cellspacing="0" border="0">
        <tr>
          <td class="md" nowrap valign="top"> <a class="el" href="classTrie.html">Trie</a> <a class="el" href="classMSApriori__Trie.html#p0">MSApriori_Trie::main_trie</a><code> [protected]</code>
      </table>
    </td>
  </tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
  <tr>
    <td>
      &nbsp;
    </td>
    <td>

<p>
<a class="el" href="classTrie.html">Trie</a> to store the candidates and the frequent itemsets. 
<p>

<p>
Definition at line <a class="el" href="MSApriori__Trie_8hpp-source.html#l00098">98</a> of file <a class="el" href="MSApriori__Trie_8hpp-source.html">MSApriori_Trie.hpp</a>.
<p>
Referenced by <a class="el" href="MSApriori__Trie_8cpp-source.html#l00240">assoc_rule_find()</a>, <a class="el" href="MSApriori__Trie_8cpp-source.html#l00084">association()</a>, <a class="el" href="MSApriori__Trie_8cpp-source.html#l00040">candidate_generation()</a>, <a class="el" href="MSApriori__Trie_8cpp-source.html#l00165">candidate_generation_two()</a>, <a class="el" href="MSApriori__Trie_8cpp-source.html#l00068">delete_infrequent()</a>, <a class="el" href="MSApriori__Trie_8cpp-source.html#l00218">delete_infrequent_two()</a>, <a class="el" href="MSApriori__Trie_8cpp-source.html#l00057">find_candidate()</a>, <a class="el" href="MSApriori__Trie_8cpp-source.html#l00030">insert_frequent_items()</a>, <a class="el" href="MSApriori__Trie_8cpp-source.html#l00122">is_all_subset_frequent()</a>, <a class="el" href="MSApriori__Trie_8cpp-source.html#l00091">longest_path()</a>, <a class="el" href="MSApriori__Trie_8cpp-source.html#l00108">show_content_preorder()</a>, and <a class="el" href="MSApriori__Trie_8cpp-source.html#l00096">write_content_to_file()</a>.    </td>
  </tr>
</table>
<a class="anchor" name="p2" doxytag="MSApriori_Trie::mis_abs" ></a><p>
<table class="mdTable" width="100%" cellpadding="2" cellspacing="0">
  <tr>
    <td class="mdRow">
      <table cellpadding="0" cellspacing="0" border="0">
        <tr>
          <td class="md" nowrap valign="top"> vector&lt;double&gt; <a class="el" href="classMSApriori__Trie.html#p2">MSApriori_Trie::mis_abs</a><code> [protected]</code>
      </table>
    </td>
  </tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
  <tr>
    <td>
      &nbsp;
    </td>
    <td>

<p>
The mis values. 
<p>
mis_abs[i] strores the mis value of item i.<p>
mis_abs vector is sorted, because eacs item gets a new code so that the item withe the smallest mis value has the smallest code. This is for the sake of efficiency, and candidate generation simplicity. 
<p>
Definition at line <a class="el" href="MSApriori__Trie_8hpp-source.html#l00113">113</a> of file <a class="el" href="MSApriori__Trie_8hpp-source.html">MSApriori_Trie.hpp</a>.
<p>
Referenced by <a class="el" href="MSApriori__Trie_8cpp-source.html#l00165">candidate_generation_two()</a>, <a class="el" href="MSApriori__Trie_8cpp-source.html#l00068">delete_infrequent()</a>, <a class="el" href="MSApriori__Trie_8cpp-source.html#l00218">delete_infrequent_two()</a>, and <a class="el" href="MSApriori__Trie_8cpp-source.html#l00122">is_all_subset_frequent()</a>.    </td>
  </tr>
</table>
<a class="anchor" name="p1" doxytag="MSApriori_Trie::temp_counter_array" ></a><p>
<table class="mdTable" width="100%" cellpadding="2" cellspacing="0">
  <tr>
    <td class="mdRow">
      <table cellpadding="0" cellspacing="0" border="0">
        <tr>
          <td class="md" nowrap valign="top"> vector&lt; vector&lt;unsigned long&gt; &gt; <a class="el" href="classMSApriori__Trie.html#p1">MSApriori_Trie::temp_counter_array</a><code> [protected]</code>
      </table>
    </td>
  </tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
  <tr>
    <td>
      &nbsp;
    </td>
    <td>

<p>
temp_counter_array stores the occurences of the itempairs 
<p>
We can use a simple array to determine the support of itemset of size two. This requires less memory than the trie-based supportcount. temp_counter_array[i][j-i] stores the occurence of the itempair (i,j). 
<p>
Definition at line <a class="el" href="MSApriori__Trie_8hpp-source.html#l00106">106</a> of file <a class="el" href="MSApriori__Trie_8hpp-source.html">MSApriori_Trie.hpp</a>.
<p>
Referenced by <a class="el" href="MSApriori__Trie_8cpp-source.html#l00165">candidate_generation_two()</a>, <a class="el" href="MSApriori__Trie_8cpp-source.html#l00218">delete_infrequent_two()</a>, and <a class="el" href="MSApriori__Trie_8cpp-source.html#l00152">find_candidate_two()</a>.    </td>
  </tr>
</table>
<hr>The documentation for this class was generated from the following files:<ul>
<li><a class="el" href="MSApriori__Trie_8hpp-source.html">MSApriori_Trie.hpp</a><li><a class="el" href="MSApriori__Trie_8cpp-source.html">MSApriori_Trie.cpp</a></ul>
<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>