An efficient framework for mining flexible constraints

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

Volumn 3518 LNAI, Issue , 2005, Pages 661-671

  Soulet, Arnaud ^a   Crémilleux, Bruno ^a  

^a Centre National de la Recherche Scientifique   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA MINING; INTERACTIVE COMPUTER SYSTEMS; PROBLEM SOLVING; QUERY LANGUAGES; SYNTACTICS;

FLEXIBLE CONSTRAINTS; KDD PROCESSES; PRUNING OPERATOR; STRUCTURED QUERY LANGUAGE (SQL);

CONSTRAINT THEORY;

EID: 26944467551     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11430919_76     Document Type: Conference Paper

References (18)

1. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. 20th Int. Conf. Very Large Data Bases, VLDB, pages 432-444, 1994.
2. F. Bonchi and C. Lucchese. On closed constrained frequent pattern mining. In proceedings of ICDM'04, pages 35-42, 2004.
3. 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.
4. T. Calders and B. Goethals. Minimal k-free representations of frequent sets. In proceedings of PKDD'03, pages 71-82. Springer, 2003.
5. L. De Raedt, M. Jäger, S. D. Lee, and H. Mannila. A theory of inductive query answering. In proceedings of ICDM'02, pages 123-130, Maebashi, Japan, 2002.
6. G. Dong and J. Li. Efficient mining of emerging patterns: Discovering trends and differences. In Knowledge Discovery and Data Mining, pages 43-52, 1999.
7. K. Gade, J. Wang, and G. Karypis. Efficient closed pattern mining in the presence of tough block constraints. In proceedings of ACM SIGKDD, pages 138-147, 2004.
8. T. Imielinski and H. Mannila. A database perspective on knowledge discovery. In Communication of the ACM, pages 58-64, 1996.
9. B. Jeudy and F. Rioult. Database transposition for constrained (closed) pattern mining. In proceedings of KDID'04, pages 89-107, 2004.
10. D. Kiefer, J. Gehrke, C. Bucila, and W. White. How to quickly find a witness. In proceedings of ACM SIGMOD/PODS 2003 Conference, pages 272-283, 2003.
11. M. Kryszkiewicz. Inferring knowledge from frequent patterns. In proceedings of Soft-Ware 2002, Lecture Notes in Computer Science, pages 247-262, 2002.
12. H. Mannila and H. Toivonen. Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery, 1(3):241-258, 1997.
13. R. T. Ng, L. V. S. Lakshmanan, and J. Han. Exploratory mining and pruning optimizations of constrained associations rules. In proceedings of SIGMOD, 1998.
14. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering frequent closed itemsets for association rules. Lecture Notes in Computer Science, 1999.
15. J. Pei, J. Han, and L. V. S. Lakshmanan. Mining frequent item sets with convertible constraints. In proceedings of ICDE, pages 433-442, 2001.
16. A. Soulet, B. Crémilleux, and F. Rioult. Condensed representation of emerging patterns. In proceedings of PAKDD'04, pages 127-132, 2004.
17. A. Soulet and B. Crémilleux. A general framework designed for constraint-based mining. Technical report, Université de Caen, Caen, France, 2004.
18. K. Wang, Y. Jiang, J. X. Yu, G. Dong, and J. Han. Pushing aggregate constraints by divide-and-approximate. In proceedings of ICDE, pages 291-302, 2003.