</tr>        <tr>          <td class="md"></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"></td><td valign="top"><em>basket</em>&nbsp;</td><td>the given basket </td></tr>    <tr><td valign="top"></td><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="Apriori__Trie_8cpp-source.html#l00183">183</a> of file <a class="el" href="Apriori__Trie_8cpp-source.html">Apriori_Trie.cpp</a>.<p>References <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#l00053">find_candidate()</a>.    </td>  </tr></table><a class="anchor" name="a1" doxytag="Apriori_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 Apriori_Trie::insert_frequent_items           </td>          <td class="md" valign="top">(&nbsp;</td>          <td class="md" nowrap valign="top">const vector&lt; <a class="el" href="common_8hpp.html#a1">countertype</a> &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"></td><td valign="top"><em>counters</em>&nbsp;</td><td>It stores the support of the items. counters[i] stores the suport of item i. </td></tr>  </table></dl><p>Definition at line <a class="el" href="Apriori__Trie_8cpp-source.html#l00020">20</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>, and <a class="el" href="Apriori__Trie_8hpp-source.html#l00105">main_trie</a>.    </td>  </tr></table><a class="anchor" name="b0" doxytag="Apriori_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 Apriori_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"></td><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="Apriori__Trie_8cpp-source.html#l00082">82</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#l00028">Trie::is_included()</a>, and <a class="el" href="Apriori__Trie_8hpp-source.html#l00105">main_trie</a>.<p>Referenced by <a class="el" href="Apriori__Trie_8cpp-source.html#l00121">candidate_generation_assist()</a>.    </td>  </tr></table><a class="anchor" name="a5" doxytag="Apriori_Trie::is_there_any_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">bool Apriori_Trie::is_there_any_candidate           </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<code> [inline]</code></td>        </tr>      </table>    </td>  </tr></table><table cellspacing="5" cellpadding="0" border="0">  <tr>    <td>      &nbsp;    </td>    <td><p>Returns true if trie is not empty. <p><p>Definition at line <a class="el" href="Apriori__Trie_8hpp-source.html#l00069">69</a> of file <a class="el" href="Apriori__Trie_8hpp-source.html">Apriori_Trie.hpp</a>.    </td>  </tr></table><hr><h2>Member Data Documentation</h2><a class="anchor" name="p0" doxytag="Apriori_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="classApriori__Trie.html#p0">Apriori_Trie::main_trie</a><code> [protected]</code>          </td>        </tr>      </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. <p><p>Definition at line <a class="el" href="Apriori__Trie_8hpp-source.html#l00105">105</a> of file <a class="el" href="Apriori__Trie_8hpp-source.html">Apriori_Trie.hpp</a>.<p>Referenced by <a class="el" href="Apriori__Trie_8cpp-source.html#l00032">candidate_generation()</a>, <a class="el" href="Apriori__Trie_8cpp-source.html#l00104">candidate_generation_two()</a>, <a class="el" href="Apriori__Trie_8cpp-source.html#l00069">delete_infrequent()</a>, <a class="el" href="Apriori__Trie_8cpp-source.html#l00203">delete_infrequent_two()</a>, <a class="el" href="Apriori__Trie_8cpp-source.html#l00053">find_candidate()</a>, <a class="el" href="Apriori__Trie_8cpp-source.html#l00020">insert_frequent_items()</a>, and <a class="el" href="Apriori__Trie_8cpp-source.html#l00082">is_all_subset_frequent()</a>.    </td>  </tr></table><a class="anchor" name="p1" doxytag="Apriori_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;<a class="el" href="common_8hpp.html#a1">countertype</a>&gt; &gt; <a class="el" href="classApriori__Trie.html#p1">Apriori_Trie::temp_counter_array</a><code> [protected]</code>          </td>        </tr>      </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="Apriori__Trie_8hpp-source.html#l00113">113</a> of file <a class="el" href="Apriori__Trie_8hpp-source.html">Apriori_Trie.hpp</a>.<p>Referenced by <a class="el" href="Apriori__Trie_8cpp-source.html#l00104">candidate_generation_two()</a>, <a class="el" href="Apriori__Trie_8cpp-source.html#l00203">delete_infrequent_two()</a>, and <a class="el" href="Apriori__Trie_8cpp-source.html#l00183">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="Apriori__Trie_8hpp-source.html">Apriori_Trie.hpp</a><li><a class="el" href="Apriori__Trie_8cpp-source.html">Apriori_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>