Représentations condensées des ensembles fréquents et extraction sous contraintes de motifs ensemblistes

• A. Bykowski. Frequent set discovery in highly-correlated data. Mémoire du DEA d'Informatique de Lyon, INSA Lyon - LISI, Juillet 99.

• T. Daurel. Atelier d'extraction de connaissances. Mémoire du DEA ECD, INSA Lyon - LISI, Juillet 00.

• J-F. Boulicaut, B. Jeudy. Using Constraints During Set Mining: should we Prune or Not? Actes des Seizième Journées Bases de Données Avancées BDA'00, Blois (F), 24-27 Octobre 2000. pp. 221-237.

• J-F. Boulicaut. Quelques problèmes ouverts pour la découverte de règles dans les bases de données. Actes des Rencontres Francophones sur la logique floue et ses applications LFA'00, octobre 2000, La Rochelle (F). pp. 357-361. Cepadues Editions.

• J-F. Boulicaut, A. Bykowski. Frequent closures as a concise representation for binary data mining. Proceedings of the 4th Pacific-Asia Conference on Knowledge Discovery and Data Mining PaKDD’00, Kyoto (JP), April 2000. Springer LNAI 1805, pp. 62-73.

• J-F. Boulicaut, A. Bykowski, and C. Rigotti. Approximation of frequency queries by means of free-sets. Proceedings of the Fourth European Conference on Principles and Practice of Knowledge Discovery in Databases PKDD'00, Lyon (F), September 2000. Springer, LNAI 1910, pp. 75-85.

•  J-F. Boulicaut, A. Bykowski, and B. Jeudy. Towards the Tractable Discovery of Association Rules with Negations. Proceedings of the Fourth International Conference on Flexible Query Answering Systems FQAS'00, Warsaw (PL), October 2000. Springer, Advances in Soft Computing. pp. 425-434.

• A. Bykowski and C. Rigotti. A condensed representation to find frequent patterns. Proceedings of the joint conference ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems PODS 2001, May 2001, Santa Barbara (USA). pp. 267-273.

• J-F. Boulicaut, B. Jeudy. Mining Free Sets under Constraints. Proceedings of the International Database Engineering and Applications Symposium IDEAS'01, Grenoble (F), July 2001, IEEE Computer Press. pp. 322-329.

• J-F. Boulicaut, B. Jeudy. Constraint-based discovery of a condensed representation for frequent patterns. Proceedings of the Workshop Database Support for KDD co-located with ECML/PKDD'01, Freiburg (D), September 2001. pp. 3-13.

• B. Jeudy, J-F. Boulicaut. Constraint-based discovery and inductive queries: application to association rule mining. Proceedings of the European Science Foundation Exploratory Workshop on Pattern Detection and Discovery in Data Mining, London (UK). September 2002. Springer LNAI 2447. pp. 110-124.

• B. Jeudy, J-F. Boulicaut. Using condensed representations for interactive association rule mining. Proceedings of the 6th European conferences on Principles and practice of Knowledge Discovery in Databases PKDD 2002, Helsinki (FIN), August 2002. Springer LNAI 2431, pp. 225-236.

• A. Bykowski, J. K. Seppänen, and J. Hollmén. Model-independent bounding of the supports of Boolean formulae in binary data. Proceedings of the 1st international workshop on Knowledge Discovery in Inductive Databases KDID'02 co-located with ECML/PKDD 2002, Helsinki (FIN), August 2002. ISBN 952-10-0638-2 Helsinki University Printing House. pp. 20-31.

• A. Bykowski. Condensed representations of frequent sets: application to descriptive pattern discovery. Thèse de doctorat de l'INSA Lyon présentée le 21 octobre 2002.  

• B. Jeudy, J-F. Boulicaut. Optimization of association rule mining queries. Intelligent Data Analysis IDA 6 (4):341-357, 2002.

• B. Jeudy. Optimisation de requêtes inductives: application à l'extraction sous contraintes de règles d'association. Thèse de doctorat de l'INSA Lyon présentée le 13 décembre 2002.

• J-F. Boulicaut, A. Bykowski, C. Rigotti. Free-sets: a condensed representation of boolean data for the approximation of frequency queries. Data Mining and Knowledge Discovery DMKD 7(1):5-22, 2003.

• A . Bykowski, C. Rigotti. DBC: a condensed representation of frequent patterns for efficient mining. Information Systems IS 28(8):949-977, 2003.

• J. Besson, C. Robardet, J-F. Boulicaut. Constraint-based mining of formal concepts in transactional data. Proceedings of the 8th Pacific-Asia Conference on Knowledge Discovery and Data Mining PaKDD’04, Sydney (Australia), May 2004. Springer LNCS 3056, pp. 615-624.

• J. Besson, C. Robardet, J-F. Boulicaut. Mining formal concepts with a bounded number of exceptions from transactional data. Knowledge Discovery in Inductive Databases KDID'04 Revised Selected and Invited Papers, Springer LNCS 3377, pp. 33-45, 2005.

• J. Besson, C. Robardet, J-F. Boulicaut. Approximation de concepts formels par des bi-ensembles denses et pertinents. Actes de la conférence francophone d’Apprentissage Automatique CAp 2005, Nice (F), juin 2005, Presses Universitaires de Grenoble, pp. 313-328.

• J. Besson, C. Robardet, J-F. Boulicaut, S. Rome. Constraint-based formal concept mining and its application to microarray data analysis. Intelligent Data Analysis IDA 9(1):59-82, 2005.

• R. Pensa, J-F. Boulicaut. Towards fault-tolerant formal concept analysis. Proceedings of the 9th Congress of the Italian Association for Artificial Intelligence AI*IA'05, Milano – Bicocca, September 2005. Springer LNAI 3673, pp. 212-223, 2005.

• J. Besson, R. Pensa, C. Robardet, J-F. Boulicaut. Constraint-based mining of fault-tolerant patterns from Boolean data. Proceedings of the 4^th International Workshop on Knowledge Discovery in Inductive Databases KDID'05, Porto (P), October 2005, pp. 13-26.

• J-F. Boulicaut, Condensed representations for data mining.  Encyclopedia of Data Warehousing and Mining, J. Wang (ed.), Idea Group Reference, pp. 207-211. 2005. 

• J. Besson. Découverte de motifs pertinents pour l'analyse du transcriptome : application à l'insulino-résistance. Thèse de doctorat de l'INSA Lyon présentée le 4 novembre 2005.  

• T. Calders, C. Rigotti, J-F. Boulicaut. A survey on condensed representations for frequent sets. Constraint-based mining and Inductive Databases. Springer LNCS 3848, pp. 64-80, 2006.

• J. Besson, R. Pensa, C. Robardet, J-F. Boulicaut. Constraint-based mining of fault-tolerant patterns from Boolean data. Knowledge Discovery in Inductive Databases 4th International Workshop KDID'05 Revised Selected and Invited Papers. Springer LNCS 3933, pp. 55-71, 2006.

•  J. Besson, C. Robardet, J-F. Boulicaut. Mining a new fault-tolerant pattern type as an alternative to formal concept discovery. Proceedings of the 14th International Conference on Conceptual Structures ICCS'06, Aalborg (DK), July 2006. Springer LNAI 4068, pp. 144-157.

• J. Besson, C. Robardet, L. De Raedt; J-F. Boulicaut. Mining numerical bi-sets. Proceedings 5th Int. Workshop on Knowledge Discovery in Inductive Databases KDID'06 co-located with ECML-PKDD 2006, Berlin (D), September 2006, pp. 9-19.

• J. Besson, C. Robardet, J-F. Boulicaut. Un algorithme générique d'extraction de bi-ensembles sous contraintes dans des données booléennes. Revue Information Interaction Intelligence I3. Cepadues Editions. Numéro Hors-Série 2007, pp. 141-160.

• J. Besson, C. Robardet, L. De Raedt, J-F. Boulicaut. Mining Bi-sets in Numerical Data. Knowledge Discovery in Inductive Databases KDID'06 Revised Selected and Invited Papers, Springer LNCS 4747, pp. 11-23.  2007. Significant revision of the of the paper published in the informal proceedings distributed at the workshop.

• L. Cerf, J. Besson, C. Robardet, J-F. Boulicaut. Data_Peeler: Constraint-based Closed Pattern Mining in n-ary Relations.  Proceedings SIAM International Conference on Data Mining SDM'08, Atlanta, USA, April 24-26, 2008. pp. 37-48.

• J-F. Boulicaut, J. Besson. Actionability and formal concepts: a data mining perspective (invited contribution) Proceedings 6th International Conference on Formal Concept Analysis ICFCA'08, Montréal, Canada, February 25-28, 2008. Springer LNAI 4933, pp. 14-31.

• J. Besson,  L. Cerf, R. Thévenoux, J-F. Boulicaut.Tackling closed pattern relevancy in n-ary relations. Proceedings 1st Workshop Mining Multidimensional Data MMD'08 co-located with ECML PKDD 2008, Antwerp, Belgium, September 15-19, 2008. pp. 2-16.

• L. Cerf, J. Besson, C. Robardet, J-F. Boulicaut. Closed Patterns Meet n-ary Relations. Closed Patterns Meet n-ary Relations. ACM Transactions on Knowledge Discovery in Data 3(1) pp. 3:1-3:37. ACM Press. March 2009.

• L. Cerf, J. Besson, J-F. Boulicaut. Extraction de motifs fermés dans des relations n-aires bruitées. Actes des 9ème Journées Francophones Extraction et Gestion de Connaissances EGC'09, Strasbourg (F), 27-30 janvier 2009, Cepadues-Editions, RNTI-E-15,  pp. 163-168.

• L. Cerf. Constraint-based mining of closed patterns in noisy n-ary relations. Thèse de doctorat de l'INSA de Lyon présentée le 9 juillet 2010.

• K. Ngan T. Nguyen, L. Cerf, J-F. Boulicaut. Sémantiques et calculs de règles descriptives dans une relation n-aire. Actes des 26èmes Journées Bases de Données Avancées BDA'10, Toulouse (F),  19-22 octobre 2010. pp. 1-20.