Graph drawing by force-directed placement
Software—Practice & Experience
A linear iteration time layout algorithm for visualising high-dimensional data
Proceedings of the 7th conference on Visualization '96
Approximate nearest neighbors: towards removing the curse of dimensionality
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Does organisation by similarity assist image browsing?
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Fixed Queries Array: A Fast and Economical Data Structure for Proximity Searching
Multimedia Tools and Applications
Similarity Search in High Dimensions via Hashing
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Self organization of a massive document collection
IEEE Transactions on Neural Networks
Fast self-organizing feature map algorithm
IEEE Transactions on Neural Networks
Fast multidimensional scaling through sampling, springs and interpolation
Information Visualization
Information Visualization - Special issue on coordinated and multiple views in exploratory visualization
A pivot-based routine for improved parent-finding in hybrid MDS
Information Visualization - Special issue of selected and extended InfoVis 03 papers
Une approche MDS hybride pour l'exploration visuelle interactive
IHM 2005 Proceedings of the 17th international conference on Francophone sur l'Interaction Homme-Machine
Visualization and exploration of time-varying medical image data sets
GI '07 Proceedings of Graphics Interface 2007
Interactive wormhole detection and evaluation
Information Visualization
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
Eigensolver methods for progressive multidimensional scaling of large data
GD'06 Proceedings of the 14th international conference on Graph drawing
Relational duals of cluster-validity functions for the c-means family
IEEE Transactions on Fuzzy Systems
Improving hybrid MDS with pivot-based searching
INFOVIS'03 Proceedings of the Ninth annual IEEE conference on Information visualization
A visual workspace for hybrid multidimensional scaling algorithms
INFOVIS'03 Proceedings of the Ninth annual IEEE conference on Information visualization
Dynamic visualization of transient data streams
INFOVIS'03 Proceedings of the Ninth annual IEEE conference on Information visualization
Visualization of labeled data using linear transformations
INFOVIS'03 Proceedings of the Ninth annual IEEE conference on Information visualization
Volume visualization and visual queries for large high-dimensional datasets
VISSYM'04 Proceedings of the Sixth Joint Eurographics - IEEE TCVG conference on Visualization
Piecewise laplacian-based projection for interactive data exploration and organization
EuroVis'11 Proceedings of the 13th Eurographics / IEEE - VGTC conference on Visualization
| Hi-index | 0.00 |
Many clustering and layout techniques have been used for structuring and visualising complex data. This paper is inspired by a number of such contemporary techniques and presents a novel hybrid approach based upon stochastic sampling, interpolation and spring models. We use Chalmers' 1996 0(N2) spring model as a benchmark when evaluating our technique, comparing layout quality and run times using data sets of synthetic and real data. Our algorithm runs in 0(N\sqrt N) and executes significantly faster than CHalmers' 1996 algorithm, whilst producing superior layouts. In reducing complexity and run time, we allow the visualisation of data sets of previously infeasible size. Our results indicate that our method is a solid foundation for interactive and visual exploration of data.