An algorithm for drawing general undirected graphs
Information Processing Letters
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
A linear iteration time layout algorithm for visualising high-dimensional data
Proceedings of the 7th conference on Visualization '96
Drawing graphs to convey proximity: an incremental arrangement method
ACM Transactions on Computer-Human Interaction (TOCHI)
Evaluating a class of distance-mapping algorithms for data mining and clustering
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
Graph Drawing by High-Dimensional Embedding
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
A Hybrid Layout Algorithm for Sub-Quadratic Multidimensional Scaling
INFOVIS '02 Proceedings of the IEEE Symposium on Information Visualization (InfoVis'02)
ACE: A Fast Multiscale Eigenvectors Computation for Drawing Huge Graphs
INFOVIS '02 Proceedings of the IEEE Symposium on Information Visualization (InfoVis'02)
IV '04 Proceedings of the Information Visualisation, Eighth International Conference
Steerable, Progressive Multidimensional Scaling
INFOVIS '04 Proceedings of the IEEE Symposium on Information Visualization
One-dimensional layout optimization, with applications to graph drawing by axis separation
Computational Geometry: Theory and Applications
Improving hybrid MDS with pivot-based searching
INFOVIS'03 Proceedings of the Ninth annual IEEE conference on Information visualization
An experimental comparison of fast algorithms for drawing general large graphs
GD'05 Proceedings of the 13th international conference on Graph Drawing
SDE: graph drawing using spectral distance embedding
GD'05 Proceedings of the 13th international conference on Graph Drawing
Graph drawing by stress majorization
GD'04 Proceedings of the 12th international conference on Graph Drawing
Graph drawing by subspace optimization
VISSYM'04 Proceedings of the Sixth Joint Eurographics - IEEE TCVG conference on Visualization
Visual analysis of importance and grouping in software dependency graphs
Proceedings of the 4th ACM symposium on Software visualization
An Experimental Study on Distance-Based Graph Drawing
Graph Drawing
DEMScale: Large Scale MDS Accounting for a Ridge Operator and Demographic Variables
IDA '09 Proceedings of the 8th International Symposium on Intelligent Data Analysis: Advances in Intelligent Data Analysis VIII
Nonlinear Dimensionality Reduction by Topologically Constrained Isometric Embedding
International Journal of Computer Vision
Universal multi-dimensional scaling
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Detecting activities from body-worn accelerometers via instance-based algorithms
Pervasive and Mobile Computing
User-centric time-distance representation of road networks
GIScience'10 Proceedings of the 6th international conference on Geographic information science
A spatiotemporal visualization approach for the analysis of gameplay data
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Drawing Large Graphs by Low-Rank Stress Majorization
Computer Graphics Forum
Piecewise laplacian-based projection for interactive data exploration and organization
EuroVis'11 Proceedings of the 13th Eurographics / IEEE - VGTC conference on Visualization
Graph drawing by classical multidimensional scaling: new perspectives
GD'12 Proceedings of the 20th international conference on Graph Drawing
| Hi-index | 0.00 |
We present a novel sampling-based approximation technique for classical multidimensional scaling that yields an extremely fast layout algorithm suitable even for very large graphs. It produces layouts that compare favorably with other methods for drawing large graphs, and it is among the fastest methods available. In addition, our approach allows for progressive computation, i.e. a rough approximation of the layout can be produced even faster, and then be refined until satisfaction.