Maximum Split Clustering Under Connectivity Constraints
Maximum Split Clustering Under Connectivity Constraints
复制标题
连接性约束下的最大分裂聚类
DOI：
10.1007/s00357-003-0012-6
复制
发表时间：
2003
期刊：
影响因子：
--
通讯作者：
J. Gower
中科院分区：
文献类型：
--
作者：
M. Rooij;J. Gower
研究了定义为三点间欧氏距离a1、a2、a3的函数的三元距离t。特别注意的是，当a3保持恒定时，所有点的轮廓给出相同的t值。这些等值线允许一些一般性的意见，作出适当的，或不，为实际调查的某些定义的三元距离。我们特别感兴趣的三元距离的定义，指定为规范，具有最佳性能。附录给出了我们发现有用的一些结果。
Triadic distances t defined as functions of the Euclidean (dyadic) distances a1, a2, a3 between three points are studied. Special attention is paid to the contours of all points giving the same value of t when a3 is kept constant. These isocontours allow some general comments to be made about the suitability, or not, for practical investigations of certain definitions of triadic distance. We are especially interested in those definitions of triadic distance, designated as canonical, that have optimal properties. An appendix gives some results we have found useful.