Erratum to: Exemplar-Based Clustering via Simulated Annealing (Psychometrika, (2009), 74, 457-475, DOI 10.1007/s11336-009-9115-2);Exemplar-based clustering via simulated annealing

Psychometrika

Volumn 74, Issue 3, 2009, Pages 457-475

  Brusco, Michael J ^a   Köhn, Hans Friedrich ^b  

^a FLORIDA STATE UNIVERSITY   (United States)

^b UNIVERSITY OF MISSOURI   (United States)

Author keywords

Cluster analysis; Heuristics; P median model; Partitioning; Simulated annealing

Indexed keywords

EID: 70350191760     PISSN: 00333123     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11336-009-9140-1     Document Type: Erratum

References (61)

1. Aarts, E., & Korst, J. (1989). Simulated annealing and Boltzmann machines: A stochastic approach to combinatorial optimization and neural computing. New York: Wiley.
2. Alba, E., & Dominguez, E. (2006). Comparative analysis of modern optimization tools for the p-median problem. Statistics and Computing, 16, 251-260.
3. Alp, O., Erkut, E., & Drezner, Z. (2003). An efficient genetic algorithm for the p-median problem. Annals of Operations Research, 122, 21-42.
4. Avella, P., Sassano, A., & Vasil'ev, I. (2007). Computational study of large-scale p-median problems. Mathematical Programming A, 109, 89-114.
5. Beasley, J.E. (1990). OR-Library: Distributing test problems by electronic mail. Journal of the Operational Research Society, 41, 1069-1072.
6. Beltran, C., Tadonki, C., & Vial, J. (2006). Solving the p-median problem with a semi-Lagrangian relaxation. Computational Optimization and Applications, June 5, 2006, doi:10.1007/s10589-006-6513-6.
7. Brusco, M.J., Cradit, J.D., & Tashchian, A. (2003). Multicriterion clusterwise regression for joint segmentation settings: An application to customer value. Journal of Marketing Research, 40, 225-234.
8. Brusco, M.J., & Köhn, H.-F. (2008a). Comment on 'Clustering by passing messages between data points'. Science, 319, 726.
9. Brusco, M.J., & Köhn, H.-F. (2008b). Optimal partitioning of a data set based on the p-median model. Psychometrika, 73, 89-105.
10. Brusco, M.J., Köhn, H.-F., & Stahl, S. (2008). Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis. Psychometrika, 73, 503-522.
11. Brusco, M.J., & Steinley, D. (2007). A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning. Psychometrika, 72, 583-600.
12. Ceulemans, E., & van Mechelen, I. (2008). CLASSI: A classification model for the study of sequential processes and individual differences therein. Psychometrika, 73, 107-124.
13. Ceulemans, E., van Mechelen, I., & Leenen, I. (2007). The local minima problem in hierarchical classes analysis: An evaluation of a simulated annealing algorithm and various multistart procedures. Psychometrika, 72, 377-391.
14. Chiyoshi, F., & Galvão, R.D. (2000). A statistical analysis of simulated annealing applied to the p-median problem. Annals of Operations Research, 96, 61-74.
15. Christofides, N., & Beasley, J.E. (1982). A tree search algorithm for the p-median problem. European Journal of Operational Research, 10, 196-204.
16. Cornuejols, G., Fisher, M.L., & Nemhauser, G.L. (1977). Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms. Management Science, 23, 789-810.
17. Du Merle, O., & Vial, J.-P. (2002). Proximal-ACCPM, a cutting plane method for column generation and Lagrangian relaxation: application to the p-median problem (Technical report 2002.23). HEC Genève, University of Genève.
18. Forgy, E.W. (1965). Cluster analyses of multivariate data: Efficiency versus interpretability of classifications. Biometrics, 21, 768.
19. Frey, B., & Dueck, D. (2007). Clustering by passing messages between data points. Science, 315, 972-976.
20. Frey, B., & Dueck, D. (2008). Response to comment on "Clustering by passing messages between data points". Science, 319, 726.
21. Galvão, R.D. (1980). A dual-bounded algorithm for the p-median problem. Operations Research, 28, 1112-1121.
22. Hanjoul, P., & Peeters, D. (1985). A comparison of two dual-based procedures for solving the p-median problem. European Journal of Operational Research, 20, 387-396.
23. Hansen, P., & Mladenović, N. (1997). Variable neighborhood search for the p-median. Location Science, 5, 207-226.
24. Hansen, P., & Mladenović, N. (2008). Complement to a comparative analysis of heuristics for the p-median problem. Statistics and Computing, 18, 41-46.
25. Hansen, P., Mladenović, N., & Perez-Brito, D. (2001). Variable neighborhood decomposition search. Journal of Heuristics, 7, 335-350.
26. Hartigan, J.A., & Wong, M.A. (1979). Algorithm AS136: A k-means clustering program. Applied Statistics, 28, 100-128.
27. Howard, R.N. (1966). Classifying a population into homogeneous groups. In J.R. Lawrence (Ed.), Operational research and social sciences (pp. 585-594). London: Tavistock.
28. Hubert, L., & Arabie, P. (1985). Comparing partitions. Journal of Classification, 2, 193-218.
29. Kaufman, L., & Rousseeuw, P.J. (1990). Finding groups in data: an introduction to cluster analysis. New York: Wiley.
30. Kirkpatrick, S., Gelatt, C.D., & Vecchi, M.P. (1983). Optimization by simulated annealing. Science, 220, 671-680.
31. Klastorin, T. (1985). The p-median problem for cluster analysis: A comparative test using the mixture model approach. Management Science, 31, 84-95.
32. Kuehn, A.A., & Hamburger, M.J. (1963). A heuristic program for locating warehouses. Management Science, 9, 643-666.
33. Levanova, T., & Loresh, M.A. (2004). Algorithms of ant system and simulated annealing for the p-median problem. Automation and Remote Control, 65, 431-438.
34. Lin, S., & Kernighan, B.W. (1973). An effective heuristic algorithm for the traveling salesman problem. Operations Research, 21, 498-516.
35. MacQueen, J.B. (1967). Some methods for classification and analysis of multivariate observations. In L.M. Le Cam & J. Neyman (Eds.), Proceedings of the fifth Berkeley symposium on mathematical statistics and probability (Vol. 1, pp. 281-297). Berkeley: University of California Press.
36. Maranzana, F.E. (1964). On the location of supply points to minimize transportation costs. Operational Research Quarterly, 15, 261-270.
37. Mladenović, N., Brimberg, J., Hansen, P., & Moreno-Pérez, J.A. (2007). The p-median problem: A survey of metaheuristic approaches. European Journal of Operational Research, 179, 927-939.
38. Moreno-Pérez, J.A., García-Roda, J.L., & Moreno-Vega, J.M. (1994). A parallel genetic algorithm for the discrete p-median problem. Studies in Location Analysis, 7, 131-141.
39. Mulvey, J.M., & Crowder, H.P. (1979). Cluster analysis: An application of Lagrangian relaxation. Management Science, 25, 329-340.
40. 2 unidimensional scaling. Journal of Classification, 22, 119-138.
41. Murray, A.T., & Church, R.L. (1996). Applying simulated annealing to location-planning models. Journal of Heuristics, 2, 31-53.
42. Narula, S.C., Ogbu, U.I., & Samuelsson, H.M. (1977). An algorithm for the p-median problem. Operations Research, 25, 709-713.
43. Rao, M.R. (1971). Cluster analysis and mathematical programming. Journal of the American Statistical Association, 66, 622-626.
44. Reinelt, G. (2001). TSPLIB. http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95.
45. Resende, M.G.C., & Werneck, R.F. (2003). On the implementation of a swap-based local-search procedure for the p-median problem. In R.E. Ladner (Ed.), Proceedings of the fifth workshop on algorithm engineering and experiments (pp. 119-127). Philadelphia: SIAM.
46. Resende, M.G.C., & Werneck, R.F. (2004). A hybrid heuristic for the p-median problem. Journal of Heuristics, 10, 59-88.
47. ReVelle, C.S., & Swain, R. (1970). Central facilities location. Geographical Analysis, 2, 30-42.
48. Rolland, E., Schilling, D.A., & Current, J.R. (1996). A efficient tabu search procedure for the p-median problem. European Journal of Operational Research, 96, 329-342.
49. Rosing, K.E. (1997). An empirical investigation of the effectiveness of a vertex substitution heuristic. Environment and Planning B, 24, 59-67.
50. Rosing, K.E., & ReVelle, C.S. (1997). Heuristic concentration: Two stage solution construction. European Journal of Operational Research, 97, 75-86.
51. Rosing, K.E., ReVelle, C.S., Rolland, E., Schilling, D.A., & Current, J.R. (1998). Heuristic concentration and tabu search: A head to head comparison. European Journal of Operational Research, 104, 93-99.
52. Steinhaus, H. (1956). Sur la division des corps matériels en parties. Bulletin de l'Académie Polonaise des Sciences, Classe III Mathématique, Astronomie, Physique, Chimie, Géologie, et Géographie, IV(12), 801-804.
53. Steinley, D. (2004). Properties of the Hubert-Arabie adjusted Rand index. Psychological Methods, 9, 386-396.
54. Steinley, D. (2006). K-means clustering: A half-century synthesis. British Journal of Mathematical and Statistical Psychology, 59, 1-34.
55. Taillard, E.D. (2003). Heuristic methods for large centroid clustering problems. Journal of Heuristics, 9, 51-74.
56. Teitz, M.B., & Bart, P. (1968). Heuristic methods for estimating the generalized vertex median of a weighted graph. Operations Research, 16, 955-961.
57. Thorndike, R.L. (1953). Who belongs in the family? Psychometrika, 18, 267-276.
58. van Laarhoven, P.J.M., & Aarts, E.H.L. (1987). Simulated annealing: Theory and applications. Dordrecht: Kluwer.
59. Vera, J.-F., Heiser, W.J., & Murillo, A. (2007). Global optimization in any Minkowski Metric: A permutation-translation simulated annealing algorithm for multidimensional scaling. Journal of Classification, 24, 277-301.
60. Vinod, H. (1969). Integer programming and the theory of grouping. Journal of the American Statistical Association, 64, 506-517.
61. Whitaker, R. (1983). A fast algorithm for the greedy interchange of large-scale clustering and median location problems. INFOR, 21, 95-108.