classtrie.html

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

<p>
Referenced by <a class="el" href="Apriori__Trie_8cpp-source.html#l00069">Apriori_Trie::delete_infrequent()</a>.    </td>
  </tr>
</table>
<a class="anchor" name="a2" doxytag="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 Trie::find_candidate           </td>
          <td class="md" valign="top">(&nbsp;</td>
          <td class="md" nowrap valign="top">vector&lt; <a class="el" href="common_8hpp.html#a0">itemtype</a> &gt;::const_iterator&nbsp;</td>
          <td class="mdname" nowrap> <em>it_basket_upper_bound</em>, </td>
        </tr>
        <tr>
          <td class="md" nowrap align="right"></td>
          <td class="md"></td>
          <td class="md" nowrap>vector&lt; <a class="el" href="common_8hpp.html#a0">itemtype</a> &gt;::const_iterator&nbsp;</td>
          <td class="mdname" nowrap> <em>it_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_incr</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>
Increases the counter for those itemsets that is 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 given basket </td></tr>
    <tr><td valign="top"></td><td valign="top"><em>it_basket</em>&nbsp;</td><td>*it_basket lead to the actual Trie. Only items following this item in the basket need to be considered </td></tr>
    <tr><td valign="top"></td><td valign="top"><em>counter_incr</em>&nbsp;</td><td>The number times this basket occurs </td></tr>
  </table>
</dl>

<p>
Definition at line <a class="el" href="Trie_8cpp-source.html#l00051">51</a> of file <a class="el" href="Trie_8cpp-source.html">Trie.cpp</a>.
<p>
References <a class="el" href="Trie_8hpp-source.html#l00082">counter</a>, and <a class="el" href="Trie_8hpp-source.html#l00088">edgevector</a>.
<p>
Referenced by <a class="el" href="Apriori__Trie_8cpp-source.html#l00053">Apriori_Trie::find_candidate()</a>.    </td>
  </tr>
</table>
<a class="anchor" name="a1" doxytag="Trie::is_included"></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">const <a class="el" href="classTrie.html">Trie</a> * Trie::is_included           </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="mdname" nowrap> <em>an_itemset</em>, </td>
        </tr>
        <tr>
          <td class="md" nowrap align="right"></td>
          <td class="md"></td>
          <td class="md" nowrap>set&lt; <a class="el" href="common_8hpp.html#a0">itemtype</a> &gt;::const_iterator&nbsp;</td>
          <td class="mdname" nowrap> <em>item_it</em></td>
        </tr>
        <tr>
          <td class="md"></td>
          <td class="md">)&nbsp;</td>
          <td class="md" colspan="2"> const</td>
        </tr>
      </table>
    </td>
  </tr>
</table>
<table cellspacing="5" cellpadding="0" border="0">
  <tr>
    <td>
      &nbsp;
    </td>
    <td>

<p>
It decides whether the given itemset is included in the trie or not. 
<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>an_itemset</em>&nbsp;</td><td>The given itemset. </td></tr>
    <tr><td valign="top"></td><td valign="top"><em>item_it</em>&nbsp;</td><td>This iterator shows the element of the basket that has to be processed. </td></tr>
  </table>
</dl>
<dl compact><dt><b>Returns:</b></dt><dd>NULL, if the itemset is not included, otherwise the trie, that represents the itemset. </dd></dl>

<p>
Definition at line <a class="el" href="Trie_8cpp-source.html#l00028">28</a> of file <a class="el" href="Trie_8cpp-source.html">Trie.cpp</a>.
<p>
References <a class="el" href="Trie_8hpp-source.html#l00088">edgevector</a>.
<p>
Referenced by <a class="el" href="Apriori__Trie_8cpp-source.html#l00082">Apriori_Trie::is_all_subset_frequent()</a>.    </td>
  </tr>
</table>
<hr><h2>Friends And Related Function Documentation</h2>
<a class="anchor" name="n0" doxytag="Trie::Apriori_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">friend class <a class="el" href="classApriori__Trie.html">Apriori_Trie</a><code> [friend]</code>          </td>
        </tr>
      </table>
    </td>
  </tr>
</table>
<table cellspacing="5" cellpadding="0" border="0">
  <tr>
    <td>
      &nbsp;
    </td>
    <td>

<p>

<p>
Definition at line <a class="el" href="Trie_8hpp-source.html#l00047">47</a> of file <a class="el" href="Trie_8hpp-source.html">Trie.hpp</a>.    </td>
  </tr>
</table>
<hr><h2>Member Data Documentation</h2>
<a class="anchor" name="r0" doxytag="Trie::counter"></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#a1">countertype</a> <a class="el" href="classTrie.html#r0">Trie::counter</a><code> [private]</code>          </td>
        </tr>
      </table>
    </td>
  </tr>
</table>
<table cellspacing="5" cellpadding="0" border="0">
  <tr>
    <td>
      &nbsp;
    </td>
    <td>

<p>
counter stores the occurrence of the itemset represented by the Trie 
<p>

<p>
Definition at line <a class="el" href="Trie_8hpp-source.html#l00082">82</a> of file <a class="el" href="Trie_8hpp-source.html">Trie.hpp</a>.
<p>
Referenced by <a class="el" href="Apriori__Trie_8cpp-source.html#l00121">Apriori_Trie::candidate_generation_assist()</a>, and <a class="el" href="Trie_8cpp-source.html#l00051">find_candidate()</a>.    </td>
  </tr>
</table>
<a class="anchor" name="r1" doxytag="Trie::edgevector"></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;<a class="el" href="structEdge.html">Edge</a>&gt; <a class="el" href="classTrie.html#r1">Trie::edgevector</a><code> [private]</code>          </td>
        </tr>
      </table>
    </td>
  </tr>
</table>
<table cellspacing="5" cellpadding="0" border="0">
  <tr>
    <td>
      &nbsp;
    </td>
    <td>

<p>
edgevector stores the edges of the root the trie. 
<p>
edgevector is always sorted! 
<p>
Definition at line <a class="el" href="Trie_8hpp-source.html#l00088">88</a> of file <a class="el" href="Trie_8hpp-source.html">Trie.hpp</a>.
<p>
Referenced by <a class="el" href="Trie_8cpp-source.html#l00123">add_empty_state()</a>, <a class="el" href="Apriori__Trie_8cpp-source.html#l00121">Apriori_Trie::candidate_generation_assist()</a>, <a class="el" href="Apriori__Trie_8cpp-source.html#l00104">Apriori_Trie::candidate_generation_two()</a>, <a class="el" href="Trie_8cpp-source.html#l00082">delete_infrequent()</a>, <a class="el" href="Apriori__Trie_8cpp-source.html#l00203">Apriori_Trie::delete_infrequent_two()</a>, <a class="el" href="Trie_8cpp-source.html#l00051">find_candidate()</a>, <a class="el" href="Trie_8cpp-source.html#l00028">is_included()</a>, and <a class="el" href="Trie_8cpp-source.html#l00111">~Trie()</a>.    </td>
  </tr>
</table>
<hr>The documentation for this class was generated from the following files:<ul>
<li><a class="el" href="Trie_8hpp-source.html">Trie.hpp</a><li><a class="el" href="Trie_8cpp-source.html">Trie.cpp</a></ul>
<hr size="1"><address style="align: right;"><small>Generated on Fri Mar 11 14:48:06 2005 for APRIORI algorithm by&nbsp;
<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>