DBC : a Condensed Representation of Frequent Patterns for Efficient Mining - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Information Systems Année : 2003

DBC : a Condensed Representation of Frequent Patterns for Efficient Mining

Résumé

Given a large set of data, a common data mining problem is to extract the frequent patterns occurring in this set. The idea presented in this paper is to extract a condensed representation of the frequent patterns called disjunction-bordered condensation (DBC), instead of extracting the whole frequent pattern collection. We show that this condensed representation can be used to regenerate all frequent patterns and their exact frequencies. Moreover, this regeneration can be performed without any access to the original data. Practical experiments show that the DBCcan be extracted very efficiently even in difficult cases and that this extraction and the regeneration of the frequent patterns is much more efficient than the direct extraction of the frequent patterns themselves. We compared the DBC with another representation of frequent patterns previously investigated in the literature called frequent closed sets. In nearly all experiments we have run, the DBC have been extracted much more efficiently than frequent closed sets. In the other cases, the extraction times are very close.

Dates et versions

hal-01593569 , version 1 (26-09-2017)

Identifiants

Citer

Artur Bykowski, Christophe Rigotti. DBC : a Condensed Representation of Frequent Patterns for Efficient Mining. Information Systems, 2003, 8, 28, pp.949-977. ⟨10.1016/S0306-4379(03)00002-4⟩. ⟨hal-01593569⟩
70 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More