AN ALGORITHM FOR MULTIDIMENSIONAL DATA CLUSTERING

被引:64
作者
WAN, SJ [1 ]
WONG, SKM [1 ]
PRUSINKIEWICZ, P [1 ]
机构
[1] UNIV REGINA,DEPT COMP SCI,REGINA S4S 0A2,SASKATCHEWAN,CANADA
来源
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE | 1988年 / 14卷 / 02期
关键词
D O I
10.1145/45054.45056
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
引用
收藏
页码:153 / 162
页数:10
相关论文
共 13 条
[1]   MULTIDIMENSIONAL DIVIDE-AND-CONQUER [J].
BENTLEY, JL .
COMMUNICATIONS OF THE ACM, 1980, 23 (04) :214-229
[2]  
Duda R. O., 1973, PATTERN CLASSIFICATI
[3]  
Friedman J. H., 1977, ACM Transactions on Mathematical Software, V3, P209, DOI 10.1145/355744.355745
[4]  
Hall E., 1979, COMPUTER IMAGE PROCE
[5]  
Hartigan JA., 1975, CLUSTERING ALGORITHM
[6]  
Heckert P., 1982, ACM COMPUTER GRAPHIC, V16, P297
[7]  
Hyafil L., 1976, Information Processing Letters, V5, P15, DOI 10.1016/0020-0190(76)90095-8
[8]  
MacQueen J., 1967, 5 BERKELEY S MATH ST, V1, P281
[9]   K-MEANS-TYPE ALGORITHMS - A GENERALIZED CONVERGENCE THEOREM AND CHARACTERIZATION OF LOCAL OPTIMALITY [J].
SELIM, SZ ;
ISMAIL, MA .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1984, 6 (01) :81-87
[10]  
WAN SJ, UNPUB VARIANCE BASED