GCARM A Combined Approach to Data Mining

Authors

  • Seema Desai Department of Information Technology, SIES Graduate School of Technology, Nerul, Navi Mumbai, India
  • Lata Ragha Department of Computer Science and Engineering, Ramrao Adik Institute of Technology, Nerul Navi Mumbai, India
  • Vimla Jethani Department of Computer Science and Engineering, Ramrao Adik Institute of Technology, Nerul Navi Mumbai, India

DOI:

https://doi.org/10.51983/ajcst-2012.1.1.1671

Keywords:

Association graph, association rule, clustering tables

Abstract

Mining association rules is an essential task for knowledge discovery. From a large amount of data, potentially useful information may be discovered. Association rules are used to discover the relationships of items or attributes among huge data. These rules can be effective in uncovering unknown relationships, providing results that can be the basis of forecast and decision. The effective management of business is significantly dependent on the quality of its decision making. Past transaction data can be analyzed to discover customer behaviors such that the quality of business decision can be improved. The approach of mining association rules focuses on discovering large itemsets, which are groups of items that appear together in an adequate number of transactions. The proposed method focuses on a combined approach to generate association rules from a large database of customer transactions. This approach scans the database once to construct an association graph and clustering tables and then traverses the graph to generate all large itemsets. The proposed algorithm will outperforms other algorithms which need to make multiple passes over the database.

References

Wael Ahmad AlZoubi,Khairuddin Omar, Azuraliza Abu Bakar, An Efficient Mining of Transactional data using Graph Based Technique. IEEE, 3rd Conference on Data Mining and Optimization(DMO), 28-29 June 2011, Selangor, Malaysia

Agrawal, R., Imielinski, T., and Swami, A. N. 1993. Mining association rules between sets of items in large databases. In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, 207-216.

Agrawal, R. Srikant, Fast algorithm for mining association rules in large databases, Proceedings of 1994 International Conference on VLDB, 1994 pp. 487–499.

Jiawei Han , Jian Pei , Yiwen Yin , Runying Mao. Mining Frequent Patternswithout Candidate Generation: A Frequent-Pattern Tree Approach. Data Mining and Knowledge Discovery, 8, 53–87, 2004.

Vijender Singh, Deepak Garg, Survey of Finding Frequent Patterns in Graph Mining: Algorithms and Techniques, International Journal of Soft Computing and Engineering (IJSCE) ISSN: 2231-2307, Volume-1, Issue-3, July 2011

Deepayan Chakrabarti And Christos Faloutsos, Graph Mining: Laws, Generators, and Algorithms, ACM Computing Surveys, Vol. 38, March 2006, Article 2

Yuh-Jiuan Tsay, Jiunn-Yann Chiang. CBAR: an efficient method for mining association rules. Knowledge-Based Systems 18 (2005) 99–105.

Michael Hahsler Bettina Grün Kurt Hornik. Introduction to arules - A computational environment for mining association rules and frequent item sets. Journal of Statistical Software. October 2005, Volume 14, Issue

Downloads

Published

05-05-2012

How to Cite

Desai, S., Ragha, L., & Jethani, V. (2012). GCARM A Combined Approach to Data Mining. Asian Journal of Computer Science and Technology, 1(1), 47–52. https://doi.org/10.51983/ajcst-2012.1.1.1671