Does organisation by similarity assist image browsing?
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
An Efficient k-Means Clustering Algorithm: Analysis and Implementation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Best Increments for the Average Case of Shellsort
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Fast multidimensional scaling through sampling, springs and interpolation
Information Visualization
A Nonlinear Mapping for Data Structure Analysis
IEEE Transactions on Computers
The Visualization of Relatedness
IV '08 Proceedings of the 2008 12th International Conference Information Visualisation
Browsing a Large Collection of Community Photos Based on Similarity on GPU
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing, Part II
Visualizing the Intellectual Structure with Paper-Reference Matrices
IEEE Transactions on Visualization and Computer Graphics
Information Retrieval Perspective to Nonlinear Dimensionality Reduction for Data Visualization
The Journal of Machine Learning Research
Two-Phase Mapping for Projecting Massive Data Sets
IEEE Transactions on Visualization and Computer Graphics
Self organization of a massive document collection
IEEE Transactions on Neural Networks
A scalable parallel force-directed graph layout algorithm
EG PGV'08 Proceedings of the 8th Eurographics conference on Parallel Graphics and Visualization
| Hi-index | 0.00 |
This paper presents the Self-Sorting Map (SSM), a novel algorithm for organizing and visualizing data. Given a set of data items and a dissimilarity measure between each pair of them, the SSM places each item into a unique cell of a structured layout, where the most related items are placed together and the unrelated ones are spread apart. The algorithm nicely integrates ideas from dimension reduction techniques, sorting algorithms, and data clustering approaches. Instead of solving the continuous optimizing problem as other dimension reduction approaches do, the SSM transforms it into a discrete labeling problem. As a result, it can organize a set of data into a structured layout without overlapping, providing a simple and intuitive presentation. Experiments on different types of data show that the SSM can be applied to a variety of applications, ranging from visualizing semantic relatedness between articles to organizing image search results based on visual similarities. Our current SSM implementation using Java is fast enough for interactively organizing datasets with hundreds of entries.