Title: Learning predictive clustering rules
Authors: Ženko, Bernard ×
Džeroski, Sašo
Struyf, Jan #
Issue Date: 2006
Publisher: Springer
Series Title: Lecture Notes in Computer Science vol:3933 pages:234-250
Conference: 4th International Workshop on Knowledge Discovery in Inductive Databases location:Porto, Portugal date:October 3, 2005
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.
ISBN: 978-3-540-33292-3
ISSN: 0302-9743
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Informatics Section
× corresponding author
# (joint) last author

Files in This Item:
File Status SizeFormat
42128.pdf Published 140KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science