【摘要】 关联规则挖掘是数据挖掘的一个重要的研究内容,而产生频繁模式集是关联规则挖掘的第1步工作。很多传统的频繁模式挖掘算法都需要产生候选模式集,因而效率很低。该文提出了一种不需要产生候选集,而直接构造频繁集的频繁模式挖掘算法——基于互关联后继树的频繁模式挖掘算法。实验证明,该算法具有较好的性能。更多还原

【Abstract】 An important subject of data mining is association rules mining, of which the first step is to generate frequent patterns. A lot of traditional algorithms need candidate items to generate frequent patterns, so they are inefficient. In this paper, a mining algorithm which does not generate candidate items is put forward. It is based on inter-relevant successive trees. Experiments show it is efficient.更多还原