Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
PAKDD
/
Paper
Frequent Closures as a Concise Representation for Binary Data Mining.
Jean-Franois Boulicaut
,
Artur Bykowski
Venue
B
PAKDD
Year
2000
Proceedings
PAKDD
DBLP record
conf/pakdd/BoulicautB00 ↗
Browse the full
PAKDD paper archive
.