Graph drawing by force-directed placement
Software—Practice & Experience
Fundamentals of speech recognition
Fundamentals of speech recognition
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
Some approaches to best-match file searching
Communications of the ACM
Does organisation by similarity assist image browsing?
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
ACM Computing Surveys (CSUR)
Fixed Queries Array: A Fast and Economical Data Structure for Proximity Searching
Multimedia Tools and Applications
Case Study: Visualizing Sets of Evolutionary Trees
INFOVIS '02 Proceedings of the IEEE Symposium on Information Visualization (InfoVis'02)
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)
The InfoSky visual explorer: exploiting hierarchical structure and document similarities
Information Visualization
Fast multidimensional scaling through sampling, springs and interpolation
Information Visualization
Audio-based event detection for sports video
CIVR'03 Proceedings of the 2nd international conference on Image and video retrieval
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
Eigensolver methods for progressive multidimensional scaling of large data
GD'06 Proceedings of the 14th international conference on Graph drawing
A visual workspace for hybrid multidimensional scaling algorithms
INFOVIS'03 Proceedings of the Ninth annual IEEE conference on Information visualization
A survey of hybrid representations of concept lattices in conceptual knowledge processing
ICFCA'10 Proceedings of the 8th international conference on Formal Concept 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
Visualisation and analysis of large and complex scale-free networks
EUROVIS'05 Proceedings of the Seventh Joint Eurographics / IEEE VGTC conference on Visualization
| Hi-index | 0.00 |
An algorithm is presented for the visualisation of multidimensional abstract data, building on a hybrid model introduced at InfoVis 2002. The most computationally complex stage of the original model involved performing a nearest-neighbour search for every data item. The complexity of this phase has been reduced by treating all high-dimensional relationships as a set of discretised distances to a constant number of randomly selected pivot items. In improving this computational bottleneck, the complexity is reduced from O(N√N) to O(N5/4). As well as documenting this improvement, the paper describes evaluation with a data set of 108000 14-dimensional items; a considerable increase on the size of data previously tested. Results illustrate that the reduction in complexity is reflected in significantly improved run times and that no negative impact is made upon the quality of layout produced.