Improving hybrid MDS with pivot-based searching

Proceedings - IEEE Symposium on Information Visualization, INFO VIS

Volumn , Issue , 2003, Pages 85-90

  Morrison, Alistair ^a   Chalmers, Matthew ^a  

^a UNIVERSITY OF GLASGOW   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION SYSTEMS; PETROLEUM RESERVOIR EVALUATION;

ABSTRACT DATA; COMPUTATIONAL BOTTLENECKS; FORCE-DIRECTED PLACEMENT; HIGH-DIMENSIONAL; HYBRID ALGORITHMS; MULTI-DIMENSIONAL SCALING; NEAREST-NEIGHBOUR; ORIGINAL MODEL;

VISUALIZATION;

EID: 78649543318     PISSN: 1522404X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/infvis.2003.1249012     Document Type: Conference Paper

References (17)

1. Amenta, N., and Klinger, J. 2002. Visualizing sets of evolutionary trees. In Proceedings InfoVis 2002, IEEE Computer Society, IEEE, 71-74.
2. Andrews, K., Kienreich, W., Sabol, V., Becker, J., Droschl, G., Kappe, F., Granitzer, M., Auer, P., and Tochtermann, K. 2002. The infosky visual explorer: Exploiting hierarchical structure and document similarities. Information Visualization 1, 3/4, 166-181.
3. Baillie, M., and Jose, J. M., 2003. Audio-based event detection for sports video. To appear in Proceedings of the International Conference of Image and Video Retrieval (CIVR 2003).
4. Burkhard, W. A., and Keller, R. M. 1973. Some approaches to best-match file searching. Communications of the ACM 16, 4, 230-236.
5. Chávez, E., Marroquín, J. L., and Navarro, G. 2001. Fixed queries array: A fast and economical data structure for proximity searching. Multimedia Tools and Applications 14, 2, 113-135.
6. Chávez, E., Navarro, G., Baeza-Yates, R., and Marroquín, J. L. 2001. Searching in metric spaces. ACM Computing Surveys 33, 3, 273-321.
7. Chalmers, M. 1996. A linear iteration time layout algorithm for visualising high-dimensional data. In Proceedings of IEEE Visualization 1996, IEEE Computer Society Press, IEEE, 127-132.
8. Fruchterman, T. M. J., and Reingold, E. M. 1991. Graph drawing by force-directed placement. Software - Practice and Experience 21, 11, 1129-1164.
9. Indyk, P., and Motwani, R. 1998. Approximate nearest neighbors: towards removing the curse of dimensionality. In Proceedings of the thirtieth annual ACM symposium on Theory of computing, ACM Press, 604-613.
10. Koren, Y., Carmel, L., and Harel, D. 2002. Ace: A fast multiscale eigenvectors computation for drawing huge graphs. In Proceedings InfoVis 2002, IEEE Computer Society, IEEE, 137-144.
11. MacQueen, J. 1967. Some methods for classification and analysis of multivariate observations. In Proceedings of the Fifth Berkeley Symposium on Mathematics and Probability, University of California Press, Berkeley, 281-297.
12. Minsky, M., and Papert, S. 1969. Perceptrons. MIT Press, Cambridge.
13. Morrison, A., Ross, G., and Chalmers, M. 2002. Combining and comparing clustering and layout algorithms. Tech. Rep. 148, Department of Computing Science, University of Glasgow, November.
14. Morrison, A., Ross, G., and Chalmers, M. 2002. A hybrid layout algorithm for sub-quadratic multidimensional scaling. In Proceedings InfoVis 2002, IEEE Computer Society, IEEE, 152-158.
15. Morrison, A., Ross, G., and Chalmers, M. 2003. Fast multidimensional scaling through sampling, springs and interpolation. Information Visualization 2, 1, 68-77.
16. Rabiner, L., and Juang, B.-H. 1993. Fundamentals of Speech Recognition. Prentice-Hall, Inc.
17. Rodden, K., Basalaj, W., Sinclair, D., and Wood, K. 2001. Does organisation by similarity assist image browsing? In Proceedings of the SIGCHI conference on Human Factors in Computing Systems, ACM Press, 190-197.