Multidimensional Scaling: I. Theory and Method
1952/12/01 by Warren S. Torgerson · 43 citations
Agricultural and Biological Sciences · #Advanced Scientific Research Methods
paper · doi:10.1007/bf02288916
Abstract
Multidimensional scaling can be considered as involving three basic steps. In the first step, a scale of comparative distances between all pairs of stimuli is obtained. This scale is analogous to the scale of stimuli obtained in the traditional paired comparisons methods. In this scale, however, instead of locating each stimulus-object on a given continuum, the distances between each pair of stimuli are located on a distance continuum. As in paired comparisons, the procedures for obtaining a scale of comparative distances leave the true zero point undetermined. Hence, a comparative distance is not a distance in the usual sense of the term, but is a distance minus an unknown constant. The second step involves estimating this unknown constant. When the unknown constant is obtained, the comparative distances can be converted into absolute distances. In the third step, the dimensionality of the psychological space necessary to account for these absolute distances is determined, and the projections of stimuli on axes of this space are obtained. A set of analytical procedures was developed for each of the three steps given above, including a least-squares solution for obtaining comparative distances by the complete method of triads, two practical methods for estimating the additive constant, and an extension of Young and Householder's Euclidean model to include procedures for obtaining the projections of stimuli on axes from fallible absolute distances.
Cited by
- Generalized canonical correlation analysis for classification
- Size Should Not Matter: Evaluating Network Visualizations with Stress
- Multidimensional Scaling, Sammon Mapping, and Isomap: Tutorial and Survey
- Consensus dimension reduction via multi-view learning
- RFX: High-Performance Random Forests with GPU Acceleration and QLORA Compression
- Imaging with super-resolution in changing random media
- Generalized Canonical Correlation Analysis for Disparate Data Fusion
- Visualizing graph neural networks in order to learn general concepts in power systems
- AliFilter: a machine learning approach to alignment filtering
- Extracting manifold information from point clouds
- Euclidean Distance Matrices: Essential theory, algorithms, and applications
- Subjective Image Quality Assessment with Boosted Triplet Comparisons
- Low-Dimensional Structure in the Space of Language Representations is\n Reflected in Brain Responses
- When One Point Is Not Enough: Addressing Ambiguous Instances in Dimensionality Reduction by Splitting
- Topical Behavior Prediction from Massive Logs
- Data-driven generation and efficient screening of MR-TADF materials
- Johnson-Lindenstrauss Lemma Beyond Euclidean Geometry
- Dynamically Detect and Fix Hardness for Efficient Approximate Nearest Neighbor Search
- Inducing a measure of phonetic similarity from pronunciation variation
- Influence Dynamics and Stagewise Data Attribution
- Contrastive Dimension Reduction: A Systematic Review
- How Scale Breaks "Normalized Stress" and KL Divergence: Rethinking Quality Metrics
- Don't take it lightly: Phasing optical random projections with unknown operators
- Out-of-sample Extension for Latent Position Graphs
- Quantifying functionally equivalent species and ecological network dissimilarity with optimal transport distances
- The Complexity of Finding Local Optima in Contrastive Learning
- Testing for differential abundance in compositional counts data, with application to microbiome studies
- Sensor Network Localization, Euclidean Distance Matrix Completions, and Graph Realization
- Why Can't I See My Clusters? A Precision-Recall Approach to Dimensionality Reduction Validation
- SMDS-based Rigid Body Localization
- Assessing local deformation and computing scalar curvature with nonlinear conformal regularization of decoders
- Orthogonal projections of hypercubes
- Topolow: Force-Directed Euclidean Embedding of Dissimilarity Data with Robustness Against Non-Metricity and Sparsity
- On Extending NLP Techniques from the Categorical to the Latent Space: KL Divergence, Zipf's Law, and Similarity Search
- Visualizing spreading phenomena on complex networks
- Bespoke multiresolution analysis of graph signals
- Euclidean Distance Deflation Under High-Dimensional Heteroskedastic Noise
- Quaternion-Domain Super MDS for Robust 3D Localization
- Generalized eigen, singular value, and partial least squares decompositions: The GSVD package
- Classification Constrained Dimensionality Reduction
- Rehabilitating Isomap: Euclidean Representation of Geodesic Structure
- Local Pairwise Distance Matching for Backpropagation-Free Reinforcement Learning
- Some steps towards a general principle for dimensionality reduction mappings
Related