On Identifying Tree-Structured Perfect Maps
- 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
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.
Unable to display preview. Download preview PDF.