A vertical format algorithm for mining frequent item sets

摘要：

Apriori is a classical algorithm for association rules. In order to get the support degree of candidate sets, Apriori needs to scan the database for many times. This paper presents a new algorithm, which mine frequent item sets with vertical format. The new algorithm only needs to scan database one time. And in the follow-up data mining process, it can get new frequent item sets through and operation between item sets. The new algorithm needs less storage space, and can improve the efficiency of data mining.

关键词： Apriori vertical format data mining

作者: GUO Yi-ming WANG Zhi-jun

作者单位: Institute of Graduate Liaoning Technical University Huludao China College of Electronic and Information Engineering Liaoning Technical University Huludao China

会议类型: 国际会议

会议名称: The 2nd IEEE International Conference on Advanced Computer Control(第二届先进计算机控制国际会议 ICACC 2010)

会议地点: 沈阳

会议语种:英文

页码: 11-13

在线出版日期: 2010-03-27（万方平台首次上网日期，不代表论文的发表时间）