EXPECTED-TIME COMPLEXITY RESULTS FOR HIERARCHIC CLUSTERING ALGORITHMS WHICH USE CLUSTER CENTERS

被引：11

作者：

MURTAGH, F

机构：

来源：

关键词：

D O I：

10.1016/0020-0190(83)90095-9

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：237 / 241

页数：5

共 12 条

[1]

BENTLEY JL, 1978, IEEE T COMPUT, V27, P97, DOI 10.1109/TC.1978.1675043

[2] OPTIMAL EXPECTED-TIME ALGORITHMS FOR CLOSEST POINT PROBLEMS [J].

BENTLEY, JL ;

WEIDE, BW ;

YAO, AC .

ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1980, 6 (04) :563-580

[3]

Benzecri J.P., 1982, CAHIERS LANALYSE DON, V7, P209

[4]

BENZECRI JP, 1982, CAHIER ANAL DONNEES, V7, P185

[5] REFLEXIVE NEAREST NEIGHBORS [J].

COX, TF .

[6]

DELANNOY C, 1980, RAIRO-INF-COMPUT SCI, V14, P275

[7]

DERHAM C, 1980, CAHIERS ANAL DONNEES, V5, P135

[8]

Dubes R., 1980, ADV COMPUT

[9]

JAMBU M, 1983, CLUSTER ANAL DATA AN

[10]

Jambu M, 1978, CLASSIFICATION AUTOM, V1