Graph coloring, minimum-diameter partitioning, and the analysis of confusion matrices

Journal of Mathematical Psychology

Volumn 48, Issue 5, 2004, Pages 301-309

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

^a FLORIDA STATE UNIVERSITY   (United States)

Author keywords

Combinatorial data analysis; Confusion matrices; Graph coloring; Implicit enumeration; Partitioning

Indexed keywords

EID: 10144234133     PISSN: 00222496     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jmp.2004.05.001     Document Type: Article

References (26)

1. Baker F.B. Hubert L.J. A graph-theoretic approach to goodness of fit in complete-link hierarchical clustering Journal of the American Statistical Association 71 1976 870-878
2. Brooks R.L. On colouring the nodes of a network Proceedings of the Cambridge Philosophical Society 37 1941 194-197
3. Brown J.R. Chromatic scheduling and the chromatic number problem Management Science 19 1972 456-463
4. Brusco M.J. An enhanced branch-and-bound algorithm for a partitioning problem British Journal of Mathematical and Statistical Psychology 56 2003 83-92
5. Cho R.Y. Yang V. Hallett P.E. Reliability and dimensionality of judgments of visually textured materials Perception & Psychophysics 62 2000 735-752
6. Dailey, D. P. (1978). Graph coloring by humans and machines: A polynomial complete problem solving task. Doctoral dissertation, University of Colorado
7. Everett M.G. Borgatti S.P. Role colouring a graph Mathematical Social Sciences 21 1991 183-188
8. Everett M.G. Borgatti S.P. An extension of regular colouring of graphs to digraphs, networks and hypergraphs Social Networks 15 1993 237-254
9. Hansen P. Delattre M. Complete-link cluster analysis by graph coloring Journal of the American Statistical Association 73 1978 397-403
10. Hubert L. Min and max hierarchical clustering using asymmetric proximity measures Psychometrika 38 1973 63-72
11. Hubert L.J. Some applications of graph theory to clustering Psychometrika 39 1974 283-309
12. Hubert L.J. Assignment methods in combinatorial data analysis 1987 Marcel Dekker New York
13. Hubert L. Arabie P. Meulman J. Linear and circular unidimensional scaling for symmetric proximity matrices British Journal of Mathematical and Statistical Psychology 50 1997 253-284
14. Hubert L. Arabie P. Meulman J. Combinatorial data analysis: Optimization by dynamic programming 2001 Society for Industrial and Applied Mathematics Philadelphia
15. Hubert L.J. Baker F.B. The comparison and fitting of given classification schemes Journal of Mathematical Psychology 16 1977 233-253
16. Klein G. Aronson J.E. Optimal clustering: A model and method Naval Research Logistics 38 1991 447-461
17. Loomis J.M. Analysis of tactile and visual confusion matrices Perception & Psychophysics 31 1982 41-52
18. May K.O. The origin of the four-color conjecture Isis 56 1965 346-348
19. Morgan B.J.T. Chambers S.M. Morton J. Acoustic confusion of digits in memory and recognition Perception & Psychophysics 14 1973 375-383
20. Rao M.R. Cluster analysis and mathematical programming Journal of the American Statistical Association 66 1971 622-626
21. Roberts F.S. Role assignments and indifference graphs. In: Dowling C.E. Roberts F.S. Theuns P. (Eds.). Recent progress in mathematical psychology 1998 33-46 Lawrence Erlbaum Associates Mahwah, NJ
22. Roberts F.S. Sheng L. Role assignments. In: Alavi Y. Lick D. Schwenk A. (Eds.). Combinatorics, graph theory, and algorithms 1999 729-745 New Issues Press Kalamazoo, MI
23. Roberts F.S. Sheng L. How hard is it to determine if a graph has a 2-role assignment? Networks 37 2001 67-73
24. Rothkopf E. A measure of stimulus similarity and errors in some paired-associate learning tasks Journal of Experimental Psychology 53 1957 94-101
25. Shepard R.N. Arabie P. Additive clustering: Representation of similarities as combinations of discrete overlapping properties Psychological Review 86 1979 87-123
26. White D.R. Reitz K.P. Graph and semigroup homomorphism on networks of relations Social Networks 5 1983 193-235