Optimizing constraint-based mining by automatically relaxing constraints

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2005, Pages 4-7

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

^a Centre National de la Recherche Scientifique   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONSTRAINT THEORY;

PRIMITIVE-BASED CONSTRAINTS; RELAXING OPERATORS;

DATA MINING;

EID: 34548590794     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2005.112     Document Type: Conference Paper

References (12)

1. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. of VLDB, pages 487-499, 1994.
2. F. Bonchi and C. Lucchese. On closed constrained frequent pattern mining. In Proc. of ICDM, pages 35-42, 2004.
3. C. Bucila, J. Gehrke, D. Kifer, and W. White. Dualminer: A dual-pruning algorithm for itemsets with constraints. In Proc. of SIGKDD, pages 42-51, 2002.
4. A. L. O. Claudia Antunes. Mining patterns using relaxations of user defined constraints. In Post-proc. of KDID, 2004.
5. M. N. Garofalakis, R. Rastogi, and K. Shim. SPIRIT: Sequential pattern mining with regular expression constraints. In Proc. of VLDB, pages 223-234, 1999.
6. T. Imielinski and H. Mannila. A database perspective on knowledge discovery. Comm. Of The Acm, 1996.
7. D. Kiefer, J. Gehrke, C. Bucila, and W. White. How to quickly find a witness. In Proc. of SIGMOD/PODS, 2003.
8. S. D. Lee and L. D. Raedt. An algebra for inductive query evaluation. In Proc. of KDID, pages 80-96, 2003.
9. H. Mannila and H. Toivonen. Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery, 1(3):241-258, 1997.
10. R. Ng, L. V. S. Lakshmanan, J. Han, and T. Mah. Exploratory mining via constrained frequent set queries, 1999.
11. J. Pei, J. Han, and L. V. S. Lakshmanan. Mining frequent item sets with convertible constraints. In Proc. of ICDE, pages 433-442, 2001.
12. A. Soulet and B. Crémilleux. An efficient framework for mining flexible constraints. In Proc. of PAKDD, pages 661-670, 2005.