Hierarchical clustering schemes
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.”
Keywords
Access
Citation
ID:
116269
Ref Key:
johnson1970psychometrikahierarchical
Use this key to autocite in
SciMatic or
Thesis Manager
References
Blockchain Verification
Account:
NFT Contract Address:
0x95644003c57E6F55A65596E3D9Eac6813e3566dA
Article ID:
116269
Unique Identifier:
doi:10.1007/BF02289588
Network:
Scimatic Chain (ID: 481)
Loading...
Blockchain Readiness Checklist
Authors
Abstract
Journal Name
Year
Title
Creates 1,000,000 NFT tokens for this article
Token Features:
- ERC-1155 Standard NFT
- 1 Million Supply per Article
- Transferable via MetaMask
- Permanent Blockchain Record
Scan with Saymatik Web3.0 Wallet