The week's pick
Random Articles
Reseach Article
GARM: A Simple Graph Based Algorithm For Association Rule Mining
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 76 - Number 16 |
| Year of Publication: 2013 |
| Authors: Amal Dev P, Sobhana N V, Philumon Joseph |
10.5120/13328-0607
|
Amal Dev P, Sobhana N V, Philumon Joseph . GARM: A Simple Graph Based Algorithm For Association Rule Mining. International Journal of Computer Applications. 76, 16 ( August 2013), 1-4. DOI=10.5120/13328-0607
Abstract
Association rule mining is an important component of data mining. In the last years a great number of algorithms have been proposed with the objective of solving the obstacles presented in the generation of association rules. In this work, a new graph based algorithm for associative rule mining which has so many advantages over the existing methods is proposed. It can be used to improve decision making in a wide variety of applications such as: market basket analysis, medical diagnosis, bio-medical literature, protein sequences, census data, logistic regression, fraud detection in web, CRM of credit card business etc.
References
- Agrawal, Rakesh; and Srikant, Ramakrishnan; Fast algorithms for mining association rules in large databases, in Bocca, Jorge B. ; Jarke, Matthias; and Zaniolo, Carlo; editors, Proceedings of the 20th International Conference on Very Large Data Bases (VLDB), Santiago, Chile, September 1994, pages 487-499
- Witten, Frank, Hall: Data mining practical machine learning tools and techniques, 3rd edition
- Zaki, M. J. (2000). "Scalable algorithms for association mining". IEEE Transactions on Knowledge and Data Engineering 12 (3): 372??390. doi:10. 1109/69. 846291
- Hjek, Petr; and Havrnek, Tom (1978). Mechanizing Hypothesis Formation: Mathematical Foundations for a General Theory. Springer-Verlag. ISBN 3-540-08738-9
- Webb, Geoffrey I. (2000); Efficient Search for Association Rules, in Ramakrishnan, Raghu; and Stolfo, Sal; eds. ; Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD- 2000), Boston, MA, New York, NY: The Association for Computing Machinery, pp. 99-107
- Data Mining Concepts and Techniques; Jiawei Han and Micheline Kamber; Second Edition
- Raunch, Jan; Logical calculi for knowledge discovery in databases; Proceedings of the First European Symposium on Principles of Data Mining and Knowledge Discovery 4(2):217-240
- Webb, Geoffrey I. (1995); OPUS: An Efficient Admissible Algorithm for Unordered Search, Journal of Artificial Intelligence Research 3, Menlo Park, CA;
- Bayardo, Roberto J. , Jr. ; Agarwal, Rakesh; Gunopulos, Dimitrios(2000). "Constraint-based rule mining in large, dense databases". Data mining and knowledge discovery 4 (2):217-240
- Rakesh Agrawal, Tomasz Imielinski and Arun Swami; "Mining Association Rules between Sets of Items in Large Databases"Proceedings of the 1993 ACM SIGMOD Conference 4
Index Terms
Keywords