Bicriterion methods for partitioning dissimilarity matrices

British Journal of Mathematical and Statistical Psychology

Volumn 58, Issue 2, 2005, Pages 319-332

  Brusco, Michael J ^a   Cradit, J Dennis ^a  

^a FLORIDA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTICLE; CLUSTER ANALYSIS; HUMAN; METHODOLOGY; PSYCHOLOGICAL MODEL; PSYCHOLOGY; STATISTICS;

CLUSTER ANALYSIS; HUMANS; MODELS, PSYCHOLOGICAL; PSYCHOLOGY;

EID: 27844570428     PISSN: 00071102     EISSN: None     Source Type: Journal    
DOI: 10.1348/000711005X63890     Document Type: Article

References (32)

1. Arabie, P., & Hubert, L. J. (1996). An overview of combinatorial data analysis. In P. Arabie, L. J. Hubert, & G. De Soete (Eds.), Clustering and classification (pp. 5-63). River Edge, NJ: World Scientific Publishing.
2. Baker, F. B., & Hubert, L. J. (1976). A graph-theoretic approach to goodness of fit in complete-link hierarchical clustering. Journal of the American Statistical Association, 71, 870-878.
3. Banfield, C. F., & Bassil, L. C. (1977). A transfer algorithm for nonhierarchical classification. Applied Statistics, 26, 206-210.
4. Brown, J. R. (1972). Chromatic scheduling and the chromatic number problem. Management Science, 19, 456-463.
5. Brusco, M. J. (2003). An enhanced branch-and-bound algorithm for a partitioning problem. British Journal of Mathematical and Statistical Psychology, 56, 83-92.
6. Brusco, M. J., & Cradit, J. D. (2001). A variable-selection heuristic for k-means clustering. Psychometrika, 66, 249-270.
7. Brusco, M. J., & Stahl, S. (2001). Compact integer programming models for extracting subsets of stimuli from confusion matrices. Psychometrika, 66, 405-419.
8. Delattre, M., & Hansen, P. (1980). Bicriterion cluster analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2, 277-291.
9. Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. San Francisco: Freeman.
10. Guénoche, A. (1993). Enumération des partitions de diamètre minimum [Enumeration of the partitions of minimum diameter]. Discrete Mathematics, 111, 277-287.
11. Guénoche, A. (2003). Partitions optimisées selon différents critères: Évaluation et comparaison [Optimizing partitions according to different criteria: Evaluation and comparison]. Mathematics and Social Sciences, 41, 41-58.
12. Guénoche, A., Hansen, P., & Jaumard, B. (1991). Efficient algorithms for divisive hierarchical clustering with the diameter criterion. Journal of Classification, 8, 5-30.
13. Hansen, P., & Delattre, M. (1978). Complete link cluster analysis by graph coloring. Journal of the American Statistical Association, 73, 397-403.
14. Hansen, P., & Jaumard, B. (1997). Cluster analysis and mathematical programming. Mathematical Programming, 79, 191-215.
15. Hubert, L. (1973a). Monotone invariant clustering procedures. Psychometrika, 38, 47-62.
16. Hubert, L. (1973b). Min and max hierarchical clustering using asymmetric proximity measures. Psychometrika, 38, 63-72.
17. Hubert, L., & Arabie, P. (1985). Comparing partitions. Journal of Classification, 2, 193-218.
18. Hubert, L., Arabie, P., & Meulman, J. (2001). Combinatorial data analysis: Optimization by dynamic programming. Philadelphia: Society for Industrial and Applied Mathematics.
19. 2-norm: Basic optimization methods using MATLAB. Journal of Classification, 19, 303-328.
20. Hubert, L. J. (1974). Some applications of graph theory to clustering. Psychometrika, 39, 283-309.
21. Johnson, D. S., Aragon, C. R., McGeoch, L. A., & Schevon, C. (1991). Optimization by simulated annealing: An experimental evaluation. Part II: Graph coloring and number partitioning. Operations Research, 39, 378-406.
22. Johnson, S. C. (1967). Hierarchical clustering schemes. Psychometrika, 32, 241-254.
23. Klein, G., & Aronson, J. E. (1991). Optimal clustering: A model and method. Naval Research Logistics, 38, 447-461.
24. Klein, R. W., & Dubes, R. C. (1989). Experiments in projection and clustering by simulated annealing. Pattern Recognition, 22, 213-220.
25. 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.
26. Manning, S. K., & Shofner, E. (1991). Similarity ratings and confusability of lipread consonants compared with similarity ratings of auditory and orthographic stimuli. American Journal of Psychology, 104, 587-604.
27. Milligan, G. W., & Cooper, M. C. (1986). A study of the comparability of external criteria for hierarchical cluster analysis. Multivariate Behavioral Research, 21, 441-458.
28. Rao, M. R. (1971). Cluster analysis and mathematical programming. Journal of the American Statistical Association, 66, 622-626.
29. Steinley, D. (2003). Local optima in K-means clustering: What you don't know may hurt you. Psychological Methods, 8, 294-304.
30. Steinley, D. (2004). Properties of the Hubert-Arabie adjusted Rand index. Psychological Methods, 9, 386-396.
31. Theise, E. S. (1989). Finding a subset of stimulus-response pairs with minimum total confusion: A binary integer programming approach. Human Factors, 31, 291-305.
32. Waller, N. G., Kaiser, H. A., Illian, J. B., & Manry, M. (1998). A comparison of the classification capabilities of the 1-dimensional Kohonen neural network with two partitioning and three hierarchical cluster analysis algorithms. Psychometrika, 63, 5-22.