A pivot-based routine for improved parent-finding in hybrid MDS

Information Visualization

Volumn 3, Issue 2, 2004, Pages 109-122

  Morrison, Alistair ^a   Chalmers, Matthew ^a  

^a UNIVERSITY OF GLASGOW   (United Kingdom)

Author keywords

force directed placement; hybrid algorithms; MDS; multidimensional scaling; near neighbour search; pivots; spring models

Indexed keywords

EID: 84998014096     PISSN: 14738716     EISSN: 14738724     Source Type: Journal    
DOI: 10.1057/palgrave.ivs.9500069     Document Type: Article

References (36)

1. Morrison A, Chalmers M. Improving hybrid MDS with pivot-based searching. Proceedings of the IEEE Symposium on Information Visualization 2003, IEEE Computer Society: New York, 2003; 85–90.
2. Andrews K, Kienreich W, Sabol V, Becker J, Droschl G, Kappe F, Granitzer M, Auer P, Tochtermann K. The infosky visual explorer: Exploiting hierarchical structure and document similarities. Information Visualization 2002; 1: 166–181.
3. Rodden K, Basalaj W, Sinclair D, Wood K. Does organisation by similarity assist image browsing?. Proceedings of the SIGCHI conference on Human Factors in Computing Systems, ACM Press: New York, 2001; 190–197.
4. Amenta N, Klinger J. Visualizing sets of evolutionary trees. Proceedings of the IEEE Symposium on Information Visualization 2002, IEEE, IEEE Computer Society: New York, 2002; 71–74.
5. Koren Y, Carmel L, Harel D. ACE: a fast multiscale eigenvectors computation for drawing huge graphs. Proceedings of the IEEE Symposium on Information Visualization 2002, IEEE Computer Society: New York, 2002; 137–144.
6. Fruchterman TMJ, Reingold EM. Graph drawing by force-directed placement. Software – Practice and Experience 1991; 21 (11): 1129–1164.
7. Chalmers M. A linear iteration time layout algorithm for visualising high-dimensional data. Proceedings of IEEE Visualization 1996, IEEE Computer Society Press: New York, 1996; 127–132.
8. Morrison A, Ross G, Chalmers M. A hybrid layout algorithm for subquadratic multidimensional scaling. Proceedings of the IEEE Symposium on Information Visualization 2002, IEEE, IEEE Computer Society: New York, 2002; 152–158.
9. Morrison A, Ross G, Chalmers M. Fast multidimensional scaling through sampling, springs and interpolation. Information Visualization 2003; 2 (1): 68–77.
10. Oja E. A simplified neuron model as a principal component analyzer. Journal of Mathematical Biology 1982; 15: 267–273.
11. Borg I, Groenen PJF. Modern Multidimensional Scaling Theory and Applications. Springer-Verlag: New York, 1997.
12. Torgerson WS. Multidimensional scaling: I. Theory and method. Psychometrika 1952; 17: 401–419.
13. Shepard RN. Multidimensional scaling with an unknown distance function. i. Psychometrika 1962; 27 (2): 125–140.
14. Kruskal JB. Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis. Psychometrika 1964; 29 (1): 1–27.
15. Carroll JD, Chang J. Analysis of individual differences in multidimensional scaling via an n-way generalization of ‘Eckart-Young’ decomposition. Psychometrika 1970; 35: 283–319.
16. Kruskal JB, Wish M. Multidimensional Scaling. Sage Publications: Beverly Hills, CA, 1978.
17. Frick A, Ludwig A, Mehldau H. A fast adaptive layout algorithm for undirected graphs. In: Tamassia R, Tollis IG, (Eds). Proceedings of the DIMACS Int. Work. Graph Drawing GD, Berlin, Germany: Springer-Verlag, 1994; 388–403.
18. Eades P. A heuristic for graph drawing. Congressus Numerantium 1984; 42: 149–160.
19. Ross G, Chalmers M. A visual workspace for hybrid multidimensional scaling algorithms. Proceedings of the IEEE Symposium on Information Visualization 2003, IEEE Computer Society: New York, 2003; 91–96.
20. Gionis A, Indyk P, Motwani R. Similarity search in high dimensions via hashing. Proceedings of 25th International Conference on Very Large Data Bases 1999; 518–529.
21. Chávez E, Navarro G, Baeza-Yates R, Marroquín JL. Searching in metric spaces. ACM Computing Surveys 2001; 33 (3): 273–321.
22. Brin S. Near neighbor search in large metric spaces. Proceedings of the 21st Conference on Very Large Databases 1995; 574–584.
23. Ciaccia P, Patella M, Zezula P. M-tree: an efficient access method for similarity search in metric spaces. Proceedings of the 23rd Conference on Very Large Data Bases 1997; 426–435.
24. Aurenhammer F. Voronoi diagrams: A survey of a fundamental geometric data structure. ACM Computing Surveys 1991; 23 (3): 345–405.
25. Burkhard WA, Keller RM. Some approaches to best-match file searching. Communications of the ACM 1973; 16 (4): 230–236.
26. Vidal E. An algorithm for finding nearest neighbours in (approximately) constant average time. Pattern Recognition Letters 1986; 4: 145–157.
27. Bourgain J. On lipschitz embedding of finite metric spaces into hilbert space. Israel Journal of Mathematics 1985; 52: 46–52.
28. Minsky M, Papert S. Perceptrons. MIT Press: Cambridge, 1969.
29. Indyk P, Motwani R. Approximate nearest neighbors: towards removing the curse of dimensionality. Proceedings of the 30th Annual ACM Symposium on Theory of Computing, ACM Press: New York, 1998; 604–613.
30. Maneewongvatana S, Mount DM. On the efficiency of nearest neighbor searching with data clustered in lower dimensions. International Conference on Computational Science 2001; 842–851.
31. Chávez E, Marroquín JL, Navarro JL. Fixed queries array: A fast and economical data structure for proximity searching. Multimedia Tools and Applications 2001; 14 (2): 113–135.
32. Baillie M, Jose JM. Audio-based event detection for sports video. Proceedings of the International Conference of Image and Video Retrieval, Springer: Berlin, 2003.
33. Rabiner L, Juang B-H. Fundamentals of Speech Recognition. Prentice-Hall, Inc.: NJ, 1993.
34. MacQueen J. Some methods for classification and analysis of multivariate observations. Proceedings of the Fifth Berkeley Symposium on Mathematics and Probability, University of California Press: Berkeley, 1967; 281–297.
35. Morrison A, Ross G, Chalmers M. Combining and comparing clustering and layout algorithms. Technical Report 148, Department of Computing Science, University of Glasgow, November 2002.
36. Ross G, Chalmers M. A visual workspace for constructing hybrid multidimensional scaling algorithms and coordinating multiple views. Information Visualization 2003; 2 (4): 247–257.