Worlds within worlds: metaphors for exploring n-dimensional virtual worlds
UIST '90 Proceedings of the 3rd annual ACM SIGGRAPH symposium on User interface software and technology
A self-organizing semantic map for information retrieval
SIGIR '91 Proceedings of the 14th annual international ACM SIGIR conference on Research and development in information retrieval
Externalising abstract mathematical models
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
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
ACM Computing Surveys (CSUR)
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
Refining Initial Points for K-Means Clustering
ICML '98 Proceedings of the Fifteenth International Conference on Machine Learning
Similarity Search in High Dimensions via Hashing
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Visualizing the non-visual: spatial analysis and interaction with information from text documents
INFOVIS '95 Proceedings of the 1995 IEEE Symposium on Information Visualization
A Hybrid Layout Algorithm for Sub-Quadratic Multidimensional Scaling
INFOVIS '02 Proceedings of the IEEE Symposium on Information Visualization (InfoVis'02)
Self organization of a massive document collection
IEEE Transactions on Neural Networks
Fast self-organizing feature map algorithm
IEEE Transactions on Neural Networks
Information Visualization - Special issue on coordinated and multiple views in exploratory visualization
Visualization of high-dimensional data with relational perspective map
Information Visualization
A pivot-based routine for improved parent-finding in hybrid MDS
Information Visualization - Special issue of selected and extended InfoVis 03 papers
Self-tuning cost modeling of user-defined functions in an object-relational DBMS
ACM Transactions on Database Systems (TODS)
Improving Angle Based Mappings
ADMA '08 Proceedings of the 4th international conference on Advanced Data Mining and Applications
RankVisu: Mapping from the neighborhood network
Neurocomputing
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
AVEDA: Statistical Tests for Finding Interesting Visualisations
KES '09 Proceedings of the 13th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems: Part I
ACM SIGKDD Explorations Newsletter
Collaborative filtering via euclidean embedding
Proceedings of the fourth ACM conference on Recommender systems
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
SEAL'10 Proceedings of the 8th international conference on Simulated evolution and learning
Human-centered visualization environments
Human-centered visualization environments
Data organization and visualization using self-sorting map
Proceedings of Graphics Interface 2011
Scalable localization in wireless sensor networks
HiPC'06 Proceedings of the 13th international conference on High Performance Computing
MDSpolar: a new approach for dimension reduction to visualize high dimensional data
IDA'05 Proceedings of the 6th international conference on Advances in Intelligent Data Analysis
An accurate MDS-Based algorithm for the visualization of large multidimensional datasets
ICAISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Soft Computing
A nonlinear method for dimensionality reduction of data using reference nodes
Pattern Recognition and Image Analysis
International Journal of Mobile Human Computer Interaction
FIMH'13 Proceedings of the 7th international conference on Functional Imaging and Modeling of the Heart
| Hi-index | 0.00 |
The term 'proximity data' refers to data sets within which it is possible to assess the similarity of pairs of objects. Multidimensional scaling (MDS) is applied to such data and attempts to map high-dimensional objects onto low-dimensional space through the preservation of these similarity relations. Standard MOS techniques have in the past suffered from high computational complexity and, as such, could not feasibly be applied to data sets over a few thousand objects in size. Through a novel hybrid approach based upon stochastic sampling, interpolation and spring models, we have designed an algorithm running in O(N√N). Using Chalmers' 1996 O(N2) spring model as a benchmark for the evaluation of our technique, we compare layout quality and run times using sets of synthetic and real data. Our algorithm executes significantly faster than Chalmers' 1996 algorithm, while 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.