NEW APPROACH TO COMPUTATION OF JARDINE-SIBSON BK-CLUSTERS

被引:11
作者
ROHLF, FJ [1 ]
机构
[1] SUNY, DEPT ECOL & EVOL, STONY BROOK, NY 11794 USA
关键词
D O I
10.1093/comjnl/18.2.164
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:164 / 168
页数:5
相关论文
共 12 条
[1]  
Busacker R.G., 1965, FINITE GRAPHS NETWOR
[2]   AN IMPROVED ALGORITHM FOR JARDINE-SIBSON METHOD OF GENERATING OVERLAPPING CLUSTERS [J].
COLE, AJ ;
WISHART, D .
COMPUTER JOURNAL, 1970, 13 (02) :156-&
[3]  
FISHER L, 1971, BIOMETRIKA, V58, P91, DOI 10.2307/2334320
[4]  
GOWER JC, 1969, APPL STATIST, V18, P54, DOI DOI 10.2307/2346439
[5]  
JARDINE N, 1968, Mathematical Biosciences, V2, P465, DOI 10.1016/0025-5564(68)90030-8
[6]   CONSTRUCTION OF HIERARCHIC AND NON-HIERARCHIC CLASSIFICATIONS [J].
JARDINE, N ;
SIBSON, R .
COMPUTER JOURNAL, 1968, 11 (02) :177-&
[7]  
Jardine N, 1971, MATHEMATICAL TAXONOM
[8]  
Kruskal J.B., 1956, P AM MATH SOC, V7, P3, DOI [10.2307/2033241, DOI 10.1090/S0002-9939-1956-0078686-7, 10.1090/S0002-9939-1956-0078686-7]
[9]   SHORTEST CONNECTION NETWORKS AND SOME GENERALIZATIONS [J].
PRIM, RC .
BELL SYSTEM TECHNICAL JOURNAL, 1957, 36 (06) :1389-1401
[10]  
ROHLF FJ, 1973, COMPUT J, V16, P93