Ph.D Artur Bykowski

Condensed Representations of Frequent Itemsets: Application to Descriptive Pattern Discovery

Download Draft here

Date de soutenance : 21/10/2002

Lieu (établissement) : INSA de Lyon

Jury              

Dr. Jean-François Boulicaut (Directeur de thèse, INSA Lyon)

Pr. Robert Laurini (Rapporteur, INSA Lyon)

Dr. Christophe Rigotti (Examinateur, INSA Lyon)

Pr. Nicolas Spyratos (Rapporteur, Université Paris-Sud, Orsay)

Dr. Gerd Stumme (Examinateur, University of Karlsruhe, Allemagne)

Pr. Hannu Toivonen (Rapporteur,University of Helsinki, Finland)

Publications liées à la thèse

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.

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, T. Daurel, N. Meger, C. Rigotti. Association Maps as Integrity Constraints in Inductive Databases. 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. 61-75.

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 7(1):5-22, 2003.

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