Association Rule Discovery in Highly-Correlated Data: a Case Study in Web Usage Mining. - Jean-François Boulicaut; Artur Bykowski; L. Gomez-Chantada (ADBIS-DASFAA Symposium, 2000)

Towards the Tractable Discovery of Association Rules with Negations. - Jean-François Boulicaut; Artur Bykowski; Baptiste Jeudy (FQAS, 2000)

Frequent Closures as a Concise Representation for Binary Data Mining. - Jean-François Boulicaut; Artur Bykowski (PAKDD, 2000)

Approximation of Frequency Queris by Means of Free-Sets. - Jean-François Boulicaut; Artur Bykowski; Christophe Rigotti (PKDD, 2000)

A condensed representation to find frequent patterns. - Artur Bykowski; Christophe Rigotti (PODS, 2001)

Association Maps as Integrity Constraints in Inductive Databases. - Artur Bykowski; Thomas Daurel; Nicolas Méger; Christophe Rigotti (KDID, 2002)

Model-independent Bounding of the Supports of Boolean Formulae in Binary Data. - Artur Bykowski; Jouni K. Seppänen; Jaakko Hollmén (KDID, 2002)

Free-Sets: A Condensed Representation of Boolean Data for the Approximation of Frequency Queries. - Jean-François Boulicaut; Artur Bykowski; Christophe Rigotti (Data Min. Knowl. Discov., 2003)

DBC: a condensed representation of frequent patterns for efficient mining. - Artur Bykowski; Christophe Rigotti (Inf. Syst., 2003)

Integrity Constraints over Association Rules. - Artur Bykowski; Thomas Daurel; Nicolas Méger; Christophe Rigotti (Database Support for Data Mining Applications, 2004)

Model-Independent Bounding of the Supports of Boolean Formulae in Binary Data. - Artur Bykowski; Jouni K. Seppänen; Jaakko Hollmén (Database Support for Data Mining Applications, 2004)