Constraint-based mining of fault-tolerant patterns from boolean data

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

Volumn 3933 LNCS, Issue , 2006, Pages 55-71

  Besson, Jérémy ^a,b   Pensa, Ruggero G ^a   Robardet, Céline ^c   Boulicaut, Jean François ^a  

^a CNRS   (France)

^b INSERM   (France)

^c UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY CODES; CONSTRAINT THEORY; DATABASE SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS; KNOWLEDGE ACQUISITION; QUERY LANGUAGES;

BOOLEAN DATA; CONSTRAINT-BASED MINING APPROACH; FAULT-TOLERANT PATTERNS; INDUCTIVE QUERIES;

DATA MINING;

EID: 33745804725     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11733492_4     Document Type: Conference Paper

References (25)

1. C. Antunes and A.L. Oliveira. Constraint relaxations for discovering unknown sequential patterns. In Revised selected and invited papers KDID'04, volume 3377 of LNCS, pages 11-32. Springer-Verlag, 2005.
2. J. Besson, C. Robardet, and J-F. Boulicaut. Mining formal concepts with a bounded number of exceptions from transactional data. In Revised selected and invited papers KDID'04, volume 3377 of LNCS, pages 33-45. Springer-Verlag, 2004.
3. J. Besson, C. Robardet, and J-F. Boulicaut. Approximation de collections de concepts formels par des bi-ensembles denses et pertinents. In Proceedings CAp 2005, pages 313-328. PUG, 2005. An extended and revised version in English is submitted to a journal.
4. J. Besson, C. Robardet, J-F. Boulicaut, and S. Rome. Constraint-based concept mining and its application to microarray data analysis. Intelligent Data Analysis, 9(1):59-82, 2005.
5. M. Bistarelli and F. Bonchi. Interestingness is not a dichotomy: introducing softness in constrained pattern mining. In Proceedings PKDD'05, volume 3721 of LNCS, pages 22-33. Springer-Verlag, 2005.
6. J-F. Boulicaut. Inductive databases and multiple uses of frequent itemsets: the cInQ approach. In Database Technologies for Data Mining - Discovering Knowledge with Inductive Queries, volume 2682 of LNCS, pages 1-23. Springer-Verlag, 2004.
7. J-F. Boulicaut, A. Bykowski, and C. Rigotti. Approximation of frequency queries by mean of free-sets. In Proceedings PKDD'00, volume 1910 of LNAI, pages 75-85. Springer-Verlag, 2000.
8. 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.
9. C. Bucila, J. E. Gehrke, D. Kifer, and W. White. Dualminer: A dual-pruning algorithm for itemsets with constraints. Data Mining and Knowledge Discovery journal, 7 (4):241-272, 2003.
10. L. De Raedt. A perspective on inductive databases. SIGKDD Explorations, 4(2):69-77, 2003.
11. I. S. Dhillon, S. Mallela, and D. S. Modha. Information-theoretic co-clustering. In Proceedings ACM SIGKDD 2003, pages 89-98, Washington, USA, 2003. ACM Press.
12. P. François, C. Robert, B. Cremilleux, C. Bucharles, and J. Demongeot. Variables processing in expert system building: application to the aetiological diagnosis of infantile meningitis. Med Inform, 15(2):115-124, 1990.
13. F. Geerts, B. Goethals, and T. Mielikäinen. Tiling databases. In Proceedings DS'04, volume 3245 of LNAI, pages 278-289. Springer-Verlag, 2004.
14. A. Gionis, H. Mannila, and J. K. Seppänen. Geometric and combinatorial tiles in 0-1 data. In Proceedings PKDD'04, volume 3202 of LNAI, pages 173-184. Springer-Verlag, 2004.
15. B. Goethals and M. Zaki. Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations FIMI 2003. CEUR-WS, Melbourne, USA, 2003.
16. T. Imielinski and H. Mannila. A database perspective on knowledge discovery. Communications of the ACM, 39(11):58-64, 1996.
17. S. O. Kuznetsov and S. A. Obiedkov. Comparing performance of algorithms for generating concept lattices. Journal of Experimental and Theoretical Artificial Intelligence, 14 (2-3):189-216, 2002.
18. J. Pei, A. K. H. Tung, and J. Han. Fault-tolerant frequent pattern mining: Problems and challenges. In SIGMOD wokshop DMKD. ACM workshop, 2001.
19. R. Pensa and J-F. Boulicaut. From local pattern mining to relevant bi-cluster characterization. In Proceedings IDA '05, volume 3646 of LNCS, pages 293-304. Springer-Verlag, 2005.
20. R. G. Pensa, C. Robardet, and J.-F. Boulicaut. A bi-clustering framework for categorical data. In Proceedings PKDD'05, volume 3721 of LNCS, pages 643-650. Springer-Verlag, 2005.
21. C. Robardet, B. Crémilleux, and J.-F. Boulicaut. Characterization of unsupervized clusters by means of the simplest association rules: an application for child's meningitis. In Proceedings IDAMAP'02 co-located with ECAI'02, pages 61-66, Lyon, F, 2002.
22. J. K. Seppänen and H. Mannila. Dense itemsets. In Proceedings ACM SIGKDD'04, pages 683-688, Seattle, USA, 2004. ACM Press.
23. G. Stumme, R. Taouil, Y. Bastide, N. Pasqier, and L. Lakhal. Computing iceberg concept lattices with TITANIC. Journal of Data and Knowledge Engineering, 42 (2):189-222, 2002.
24. R. Wille. Restructuring lattice theory: an approach based on hierarchies of concepts. In I. Rival, editor, Ordered sets, pages 445-470. Reidel, 1982.
25. C. Yang, U. Fayyad, and P. S. Bradley. Efficient discovery of error-tolerant frequent itemsets in high dimensions. In Proceedings ACM SIGKDD'01, pages 194-203. ACM Press, 2001.