Journal of Mathematical Psychology volume 48, issue 5, P301-309 2004 DOI: 10.1016/ View full text
Michael J. Brusco, J.Dennis Cradit

Abstract: It is well known that minimum-diameter partitioning of symmetric dissimilarity matrices can be framed within the context of coloring the vertices of a graph. Although confusion data are typically represented in the form of asymmetric similarity matrices, they are also amenable to a graph-coloring perspective. In this paper, we propose the integration of the minimum-diameter partitioning method with a neighborhood-based coloring approach for analyzing digraphs corresponding to confusion data. This procedure is…

expand abstract