Computer Programs
Brusco, M. (2012). KMEDCLU: MATLAB m-files for K-medoid clustering.
Brusco, M., & Steinley, D. (2010). Neighborhood search heuristics for selecting hierarchically well-formulated subsets in polynomial regression. Naval Research Logistics, 57 (1), 33-44.
Koehn, H.-F., Steinley, D., & Brusco, M. (2010). The p-median model as a tool for clustering psychological data. Psychological Methods, 15 (1), 87-95. -The file below contains some software programs and a user’s manual for p-median clustering.
Brusco, M., Steinley, D., & Cradit, J. D. (2009). An exact algorithm for hierarchically well-formulated subsets in second-order polynomial regression. Technometrics, 51 (3), 306-315.
Brusco, M., & Koehn, H.-F. (2009). Clustering qualitative data based on binary equivalence relations: Neighborhood search heuristics for the clique partitioning problem. Psychometrika, 74 (4), 685-703.
Brusco, M., & Koehn, H.-F. (2008). Comment on ‘Clustering by Passing Messages Between Data Points’. Science, 319 (February 8), p. 726.
Overview of methods and summary of comparison
Vertex substitution heuristic (a Matlab m-file)
VSH version that ignores preference vector (a Matlab m-file)
Hartigans birth and death rates data
European cities (202) data from Grotschel and Holland
European cities (431) data from Grotschel and Holland
European cities (666) data from Grotschel and Holland
Reinelts circuit board holes data
Brusco, M., & Stahl, S. (2005). Branch-and-Bound Applications in Combinatorial Data Analysis.
Minimum diameter partitioning (Chapter 3)
Minimum within-cluster sums of dissimilarities partitioning (Chapter 4)
Minimum within-cluster sums of squares partitioning (Chapter 5)
Bicriterion within-cluster sums of squares (Chapter 6)
Maximizing the dominance index (Chapter 8)
Maximizing gradient indices (Chapter 9)
Unidimensional Scaling (Chapter 10)
Brusco, M., & Cradit, J. D. (2005). Bicriterion methods for partitioning dissimilarity matrices. British Journal of Mathematical and Statistical Psychology, 58, 319-332.