2009
DOI: 10.18637/jss.v031.i03
|View full text |Cite
|
Sign up to set email alerts
|

Multidimensional Scaling Using Majorization: SMACOF inR

Abstract: In this paper we present the methodology of multidimensional scaling problems (MDS) solved by means of the majorization algorithm. The objective function to be minimized is known as stress and functions which majorize stress are elaborated. This strategy to solve MDS problems is called SMACOF and it is implemented in an R package of the same name which is presented in this article. We extend the basic SMACOF theory in terms of configuration constraints, three-way data, unfolding models, and projection of the r… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
332
0
8

Year Published

2010
2010
2020
2020

Publication Types

Select...
7
3

Relationship

0
10

Authors

Journals

citations
Cited by 422 publications
(341 citation statements)
references
References 44 publications
1
332
0
8
Order By: Relevance
“…Second, by means of multidimensional scaling, insights are gained into which connotations respondents associate with the respective skiing destinations. For this analysis, the smacof package, as implemented in the R system, is used (De Leeuw & Mair, 2009). The last step of data analysis aims at validating findings resulting from the two preceding methods (i.e., hierarchical clustering and multidimensional scaling).…”
Section: Discussionmentioning
confidence: 99%
“…Second, by means of multidimensional scaling, insights are gained into which connotations respondents associate with the respective skiing destinations. For this analysis, the smacof package, as implemented in the R system, is used (De Leeuw & Mair, 2009). The last step of data analysis aims at validating findings resulting from the two preceding methods (i.e., hierarchical clustering and multidimensional scaling).…”
Section: Discussionmentioning
confidence: 99%
“…In such cases, the configuration X is constructed from a subset of the distances, and, at the same time, the other (missing) distances are estimated by monotonic regression. In nonmetric MDS it is assumed that d ij ≈ f(δ ij ), therefore f(δ ij ) are often referred as the disparities [55][56][57] in contrast to the original dissimilarities δ ij , on one hand, and the distances d ij of the configuration space on the other hand. In this context, the disparity is a measure of how well the distance d ij matches the dissimilarity δ ij .…”
Section: Multidimensional Scalingmentioning
confidence: 99%
“…Otherwise, one has to opt for many of its variants. Well-known ones include SMACOF [7], weighted-MDS [8], and MDS-MAP [9,10]. In particular, MDS-MAP often works when nodes are positioned relatively uniformly in the space, but does not perform well on networks with irregular topology, where the shortest path distance does not correlate well with the true Euclidean distance.…”
Section: Introductionmentioning
confidence: 99%