Hierarchical clustering schemes
Clicks: 311
ID: 116269
1970
Article Quality & Performance Metrics
Overall Quality
Improving Quality
0.0
/100
Combines engagement data with AI-assessed academic quality
Reader Engagement
Star Article
72.5
/100
302 views
246 readers
Trending
AI Quality Assessment
Not analyzed
Abstract
Techniques for partitioning objects into optimally homogeneous groups on the basis of empirical measures of similarity among those objects have received increasing attention in several different fields. This paper develops a useful correspondence between any hierarchical system of such clusters, and a particular type of distance measure. The correspondence gives rise to two methods of clustering that are computationally rapid and invariant under monotonic transformations of the data. In an explicitly defined sense, one method forms clusters that are optimally “connected,” while the other forms clusters that are optimally “compact.”
| Reference Key |
johnson1970psychometrikahierarchical
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | Stephen C. Johnson;Stephen C. Johnson; |
| Journal | psychometrika |
| Year | 1970 |
| DOI |
doi:10.1007/BF02289588
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.