Browse > Article
http://dx.doi.org/10.6109/jkiice.2011.15.1.147

An Algorithm for reducing the search time of Frequent Items  

Yun, So-Young (부경대학교)
Youn, Sung-Dae (부경대학교 컴퓨터공학과)
Publication Information
Journal of the Korea Institute of Information and Communication Engineering / v.15, no.1, 2011 , pp. 147-156 More about this Journal
Abstract
With the increasing utility of the recent information system, the methods to pick up necessary products rapidly by using a lot of data has been studied. Association rule search methods to find hidden patterns has been drawing much attention, and the Apriori algorithm is a major method. However, the Apriori algorithm increases search time due to its repeated scans. This paper proposes an algorithm to reduce searching time of frequent items. The proposed algorithm creates matrix using transaction database and search for frequent items using the mean number of items of transactions at matrix and a defined minimum support. The mean number of items of transactions is used to reduce the number of transactions, and the minimum support to cut down on items. The performance of the proposed algorithm is assessed by the comparison of search time and precision with existing algorithms. The findings from this study indicated that the proposed algorithm has been searched more quickly and efficiently when extracting final frequent items, compared to existing Apriori and Matrix algorithm.
Keywords
Data mining; Apriori algorithm; Frequent Item; Matrix;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Ashok Savasere, Edward Omiecinski, and Shamkant Navathe, "An effective algorithm for mining association rules in large databases," In Proc. of the 21st International Conference on Very Large Data Bases (VLDB'95), pp. 432 -444, Zurich, Swizerland, 1995.
2 Hannu Toivonen, "Sampling Large Data-base for Asso -ciation rules," In Proc. of the 22nd International Conference on Very Large Data Bases (VLDB'96), Mumbai(Bombay), India, 1996.
3 Feng WANG, Yong-hua LI, "Am Improved Apriori Algorithm based on the matrix", FBIE '08. International Seminar, pp. 152-155, Dec. 2008.
4 M.G. Vozalis, K.G. Margaritis, Using SVD and demographic data for the enhancement of generalized Collaborative Filtering, Information Sciences 177, pp.3017-3037, 2007.   DOI   ScienceOn
5 Jian Pei, Pattern-Growth methods for frequent pattern mining, the degree of doctor of philosophy, Simon Fraser University, pp. 9-12, 2002.
6 Mehmed Kantardzic, Data Mining : Concepts, Models, Methods and Algorithms, Wiley-IEEE Press, 2002
7 Sergey Brin, Rajeev Motwani, Jeffrey D. Ulman, and Shalom Tsur., "Dynamic Itemset Counting and Implication Rules for Market Basket Data," In Proc. of ACM SIGMOD Conference on Management of Data (SIGMOD'97), pp. 255-264,1997.
8 Jung Soo Park, Ming-Syan Chen, and Philip S.Yu., "An effective hash-based algorithm for mining association rules," In Proc. of ACM SIGMOD Conference on Management of Data(SIGMOD'95), pp. 175-186, San Jose, California, May 1995.
9 R. Agrawal, T. Imielinski, and A. Swami, "Mining association rules between sets of items in large database", Proceedings of the ACM SIGMOND Conference on Management of data, pp. 207-216, Washington. DC, 1993.
10 R. Agrawal, and R. Srikant, "Fast algorithms for mining association rules", In Proceeding of the 20th VLDB Conference, pp. 487-499, Santiago, Chile,1994.