Improvement of Apriori Algorithm Based on the User Interest and the Importance of Itemsets


Article Preview

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 time-consuming. 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.



Advanced Materials Research (Volumes 121-122)

Edited by:

Donald C. Wunsch II, Honghua Tan, Dehuai Zeng, Qi Luo






Y. S. He and X. Li, "Improvement of Apriori Algorithm Based on the User Interest and the Importance of Itemsets", Advanced Materials Research, Vols. 121-122, pp. 540-545, 2010

Online since:

June 2010





[1] H. Toivonen. Sampling large databases for association rules. In Proc. 2006 Int. Conf. Very Large Data Bases(VLDB'06), pages 134-145, Bombay, India, Sep. (2006).

[2] D.W. Cheung, et al. A fast distributed algorithm for mining association rules. Proc. Of 2006 Int. Conf. On Parallel and Distributed Information Systems (PDIS'06), Miami Beach, Florida, USA, Dec. (2006).

[3] Agrawal R, Srikant R. Fast algorithms for mining association rules. In Proceeding of the 28th International Conference on Very Large Databases. (2004).

[4] Jong S P, Ming S C, Philip S Y. An effective hash based algorithm for mining association rules. In Proceedings of the 2005 ACM SIGMOD International Conference On Management of Data. 2005, 24(2): 175-186.

DOI: 10.1145/568271.223813

[5] A. Savasere,E. Omiecinski and S. Navathe. An ffcient algorithm for mining association rules. Proceedings of the 21# international conference on very large atabases, Zurich, Switzerland, Sept, 2005, 432-444.

[6] B. Ozden, et al. Cyclic association rules. Proc 2007 int. conf. Data Engineering, Orlando, FL, Feb, 2007, 412-421.

In order to see related information, you need to Login.