K-optimal rule discovery

Data Mining and Knowledge Discovery

Volumn 10, Issue 1, 2005, Pages 39-79

  Webb, Geoffrey I ^a   Zhang, Songmao ^b  

^a MONASH UNIVERSITY   (Australia)

^b NATIONAL INSTITUTES OF HEALTH   (United States)

Author keywords

Association rules; Classification rules; Exploratory rule discovery; Rule search; Search space pruning

Indexed keywords

ALGORITHMS; CLASSIFICATION (OF INFORMATION); CONSTRAINT THEORY; DATABASE SYSTEMS; LEARNING SYSTEMS; OPTIMIZATION; SET THEORY;

ASSOCIATION RULES; CLASSIFICATION RULES; EXPLORATORY RULE DISCOVERY; RULE SEARCH; SEARCH SPACE PRUNING;

DATA MINING;

EID: 14844340628     PISSN: 13845810     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10618-005-0255-4     Document Type: Article

References (34)

1. Agarwal, R.C., Aggarwal, C.C., and Prasad, V.V.V. 2000. Depth first generation of long patterns. In Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD2000). ACM, Boston, MA, pp. 108-118.
2. Agrawal, R., Imielinski, T., and Swami, A. 1993. Mining associations between sets of items in massive databases. In Proceedings of the 1993 ACM-SIGMOD International Conference on Management of Data. Washington, DC, pp. 207-216.
3. Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., and Verkamo, A.I. 1996. Fast discovery of association rules. In U.M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy (Eds.). Advances in Knowledge Discovery and Data Mining. Menlo Park, CA.: AAAI Press, pp. 307-328.
4. Agrawal, R. and Srikant, R. 1994. Fast algorithms for mining association rules. In Proceedings of the 20th International Conference on Very Large Databases. Santiago, Chile, pp. 487-499.
5. Bay, S.D. 2001. The UCIKDD archive, [http://kdd.ics.uci.edu] Irvine, CA: University of California, Department of Information and Computer Science.
6. Bayardo, R.J. 1998. 'Efficiently mining long patterns from databases. In Proceedings of the 1998 ACM-SIGMOD International Conference on Management of Data, pp. 85-93.
7. Bayardo, R.J. and Agrawal, R. 1999. Mining the most interesting rules. In Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 145-154.
8. Bayardo, R.J., Agrawal, R., and Gunopulos, D. 2000. Constraint-based rule mining in large, dense databases. Data Mining and Knowledge Discovery, 4(2/3):217-240.
9. Blake, C. and Merz, C.J. 2001. UCI repository of machine learning databases. [Machine-readable data repository]. University of California, Department of Information and Computer Science, Irvine, CA.
10. Borgelt, C. 2000. Apriori. (Computer Software) http://fuzzy.cs.Uni- Magdeburg.de/~borgelt/.
11. Buchanan, B.G. and Feigenbaum, E.A. 1978. DENDRAL and meta-DENDRAL: Their applications dimension. Artificial Intelligence, 11:5-24.
12. Clark, P. and Niblett, T. 1989. The CN2 induction algorithm. Machine Learning, 3:261-284.
13. Clearwater, S.H. and Provost, F.J. 1990. RL4: A tool for knowledge-based induction. In Proceedings of Second Intl. IEEE Conf. on Tools for AI. Los Alamitos, CA, IEEE Computer Society Press, pp. 24-30.
14. Cohen, E., Datar, M., Fujiwara, S., Gionis, A., Indyk, R., Motwani, P., Ullman, J., and Yang, C. 2000. Finding interesting associations without support pruning. In Proceedings International Conference on Data Engineering, pp. 489-499.
15. Cohen, W.W. 1995. Fast effective rule induction. In Proceedings of the Twelfth International Conference on Machine Learning. Morgan Kaufmann, pp. 115-123.
16. Han, J., Pei, J., and Yin, Y. 2000. Mining frequent patterns without candidate generation. In Proceedings 2000 ACM-SIGMOD Int. Conf. on Management of Data (SIGMOD'00). Dallas, TX, pp. 1-12.
17. Kohavi, R., Brodley, C., Frasca, B., Mason, L., and Zheng, Z. 2000. KDD-cup 2000 organizers report: Peeling the onion. SIGKDD Explorations, 2(2):86-98.
18. Liu, B., Hsu, W., and Ma, Y. 1998. Integrating classification and association rule mining. In Proceedings Knowledge Discovery and Data Mining (KDD-98), pp. 80-86.
19. Liu, B., Hsu, W., and Ma, Y. 1999. Mining association rules with multiple minimum supports. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-99). San Diego, CA, pp. 337-341.
20. Michalski, R.S. 1977. Synthesis of optimal and quasi-optimal variable-valued logic formulas. In Proceedings of the 1975 International Symposium on Multiple Valued Logic. Bloomington, Indiana, Reidel, pp. 76-87.
21. Morishita, S. and Nakaya, A. 2000. Parallel branch-and-bound graph search for correlated association ruless. In Proceedings of the ACM SIGKDD Workshop on Large-Scale Parallel KDD Systems, Vol. LNAI 1759. Berlin, Springer, pp. 127-144.
22. Pasquier, N., Bastide,Y., Taouil, R., and Lakhal, L. 1999. Discovering frequent closed itemsets for association rules. In Proceedings of the Seventh International Conference on Database Theory (ICDT'99). Jerusalem, Israel, pp. 398-416.
23. Pei, J., Han, J., and Mao, R. 2000. CLOSET: An efficient algorithm for mining frequent closed itemsets. In Proceedings 2000 ACM-SIGMOD Int. Workshop on Data Mining and Knowledge Discovery (DMKD'00). Dallas, TX, pp. 21-30.
24. Piatetsky-Shapiro, G. 1991. Discovery, analysis, and presentation of strong rules. In Knowledge Discovery in Databases. G. Piatetsky-Shapiro and J. Frawley (Eds.). AAAI/MIT Press, pp. 229-248.
25. Provost, F., Aronis, J., and Buchanan, B. 1999. Rule-space search for knowledge-based discovery. CIIO Working Paper IS 99-012, Stern School of Business, New York University, NY, NY 10012.
26. Rymon, R. 1992. Search through systematic set enumeration. In Proceedings KR-92. Cambridge, MA, pp. 268-275.
27. Savasere, A., Omiecinski, E., and Navathe, S. 1995. An efficient algorithm for mining association rules in large databases. In Proceedings of the 21st International Conference on Very Large Data Bases. Morgan Kaufmann, pp. 432-444.
28. Segal, R. and Etzioni, O. 1994. Learning decision lists using homogeneous rules. In AAAI-94. Seattle, WA, AAAI Press.
29. Todorovski, L., Flach, P., and Lavrac, N. 2000. Predictive performance of weighted relative accuracy. In Proceedings of the Fourth European Conference on Principles of Data Mining and Knowledge Discovery (PKDD2000). D.A. Zighed, J. Komorowski, and J. Zytkow (Eds.). Springer-Verlag, pp. 255-264.
30. Toivonen, H. 1996. Sampling large databases for association rules. In Proceedings of the 22nd International Conference on Very Large Data Bases. Morgan Kaufmann, pp. 134-145.
31. Webb, G.I. 1995. OPUS: An efficient admissible algorithm for unordered search. Journal of Artificial Intelligence Research, 3:431-465.
32. Webb, G.I. 2000. Efficient search for association rules. In The Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Boston, MA, ACM, pp. 99-107.
33. Zaki, M.J. 2000. Generating non-redundant association rules. In Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD2000). Boston, MA, ACM, pp. 34-43.
34. Zheng, Z., Kohavi, R., and Mason, L. 2001. Real world performance of association rule algorithms. In KDD-2001: Proceedings of the Seventh International Conference on Knowledge Discovery and Data Mining. San Francisco, ACM, pp. 401-406.