التفاصيل البيبلوغرافية
| العنوان: |
Computational method for the point cluster analysis on networks. |
| المؤلفون: |
Sugihara, Kokichi, Okabe, Atsuyuki, Satoh, Toshiaki |
| المصدر: |
GeoInformatica; Mar2011, Vol. 15 Issue 1, p167-189, 23p, 6 Diagrams, 1 Chart |
| مصطلحات موضوعية: |
CLUSTER analysis (Statistics), ALGORITHMS, DISTANCES, MEDIAN (Mathematics), RADIUS (Geometry), ARITHMETIC mean, MATHEMATICAL analysis |
| مستخلص: |
We present a general framework of hierarchical methods for point cluster analysis on networks, and then consider individual clustering procedures and their time complexities defined by typical variants of distances between clusters. The distances considered here are the closest-pair distance, the farthest-pair distance, the average distance, the median-pair distance and the radius distance. This paper will offer a menu for users to choose hierarchical clustering algorithms on networks from a time complexity point of view. [ABSTRACT FROM AUTHOR] |
|
Copyright of GeoInformatica is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| قاعدة البيانات: |
Complementary Index |
