Incremental mining of association patterns on compressed data

Vincent To Yee Ng, Jacky Man Lee Wong, Paul Bao

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

2 Citations (Scopus)


Introducing data compression concept to large databases has been proposed for many years. In this project, we propose a new algorithm for the compression of large databases. Our goal is to optimize the I/O effort for finding association rules. The algorithm partitions the databases into two parts and all transactions will be compressed with the help of a reference transaction found in the small partition. We also compared the proposed compression algorithms with a normal compression algorithm - the binary compression. Empirical evaluation shows that the proposed algorithm performs well both in reducing the storage space and the I/O process required to find the large itemsets for association rules.
Original languageEnglish
Title of host publicationAnnual Conference of the North American Fuzzy Information Processing Society - NAFIPS
Number of pages6
Publication statusPublished - 1 Dec 2001
EventJoint 9th IFSA World Congress and 20th NAFIPS International Conference - Vancouver, BC, Canada
Duration: 25 Jul 200128 Jul 2001


ConferenceJoint 9th IFSA World Congress and 20th NAFIPS International Conference
CityVancouver, BC

ASJC Scopus subject areas

  • General Computer Science
  • General Mathematics


Dive into the research topics of 'Incremental mining of association patterns on compressed data'. Together they form a unique fingerprint.

Cite this