|
ABSTRACT
In Information Visualization, adding and removing data elements can strongly impact the underlying visual space. We introduce a chess board analogy for displaying (projecting) objects from a dynamic set on a 2D space, considering their similarity in a higher dimensional space. Our solution is inherently incremental and maintains a coherent disposition of elements, even for completely renewed sets. The algorithm considers relative positions, rather than raw dissimilarity. It has low computational cost, and its complexity depends only on the size of the currently viewed subset, V. Thus, a set of size N can be sequentially displayed in O(N) time, reaching at most O(N2) only if viewing the whole set at once. Consistent results were obtained as compared to (non-incremental) multidimensional scaling solutions. Moreover, the corresponding visualization is not susceptible to occlusion. The technique was tested in different domains, being particularly adequate to display dynamic corpora.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
D. Alahakoon, S. Halgamuge, and B. Srinivasan. Dynamic Self-Organizing Maps with Controlled Growth for Knowledge Discovery. IEEE Trans. On Neural Networks, 11(3):601--614, 2000.
|
| |
2
|
|
| |
3
|
A. Asuncion and D. Newman. UCI machine learning repository. University of California, Irvine, School of Information and Computer Sciences, http://www.ics.uci.edu/~mlearn/MLRepository.html, 2007.
|
| |
4
|
M. Barioni, E. Botelho, C. Faloutsos, H. Razente, A. Traina, and C. Júnior. Data Visualization in RDBMS. In Proc. IASTED Int. Conf. Information Systems and Databases ISDB, pages 264--269, 2002.
|
| |
5
|
W. Basalaj. Proximity Visualization of Abstract Data. PhD thesis, University of Cambridge Computer Lab, 2000.
|
 |
6
|
|
| |
7
|
J. Blackmore and R. Miikkulainen. Visualizing high-dimensional structure with the incremental grid growing neural network. In Proc. 12th Int. Conf. on Machine Learning, pages 55--63, San Francisco, CA, USA, 1995.
|
| |
8
|
K. Borner, C. Chen, and K. Boyack. Visualizing Knowledge Domains. Annual Review of Information Science and Technology ARIST, 37:179--255, 2003.
|
| |
9
|
|
| |
10
|
|
| |
11
|
|
| |
12
|
I. T. Jolliffe. Principal component analysis {electronic resource}. Springer, 2002.
|
| |
13
|
S. Kaski. Data Exploration Using Self-Organizing Maps. PhD thesis, Finnish Academy of Technology, 1997.
|
| |
14
|
S. Kaski, T. Honkela, K. Lagus, and T. Kohonen. WEBSOM--Self-organizing maps of document collections. Neurocomputing, 21(1-3):101--117, 1998.
|
| |
15
|
J. Kruskal. Nonmetric multidimensional scaling: A numerical method. Psychometrika, 29(2):115--129, 1964.
|
| |
16
|
J. Kruskal and M. Wish. Multidimensional Scaling. Sage Publications, 1978.
|
| |
17
|
J. B. Kruskal. Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis. Psychometrika, 29:1--27, 1964.
|
| |
18
|
|
| |
19
|
M. Law, N. Zhang, and A. Jain. Nonlinear Manifold Learning for Data Stream. Proc. SIAM Data Mining, pages 33--44, 2004.
|
| |
20
|
|
| |
21
|
A. Lopes, R. Minghim, V. Melo, and F. Paulovich. Mapping texts through dimensionality reduction and visualization techniques for interactive exploration of document collections. Proc. of SPIE, 6060:271--282, 2006.
|
| |
22
|
|
 |
23
|
|
| |
24
|
A. Nurnberger and M. Detyniecki. Visualizing changes in data collections using growing self-organizing maps. In Proc. Int. Joint Conf. on Neural Networks IJCNN'02, volume 2, pages 1912--1917, 2002.
|
| |
25
|
|
| |
26
|
|
| |
27
|
|
| |
28
|
|
 |
29
|
Kerry Rodden , Wojciech Basalaj , David Sinclair , Kenneth Wood, Does organisation by similarity assist image browsing?, Proceedings of the SIGCHI conference on Human factors in computing systems, p.190-197, March 2001, Seattle, Washington, United States
[doi> 10.1145/365024.365097]
|
| |
30
|
|
| |
31
|
|
|