✦ LIBER ✦

CHSMST: a clustering algorithm based on hyper surface and minimum spanning tree

✍ Scribed by Qing He; Weizhong Zhao; Zhongzhi Shi

Publisher: Springer
Year: 2010
Tongue: English
Weight: 333 KB
Volume: 15
Category: Article
ISSN: 1432-7643
DOI: 10.1007/s00500-010-0585-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Topology aggregation and decoding algori

Topology aggregation and decoding algorithms based on a minimum spanning tree in asymmetric multi-domain optical networks

✍ Jianping Wang; Chaoping Pan; Huai Zhang; Qiwu Wu; Xianwei Zhou 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 477 KB

A clustering procedure based on the comp

A clustering procedure based on the comparison between the k nearest neighbors graph and the minimal spanning tree

✍ José Marı́a González-Barrios; Adolfo J. Quiroz 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 250 KB

We present a procedure for the identiÿcation of clusters in multivariate data sets, based on the comparison between the k nearest neighbors graph, G k , and the minimal spanning tree, MST. Our key statistic is the random quantity k := the smallest k such that G k contains the MST. Under regularity a