Condensed representation of EPs and patterns quantified by frequency-based measures

Lecture Notes in Computer Science

Volumn 3377, Issue , 2005, Pages 173-189

  Soulet, Arnaud ^a   Crémilleux, Bruno ^a   Rioult, François ^a  

^a Centre National de la Recherche Scientifique   (France)

Author keywords

Characterization of classes; Closed patterns; Condensed representations; Emerging patterns; Frequency based measures

Indexed keywords

SET THEORY; SILICON;

CLOSED PATTERNS; EMERGING PATTERNS (EP); FREQUENCY-BASED MEASURES; STRONG EMERGING PATTERNS (SEP);

DATABASE SYSTEMS;

EID: 24144442790     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31841-5_10     Document Type: Conference Paper

References (32)

1. R. Agrawal, T. Imielinsky, and A Swami. Mining associations rules between sets of items in large databases. In In Proceedings of the ACM SIGMOD'93, pages 207-216, 1993.
2. J. Bailey, T. Manoukian, and K. Ramamohanarao. Fast algorithms for mining emerging patterns. In Sixth European Conference on Principles Data Mining and Knowledge Discovery, PKDD'02, pages 39-50, Helsinki, Finland, 2002. Springer.
3. G. Birkhoff. Lattices theory. American Mathematical Society, vol. 25, 1967.
4. E. Boros, V.r Gurvich, L. Khachiyan, and K. Makino. On the complexity of generating maximal frequent and minimal infrequent sets. In Symposium on Theoretical Aspects of Computer Science, pages 133-141, 2002.
5. J. F. Boulicaut, A. Bykowski, and C. Rigotti. Free-sets: a condensed representation of boolean data for the approximation of frequency queries. Data Mining and Knowledge Discovery journal, 7(1):5-22, 2003. Kluwer Academics Publishers.
6. T. Calders and B. Goethals. Mining all non-derivable frequent itemsets. In T. Elomaa, H. Mannila, and H. Toivonen, editors, proceedings of the 6th European Conference on Principles of Data Mining and Knowledge Discovery (PKDD'02), pages 74-85. Springer, 2002.
7. T. Calders and B. Goethals. Minimal k-free representations of frequent sets. In In proceedings of the 7th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD'03), pages 71-82. Springer, 2003.
8. P. Clark and R. Boswell. Rule induction with CN2: Some recent improvements. In Proc. Fifth European Working Session on Learning, pages 151-163, Berlin, 1991. Springer.
9. B. Crémilleux and J. F. Boulicaut. Simplest rules characterizing classes generated by delta-free sets. In 22nd Int. Conf. on Knowledge Based Systems and Applied Artificial Intelligence, pages 33-46, Cambridge, UK, December 2002.
10. B. Crémilleux, A. Soulet, and F. Rioult. Mining the strongest emerging patterns characterizing patients affected by diseases due to atherosclerosis. In proceedings of the workshop Discovery Challenge, PKDD'03, pages 59-70, 2003.
11. L. De Raedt, M. Jäger, S. D. Lee, and H. Mannila. A theory of inductive query answering. In proceedings of the IEEE Conference on Data Mining, pages 123-130, Maebashi, Japan.
12. L. De Raedt and S. Kramer. The levelwise version space algorithm and its application to molecular fragment finding. In IJCAI, pages 853-862, 2001.
13. G. Dong and J. Li. Efficient mining of emerging patterns: Discovering trends and differences. In Knowledge Discovery and Data Mining, pages 43-52, 1999.
14. G. Dong, X. Zhang, W. Wong, and J. Li. CAEP: Classification by aggregating emerging patterns. In Discovery Science, pages 30-42, 1999.
15. E-H. Han, G. Karypis, V. Kumar, and B. Mobasher. Clustering based on association rule hypergraphs. In proceedings of the workshop on Research Issues on Data Mining And Knowledge Discovery, SIGMOD 97, 1997.
16. J. Li, G. Dong, and K. Ramamohanarao. Making use of the most expressive jumping emerging patterns for classification. In Pacific-Asia Conference on Knowledge Discovery and Data Mining, pages 220-232. Morgan Kaufmann, San Francisco, CA, 2000.
17. J. Li and K. Ramamohanarao. The space of jumping emerging patterns and its incremental maintenance algorithms. In Proc. 17th International Conf. on Machine Learning, pages 551-558. Morgan Kaufmann, San Francisco, 2000.
18. J. Li and L. Wong. Emerging patterns and gene expression data. In Genome Informatics 12, pages 3-13, 2001.
19. International Business Machines. IBM intelligent miner, user's guide, version 1, release 1, 1996.
20. H. Mannila and H. Toivonen. Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery, 1(3):241-258, 1997.
21. T. Mitchell. Generalization as search. Artificial Intelligence, vol. 18, pages 203-226, 1980.
22. N. Pasquier, Y. Bastide, T. Taouil, and L. Lakhal. Discovering frequent closed itemsets for association rules. Lecture Notes in Computer Science, 1540:398-416, 1999.
23. J. Pei, J. Han, and L. V. S. Lakshmanan. Mining frequent item sets with convertible constraints. In ICDE, pages 433-442, 2001.
24. J. Pei, J. Han, and Mao R. CLOSET: An efficient algorithm for mining frequent closed itemsets. In ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pages 21-30, 2000.
25. G. Piatetsky-Shapiro. Discovery, analysis and presentation of strong rules. In G. Piatetsky-Shapiro and W. Frawley, editors, Knowledge Discovery in Databases, pages 229-248, Cambridge, MA, 1991. AAAI/MIT Press.
26. F. Rioult and B. Crémilleux. Condensed representations in presence of missing values. In 5th International Conference on Intelligent Data Analysis (IDA '03), 2003.
27. M. Sebag and M Schoenauer. Generation of rules with certainty and confidence factors from incomplete and incoherent learning bases. In G. Piatetsky-Shapiro and W. Frawley, editors, in proceedings pf the European Knowledge Acquisition Workshop, EKAW'88, 1988.
28. P. Smyth and R. M. Goodman. Rule induction using information theory. In G. Piatetsky-Shapiro and W. Frawley, editors, Knowledge Discovery in Databases, pages 159-176, Cambridge, MA, 1991. AAAI/MIT Press.
29. A. Soulet, B. Crémilleux, and F. Rioult. Condensed representation of emerging patterns. In 8th Pacific-Asia Conference on Knowledge Discovery and Data Mining, Lecture Notes in Computer Science, pages 127-132, Sydney, 2004.
30. P. Tan, V. Kumar, and J. Srivastava. Selecting the right interestingness measure for association patterns. In In proceedings The Eighth ACM Special Interest Group on Knowledge Discovery in Data and Data Mining (SIGKDD'02), Edmonton, Alberta, Canada, 2002.
31. M. Zaki. Generating non-redundant association rules. In In proceedings The 6th ACM Special Interest Group on Knowledge Discovery in Data and Data Mining (SIGKDD'00), pages 34-43, 2000.
32. X. Zhang, G. Dong, and K. Ramamohanarao. Exploring constraints to efficiently mine emerging patterns from large high-dimensional datasets. In Knowledge Discovery and Data Mining, pages 310-314, 2000.