Open Access Open Access  Restricted Access Subscription or Fee Access

Determining the Existence of Quantitative Association Rules in Data Mining

R. Sugumar, A. Rengarajan, Dr.C. Jayakumar

Abstract


Determining the association rules is a core topic of data mining. This survey paper aims at giving an overview to some of the previous researches done in this topic, evaluating the current status of the field, and envisioning possible future trends in this area. The theories behind association rules are presented at the beginning. Comparison of different algorithms is provided as part of the evaluation.


Keywords


Data Mining,market-basket .

Full Text:

PDF

References


Ramakrishnan Srikant, Rakesh Agrawal: Mining quantitative association rules in large relational tables.ACM SIGMOD Record, Proceedings of the 1996 ACM SIGMOD international conference on Management of data SIGMOD 96, Volume 25 Issue 2. June 1996 .

Ming-Syan Chen, Jiawei Han, Philip S. Yu: Data Mining: An Overview from a Database Perspective. IEEE Trans. On Knowledge And Data Engineering. 1996

Data Mining Lecture Notes http://www-db.stanford.edu/~ullman/mining/mining.html

Rakesh Agrawal, Ramakrishnan Srikant: Fast Algorithms for Mining Association Rules (1994)

Juan M. Ale, Gustavo H. Rossi: An approach to discovering temporal association rules. Proceedings of the 2000 ACM symposium on Applied computing – Volume 1. March 2000

Keith C. C. Chan, Wai-Ho Au: An effective algorithm for mining interesting quantitative association rules. Proceedings of the 1997 ACM symposium on Applied computing. April 1997

M. J. Zaki, M. Ogihara, S. Parthasarathy, W. Li: Parallel data mining for association rules on shared-memory multi-processors Proceedings of the 1996 ACM/IEEE conference on Supercomputing (CDROM) Supercomputing '96. November 1996

J. Mata, J. L. Alvarez, J. C. Riquelme: Evolutionary computing and optimization: An volutionary algorithm to discover numeric association rules Proceedings of the 2002 ACM symposium on Applied computing. March 2002

Jiawei Han, Jian Pei, Yiwen Yin: Mining frequent patterns without candidate generation. ACM SIGMOD Record , Proceedings of the 2000 ACM SIGMOD international conference on Management of data SIGMOD '00, Volume 29 Issue 2. May 2000

Rajesh Natarajan, B. Shekar: Data mining (DM): poster papers: Relatedness- based data-driven approach to determination of interestingness of association rules. Proceedings of the 2005 ACM symposium on applied computing SAC '05. March 2005

Eui-Hong (Sam) Han, George Karypis, V. Kumar: Scalable Parallel Data Mining for Association Rules. Transaction on Knowledge and Data Engineering, 12(3): P. 728-737. 2000

Rakesh Agrawal, Thomasz Imielinski, and Arun Swami: Mining association rules between sets of items in large database. In Proc. Of the ACM SIGMOD Conference on Management of Data, P. 207-216, May 1993.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.