classmsapriori__trie.html

Aprior的C++实现算法

<p>
References <a class="el" href="MSApriori__Trie_8cpp-source.html#l00218">delete_infrequent_two()</a>, <a class="el" href="Trie_8hpp-source.html#l00088">Trie::edgevector</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>, and <a class="el" href="MSApriori__Trie_8hpp-source.html#l00113">mis_abs</a>.
<p>
Referenced by <a class="el" href="MSApriori_8cpp-source.html#l00068">MSApriori::MSAPRIORI_alg()</a>.    </td>
  </tr>
</table>
<a class="anchor" name="b4" doxytag="MSApriori_Trie::delete_infrequent_two" ></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::delete_infrequent_two </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><code> [protected]</code></td>
        </tr>

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

<p>
Deletes the Tries that represent infrequent itemsets of size 2. 
<p>
temp_counter_array[stateIndex_1] will never be used again!<p>
temp_counter_array will never be used again! 
<p>
Definition at line <a class="el" href="MSApriori__Trie_8cpp-source.html#l00218">218</a> of file <a class="el" href="MSApriori__Trie_8cpp-source.html">MSApriori_Trie.cpp</a>.
<p>
References <a class="el" href="Trie_8cpp-source.html#l00015">Edge_point_less()</a>, <a class="el" href="Trie_8hpp-source.html#l00088">Trie::edgevector</a>, <a class="el" href="MSApriori__Trie_8hpp-source.html#l00098">main_trie</a>, <a class="el" href="Trie_8cpp-source.html#l00134">Trie::max_path_set()</a>, <a class="el" href="MSApriori__Trie_8hpp-source.html#l00113">mis_abs</a>, and <a class="el" href="MSApriori__Trie_8hpp-source.html#l00106">temp_counter_array</a>.
<p>
Referenced by <a class="el" href="MSApriori__Trie_8cpp-source.html#l00068">delete_infrequent()</a>.    </td>
  </tr>
</table>
<a class="anchor" name="a3" doxytag="MSApriori_Trie::find_candidate" ></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::find_candidate </td>
          <td class="md" valign="top">(&nbsp;</td>
          <td class="md" nowrap valign="top">const vector&lt; <a class="el" href="common_8hpp.html#a0">itemtype</a> &gt; &amp;&nbsp;</td>
          <td class="mdname" nowrap> <em>basket</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>candidate_size</em>, </td>
        </tr>
        <tr>
          <td></td>
          <td></td>
          <td class="md" nowrap>const unsigned long&nbsp;</td>
          <td class="mdname" nowrap> <em>counter_incr</em> = 1</td>
        </tr>
        <tr>
          <td></td>
          <td class="md">)&nbsp;</td>
          <td class="md" colspan="2"></td>
        </tr>

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

<p>
Increases the counter of those candidates that are contained by the given basket. 
<p>
<dl compact><dt><b>Parameters:</b></dt><dd>
  <table border="0" cellspacing="2" cellpadding="0">
    <tr><td valign=top><em>basket</em>&nbsp;</td><td>The basket that hs to be analyzed. </td></tr>
    <tr><td valign=top><em>candidate_size</em>&nbsp;</td><td>the size of the candidates. </td></tr>
    <tr><td valign=top><em>counter_incr</em>&nbsp;</td><td>The number of time the basket occured. The counters of candidates that occure in the basket has to be incremented by counter_incr. </td></tr>
  </table>
</dl>

<p>
Definition at line <a class="el" href="MSApriori__Trie_8cpp-source.html#l00057">57</a> of file <a class="el" href="MSApriori__Trie_8cpp-source.html">MSApriori_Trie.cpp</a>.
<p>
References <a class="el" href="Trie_8cpp-source.html#l00058">Trie::find_candidate()</a>, <a class="el" href="MSApriori__Trie_8cpp-source.html#l00152">find_candidate_two()</a>, <a class="el" href="common_8hpp-source.html#l00022">itemtype</a>, and <a class="el" href="MSApriori__Trie_8hpp-source.html#l00098">main_trie</a>.
<p>
Referenced by <a class="el" href="MSApriori_8cpp-source.html#l00021">MSApriori::support()</a>.    </td>
  </tr>
</table>
<a class="anchor" name="b3" doxytag="MSApriori_Trie::find_candidate_two" ></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::find_candidate_two </td>
          <td class="md" valign="top">(&nbsp;</td>
          <td class="md" nowrap valign="top">const vector&lt; <a class="el" href="common_8hpp.html#a0">itemtype</a> &gt; &amp;&nbsp;</td>
          <td class="mdname" nowrap> <em>basket</em>, </td>
        </tr>
        <tr>
          <td></td>
          <td></td>
          <td class="md" nowrap>const unsigned long&nbsp;</td>
          <td class="mdname" nowrap> <em>counter</em> = 1</td>
        </tr>
        <tr>
          <td></td>
          <td class="md">)&nbsp;</td>
          <td class="md" colspan="2"><code> [protected]</code></td>
        </tr>

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

<p>
Increases the counter for those itempairs that are in the given basket. 
<p>
<dl compact><dt><b>Parameters:</b></dt><dd>
  <table border="0" cellspacing="2" cellpadding="0">
    <tr><td valign=top><em>basket</em>&nbsp;</td><td>the given basket </td></tr>
    <tr><td valign=top><em>counter</em>&nbsp;</td><td>The number the processed basket occures in the transactional database </td></tr>
  </table>
</dl>

<p>
Definition at line <a class="el" href="MSApriori__Trie_8cpp-source.html#l00152">152</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#l00106">temp_counter_array</a>.
<p>
Referenced by <a class="el" href="MSApriori__Trie_8cpp-source.html#l00057">find_candidate()</a>.    </td>
  </tr>
</table>
<a class="anchor" name="a1" doxytag="MSApriori_Trie::insert_frequent_items" ></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::insert_frequent_items </td>
          <td class="md" valign="top">(&nbsp;</td>
          <td class="md" nowrap valign="top">const set&lt; pair&lt; <a class="el" href="common_8hpp.html#a0">itemtype</a>, unsigned long &gt; &gt; &amp;&nbsp;</td>
          <td class="mdname1" valign="top" nowrap> <em>counters</em>          </td>
          <td class="md" valign="top">&nbsp;)&nbsp;</td>
          <td class="md" nowrap></td>
        </tr>

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

<p>
Insert the frequent items and their counters into the trie;. 
<p>
<dl compact><dt><b>Parameters:</b></dt><dd>
  <table border="0" cellspacing="2" cellpadding="0">
    <tr><td valign=top><em>counters</em>&nbsp;</td><td>It stores the support of the frequent items. counters[i] stores the suport of item i. </td></tr>
  </table>
</dl>

<p>
Definition at line <a class="el" href="MSApriori__Trie_8cpp-source.html#l00030">30</a> of file <a class="el" href="MSApriori__Trie_8cpp-source.html">MSApriori_Trie.cpp</a>.
<p>
References <a class="el" href="Trie_8cpp-source.html#l00150">Trie::add_empty_state()</a>, <a class="el" href="Trie_8hpp-source.html#l00088">Trie::edgevector</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="b0" doxytag="MSApriori_Trie::is_all_subset_frequent" ></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"> bool MSApriori_Trie::is_all_subset_frequent </td>
          <td class="md" valign="top">(&nbsp;</td>
          <td class="md" nowrap valign="top">const set&lt; <a class="el" href="common_8hpp.html#a0">itemtype</a> &gt; &amp;&nbsp;</td>
          <td class="mdname1" valign="top" nowrap> <em>maybe_candidate</em>          </td>
          <td class="md" valign="top">&nbsp;)&nbsp;</td>
          <td class="md" nowrap> const<code> [protected]</code></td>
        </tr>

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

<p>
Decides if all subset of an itemset is contained in the Apriori_Trie. 
<p>
<dl compact><dt><b>Parameters:</b></dt><dd>
  <table border="0" cellspacing="2" cellpadding="0">
    <tr><td valign=top><em>maybe_candidate</em>&nbsp;</td><td>The itemset that has to be checked. </td></tr>
  </table>
</dl>

<p>
Definition at line <a class="el" href="MSApriori__Trie_8cpp-source.html#l00122">122</a> of file <a class="el" href="MSApriori__Trie_8cpp-source.html">MSApriori_Trie.cpp</a>.
<p>
References <a class="el" href="Trie_8cpp-source.html#l00038">Trie::is_included()</a>, <a class="el" href="MSApriori__Trie_8hpp-source.html#l00098">main_trie</a>, and <a class="el" href="MSApriori__Trie_8hpp-source.html#l00113">mis_abs</a>.
<p>
Referenced by <a class="el" href="MSApriori__Trie_8cpp-source.html#l00181">candidate_generation_assist()</a>.    </td>
  </tr>
</table>
<a class="anchor" name="a6" doxytag="MSApriori_Trie::longest_path" ></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="common_8hpp.html#a0">itemtype</a> MSApriori_Trie::longest_path </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>