?? index.html
字號:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"><html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1"><title>APRIORI algorithm: An efficient implemenation of APRIORI algorithm</title><link href="doxygen.css" rel="stylesheet" type="text/css"></head><body><!-- Generated by Doxygen 1.3.9.1 --><div class="qindex"><a class="qindexHL" href="index.html">Main Page</a> | <a class="qindex" href="namespaces.html">Namespace List</a> | <a class="qindex" href="annotated.html">Class List</a> | <a class="qindex" href="files.html">File List</a> | <a class="qindex" href="functions.html">Class Members</a> | <a class="qindex" href="globals.html">File Members</a></div><h1>An efficient implemenation of APRIORI algorithm </h1><p>This program is a very efficient implementation of APRIORI algorithm proposed by Rakesh Agrawal and Ramakrishnan Srikant. APRIORI is the most basic and well-known algorithm to find frequent itemsets in a transactional database.<p><h2>Frequent Itemset Mining problem</h2><p>A <em>transactional database</em> consists of sequence of transaction: <img class="formulaInl" alt="$T=\langle t_1,\ldots ,t_n\rangle $" src="form_3.png">. A transaction is a set of items (<img class="formulaInl" alt="$t_i\in I$" src="form_4.png">). Transactions are often called <em>baskets</em>, referring to the primary application domain (i.e. market-basket analysis). A set of items is often called <em>itemset</em> by the data mining community. The <em>(absolute) support</em> or the <em>occurrence</em> of <img class="formulaInl" alt="$X$" src="form_5.png"> (denoted by <img class="formulaInl" alt="$supp(X)$" src="form_6.png">) is the number of transactions that are supersets of <img class="formulaInl" alt="$X$" src="form_5.png"> (i.e. that <em>contain</em> <img class="formulaInl" alt="$X$" src="form_5.png">). The <em>realtive support</em> is the absolute support divided by the number of transactions (i.e. <em>n</em>). An itemset is <em>frequent</em> if its support is greater or equal than a threshold value.<p>In the frequent itemset mining problem a transaction database and a relative support threshold (traditionally denoted by <em>min_supp</em>) is given and we have to find all frequent itemsets. <hr size="1"><address style="align: right;"><small>Generated on Fri Mar 11 14:48:05 2005 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.9.1 </small></address></body></html>?? 快捷鍵說明
復制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號
Ctrl + =
減小字號
Ctrl + -