Soft Margin Trees

  • Authors:
  • Jorge Díez;Juan José Coz;Antonio Bahamonde;Oscar Luaces

  • Affiliations:
  • Artificial Intelligence Center, University of Oviedo at Gijón, Asturias, Spain;Artificial Intelligence Center, University of Oviedo at Gijón, Asturias, Spain;Artificial Intelligence Center, University of Oviedo at Gijón, Asturias, Spain;Artificial Intelligence Center, University of Oviedo at Gijón, Asturias, Spain

  • Venue:
  • ECML PKDD '09 Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part I
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

From a multi-class learning task, in addition to a classifier, it is possible to infer some useful knowledge about the relationship between the classes involved. In this paper we propose a method to learn a hierarchical clustering of the set of classes. The usefulness of such clusterings has been exploited in bio-medical applications to find out relations between diseases or populations of animals. The method proposed here defines a distance between classes based on the margin maximization principle, and then builds the hierarchy using a linkage procedure. Moreover, to quantify the goodness of the hierarchies we define a measure. Finally, we present a set of experiments comparing the scores achieved by our approach with other methods.