Mining negative rules using GRD

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3056, Issue , 2004, Pages 161-165

  Thiruvady, Dhananjay R ^a   Webb, Geoff I ^a  

^a MONASH UNIVERSITY   (Australia)

Author keywords

Negative rules; Rule discovery

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS; ALGORITHMS; CONSTRAINT THEORY; SEARCH ENGINES;

ASSOCIATION RULE DISCOVERY; INTERESTING RULES; INTERESTINGNESS; MINIMUM SUPPORT; NEGATIVE RULE; NEW APPROACHES; RULE DISCOVERY;

DATA MINING;

GRD; NEGATIVE RULES; RULE DISCOVERY; RULE SOUGHT (K); SUPPORT CONSTRAINTS;

EID: 7444267530     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24775-3_20     Document Type: Conference Paper

References (14)

1. R. Agrawal, T. Imielinski, and A.N. Swami. Mining association rules between sets of items in large databases. In Peter Buneman and Sushil Jajodia, editors, SIGMOD, pages 207–216, Washington, D.C., 26–28, 1993.
2. C.L. Blake and C.J. Merz. UCI repository of machine learning databases. http://www.ics.uci.edu/∼mlearn/mlrepository.html, University of California, Irvine, Dept. of Information and Computer Sciences, 1998.
3. S. Brin, R. Motwani, and C. Silverstein. Beyond market baskets: generalizing association rules to correlations. SIGMOD, pages 265–276, 1997.
4. E. Cohen, M. Datar, S. Fujiwara, A. Gionis, R. Indyk, P. Motwani, J. Ullman, and C. Yang. Finding interesting associations without supporting pruning. In Proc. ICDE, 2000.
5. S. Hettich and S. D. Bay. The UCI KDD archive. http://www.ics.uci.edu/, University of California, Irvine, Dept. of Information and Computer Sciences, 1999.
6. As. Savasere, E. Omiecinski, and S. B. Navathe. Mining for strong negative associations in a large database of customer transactions. In ICDE, pages 494–502, 1998.
7. R. Srikant and R. Agrawal. Mining generalized association rules. Future Generation Computer Systems, 13(2–3):161–180, 1997.
8. R. Srikant, Q. Vu, and R. Agrawal. Mining association rules with item constraints. In D. Heckerman, H. Mannila, D. Pregibon, and R. Uthurusamy, editors, Proc. KDD, pages 67–73. AAAI Press, 14–17 1997.
9. G. I. Webb. OPUS: An efficient admissible algorithm for unordered search. Journal of Artificial Intelligence Research, 3:431–465, 1995.
10. G. I Webb. Efficient search for association rules. KDD, pages 99–107, 2000.
11. G. I Webb and S. Zhang. Beyond association rules: Generalized rule discovery. In Knowledge Discovery and Data Mining. Kluwer Academic Publishers, 14–17, unpublished manuscript.
12. X. Wu, C. Zhang, and S. Zhang. Mining both positive and negative rules. ICML, pages 658–665, 2002.
13. M. Zaki and K. Gouda. Fast vertical mining using diffsets. Technical Report 01-1, Rensselaer Polytechnic Institute, 2001.
14. Z. Zheng, R. Kohavi, and L. Mason. Real world performance of association rule algorithms. KDD, pages 401–406, 2001.