Comment on "clustering by passing messages between data points"

被引：37

作者：

Brusco, Michael J. ^{[1
]}

Koehn, Hans-Friedrich ^{[2
]}

机构：

[1] Florida State Univ, Coll Business, Tallahassee, FL 32306 USA

[2] Univ Missouri, Dept Psychol Sci, Columbia, MO 65211 USA

来源：

SCIENCE | 2008年 / 319卷 / 5864期

关键词：

D O I：

10.1126/science.1150938

中图分类号：

O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];

学科分类号：

07 ; 0710 ; 09 ;

摘要：

引用

页数：2

共 11 条

[1]

[Anonymous], 1975, CLUSTERING ALGORITHM

[2] LOCATION OF BANK ACCOUNTS TO OPTIMIZE FLOAT - ANALYTIC STUDY OF EXACT AND APPROXIMATE ALGORITHMS [J].

CORNUEJOLS, G ;

FISHER, ML ;

NEMHAUSER, GL .

MANAGEMENT SCIENCE, 1977, 23 (08) :789-810

[3] The use of multiple measurements in taxonomic problems [J].

Fisher, RA .

ANNALS OF EUGENICS, 1936, 7 :179-188

[4] Clustering by passing messages between data points [J].

Frey, Brendan J. ;

Dueck, Delbert .

SCIENCE, 2007, 315 (5814) :972-976

[5] SOLUTION OF LARGE-SCALE SYMMETRICAL TRAVELING SALESMAN PROBLEMS [J].

GROTSCHEL, M ;

HOLLAND, O .

MATHEMATICAL PROGRAMMING, 1991, 51 (02) :141-202

[6] A COMPARISON OF 2 DUAL-BASED PROCEDURES FOR SOLVING THE P-MEDIAN PROBLEM [J].

HANJOUL, P ;

PEETERS, D .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1985, 20 (03) :387-396

[7]

Hansen P., 1997, Location Science, V5, P207, DOI 10.1016/S0966-8349(98)00030-8

[8] EFFECTIVE HEURISTIC ALGORITHM FOR TRAVELING-SALESMAN PROBLEM [J].

LIN, S ;

KERNIGHAN, BW .

OPERATIONS RESEARCH, 1973, 21 (02) :498-516

[9] The p-median problem:: A survey of metaheuristic approaches [J].

Mladenovic, Nenad ;

Brimberg, Jack ;

Hansen, Pierre ;

Moreno-Perez, Jose A. .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 179 (03) :927-939

[10] An efficient tabu search procedure for the p-Median Problem [J].

Rolland, E ;

Schilling, DA ;

Current, JR .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 96 (02) :329-342

← 1 2 →