classapriori__trie.html

APRIOR算法的源程序.希望对大家有用,谁有FP-GROWTH算法的程序请给我发一份,谢谢[e-mail]

<p>
Generates candidate of size more than two. 
<p>

<p>
Definition at line <a class="el" href="Apriori__Trie_8cpp-source.html#l00121">121</a> of file <a class="el" href="Apriori__Trie_8cpp-source.html">Apriori_Trie.cpp</a>.
<p>
References <a class="el" href="Trie_8cpp-source.html#l00123">Trie::add_empty_state()</a>, <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="Apriori__Trie_8cpp-source.html#l00082">is_all_subset_frequent()</a>, and <a class="el" href="Input__Output__Manager_8cpp-source.html#l00138">Input_Output_Manager::write_out_basket_and_counter()</a>.
<p>
Referenced by <a class="el" href="Apriori__Trie_8cpp-source.html#l00032">candidate_generation()</a>.    </td>
  </tr>
</table>
<a class="anchor" name="b1" doxytag="Apriori_Trie::candidate_generation_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 Apriori_Trie::candidate_generation_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>
Generates candidate of size two. 
<p>

<p>
Definition at line <a class="el" href="Apriori__Trie_8cpp-source.html#l00104">104</a> of file <a class="el" href="Apriori__Trie_8cpp-source.html">Apriori_Trie.cpp</a>.
<p>
References <a class="el" href="Trie_8hpp-source.html#l00088">Trie::edgevector</a>, <a class="el" href="Apriori__Trie_8hpp-source.html#l00105">main_trie</a>, and <a class="el" href="Apriori__Trie_8hpp-source.html#l00113">temp_counter_array</a>.
<p>
Referenced by <a class="el" href="Apriori__Trie_8cpp-source.html#l00032">candidate_generation()</a>.    </td>
  </tr>
</table>
<a class="anchor" name="a4" doxytag="Apriori_Trie::delete_infrequent"></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 Apriori_Trie::delete_infrequent           </td>
          <td class="md" valign="top">(&nbsp;</td>
          <td class="md" nowrap valign="top">const double&nbsp;</td>
          <td class="mdname" nowrap> <em>min_occurrence</em>, </td>
        </tr>
        <tr>
          <td class="md" nowrap align="right"></td>
          <td class="md"></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 class="md"></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>
Deletes unfrequent itemsets. 
<p>
<dl compact><dt><b>Parameters:</b></dt><dd>
  <table border="0" cellspacing="2" cellpadding="0">
    <tr><td valign="top"></td><td valign="top"><em>min_occurrence</em>&nbsp;</td><td>The threshold of absolute support. </td></tr>
    <tr><td valign="top"></td><td valign="top"><em>candidate_size</em>&nbsp;</td><td>The size of the candidate itemset. </td></tr>
  </table>
</dl>

<p>
Definition at line <a class="el" href="Apriori__Trie_8cpp-source.html#l00069">69</a> of file <a class="el" href="Apriori__Trie_8cpp-source.html">Apriori_Trie.cpp</a>.
<p>
References <a class="el" href="Trie_8cpp-source.html#l00082">Trie::delete_infrequent()</a>, <a class="el" href="Apriori__Trie_8cpp-source.html#l00203">delete_infrequent_two()</a>, and <a class="el" href="Apriori__Trie_8hpp-source.html#l00105">main_trie</a>.    </td>
  </tr>
</table>
<a class="anchor" name="b4" doxytag="Apriori_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 Apriori_Trie::delete_infrequent_two           </td>
          <td class="md" valign="top">(&nbsp;</td>
          <td class="md" nowrap valign="top">const double&nbsp;</td>
          <td class="mdname1" valign="top" nowrap> <em>min_occurrence</em>          </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>
<dl compact><dt><b>Parameters:</b></dt><dd>
  <table border="0" cellspacing="2" cellpadding="0">
    <tr><td valign="top"></td><td valign="top"><em>min_occurrence</em>&nbsp;</td><td>The occurence threshold</td></tr>
  </table>
</dl>
<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="Apriori__Trie_8cpp-source.html#l00203">203</a> of file <a class="el" href="Apriori__Trie_8cpp-source.html">Apriori_Trie.cpp</a>.
<p>
References <a class="el" href="Trie_8cpp-source.html#l00123">Trie::add_empty_state()</a>, <a class="el" href="Trie_8hpp-source.html#l00088">Trie::edgevector</a>, <a class="el" href="Apriori__Trie_8hpp-source.html#l00105">main_trie</a>, and <a class="el" href="Apriori__Trie_8hpp-source.html#l00113">temp_counter_array</a>.
<p>
Referenced by <a class="el" href="Apriori__Trie_8cpp-source.html#l00069">delete_infrequent()</a>.    </td>
  </tr>
</table>
<a class="anchor" name="a3" doxytag="Apriori_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 Apriori_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 class="md" nowrap align="right"></td>
          <td class="md"></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 class="md" nowrap align="right"></td>
          <td class="md"></td>
          <td class="md" nowrap>const <a class="el" href="common_8hpp.html#a1">countertype</a>&nbsp;</td>
          <td class="mdname" nowrap> <em>counter_incr</em> = <code>1</code></td>
        </tr>
        <tr>
          <td class="md"></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"></td><td valign="top"><em>basket</em>&nbsp;</td><td>The basket that hs to be analyzed. </td></tr>
    <tr><td valign="top"></td><td valign="top"><em>candidate_size</em>&nbsp;</td><td>the size of the candidates. </td></tr>
    <tr><td valign="top"></td><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="Apriori__Trie_8cpp-source.html#l00053">53</a> of file <a class="el" href="Apriori__Trie_8cpp-source.html">Apriori_Trie.cpp</a>.
<p>
References <a class="el" href="Trie_8cpp-source.html#l00051">Trie::find_candidate()</a>, <a class="el" href="Apriori__Trie_8cpp-source.html#l00183">find_candidate_two()</a>, and <a class="el" href="Apriori__Trie_8hpp-source.html#l00105">main_trie</a>.
<p>
Referenced by <a class="el" href="Apriori_8cpp-source.html#l00021">Apriori::support()</a>.    </td>
  </tr>
</table>
<a class="anchor" name="b3" doxytag="Apriori_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 Apriori_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 class="md" nowrap align="right"></td>
          <td class="md"></td>
          <td class="md" nowrap>const <a class="el" href="common_8hpp.html#a1">countertype</a>&nbsp;</td>
          <td class="mdname" nowrap> <em>counter</em> = <code>1</code></td>