| dc.contributor | 統計系 | - |
| dc.creator (作者) | 洪英超 | - |
| dc.creator (作者) | Hung, Y.C. | - |
| dc.creator (作者) | Li, Y.F. | - |
| dc.creator (作者) | Lu, L.H. | - |
| dc.date (日期) | 2018-11 | - |
| dc.date.accessioned | 28-May-2020 11:33:20 (UTC+8) | - |
| dc.date.available | 28-May-2020 11:33:20 (UTC+8) | - |
| dc.date.issued (上傳時間) | 28-May-2020 11:33:20 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/130051 | - |
| dc.description.abstract (摘要) | 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. | - |
| dc.format.extent | 2799488 bytes | - |
| dc.format.mimetype | application/pdf | - |
| dc.relation (關聯) | Advances in Intelligent Systems and Computing, Springer, pp.442-454 | - |
| dc.subject (關鍵詞) | Clustering ; Graph theory ; Time complexity | - |
| dc.title (題名) | A New Clustering Algorithm Based on Graph Connectivity | - |
| dc.type (資料類型) | book | - |
| dc.identifier.doi (DOI) | 10.1007/978-3-030-01174-1_33 | - |
| dc.doi.uri (DOI) | https://doi.org/10.1007/978-3-030-01174-1_33 | - |
