A program to find association rules and frequent item sets (also closed and maximal) with the apriori algorithm (Agrawal et al. 1993), which carries out a breadth first search on the subset lattice and determines the support of itemsets by subset tes

Apriori算法【l】：1994年由R．Agrawal等人提出来的Apriori算法是 关联规则挖掘的一个经典算法，后来的许多算法都是基于该算法的思想。算 法的名称来源于在算法中应用了频繁项集的先验知识，即：一个频繁项集的 任一非空子集必定是频繁项集；因此只要某一项集是非频繁的，则其超集就 无须再检验。-Apriori algorithm】 【l: 1994 by R. Agrawal et al to the Apriori algorithm is a classical

Apriori algorithm是关联规则里一项基本算法。是由Rakesh Agrawal和Ramakrishnan Srikant两位博士在1994年提出的关联规则挖掘算法。关联规则的目的就是在一个数据集中找出项与项之间的关系。 文件中为实现Apriori算法的matlab函数-Apriori algorithm in association rules is a basic algorithm. By Rakesh Agrawal and Ramakrishnan Srikant Dr

The Apriori algorithm was proposed by Agrawal and Srikant in 1994. Apriori is designed to operate on databases containing transactions (for example, collections of items bought by customers, or details of a website frequentation). Other algorithms ar