CHARACTERIZATIONS OF NEAREST AND FARTHEST NEIGHBOR ALGORITHMS BY CLUSTERING ADMISSIBILITY CONDITIONS
作者：
Highlights：
•
摘要
Monotone admissibility for clustering algorithms was introduced in Fisher and Van Ness [Biometrika 58, 91–104 (1971)]. The present paper discusses monotone admissibility for a broad class of clustering algorithms called the Lance and Williams algorithms. Necessary and sufficient conditions for Lance and Williams algorithms to be monotone admissible are discussed here. It is shown that the only such algorithms which are monotone admissible are nearest neighbor and farthest neighbor.
论文关键词：Clustering,Clustering admissibility,Monotone clustering admissibility Nearest-neighbor clustering,Farthest-neighbor clustering,Lance and Williams algorithms
论文评审过程：Received 15 March 1996, Revised 24 December 1997, Available online 7 June 2001.
论文官网地址：https://doi.org/10.1016/S0031-3203(98)00002-8
