Exploring Interestingness Through Clustering: A Framework

  • Authors:
  • Sigal Sahar

  • Affiliations:
  • -

  • Venue:
  • ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Determining interestingness is a notoriously difficultproblem: it is subjective and elusive to capture. It is alsobecoming an increasingly more important problem in KDDas the number of mined patterns increases. In this work weintroduce and investigate a framework for association ruleclustering that enables automating much of the laboriousmanual effort normally involved in the exploration and understandingof interestingness. Clustering is ideally suitedfor this task; it is the unsupervised organization of patternsinto groups, so that patterns in the same group are moresimilar to each other than to patterns in other groups. Wealso define a data-driven inferred labeling of these clusters,the ancestor coverage, which provides an intuitive, conciserepresentation of the clusters.