Frequent Closures as a Concise Representation for Binary Data Mining
J. Boulicaut, and A. Bykowski.
PADKK '00: Proceedings of the 4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, Current Issues and New Applications, page 62--73. London, UK, Springer-Verlag, (2000)

search on

This publication has not been reviewed yet.

rating distribution

average user rating0.0 out of 5.0 based on 0 reviews

Please log in to take part in the discussion (add own reviews or comments).

%0 Conference Paper
%1 boulicaut00frequent
%A Boulicaut, Jean-Francois
%A Bykowski, Artur
%B PADKK '00: Proceedings of the 4th Pacific-Asia Conference on Knowledge
    Discovery and Data Mining, Current Issues and New Applications
%C London, UK
%D 2000
%I Springer-Verlag
%K FCA OntologyHandbook
%P 62--73
%T Frequent Closures as a Concise Representation for Binary Data Mining
%@ 3-540-67382-2

PUMA

Frequent Closures as a Concise Representation for Binary Data Mining
J. Boulicaut, and A. Bykowski.
PADKK '00: Proceedings of the 4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, Current Issues and New Applications, page 62--73. London, UK, Springer-Verlag, (2000)

Tags

Users

Comments and Reviews

Cite this publication

PUMA

Frequent Closures as a Concise Representation for Binary Data MiningJ. Boulicaut, and A. Bykowski. PADKK '00: Proceedings of the 4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, Current Issues and New Applications, page 62--73. London, UK, Springer-Verlag, (2000)

Tags

Users

Comments and Reviews

Cite this publication

Frequent Closures as a Concise Representation for Binary Data Mining
J. Boulicaut, and A. Bykowski.
PADKK '00: Proceedings of the 4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, Current Issues and New Applications, page 62--73. London, UK, Springer-Verlag, (2000)