1991 | OriginalPaper | Buchkapitel
Dual Algorithms in Multidimensional Scaling
verfasst von : Rudolf Mathar
Erschienen in: Classification, Data Analysis, and Knowledge Organization
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
A basic problem in Multidimensional Scaling is to minimize the weighted sum of squared differences between given dissimilarities and distances over all Euclidian distance matrices. Existing algorithms solve this problem in a not quite satisfactory way. The present paper aims at the development of dual algorithms which are able to find the global minimum with a sufficient speed of convergence.