论文信息 - Representation and Evaluation of Partitions

Representation and Evaluation of Partitions

Many methods lead to build a partition of a finite set, given a metric. In this text we propose some criteria to evaluate the quality of each class and other parameters to compare several partitions on the same data set. Then, we indicate how to represent graphically a partition as a tree of boxes, each one containing information about the quality of a class.

Alain Guénoche | Henri Garreta | A. Guénoche | H. Garreta

[1] Teuvo Kohonen,et al. Self-organized formation of topologically correct feature maps , 2004, Biological Cybernetics.

[2] B. Jaumard,et al. Cluster Analysis and Mathematical Programming , 2003 .

[3] Cristian S. Calude,et al. Discrete Mathematics and Theoretical Computer Science , 2003, Lecture Notes in Computer Science.

[4] M. Gouy,et al. WWW-query: an on-line retrieval system for biological sequence banks. , 1996, Biochimie.

[5] T. Kohonen. Self-organized formation of topographically correct feature maps , 1982 .

[6] G. De Soete,et al. Clustering and Classification , 2019, Data-Driven Science and Engineering.

[7] Kathleen Marchal,et al. INCLUSive: INtegrated Clustering, Upstream sequence retrieval and motif Sampling , 2002, Bioinform..

[8] Pierre Hansen,et al. How to Choose K Entities Among N , 1994, Partitioning Data Sets.

[9] Phipps Arabie,et al. AN OVERVIEW OF COMBINATORIAL DATA ANALYSIS , 1996 .

[10] Bernhard Korte,et al. Optimization and Operations Research , 1976 .

[11] L. Hubert. SPANNING TREES AND ASPECTS OF CLUSTERING , 1974 .