1988
DOI: 10.1007/bf01897162
|View full text |Cite
|
Sign up to set email alerts
|

Convergence of the majorization method for multidimensional scaling

Abstract: Multidimensional scaling, Convergence, Step size, Local minima,

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
102
0

Year Published

1998
1998
2016
2016

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 184 publications
(102 citation statements)
references
References 10 publications
0
102
0
Order By: Relevance
“…As for discrimination of the treatments in relation to the physical-chemical variables for the cheese bread and dough, the multidimensional scaling technique was used, following the procedure recommended by BORG & GROENEN (2005). This reduction was validated considering the approximation between the dissimilarity matrix obtained from the original data and from the variables selected as indicated by DE LEEUW (1988).…”
Section: T11mentioning
confidence: 99%
“…As for discrimination of the treatments in relation to the physical-chemical variables for the cheese bread and dough, the multidimensional scaling technique was used, following the procedure recommended by BORG & GROENEN (2005). This reduction was validated considering the approximation between the dissimilarity matrix obtained from the original data and from the variables selected as indicated by DE LEEUW (1988).…”
Section: T11mentioning
confidence: 99%
“…In this section, we review stress majorization as described in the MDS literature [3,5]. We denote a d-dimensional layout by an n × d matrix X.…”
Section: Stress Majorizationmentioning
confidence: 99%
“…Substantial work in statistical MDS deals with the properties of the majorization process, including proofs of its convergence rate [3]. The MDS literature suggests solving equation (9) by computing (L w ) + , the Moore-Penrose inverse of the singular matrix L w .…”
Section: Related Workmentioning
confidence: 99%
“…Therefore, if the minimum of this quadratic function yields an update with the same ordering (and thus in the same polyhedron), then the update is a local minimum and the next iteration shows an improvement in Stress of zero. This dependency of the update on the rank order of the coordinates was first observed in De Leeuw and Heiser (1977). We can illustrate this effect by applying unidimensional scaling to the cola data by running the code below.…”
Section: Local Minimamentioning
confidence: 63%
“…Initially, the acronym SMACOF stood for 'scaling by majorizing a convex function' following the convex analysis approach of De Leeuw (1977). Here we follow De Heiser (1980) andDe Leeuw (1988) who redefine the acronym as scaling by majorizing a complicated function.…”
Section: The Smacof Algorithm For Mdsmentioning
confidence: 99%