The week's pick
Reseach Article
An Efficient Mining Algorithm for Determining Related Item Sets using Classification and Association Rules
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 51 - Number 21 |
| Year of Publication: 2012 |
| Authors: Majeti Srinadh Swamy, G. Aparna, Ch. Mamatha, M. Venkatesh |
10.5120/8327-1820
|
Majeti Srinadh Swamy, G. Aparna, Ch. Mamatha, M. Venkatesh . An Efficient Mining Algorithm for Determining Related Item Sets using Classification and Association Rules. International Journal of Computer Applications. 51, 21 ( August 2012), 23-28. DOI=10.5120/8327-1820
Abstract
In the present days, data mining is the advanced research area because it is one of the important steps in the knowledge discovery process. This paper presents an experimental study of finding the frequent item sets by classifying the data base transactions into classes by using Decision tree induction based classification and applying Frequent-Pattern (FP) growth on the classes. First, data base transactions are pre- processed by using the pre-processing techniques and those are classified into classes based on information gain. After classifying the transactions into classes, we applied the FP growth algorithm to obtain the frequent or related item sets. This proposed technique is also suitable for heterogeneous data bases. We examined this technique on different types of data bases and by using this technique it have given the accuracy of 96%.
References
- P. Isakki alias Devi, S. P. Rajagopalan, "Analysis of Customer Behavior using Clustering and Association Rules" in IJCA volume 43-number 23 in April2012.
- Jia Ling, Koh and Vi-Lang Tu, " A Tree-based Approach for Efficiently Mining Approximate Frequent Itemsets", IEEE International Conference on Research Challenges in Information Science, 2010, pp. 25-36
- Abdul Fattah Mashat, Mohammed M. Fouad, Philip S. Yu, Tarek F. Gharib, "Efficient Clustering Technique for University Admission Data" in IJCA volume 45- number 23 in May2012.
- L. J. Deborah, R. Baskaran and A. Kannan, (2010) "A survey on Internal Validity Measure for Cluster Validation", International Journal of Computer Science & Engineering Surveys (IJCSES), vol. 1, no. 2, pp. 85-102.
- J. Han and M. Kamber, (2000), Data mining:concepts and techniques, San Francisco, Morgan-Kaufma.
- J. Hartigan and M. A. Wong, (1979) "A k-means clustering algorithm", Applied Statistics, vol. 28, pp. 100-108.
- M. Verma, M. Srivastava, N. Chack, A. K. Diswar, N. Gupta, (2012) "A Comparative Study of Various Clustering Algorithms in Data Mining", International Journal of Engineering Research and Applications (IJERA), vol. 2, no. 3, pp. 1379-1384.
- Hegland, M. , Algorithms for Association Rules, Lecture Notes in Computer Science,Volume 2600, Jan 2003, Pages 226 – 234
- E. W. T. Ngai , Li Xiu and D. C. K. Chau, 2009, Application of data mining techniques in customer relationship management: A literature review and classification, Expert Systems with Applications, Vol 36,Issue 2, Part 2 , pp 2592-2602.
- Nikhil Kumar Singh, Deepak Singh Tomar ,Bhola Nath Roy "An Approach to Understand the End User Behavior through Log Analysis " in IJCA 2010
- Han, J. and Pei, J. 2000. Mining frequent patterns by pattern-growth: methodology and implications. ACM SIGKDD Explorations Newsletter 2, 2, 14-20.
- Ramesh Agrawal, Tomasz Imielinski, and A. Swami, "Mining association rules between sets of items in large databases", ACM-SIGMOD Int. Conf. Management of Data, Washington, D. C. , May 1993, pp 207–216.
Index Terms
Keywords