The p-Median Model as a Tool for Clustering Psychological Data

Psychological Methods

Volumn 15, Issue 1, 2010, Pages 87-95

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

^a UNIVERSITY OF MISSOURI   (United States)

^b FLORIDA STATE UNIVERSITY   (United States)

Author keywords

cluster analysis; combinatorial data analysis; heuristics; Lagrangian relaxation; p median problem

Indexed keywords

EID: 77949646469     PISSN: 1082989X     EISSN: None     Source Type: Journal    
DOI: 10.1037/a0018535     Document Type: Article

References (59)

1. Agmon S. The relaxation method for linear inequalities. Canadian Journal of Mathematics 6 (1954) 382-392
2. Alba E., and Domínguez E. Comparative analysis of modern optimization tools for the p-median problem. Statistics and Computing 16 (2006) 251-260
3. Arabie P., and Hubert L.J. An overview of combinatorial data analysis. In: Arabie P., Hubert L.J., and de Soete G. (Eds). Clustering and classification (1996), World Scientific, River Edge, NJ 5-63
4. Avella P., Sassano A., and Vasil'ev I. Computational study of large-scale p-median problems. Mathematical Programming A 109 (2007) 89-114
5. Beltran C., Tadonki C., and Vial J.-P. Solving the p-median problem with a semi-Lagrangian relaxation. Computational Optimization and Applications 35 (2006) 239-260
6. Bock H.H. Clustering methods: A history of K-means algorithms. In: Brito P., Bertrand P., Cucumel G., and De Carvalho F. (Eds). Selected contributions in data analysis and classification (2007), Springer, Berlin, Germany 161-172
7. Brusco M.J., and Cradit J.D. Bicriterion methods for partitioning dissimilarity matrices. British Journal of Mathematical and Statistical Psychology 58 (2005) 319-332
8. Brusco M.J., and Köhn H.-F. Comment on "Clustering by passing messages between data points.". Science 319 (2008) 726c
9. Brusco M.J., and Köhn H.-F. Optimal partitioning of a data set based on the p-median model. Psychometrika 73 (2008) 89-105
10. Brusco M.J., and Köhn H.-F. Exemplar-based clustering via simulated annealing. Psychometrika 74 (2009) 457-475
11. Brusco M.J., and Stahl S. Branch-and-bound applications in combinatorial data analysis (2005), Springer, New York
12. Brusco M.J., and Steinley D. Clustering, seriation, and subset extraction of confusion data. Psychological Methods 11 (2006) 271-286
13. Chiyoshi F., and Galvão D. A statistical analysis of simulated annealing applied to the p-median problem. Annals of Operations Research 96 (2000) 61-74
14. Christofides N., and Beasley J.E. A tree search algorithm for the p-median problem. European Journal of Operational Research 10 (1982) 196-204
15. Cornuejols G., Fisher M.L., and Nemhauser G.L. Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms. Management Science 23 (1977) 789-810
16. Du Merle O., and Vial J.-P. Proximal-ACCPM, a cutting plane method for column generation and Lagrangian relaxation: Application to the p-median problem (Technical Report 2002.23) (2002), University of Geneva, Geneva, Switzerland
17. Fisher M.L. The Lagrangian relaxation method for solving integer programming problems. Management Science 27 (1981) 1-18
18. Forgy E.W. Cluster analyses of multivariate data: Efficiency versus interpretability of classifications. Biometrika 61 (1965) 621-626
19. Fraley C., and Raftery A. MCLUST Version 3 for R: Normal mixture modeling and model-based clustering (Technical Report 504) (2006), Department of Statistics, University of Washington, Seattle, WA
20. Gan G., Ma C., and Wu J. Data clustering: Theory, algorithms, and applications (2007), Society for Industrial and Applied Mathematics, Philadelphia
21. Hanjoul P., and Peeters D. A comparison of two dual-based procedures for solving the p-median problem. European Journal of Operational Research 20 (1985) 387-396
22. Hansen P., and Mladenović N. Variable neighborhood search for the p-median. Location Science 5 (1997) 207-226
23. Hansen P., and Mladenović N. Variable neighborhood search. In: Burke E.K., and Kendall G. (Eds). Search methodologies (2005), Springer, New York 211-238
24. Hansen P., and Mladenović N. Complement to a comparative analysis for the p-median problem. Statistics and Computing 18 (2008) 41-46
25. Hartigan J.A., and Wong M.A. Algorithm AS 136: A K-means clustering algorithm. Applied Statistics 28 (1979) 100-108
26. Held M., and Karp R.M. The traveling salesman problem and minimum spanning trees. Operations Research 18 (1970) 1138-1162
27. Hubert L.J., Arabie P., and Meulman J. Combinatorial data analysis: Optimization by dynamic programming (2001), Society for Industrial and Applied Mathematics, Philadelphia, PA
28. Hubert L.J., Arabie P., and Meulman J. The structural representation of proximity matrices with MATLAB (2006), Society for Industrial and Applied Mathematics, Philadelphia, PA
29. Hubert L.J., Köhn H.-F., and Steinley D. Cluster analysis. In: Millsap R., and Maydeu-Olivares A. (Eds). The SAGE handbook of quantitative methods in psychology (2009), Sage, Los Angeles, CA 444-512
30. Kaufman L., and Rousseeuw P.J. Finding groups in data: An introduction to cluster analysis. 9th ed. (2005), Wiley, New York
31. Klastorin T. The p-median problem for cluster analysis: A comparative test using the mixture model approach. Management Science 31 (1985) 84-95
32. Kogan J. Introduction to clustering large and high-dimensional data (2007), Cambridge University Press, New York
33. Kuehn A.A., and Hamburger M.J. A heuristic program for locating warehouses. Management Science 9 (1963) 643-666
34. Love B.C. Concept learning. In: Nadel L. (Ed). The encyclopedia of cognitive science 1 (2003), Nature Publishing Group, London 646-652
35. MacQueen J.B. Some methods for classification and analysis of multivariate observations. In: Le Cam L.M., and Neyman J. (Eds). Proceedings of the fifth Berkeley symposium on mathematical statistics and probability 1 (1967), University of California Press, Berkeley, CA 281-297
36. Maranzana F.E. On the location of supply points to minimize transportation costs. Operations Research Quarterly 12 (1964) 138-139
37. Martinez W.L., and Martinez A.R. Exploratory data analysis with MATLAB (2005), Chapman & Hall/CRC, Boca Raton, FL
38. Martinez W.L., and Martinez A.R. Computational statistics handbook with MATLAB. 2nd ed. (2007), Chapman & Hall/CRC, Boca Raton, FL
39. McLachlan G., and Basford K.E. Mixture models: Inference and applications to clustering (1988), Marcel Dekker, New York
40. McLachlan G., and Peel D. Finite mixture models (2000), Wiley, New York
41. Mladenović N., Brimberg J., Hansen P., and Moreno-Pérez J.A. The p-median problem: A survey of metaheuristic approaches. European Journal of Operational Research 179 (2007) 927-939
42. Motzkin T., and Schoenberg I.J. The relaxation method for linear inequalities. Canadian Journal of Mathematics 6 (1954) 393-404
43. Mulvey J.M., and Crowder H.P. Cluster analysis: An application of Lagrangian relaxation. Management Science 25 (1979) 329-340
44. Murphy G.L. The big book of concepts (2002), MIT Press, Cambridge, MA
45. Muthén L.K., and Muthén B.O. Mplus user's guide. 5th ed. (1998-2007), Muthén & Muthén, Los Angeles, CA
46. Rao M.R. Cluster analysis and mathematical programming. Journal of the American Statistical Association 66 (1971) 622-626
47. Rolland E., Schilling D.A., and Current J.R. An efficient tabu search procedure for the p-median problem. European Journal of Operational Research 96 (1996) 329-342
48. Ross B.H., and Murphy G.L. Food for thought: Cross-classification and category organization in a complex real-world domain. Cognitive Psychology 38 (1999) 495-553
49. Ross B.H., Taylor E.G., Middleton E.L., and Nokes T.J. Concept and category learning in humans. In: Roediger III H.L., and Byrne J.H. (Eds). Cognitive psychology of memory 2 (2008), Elsevier, Oxford, United Kingdom 535-556
50. Rousseeuw P.J. Silhouettes: A graphical aid to the interpretation and validation of cluster analysis. Computational and Applied Mathematics 20 (1987) 53-65
51. Steinhaus H. Sur la division des corps matériels en parties [On the division of a collection of objects into parts]. Bulletin de l'Académie Polonaise des Sciences, Classe III 4 (1956) 801-804
52. Steinley D. K-means clustering: What you don't know may hurt you. Psychological Methods 8 (2003) 294-304
53. Steinley D. K-means clustering: A half-century synthesis. British Journal of Mathematical and Statistical Psychology 59 (2006) 1-34
54. Steinley D. Profiling local optima in K-means clustering: Developing a diagnostic technique. Psychological Methods 11 (2006) 178-192
55. Teitz M.B., and Bart P. Heuristic methods for estimating the generalized vertex median of a weighted graph. Operations Research 16 (1968) 955-961
56. Tversky A. Features of similarity. Psychological Review 84 (1977) 327-352
57. Vermunt J., and Magidson J. Latent GOLD 4.0 user's guide (2005), Statistical Innovations, Belmont, MA
58. Vinod H. Integer programming and the theory of grouping. Journal of the American Statistical Association 64 (1969) 507-517
59. Whitaker R. A fast algorithm for greedy interchange of large-scale clustering and median location problems. INFOR 21 (1983) 95-108