Classification tree generation constrained with variable weights

  • Authors:
  • Pedro Barahona;Gemma Bel-Enguix;Veronica Dahl;M. Dolores Jiménez-López;Ludwig Krippahl

  • Affiliations:
  • Departamento de Informática, Universidade Nova de Lisboa;Research Group on Mathematical Linguistics, Universitat Rovira i Virgili;Research Group on Mathematical Linguistics, Universitat Rovira i Virgili and Department of Computer Science, Simon Fraser University;Research Group on Mathematical Linguistics, Universitat Rovira i Virgili;Departamento de Informática, Universidade Nova de Lisboa

  • Venue:
  • IWINAC'11 Proceedings of the 4th international conference on Interplay between natural and artificial computation - Volume Part I
  • Year:
  • 2011

Quantified Score

Hi-index 0.01

Visualization

Abstract

Trees are a useful framework for classifying entities whose attributes are, at least partially, related through a common ancestry, such as species of organisms, family members or languages. In some common applications, such as phylogenetic trees based on DNA sequences, relatedness can be inferred from the statistical analysis of unweighted attributes. In this paper we present a Constraint Programming approach that can enforce consistency between bounds on the relative weight of each trait and tree topologies, so that the user can best determine which sets of traits to use and how the entities are likely to be related.