论文信息 - Minimum spanning tree: ordering edges to identify clustering structure

Minimum spanning tree: ordering edges to identify clustering structure

Abstract Ordering edges to identify clustering structure (OETICS), the clustering algorithm presented here, is based on the minimum spanning tree connecting the objects. The edges of the tree are ordered, beginning from the longest edge, to form groups of objects separated by large edges. The plot of ordered edges is the main result of the algorithm. In some aspects OETICS is similar to OPTICS, a known clustering technique that orders the objects with reference to the local density, but the solution is unique, because it does not select the value of some parameters, as the generating distance in OPTICS. OETICS is applied to many simulated and real data sets, with very different number of objects and variables, and the results are compared with those obtained by OPTICS.

[1] Desire L. Massart,et al. Reference data sets for chemometrical methods testing , 1993 .

[2] J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[3] Ali S. Hadi,et al. Finding Groups in Data: An Introduction to Chster Analysis , 1991 .

[4] Johann Gasteiger,et al. Classification of multicomponent analytical data of olive oils using different neural networks , 1994 .

[5] R. Prim. Shortest connection networks and some generalizations , 1957 .

[6] M. Forina,et al. New index for clustering tendency , 2001 .

[7] Peter J. Rousseeuw,et al. Finding Groups in Data: An Introduction to Cluster Analysis , 1990 .

[8] Hans-Peter Kriegel,et al. OPTICS: ordering points to identify the clustering structure , 1999, SIGMOD '99.

[9] O. Mangasarian,et al. Multisurface method of pattern separation for medical diagnosis applied to breast cytology. , 1990, Proceedings of the National Academy of Sciences of the United States of America.