Learning predictive clustering rules

  • Authors:
  • Bernard Ženko;Sašo Džeroski;Jan Struyf

  • Affiliations:
  • Department of Knowledge Technologies, Jožef Stefan Institute, Slovenia;Department of Knowledge Technologies, Jožef Stefan Institute, Slovenia;Department of Computer Science, Katholieke Universiteit Leuven, Belgium

  • Venue:
  • KDID'05 Proceedings of the 4th international conference on Knowledge Discovery in Inductive Databases
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

The two most commonly addressed data mining tasks are predictive modelling and clustering. Here we address the task of predictive clustering, which contains elements of both and generalizes them to some extent. Predictive clustering has been mainly evaluated in the context of trees. In this paper, we extend predictive clustering toward rules. Each cluster is described by a rule and different clusters are allowed to overlap since the sets of examples covered by different rules do not need to be disjoint. We propose a system for learning these predictive clustering rules, which is based on a heuristic sequential covering algorithm. The heuristic takes into account both the precision of the rules (compactness w.r.t. the target space) and the compactness w.r.t. the input space, and the two can be traded-off by means of a parameter. We evaluate our system in the context of several multi-objective classification problems.