Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/130051
題名: | A New Clustering Algorithm Based on Graph Connectivity | 作者: | 洪英超 Hung, Y.C. Li, Y.F. Lu, L.H. |
貢獻者: | 統計系 | 關鍵詞: | Clustering ; Graph theory ; Time complexity | 日期: | Nov-2018 | 上傳時間: | 28-May-2020 | 摘要: | A new clustering algorithm based on the concept of graph connectivity is introduced. The idea is to develop a meaningful graph representation for data, where each resulting sub-graph corresponds to a cluster with highly similar objects connected by edge. The proposed algorithm has a fairly strong theoretical basis that supports its originality and computational efficiency. Further, some useful guidelines are provided so that the algorithm can be tuned to optimize the well-designed quality indices. Numerical evidences show that the proposed algorithm can provide a very good clustering accuracy for a number of benchmark data and has a relatively low computational complexity compared to some sophisticated clustering methods. | 關聯: | Advances in Intelligent Systems and Computing, Springer, pp.442-454 | 資料類型: | book | DOI: | https://doi.org/10.1007/978-3-030-01174-1_33 |
Appears in Collections: | 專書/專書篇章 |
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.