Essential classification rule sets

ACM Transactions on Database Systems

Volumn 29, Issue 4, 2004, Pages 635-674

  Baralis, Elena ^a   Chiusano, Silvia ^a  

^a POLITECNICO DI TORINO   (Italy)

Author keywords

Association rules; Associative classification; Concise representations

Indexed keywords

ASSOCIATION RULES; ASSOCIATIVE CLASSIFICATION; CONCISE REPRESENTATIONS; DATASETS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA MINING; DATA STRUCTURES; INFORMATION ANALYSIS; KNOWLEDGE ACQUISITION; MATHEMATICAL MODELS;

DATABASE SYSTEMS;

EID: 11344271623     PISSN: 03625915     EISSN: None     Source Type: Journal    
DOI: 10.1145/1042046.1042048     Document Type: Article

References (50)

1. AGARWAL, R. C., AGGARWAL, C. C., AND PRASAD, V. V. V. 2001. A tree projection algorithm for generation of frequent item sets. J. Parall. Distrib. Comput. 61, 3 (Mar.), 350-371.
2. AGRAWAL, R., IMIELINSKI, T., AND SWAMI, A. 1993. Database mining: A performance perspective. IEEE Trans. Knowl. Data Eng. 5, 6 (Dec.), 914-925.
3. AGRAWAL, R. AND SRIKANT, R. 1994. Fast algorithms for mining association rules in large databases. In Proceedings of the 20th International Conference on Very Large Data Bases (VLDB'94). Morgan Kaufmann, San Francisco, CA, 487-499.
4. BARALIS, E. AND CHIUSANO, S. 2002. Minimal non redundant classification rule sets. In Proceedings of the IEEE ICDM Workshop on The Foundation of Data Mining and Discovery. 143-149.
5. BARALIS, E. AND GARZA, P. 2002. A lazy approach to pruning classification rules. In Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM'02). IEEE Computer Society Press, Los Alamitos, CA, 35-42.
6. BASTIDE, Y., PASQUIER, N., TAOUIL, R., STUMME, G., AND LAKHAL, L. 2000a. Mining frequent patterns with counting inference. ACM SIGKDD Explorat. 2, 2 (Dec.), 66-75.
7. BASTIDE, Y., PASQUIER, N., TAOUIL, R., STUMME, G., AND LAKHAL, L. 2000b. Mining minimal nonredundant association rules using frequent closed itemsets. In Proceedings of 1st International Conference on Computational Logic (CL'OO). Lecture Notes in Computer Science, vol. 1861. Springer-Verlag, New York, NY, 972-986.
8. BAYARDO, R. J. 1998. Efficiently mining long patterns from databases. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'98). ACM Press, New York, NY, 85-93.
9. BAYARDO, R. J. AND AGRAWAL, R. 1999. Mining the most interesting rules. In Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'99). ACM Press, New York, NY, 145-154.
10. BLAKE, C. AND MERZ, C. 1998. UCI repository of machine learning databases. Department of Information and Computer Science, University of California, Irvine, Irvine, CA. Available online at http://www.ics.uci.edu/ ~mlearn/mlrepository.html.
11. BOULICAUT, J.-F., BYKOWSKI, A., AND RIGOTTI, C. 2003. Free-sets: A condensed representation of boolean data for the approximation of frequency queries. Data Mining Knowl. Discov. J. 7, 1, 5-22.
12. BRIN, S., MOTWANI, R., AND SILVERSTEIN, C. 1998. Beyond market baskets: Generalizing association rules to dependence rules. Data Mining Knowl. Discov. J.2, 1 (Jan.), 39-68.
13. BRIN, S., MoTWANI, R., ULLMAN, J. D., AND TSUR, S. 1997. Dynamic itemset counting and implication rules for market basket data. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'97). ACM Press, New York, NY, 255-264.
14. BURDICK, D., CALIMLIM, M., AND GEHRKE, J. 2001. Mafia: A maximal frequent itemset algorithm for transactional databases. In Proceedings of the IEEE International Conference on Data Engineering (ICDE'01). IEEE Computer Society Press, Los Alamitos, CA, 443-452.
15. BYKOWSKI, A. AND RIGOTTI, C. 2001. A condensed representation to find frequent patterns. In Proceedings of the 20th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'01). ACM Press, New York, NY, 267-273.
16. CALDERS, T. AND GOETHALS, B. 2002. Mining all non-derivable frequent itemsets. In Proceedings of the 6th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD'02). Lecture Notes in Computer Science, vol. 2431. Springer-Verlag, New York, NY, 74-85.
17. CREMILLEUX, B. AND BOULICAUT, J.-F. 2002. Simplest rules characterizing classes generated by delta-free sets. In Proceedings of the Twenty-Second Annual International Conference Knowledge Based Systems and Applied Artificial Intelligence (ES'02). Springer, New York, NY, 33-46.
18. CRISTIANINI, N. AND SHAWE-TAYLOR, J. 2000. An Introduction to Support Vector Machines. Cambridge University Press, Cambridge, U.K.
19. DONG, G., ZHANG, X., WONG, L., AND LI, J. 1999. CAEP: Classification by aggregating emerging patterns. In Proceedings of the 2nd International Conference on Discovery Science (DS'99). Lecture Notes in Computer Science, vol. 1721. Springer-Verlag, New York, NY, 30-42.
20. DUDA, R. AND HART, P. 1973. Pattern Classification and Scene Analysis. John Wiley and Sons, New York, NY.
21. FAYYAD, U. AND IRANI, K. 1993. Multi-interval discretization of continuous-valued attributes for classification learning. In Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAT93). Morgan Kaufmann, San Francisco, CA, 1022-1029.
22. FUKUDA, T., MORIMOTO, Y., MORISHITA, S., AND TOKUYAMA, T. 1996. Data mining using two-dimensional optimized association rules: Scheme, algorithms, and visualization. In Proceedings of the ACM SIGMOD International Conference on Management of Data (ACM SIGMOD'96). ACM Press, New York, NY, 13-23.
23. HAN, J., PEI, J., AND YIN, Y. 2000. Mining frequent patterns without candidate generation. In Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data (ACM SIGMOD'00). ACM Press, New York, NY, 1-12.
24. HETTICH, S. AND BAY, S. D. 1999. UCIKDD archive. Department of Information and Computer Science, University of California, Irvine, Irvine, CA. Available online at http://kdd.ics.uci.edu
25. KDDCUP2002. 2002. KDDCup 2002 - Task 2. Available online at http://www.biostat.wise.edu/~craven/kddcup/.
26. KRYSZKIEWICZ, M. 2001. Concise representation of frequent patterns based on disjunction-free generators. In Proceedings of the IEEE International Conference on Data Mining (ICDM'01). IEEE Computer Society Press, Los Alamitos, CA, 305-312.
27. KRYSZKIEWICZ, M. AND GAJEK, M. 2002. Concise representation of frequent patterns based on generalized disjunction-free generators. In Proceedings of the 6th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD'02). Lecture Notes in Computer Science, vol. 2336. Springer-Verlag, New York, 159-171.
28. LI, W., HAN, J., AND PEI, J. 2001. CMAR: Accurate and efficient classification based on multiple class-association rules. In Proceedings of the IEEE International Conference on Data Mining (ICDM'01). IEEE Computer Society Press, Los Alamitos, CA, 369-376.
29. LIM, T.-S., LOH, W.-Y, AND SHIH, Y.-S. 2000. A comparison of prediction accuracy, complexity and training time of thirty-three old and new classification algorithms. Mach. Learn. 40, 3 (Sept.), 203-228.
30. LIU, B., HSU, W., AND MA, Y. 1998. Integrating classification and association rule mining. In Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining (KDD'98). AAAI Press, Menlo Park, CA, 80-86.
31. LIU, B., HSU, W., AND MA, Y. 1999. Pruning and summarizing the discovered associations. In Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'99). ACM Press, New York, NY, 125-134.
32. MANNILA, H. AND TOIVONEN, H. 1996. Multiple uses of frequent sets and condensed representations. In Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD'96). AAAI Press, Menlo Park, CA, 189-194.
33. MEO, R. 2000. Theory of dependence values. ACM Trans. Database Syst. 25, 3 (Sept.), 380-406.
34. MICHALSKI, R. 1980. Pattern recognition as rule-guided induction inference. IEEE Trans. Patt. Anal. Mach. Learn. 2, 349-361.
35. MILLS, F. 1995. Statistical methods. Pitman, London, U.K.
36. PASQUIER, N., BASTIDE, Y., TAOUIL, R., AND LAKHAL, L. 1999a. Closed itemsets discovery of small covers for association rules. In Proceedings of 15mes Journes Bases des Donnes Avances (BDA'99). 361-381.
37. PASQUIER, N., BASTIDE, Y., TAOUIL, R., AND LAKHAL, L. 1999b. Discovering frequent closed itemsets for association rules. In Proceedings of the 7th International Conference on Database Theory (ICDT'99). Lecture Notes in Computer Science, vol. 1540. Springer-Verlag, New York, NY, 398-416.
38. PASQUIER, N., BASTIDE, Y., TAOUIL, R., AND LAKHAL, L. 1999c. Efficient mining of association rules using closed itemsets lattice. J. Inform. Syst. 24, 1, 25-46.
39. PEI, J., HAN, J., AND MAO, R. 2000. CLOSET: An efficient algorithm for mining frequent closed itemsets. In Proceedings of the ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery (DMKD'00). ACM Press, New York, NY, 21-30.
40. QUINLAN, J. 1993. C4.5: Programs for Machine Learning. Morgan Kaufmann, San Francisco, CA.
41. RUMELHART, D. E., HINTON, G. E., AND WILLIAMS, J. 1986. Learning internal representations by error propagation. In Parallel Distributed Processing: Explorations in the Microstructure of Cognition, Vol. 1: Foundations 1. MIT Press, Cambridge, MA, 318-362.
42. STUMME, G., TAOUIL, R., BASTIDE, Y., PASQUIER, N., AND LAKHAL, L. 2001. Intelligent structuring and reducing of association rules with formal concept analysis. In Proceedings of Advances in Artificial Intelligence Conference (KI'01). Lecture Notes in Computer Science, Springer, New York, NY, 335-350.
43. TAN, P.-N., KUMAR, V., AND SRIVASTAVA, J. 2002. Selecting the right interestingness measure for association patterns. In Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'02). ACM Press, New York, NY, 32-41.
44. TOIVONEN, H., KLEMETTINEN, M., RONKAINEN, P., HATONEN, K., AND MANILLA, H. 1995. Pruning and grouping discovered association rules. In Workshop on Statistics, Machine Learning, and Knowledge Discovery in Databases (ECML'95). 47-52.
45. WANG, J., HAN, J., AND PEI, J. 2003. CLOSET+: Searching for the best strategy for mining frequent closed itemsets. In Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'03). ACM Press, New York, NY, 236-245.
46. WANG, K., ZHOU, S., AND HE, Y. 2000. Growing decision trees on support-less association rules. In Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'00). ACM Press, New York, NY, 265-269.
47. YIN, X. AND HAN, J. 2003. CPAR: Classification based on predictive association rules. In Proceedings of the 3rd SIAM International Conference on Data Mining (SDM'03). SIAM, Philadelphia, PA.
48. ZAKI, M. 2000. Generating non-redundant association rules. In Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'00). ACM Press, New York, NY, 34-43.
49. ZAKI, M. AND HSIAO, C.-J. 1999. CHARM: An efficient algorithm for closed itemset mining. In Tech. rep. 99-10. Rensselaer Polytechnic Institute
50. ZAKI, M. AND HSIAO, C.-J. 2002. CHARM: An efficient algorithm for closed itemset mining. In Proceedings of the Second SIAM International Conference on Data Mining (SIAM'02). SIAM, Philadelphia, PA.