An Algorithm of Association Rule Mining Based on Memory Indexing

摘要：

　　In the field of data mining,Apriori is a classical algorithm for mining association rules.In this paper,an improved Apriori algorithm is proposed,which is based on the principle of memory indexing.By recording unnecessary scanning transactions and storing relatively frequent transactions,the algorithm decreases the scanning times of the database,and consequently save the time of I/O operation.The experiments result has verified the effectiveness of the improved algorithm.

关键词： Data mining association rules memory indexing

作者: Yong Huang Kuanjiu Zhou Huamei Sun Tiyun Huang

作者单位: School of Management, Dalian University of Technology,Dalian 116024, China School of Management, Harbin Institute of Technology,Harbin 150001, China

会议类型: 国际会议

会议名称: 2012 2nd International Conference on Computer Application and System Modeling(2012第二届计算机应用与系统建模国际会议)(ICCASM-2012)

会议地点: 沈阳

会议语种:英文

页码: 276-279

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