On the use of human-computer interaction for projected nearest neighbor search

Data Mining and Knowledge Discovery

Volumn 13, Issue 1, 2006, Pages 89-117

  Aggarwal, Charu C ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

High dimensions; Nearest neighbor search; Projected clustering

Indexed keywords

DATA ACQUISITION; MAN MACHINE SYSTEMS; PATTERN RECOGNITION; PROBLEM SOLVING; VISUAL COMMUNICATION;

DATA SETS; HIGH DIMENSIONS; NEAREST NEIGHBOR SEARCH; PROJECTED CLUSTERING;

HUMAN COMPUTER INTERACTION;

EID: 33745059959     PISSN: 13845810     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10618-005-0030-6     Document Type: Article

References (40)

1. Aggarwal, C.C. 2002. Towards meaningful high dimensional nearest neighbor search by human-computer interaction. In Proceedings of the International Conference on Data Engineering, pp. 593-604.
2. Aggarwal, C.C. 2001. Re-designing distance functions and distance based applications for high dimensional data. ACM SIGMOD Record, 30(1):13-18.
3. Aggarwal, C.C., Hinneburg, A., and Keim, D.A. 2001. On the surprising behavior of distance metrics in high dimensional space. International Conference on Database Theory, pp. 420-434.
4. Aggarwal, C.C. and Yu, P.S. 2000. Finding generalized projected clusters in high dimensional spaces. ACM SIGMOD Conference Proceedings, pp. 70-81.
5. Aggarwal, C.C. 2001. A human-computer cooperative system for effective high dimensional clustering. ACM KDD Conference Proceedings, pp. 221-226.
6. Aggarwal, C.C. and Yu, P.S. 2000. The IGrid Index: Reversing the dimensionality Curse for similarity indexing in high dimensional space. ACM KDD Conference Proceedings, pp. 119-129.
7. Agrawal, R., Gehrke, J., Gunopulos, D., and Raghavan, P. 1998. Automatic subspace clustering of high dimensional data for data mining applications. ACM SIGMOD Conference Proceedings, pp. 94-105.
8. Ankerst, M., Ester, M., and Kriegel, H.-P. 2000. Towards an effective cooperation of the user and the computer for classification. ACM KDD Conference Proceedings, pp. 179-188.
9. Applied Visions Inc. URL: http://www.avi.com
10. Bennett, K.P., Fayyad, U., and Geiger, D. 1999. Density-based indexing for approximate nearest neighbor queries. ACM KDD Conference Proceedings, pp. 233-243.
11. Berchtold, S., Keim, D.A., and Kriegel, H.-P. 1996. The X-Tree: An index structure for high-dimensional data, Very Large Database Conference Proceedings, pp. 28-39.
12. Beyer, K., Ramakrishnan, R., Shaft, U., and Goldstein, J. 1999. When is nearest neighbor meaningful? Proceedings of the International Conference on Database Theory, pp. 217-235.
13. Buja, A., Cook, D., Asimov, D., and Hurley, C. 1997. Dynamic projections in high-dimensional visualization: Theory and Computational Methods, Technical Report, AT&T Labs, Florham Park, NJ.
14. Chakrabarti, K. and Mehrotra, S. 2000. Local dimensionality reduction: A new approach to indexing high dimensional spaces. Very Large Database Conference Proceedings, pp. 89-100.
15. Ester, M., Kriegel, H.-P, Sander, J., Wimmer, M., and Xu, X. 1997. Density-connected sets and their application for trend detection in spatial databases. ACM KDD Conference Proceedings, pp. 10-15.
16. Faloutsos, C., Equitz, W., Niblack, W, Petkovic, D., and Barber, R. 1994. Efficient and effective querying by image content. Journal of Intelligent Information Systems, 3(4):231-262.
17. Friedman, J.H. 1985. Exploration projection pursuit. Journal of the American Statistical Association, pp. 82:249-286.
18. Friedman, J.H. and Tukey, J.W. 1974. A projection pursuit algorithm for exploratory data analysis. IEEE Transactions of Conputers, C23:881-890.
19. Gionis, A., Indyk, P., and Motwani, R. 1999. Similarity search in high dimensions via hashing. Very Large Database Conference Proceedings, pp. 518-529.
20. Han, J., Lakshmanan, L., and Ng, R. 1999. Constraint based multidimensional data mining. IEEE Computer, 32(8):46-50.
21. Hinneburg, A., Aggarwal, C., and Keim, D.A. 2000. What is the nearest neighbor in high dimensional spaces? Proceedings of the VLDB Conference, pp. 506-515.
22. Hinneburg, A., Keim, D.A., and Wawryniuk, M. 1999. HD-Eye: Visual mining of high dimensional data. IEEE Computer Graphics and Applications, 19(5):22-31.
23. Huber, P.J. 1985. Projection pursuit. The Annals of Statistics, 13(2):435-475.
24. Jolliffe, IT. 1986. Principal Component Analysis, Springer-Verlag, New York.
25. Katayama, N. and Satoh , S. 1997. The SR-Tree: An index structure for high dimensional nearest neighbor queries. ACM SIGMOD Conference, pp. 369-380.
26. Katayama, N. and Satoh, S. 2001. Distinctiveness sensitive nearest neighbor sarch for efficient similarity retrieval of multimedia information. Proceedings of the ICDE Conference, pp. 493-502.
27. Keim, D.A. 1995. Visual Support for Query Specification and Data Mining. Ph. D. Thesis, Shaker Publishing Company, Aachen, Germany.
28. Keim, D.A., Kriegel, H.-P., and Seidl, T. 1994. Supporting data mining of large databases by visual feedback queries. ICDE Conference, pp. 302-313.
29. Kruskal, J.B. 1969. Towards a practical method which help uncover the structure of a set of observations by finding the line transformation which optimizes a new index of condensation. In R.C. Milton and J.A. Neider (Eds), Statistical Computation, Academic Press, New York, pp. 427-440.
30. Lin, K.-I., Jagadish, H.V., and Faloutsos, C. 1992. The TV-tree: An index structure for high dimensional data. VLDB Journal, 3(4):517-542.
31. Rui, Y., Huang, T.S., and Mehrotra, S. 1997. Content-based image retrieval with relevance feedback in MARS. Proceedings of the IEEE Conference on Image Processing, pp. 815-818.
32. Salton, G. 1971. THE SMART Retrieval System - Experiments in Automatic Document Processing, Prentice Hall, Englewood Cliffs, NJ.
33. Sarawagi, S. 2000. User-adaptive Exploration of Multidimensional Data. VLDB Conference Proceedings, pp. 307-316.
34. Seidl, T. and Kriegel, H.-P. 1997. Efficient User-Adaptable Similarity Search in Large Multimedia Databases. Very Large Database Conference Proceedings, pp. 506-515.
35. Silverman, B.W. 1986. Density Estimation for Statistics and Data Analysis, Chapman and Hall.
36. Swayne, D.F., Cook, D., and Buja, A. 1998. XGobi: Interactive dynamic data visualization in the X window system. Journal of Computational and Graphical Statistics, 7(1):113-130.
37. Tung, A.K.H., Ng, R., Lakshmanan, L.V.S., and Han, J. 2001. Constraint-based clustering in large databases. International Conference on Database Theory, pp. 405-419.
38. Weber, R., Schek, H.-J., and Blott, S. 1998. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. Very Large Database Conference Proceedings, pp. 194-205.
39. Wu, L., Faloutsos, C., Sycara, K., and Payne, T. 2000. FALCON: Feedback adaptive loop for content-based retrieval. Very Large Database Conference Proceedings, pp. 297-306.
40. Yang, L. 2000. Interactive exploration of very large relational datasets through 3D dynamic projections. ACM KDD Conference Proceedings, pp. 236-243.