A Novel Algorithm Using N-link Average for Hierarchical Automatic Clustering
碩士 === 中原大學 === 資訊管理研究所 === 98 === This study proposed a novel method of using N-link average for hierarchical automatic clustering, which has the ability to explore arbitrary shapes and can improve the accuracy of clustering to avoid chaining effect efficiently. Comparing with relevant literature,...
Main Authors: | Jia-Hsien Chang, 張加憲 |
---|---|
Other Authors: | Wei-Ping Lee |
Format: | Others |
Language: | zh-TW |
Published: |
2010
|
Online Access: | http://ndltd.ncl.edu.tw/handle/19050667026272691022 |
Similar Items
-
Automatic Link-Chain Clustering Algorithm
by: Kang-Hsiung Tai, et al.
Published: (2008) -
Average Linkage Hierarchical Clustering Algorithm for Determining the Relationships between Elements in Coal
by: Na Xu, et al.
Published: (2021-02-01) -
A Novel Hierarchical Clustering Algorithm Using the Micro-Cluster Strategy
by: Chun-Chieh Su, et al.
Published: (2012) -
A Novel Divisive Hierarchical Clustering Algorithm for Geospatial Analysis
by: Shaoning Li, et al.
Published: (2017-01-01) -
Automatic Labeling of Hierarchical Document Clusters
by: LIN, CHIA-YI, et al.
Published: (2008)