Convergence of the majorization method for multidimensional scaling
From MaRDI portal
(Redirected from Publication:583775)
Recommendations
- scientific article; zbMATH DE number 1203381
- A generalized majorization method for least squares multidimensional scaling of pseudodistances that may be negative
- scientific article; zbMATH DE number 876715
- Better initial configurations for metric multidimensional scaling
- scientific article; zbMATH DE number 1434020
Cites work
- scientific article; zbMATH DE number 3734973 (Why is no real title available?)
- scientific article; zbMATH DE number 3641227 (Why is no real title available?)
- scientific article; zbMATH DE number 3352737 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- A general nonmetric technique for finding the smallest coordinate space for a configuration of points
- Monotone regression: Continuity and differentiability properties
- Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
- Nonmetric multidimensional scaling. A numerical method
- Upper bounds for Kruskal's stress
Cited in
(33)- Positive semidefinite relaxations for distance geometry problems.
- Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures
- INDSCAL model: geometrical interpretation and methodology
- Setting up alternating least squares and iterative majorization algorithms for solving various matrix optimization problems
- Nonlinear dimensionality reduction by topologically constrained isometric embedding
- The appeals of quadratic majorization-minimization
- Fuzzy clustering with squared Minkowski distances
- The majorization approach to multidimensional scaling for Minkowski distances
- A generalized majorization method for least squares multidimensional scaling of pseudodistances that may be negative
- A fast successive over-relaxation algorithm for force-directed network graph drawing
- Estimating the city-block two-dimensional scaling model with simulated annealing
- OVERALS: Nonlinear canonical correlation with k sets of variables
- Points of view analysis revisited: Fitting multidimensional structures to optimal distance components with cluster restrictions on the variables
- A globally convergent inertial first-order optimization method for multidimensional scaling
- The cone of distance matrices
- Analysis of k sets of data, with differential emphasis on agreement between and within sets
- A latent class unfolding model for analyzing single stimulus preference ratings
- Visualizing the effects of a changing distance on data using continuous embeddings
- Analysis of asymmetry by a slide-vector
- A majorized penalty approach to inverse linear second order cone programming problems
- Iterative denoising
- The tunneling method for global optimization in multidimensional scaling
- A distance-based variety of nonlinear multivariate data analysis, including weights for objects and variables
- Majorization as a tool for optimizing a class of matrix functions
- Resistant orthogonal Procrustes analysis
- Optimal embedding of finite metric spaces into strictly convex spaces
- Weighted Euclidean biplots
- A new efficient algorithm based on DC programming and DCA for clustering
- Nonlinear eigenvector algorithms for local optimization in multivariate data analysis
- Sharp quadratic majorization in one dimension
- A uniform approach to multidimensional scaling
- Data-driven graph drawing techniques with applications for conveyor systems
- Multinomial restricted unfolding
This page was built for publication: Convergence of the majorization method for multidimensional scaling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q583775)
