A Branch-and-Bound Algorithm for Fitting Anti-Robinson Structures to Symmetric Dissimilarity Matrices

Developed a branch-and-bound algorithm that can be used to seriate a symmetric dissimilarity matrix by identifying a reordering of rows and columns of the matrix optimizing an anti-Robinson criterion. Computational results suggest that with respect to computational efficiency, the approach is genera...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Psychometrika 2002-09, Vol.67 (3), p.459-471
1. Verfasser:	Brusco, Michael J
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Biological and medical sciences Branch and Bound Method Fundamental and applied biological sciences. Psychology Matrices Psychology. Psychoanalysis. Psychiatry Psychology. Psychophysiology Psychometrics. Statistics. Methodology Statistics. Mathematics
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	Developed a branch-and-bound algorithm that can be used to seriate a symmetric dissimilarity matrix by identifying a reordering of rows and columns of the matrix optimizing an anti-Robinson criterion. Computational results suggest that with respect to computational efficiency, the approach is generally competitive with dynamic programming. (SLD)
ISSN:	0033-3123 1860-0980
DOI:	10.1007/BF02294996