Extending the state-of-the-art of constraint-based pattern discovery

Data and Knowledge Engineering

Volumn 60, Issue 2, 2007, Pages 377-399

  Bonchi, Francesco ^a   Lucchese, Claudio ^b  

^a ISTI CNR   (Italy)

^b CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

Author keywords

Constraint pushing techniques; Data reduction; Frequent pattern mining

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; DATA MINING; DATA REDUCTION; STATISTICAL METHODS;

ANTI-MONOTONE CONSTRAINTS; APRIORI-LIKE ALGORITHM; CONSTRAINT PUSHING TECHNIQUES; PATTERN MINING;

PATTERN RECOGNITION;

EID: 33846237753     PISSN: 0169023X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.datak.2006.02.006     Document Type: Article

References (22)

1. R. Agrawal, R. Srikant, Fast algorithms for mining association rules in large databases, in: Proceedings of the 20th International Conference on Very Large Databases, VLDB 1994, Santiago de Chile, Chile, 1994.
2. Besson J., Robardet C., Boulicaut J.F., and Rome S. Constraint-based concept mining and its application to microarray data analysis. Intelligent Data Analysis Journal 9 1 (2005) 59-82
3. F. Bonchi, B. Goethals, FP-Bonsai: the art of growing and pruning small FP-trees, in: Proceedings of Advances in Knowledge Discovery and Data Mining, 8th Pacific-Asia Conference, PAKDD 2004, Sydney, Australia, 2004.
4. F. Bonchi, C. Lucchese, On closed constrained frequent pattern mining, in: Proceedings of the Third IEEE International Conference on Data Mining, ICDM 2004, Brighton, UK, 2004.
5. F. Bonchi, C. Lucchese, Pushing tougher constraints in frequent pattern mining, in: Proceedings of Advances in Knowledge Discovery and Data Mining, 9th Pacific-Asia Conference, PAKDD 2005, Hanoi, Vietnam, 2005.
6. F. Bonchi, F.Giannotti, C. Lucchese, S. Orlando, R. Perego, R. Trasarti, ConQueSt: a constraint-based querying system for exploratory pattern discovery, in: Proceedings of the 22nd International Conference on Data Engineering, ICDE 2006, Atlanta, Georgia, USA (demo paper), 2006.
7. F. Bonchi, F. Giannotti, A. Mazzanti, D. Pedreschi, Adaptive constraint pushing in frequent pattern mining, in: Proceedings of the 7th European Conference on Principles and Practice of Knowledge Discovery in Databases, PKDD 2003, Cavtat-Dubrovnik, Croatia, 2003.
8. F. Bonchi, F. Giannotti, A. Mazzanti, D. Pedreschi, ExAnte: Anticipated data reduction in constrained pattern mining, in: Proceedings of the 7th European Conference on Principles and Practice of Knowledge Discovery in Databases, PKDD 2003, Cavtat-Dubrovnik, Croatia, 2003.
9. F. Bonchi, F. Giannotti, A. Mazzanti, D. Pedreschi, ExAMiner: optimized level-wise frequent pattern mining with monotone constraints, in: Proceedings of the Third IEEE International Conference on Data Mining, ICDM 2003, Melbourne, Florida, USA, 2003.
10. Boulicaut J.F., and Jeudy B. Optimization of association rule mining queries. Intelligent Data Analysis Journal 6 4 (2002) 341-357
11. C. Bucila, J. Gehrke, D. Kifer, W. White, DualMiner: A dual-pruning algorithm for itemsets with constraints, in: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2002, Edmonton, Alberta, Canada, 2002.
12. L. De Raedt, S. Kramer, The levelwise version space algorithm and its application to molecular fragment finding, in: Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI 2001, Seattle, Washington, USA, 2001.
13. G. Grahne, L. Lakshmanan, X. Wang, Efficient mining of constrained correlated sets, in: Proceedings of the 16th IEEE International Conference on Data Engineering, ICDE 2000, San Diego, California, USA, 2000.
14. Han J., Lakshmanan L., and Ng R. Constraint-based, multidimensional data mining. Computer 32 8 (1999) 46-50
15. J. Han, J. Pei, Y. Yin, Mining frequent patterns without candidate generation, in: Proceedings of 2000 ACM International Conference on Management of Data, SIGMOD 2000, Dallas, Texas, USA, 2000.
16. D. Kifer, J. Gehrke, C. Bucila, Q. White, How to quickly find a witness, in: Proceedings of 2003 ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, PODS 2003, San Diego, CA, USA, 2003.
17. L. Lakshmanan, R. Ng, J. Han, A. Pang, Optimization of constrained frequent set queries with 2-variable constraints, in: Proceedings of 1999 ACM International Conference on Management of Data, SIGMOD 1999, Philadelphia, Pennsylvania, USA, 1999, pp. 157-168.
18. R. Ng, L. Lakshmanan, J. Han, A. Pang, Exploratory mining and pruning optimizations of constrained associations rules, in: Proceedings of 1998 ACM International Conference on Management of Data, SIGMOD 1998, Seattle, Washington, USA, 1998.
19. C. Ordonez et al., Mining constrained association rules to predict heart disease, in: Proceedings of the First IEEE International Conference on Data Mining, December 2001, San Jose, California, USA, 2001, pp. 433-440.
20. J, Pei, J. Han, Can we push more constraints into frequent pattern mining? in: Proceedings ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2000, Boston, MA, USA, 2000.
21. J. Pei, J. Han, L. Lakshmanan, Mining frequent item sets with convertible constraints, in: Proceedings of the 17th IEEE International Conference on Data Engineering, ICDE 2001, Heidelberg, Germany, 2001.
22. R. Srikant, Q. Vu, R. Agrawal, Mining association rules with item constraints, in: Proceedings ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 1997, Newport Beach, California, USA, 1997.