Welcome to DiSC 2002
SIGMOD 2001
PODS 2001
SIGMOD RECORD 2001
CIKM 2001
CoopIS 2001
DASFAA 2001
DASFAA 2000
DBPL 2001
Data Engineering Bul
DEXA_EC-WEB 2001
DMKD 2001
DPDJ 2001
HYPERTEXT 2001
ICDE 2001
ICDM 2001
ICDT 2001
JCDL 2001
KDD 2001
KDD_EXPLORATIONS 20
KRDB 2001
MDM 2001
MIR 2001
MIS 2001
RIDE 2001
SBBD 2001
SIGIR 2001
SIGIR FORUM 2001
SSDBM 2001
SSTD 2001
TODS 2001
TIME 2001
VLDB 2001
VLDBJ 2001
About DiSC 2002
Editorial Board
Acknowledgements
DiSC 2002 Production
ADVIS
DiSC'02 Feedback
DiSC'02 Sitemap
Search DiSC'02
<<<Author Index>>>
Copyright Notice

Artur Bykowski

Papers on DiSC'02


A condensed representation to find frequent patterns

Publications


Note: Links lead to the DBLP on the Web.

Artur Bykowski

5 Artur Bykowski, Christophe Rigotti : A condensed representation to find frequent patterns. PODS 2001

4 Jean-Francois 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-Francois Boulicaut , Artur Bykowski, Baptiste Jeudy : Towards the Tractable Discovery of Association Rules with Negations. FQAS 2000 : 425-434

2 Jean-Francois Boulicaut , Artur Bykowski: Frequent Closures as a Concise Representation for Binary Data Mining. PAKDD 2000 : 62-73

1 Jean-Francois Boulicaut , Artur Bykowski, Christophe Rigotti : Approximation of Frequency Queris by Means of Free-Sets. PKDD 2000 : 75-85




DiSC'02 © 2003 Association for Computing Machinery