On Identifying Tree-Structured Perfect Maps

  • Christian Borgelt
Conference paper

DOI: 10.1007/978-3-540-39451-8_28

Volume 2821 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Borgelt C. (2003) On Identifying Tree-Structured Perfect Maps. In: Günter A., Kruse R., Neumann B. (eds) KI 2003: Advances in Artificial Intelligence. KI 2003. Lecture Notes in Computer Science, vol 2821. Springer, Berlin, Heidelberg

Abstract

It is well known that tree-structured perfect maps can be uniquely identified by computing a maximum weight spanning tree with mutual information providing the edge weights. In this paper I generalize the edge evaluation measure by stating the conditions such a measure has to satisfy in order to be able to identify tree-structured perfect maps. In addition, I show that not only mutual information, but also the well-known χ2 measure satisfies these conditions.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Christian Borgelt
    • 1
  1. 1.Dept. of Knowledge Processing and Language EngineeringSchool of Computer Science, Otto-von-Guericke-University of MagdeburgMagdeburgGermany