A New Improvement of Apriori Algorithm for Mining Association Rules
Among the many mining algorithms of association rules, Apriori Algorithm is a classical algorithm that has caused the most discussion; it can effectively carry out the mining association rules. However, based on Apriori Algorithm, most of the traditional algorithms existed item sets generation bottleneck problem, and are very timeconsuming. An enhance algorithm associating which is based on the user interest and the importance of itemsets is put forward by the paper, incorporate item that user is interested in into the itemsets as a seed item, then scan the database, incorporate all other items which are in the same transaction into itemsets, Construct user interest itemsets, reduce unnecessary itemsets; through the design of the support functions algorithm not only considered the frequency of itemsets, but also consider different importance between different itemsets. The new algorithm reduces the storage space, improves the efficiency and accuracy of the algorithm.
association rules apriori algorithm importance of frequent itemsets improved algorithm
Du Ping Gao Yongping
East China Institute of Technology Nanchang, China
国际会议
太原
英文
529-532
2010-10-22（万方平台首次上网日期，不代表论文的发表时间）