Optimal partitioning of a data set based on the p-median model

Psychometrika

Volumn 73, Issue 1, 2008, Pages 89-105

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

^a FLORIDA STATE UNIVERSITY   (United States)

^b UNIVERSITY OF MISSOURI   (United States)

Author keywords

Branch and bound; Cluster analysis; Combinatorial data analysis; Heuristics; Lagrangian relaxation; P median problem

Indexed keywords

EID: 41449106691     PISSN: 00333123     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11336-007-9021-4     Document Type: Article

References (48)

1. Agmon, S. (1954). The relaxation method for linear inequalities. Canadian Journal of Mathematics, 6, 382-392.
2. Anderson, E. (1935). The irises of the Gaspé peninsula. Bulletin of the American Iris Society, 59, 2-5.
3. Avella, P., Sassano, A., & Vasil'ev, I. (2003). Computational study of large-scale p -median problems. Technical Report, Dipartimento di Informatica e Sistemistica, Università di Roma "La Sapienza."
4. 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.
5. Brusco, M.J. (2006). A repetitive branch-and-bound algorithm for minimum within-cluster sums of squares partitioning. Psychometrika, 71, 347-363.
6. Brusco, M.J., & Stahl, S. (2005). Branch-and-bound applications in combinatorial data analysis. New York: Springer.
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. Christofides, N., & Beasley, J.E. (1982). A tree search algorithm for the p-median problem. European Journal of Operational Research, 10, 196-204.
9. 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.
10. 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.
11. Du Merle, O., Hansen, P., Jaumard, B., & Mladenović, N. (2000). An interior point algorithm for minimum sum-of-squares clustering. SIAM Journal on Scientific Computing, 21, 1485-1505.
12. Erlenkotter, D. (1977). Facility location with price-sensitive demands: Private, public, and quasi-public. Management Science, 24, 378-386.
13. Fisher, R.A. (1936). The use of multiple measurements in taxonomic problems. Annals of Eugenics, 7, 179-188.
14. Fisher, M.L. (1981). The Lagrangian relaxation method for solving integer programming problems. Management Science, 27, 1-18.
15. Forgy, E.W. (1965). Cluster analyses of multivariate data: Efficiency versus interpretability of classifications. Biometrics, 21, 768.
16. Grötschel, M., & Holland, O. (1991). Solution of large-scale symmetric traveling salesman problems. Mathematical Programming, 51, 141-202.
17. Hair, J.F., Anderson, R.E., Tatham, R.L., & Black, W.C. (1998). Multivariate data analysis (5th edn.). Upper Saddle River: Prentice-Hall.
18. Hakimi, S.L. (1964). Optimum locations of switching centers and the absolute centers and medians of a graph. Operations Research, 12, 450-459.
19. 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.
20. Hansen, P., & Jaumard, B. (1997). Cluster analysis and mathematical programming. Mathematical Programming, 79, 191-215.
21. Hansen, P., Mladenoviĉ, N., & Perez-Brito, D. (2001). Variable neighborhood decomposition search. Journal of Heuristics, 7, 335-350.
22. Hartigan, J.A. (1975). Clustering algorithms. New York: Wiley.
23. Hartigan, J.A., & Wong, M.A. (1979). Algorithm AS136: A k-means clustering program. Applied Statistics, 28, 100-128.
24. Heinz, G., Peterson, L.J., Johnson, R.W., & Kerk, C.J. (2003). Exploring relationships in body dimensions. Journal of Statistics Education, 11. Available at: www.amstat.org/publications/jse/v11n2/datasets.heinz.html.
25. Held, M., & Karp, R.M. (1970). The traveling salesman problem and minimum spanning trees. Operations Research, 18, 1138-1162.
26. Held, M., Wolfe, P., & Crowder, H.P. (1974). Validation of subgradient optimization. Mathematical Programming, 6, 62-88.
27. Hubert, L.J. (1987). Assignment methods in combinatorial data analysis. New York: Marcel Dekker.
28. Hubert, L., & Arabie, P. (1985). Comparing partitions. Journal of Classification, 2, 193-218.
29. Hubert, L.J., & Baker, F.B. (1978). Applications of combinatorial programming to data analysis: The traveling salesman and related problems. Psychometrika, 43, 81-91.
30. Hubert, L.J., & Schultz, J.V. (1976). Quadratic assignment as a general data analysis strategy. British Journal of Mathematical and Statistical Psychology, 29, 190-241.
31. Hubert, L., Arabie, P., & Meulman, J. (2001). Combinatorial data analysis: Optimization by dynamic programming. Philadelphia: SIAM.
32. Hubert, L., Arabie, P., & Meulman, J. (2006). The structural representation of proximity matrices with MATLAB. Philadelphia: SIAM.
33. Johnson, S.C. (1967). Hierarchical clustering schemes. Psychometrika, 32, 241-254.
34. Klastorin, T. (1985). The p-median problem for cluster analysis: A comparative test using the mixture model approach. Management Science, 31, 84-95.
35. Lin, S., & Kernighan, B.W. (1973). An effective heuristic algorithm for the traveling salesman problem. Operations Research, 21, 498-516.
36. 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.
37. Motzkin, T., & Schoenberg, I.J. (1954). The relaxation method for linear inequalities. Canadian Journal of Mathematics, 6, 393-404.
38. Mulvey, J.M., & Crowder, H.P. (1979). Cluster analysis: An application of Lagrangian relaxation. Management Science, 25, 329-340.
39. Narula, S.C., Ogbu, U.I., & Samuelson, H.M. (1977). An algorithm for the p-median problem. Operations Research, 25, 709-713.
40. Rao, M.R. (1971). Cluster analysis and mathematical programming. Journal of the American Statistical Association, 66, 622-626.
41. Reinelt, G. (2001). TSPLIB. http://www.iwr.uni-heidelberg.de/groups/ comopt/software/TSPLIB95.
42. Sokal, R.R., & Sneath, P.H.A. (1963). Principles of numerical taxonomy. San Francisco: Freeman.
43. Späth, H. (1980). Cluster analysis algorithms for data reduction and classification of objects. New York: Wiley.
44. Steinley, D. (2004). Properties of the Hubert-Arabie adjusted Rand index. Psychological Methods, 9, 386-396.
45. Steinley, D. (2006a). K-Means clustering: A half-century synthesis. British Journal of Mathematical and Statistical Psychology, 59, 1-34.
46. Steinley, D. (2006b). Profiling local optima in K-means clustering: Developing a diagnostic technique. Psychological Methods, 11, 178-192.
47. Teitz, M.B., & Bart, P. (1968). Heuristic methods for estimating the generalized vertex median of a weighted graph. Operations Research, 16, 955-961.
48. Ward, J.H. (1963). Hierarchical grouping to optimize an objective function. Journal of the American Statistical Association, 58, 236-244.