Mining entropy l-diversity patterns

  • Chaofeng Sha*
  • , Jian Gong
  • , Aoying Zhou
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The discovery of diversity patterns from binary data is an important data mining task. This paper proposes entropy l-diversity patterns based on information theory, and develops techniques for discovering such diversity patterns. We study the properties of the entropyl-diversity patterns, and propose some pruning strategies to speed our mining algorithm. Experiments show that our mining algorithm is fast in practice. For real date sets the running time are improved by serval orders of magnitude over brute force method.

Original languageEnglish
Title of host publicationDatabase Systems for Advanced Applications - 14th International Conference, DASFAA 2009, Proceedings
Pages384-388
Number of pages5
DOIs
StatePublished - 2009
Externally publishedYes
Event14th International Conference on Database Systems for Advanced Applications, DASFAA 2009 - Brisbane, QLD, Australia
Duration: 21 Apr 200923 Apr 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5463
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference14th International Conference on Database Systems for Advanced Applications, DASFAA 2009
Country/TerritoryAustralia
CityBrisbane, QLD
Period21/04/0923/04/09

Fingerprint

Dive into the research topics of 'Mining entropy l-diversity patterns'. Together they form a unique fingerprint.

Cite this