The week's pick
Random Articles
Reseach Article
Optimization of Execution Time using Association Rule Mining Algorithms
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 59 - Number 11 |
| Year of Publication: 2012 |
| Authors: Smita R. Sankhe, Kavita Kelkar |
10.5120/9591-4210
|
Smita R. Sankhe, Kavita Kelkar . Optimization of Execution Time using Association Rule Mining Algorithms. International Journal of Computer Applications. 59, 11 ( December 2012), 18-20. DOI=10.5120/9591-4210
Abstract
The efficiency of mining association rules is an important field of Knowledge Discovery in Databases. The Apriori algorithm is a classical algorithm in mining association rules. This paper presents optimization of execution time for classicical apriori and an improved Apriori algorithm (DFR-Direct Fined and Remove) to increase the efficiency of generating association rules. This algorithm adopts a new method to reduce the redundant generation of sub-itemsets during pruning the candidate itemsets, which can form directly the set of frequent itemsetsand eliminate candidates having a subset that is not frequent in the meantime. This algorithm can raise the probability of obtaining information in scanning database and reduce the potential scale of item sets. Now a day's Hypermarket databases use data mining as a tool to optimize business solutions especially in the domain of sales and marketing. Common applications of data mining for any hypermarket include inventory management, tracking of customer behavior, finding frequent item sets and so on. The aim of this topic is to purpose efficiency analysis on data mining algorithms on aspects like Association Rule Mining. These aspects will help hypermarkets perform these functions effectively and hence increase their overall profit.
References
- Sheng Chai, Hai-Chun Wang, Ji-Fan Qiu, 2009 "DFR: A New Improved Algorithm for Mining Frequent Itemsets", IEEE/ACM Fuzzy Systems and Knowledge Discovery.
- Jen-PengHuang; Guo-ChengLan; Huang-Cheng Kuo Tzung Pei Hong, 2008"A Decomposition Approach for Mining Frequent Itemsets", Intelligent Information Hiding and Multimedia Signal Processing. IIHMSP 2008. Third International Conference 2008 Volume: 2, On page(s): 605-608, Dec 2008.
- Jen-PengHuang; Guo-ChengLan; Huang-Cheng Kuo Xuezhi chi , "A New Matrix-Based Association Rules Mining Algorithm",2012 Proc. 9th IEEE Int. Conf. on Fuzzy systems and Knowledge Discovery(FSKD2012).
- D. Zhang, Y. Wang, and W. Kinsner (Eds. ), "An Algorithm to Improve the Effectiveness of Apriori", Proc. 6th IEEE Int. Conf. on Cognitive Informatics (ICCI'07),2007.
- J. Han, M. Kamber 2006, Data Mining,Concepts and Techniques",Morgan Kaufmann Publishers, San Francisco, CA.
- Pimgxiang,ChenJiangping,Bian, Fuling,"Adeveloped algorithm of apriori based on association anlaysis,Geo-special Information science, 2004.
- Agrawa IR, Imielinski T, Swami A Miningassociation rules between sets of items in largedatabases (C). In:Buneman P, Jajodia S,eds. Proc. of the ACM SIGMOD Conf. on Management ofData. 1993.
Index Terms
Keywords