| 2004 |
|---|
| 11 | EE | Artur Bykowski,
Jouni K. Seppänen,
Jaakko Hollmén:
Model-Independent Bounding of the Supports of Boolean Formulae in Binary Data.
Database Support for Data Mining Applications 2004: 234-249 |
| 10 | EE | Artur Bykowski,
Thomas Daurel,
Nicolas Méger,
Christophe Rigotti:
Integrity Constraints over Association Rules.
Database Support for Data Mining Applications 2004: 306-323 |
| 2003 |
|---|
| 9 | | Jean-François Boulicaut,
Artur Bykowski,
Christophe Rigotti:
Free-Sets: A Condensed Representation of Boolean Data for the Approximation of Frequency Queries.
Data Min. Knowl. Discov. 7(1): 5-22 (2003) |
| 8 | EE | Artur Bykowski,
Christophe Rigotti:
DBC: a condensed representation of frequent patterns for efficient mining.
Inf. Syst. 28(8): 949-977 (2003) |
| 2002 |
|---|
| 7 | EE | Artur Bykowski,
Jouni K. Seppänen,
Jaakko Hollmén:
Model-independent Bounding of the Supports of Boolean Formulae in Binary Data.
KDID 2002: 20-31 |
| 6 | EE | Artur Bykowski,
Thomas Daurel,
Nicolas Méger,
Christophe Rigotti:
Association Maps as Integrity Constraints in Inductive Databases.
KDID 2002: 61-75 |
| 2001 |
|---|
| 5 | EE | Artur Bykowski,
Christophe Rigotti:
A condensed representation to find frequent patterns.
PODS 2001 |
| 2000 |
|---|
| 4 | | Jean-François Boulicaut,
Artur Bykowski,
L. Gomez-Chantada:
Association Rule Discovery in Highly-Correlated Data: a Case Study in Web Usage Mining.
ADBIS-DASFAA Symposium 2000: 46-55 |
| 3 | | Jean-François Boulicaut,
Artur Bykowski,
Baptiste Jeudy:
Towards the Tractable Discovery of Association Rules with Negations.
FQAS 2000: 425-434 |
| 2 | | Jean-François Boulicaut,
Artur Bykowski:
Frequent Closures as a Concise Representation for Binary Data Mining.
PAKDD 2000: 62-73 |
| 1 | EE | Jean-François Boulicaut,
Artur Bykowski,
Christophe Rigotti:
Approximation of Frequency Queris by Means of Free-Sets.
PKDD 2000: 75-85 |
