COAST: A Convex Optimization Approach to Stress-Based Embedding
From MaRDI portal
Abstract: Visualizing graphs using virtual physical models is probably the most heavily used technique for drawing graphs in practice. There are many algorithms that are efficient and produce high-quality layouts. If one requires that the layout also respect a given set of non-uniform edge lengths, however, force-based approaches become problematic while energy-based layouts become intractable. In this paper, we propose a reformulation of the stress function into a two-part convex objective function to which we can apply semi-definite programming (SDP). We avoid the high computational cost associated with SDP by a novel, compact re-parameterization of the objective function using the eigenvectors of the graph Laplacian. This sparse representation makes our approach scalable. We provide experimental results to show that this method scales well and produces reasonable layouts while dealing with the edge length constraints.
Recommendations
- On interpolation of cocompact imbeddings
- Constrained Optimization of the Stress Function for Multidimensional Scaling
- scientific article; zbMATH DE number 1865482
- Coconvex pointwise approximation
- scientific article; zbMATH DE number 1827092
- Estimating the optimal margins of embeddings in Euclidean half spaces
- New phenomena in coconvex approximation
- Coconvex approximation in the uniform norm: the final frontier
- Convex optimization learning of faithful Euclidean distance representations in nonlinear dimensionality reduction
Cited in
(4)
This page was built for publication: COAST: A Convex Optimization Approach to Stress-Based Embedding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867664)
