摘要
In this paper, we propose a hierarchical approach to ART-like clustering algorithm which is able to deal with data consisting of arbitrarily geometrical-shaped clusters. Combining hierarchical and ART-like clustering is suggested as a natural feasible solution to the two problems of determining the number of clusters and clustering data. A 2-d artificial data set is tested to demonstrate the performance of the proposed algorithm.
原文 | ???core.languages.en_GB??? |
---|---|
頁面 | 788-793 |
頁數 | 6 |
出版狀態 | 已出版 - 2002 |
事件 | 2002 International Joint Conference on Neural Networks (IJCNN '02) - Honolulu, HI, United States 持續時間: 12 5月 2002 → 17 5月 2002 |
???event.eventtypes.event.conference???
???event.eventtypes.event.conference??? | 2002 International Joint Conference on Neural Networks (IJCNN '02) |
---|---|
國家/地區 | United States |
城市 | Honolulu, HI |
期間 | 12/05/02 → 17/05/02 |