Cluster-grouping: from subgroup discovery to clustering

  • Authors:
  • Albrecht Zimmermann;Luc Raedt

  • Affiliations:
  • Department of Computer Science, Katholieke Universiteit Leuven, Leuven, Belgium 3001;Department of Computer Science, Katholieke Universiteit Leuven, Leuven, Belgium 3001

  • Venue:
  • Machine Learning
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

We introduce the problem of cluster-grouping and show that it can be considered a subtask in several important data mining tasks, such as subgroup discovery, mining correlated patterns, clustering and classification. The algorithm CG for solving cluster-grouping problems is then introduced, and it is incorporated as a component in several existing and novel algorithms for tackling subgroup discovery, clustering and classification. The resulting systems are empirically compared to state-of-the-art systems such as CN2, CBA, Ripper, Autoclass and CobWeb. The results indicate that the CG algorithm can be useful as a generic local pattern mining component in a wide variety of data mining and machine learning algorithms.