Mining frequent patterns by differential refinement of clustered bitmaps

Jianwei Li*, Alok Choudhary, Nan Jiang, Wei Keng Liao

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

Abstract

Existing algorithms for mining frequent patterns are facing challenges to handle databases (a) of increasingly large sizes, (b) consisting of variable-length, irregularly-spaced data, and (c) with mixed or even unknown properties. In this paper, we propose a novel self-adaptive algorithm D-CLUB that thoroughly addresses these issues by progressively clustering the database into condensed association bitmaps, applying a differential technique to digest and remove dense patterns, and then mining the remaining tiny bitmaps directly through fast aggregate bit operations. The bitmaps are well organized into rectangular two-dimensional matrices and adaptively refined in regions that necessitate further computation. We show that this approach not only drastically cuts down the original database size but also largely reduces and simplifies the mining computation for a wide variety of datasets and parameters. We compare D-CLUB with various state-of-the-art algorithms and show significant performance improvement in all cases.

Original languageEnglish (US)
Title of host publicationProceedings of the Sixth SIAM International Conference on Data Mining
PublisherSociety for Industrial and Applied Mathematics
Pages294-305
Number of pages12
ISBN (Print)089871611X, 9780898716115
DOIs
StatePublished - 2006
EventSixth SIAM International Conference on Data Mining - Bethesda, MD, United States
Duration: Apr 20 2006Apr 22 2006

Publication series

NameProceedings of the Sixth SIAM International Conference on Data Mining
Volume2006

Other

OtherSixth SIAM International Conference on Data Mining
CountryUnited States
CityBethesda, MD
Period4/20/064/22/06

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Mining frequent patterns by differential refinement of clustered bitmaps'. Together they form a unique fingerprint.

  • Cite this

    Li, J., Choudhary, A., Jiang, N., & Liao, W. K. (2006). Mining frequent patterns by differential refinement of clustered bitmaps. In Proceedings of the Sixth SIAM International Conference on Data Mining (pp. 294-305). (Proceedings of the Sixth SIAM International Conference on Data Mining; Vol. 2006). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611972764.26