Clustering and Singular Value Decomposition for Approximate Indexing in High Dimensional Spaces

International Conference on Information and Knowledge Management, Proceedings

Volumn 1998-January, Issue , 1998, Pages 201-207

  Thomasian, Alexander ^a   Castelli, Vittorio ^a   Li, Chung Sheng ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

CONTENT BASED RETRIEVAL; DATA MINING; INDEXING (OF INFORMATION); NEAREST NEIGHBOR SEARCH; REDUCTION;

CLUSTERINGS; CONTENT-BASED RETRIEVAL; DATA-INTENSIVE APPLICATION; DIMENSIONALITY REDUCTION; FEATURE SPACE; HIGH DIMENSIONAL SPACES; HIGH DIMENSIONALITY; NEAREST-NEIGHBOR QUERY; SINGULAR VALUE DECOMPOSITION METHOD; TOTAL VARIANCE;

SINGULAR VALUE DECOMPOSITION;

EID: 0742328140     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/288627.288658     Document Type: Conference Paper

References (15)

1. Beatty, M., and Manjunath, B. Dimensionality reduction using multi-dimensional scaling for content-based retrieval. In Proc. IEEE Int'l Conf. Image Process. ICIP'97 (Santa Barbara, CA, Oct. 1997), vol. 2, pp. 835-838.
2. Berchtold, S., Keim, D. A., and Kriegel, H.-P. The X-tree: An index structure for high-dimensional data. In Proc. 22nd Int'l Conf. on VLDB (Bombay, India, Sept. 1996), pp. 28-39.
3. Berchtold, S. et al. A cost model for nearest neighbor search in high-dimensional data space. In Proc. 16th ACM Symp. on Principles of Database Systems (Tucson, AZ, May 1997), pp. 78-86.
4. Berchtold, S. et al. Fast parallel similarity search in multimedia databases. In Proc. SIGMOD Conf. 97 (Tucson, AZ, May 12-15 1997), pp. 1-12.
5. Blott, S., and Weber, R. A simple vector-approximation file for similarity search in high-dimensional vector spaces. Tech. rep., Institute of Information Systems, ETH, Zurich, Switzerland, 1997.
6. Cherkassky, V., Friedman, J., and Wechsler, H. From Statistics to Neural Networks: Theory and Pattern Recognition Application. Springer-Verlag, New York, 1993.
7. Everitt, B. Cluster Analysis, 3rd ed. John Wiley & Sons, 1993.
8. Faloutsos, C. Searching Multimedia Databases by Content. Kluwer Academic Publishers, Boston, 1996.
9. Gaede, B. V., and Gunther, O. Mutidimensional access methods. A CM Computing Surveys (to appear in 1998).
10. Jolliffe, I. T. Principal Component Analysis. Springer-Verlag, New York, 1986.
11. Kim, B. S., and Park, S. B. A fast k nearest neighbor finding algorithm based on the ordered partition. IEEE Trans. on Pattern Analysis and Machine Intelligence PAMI 8, 6 (Nov 1986), 761-766.
12. Korn, F., Jagadish, H. V., and Faloutsos, C. Efficiently supporting ad hoc queries in large datasets of time sequences. In Proc. ACM SIGMOD Int'l Conf. (Tucson, AZ, May 1997), pp. 289-300.
13. Linde, Y., Buzo, A., and Gray, R. An algorithm for vector quantizer design. IEEE Trans. Communications COM-28, 1 (Jan. 1980), 84-95.
14. Press, W.H. et al. Numerical Recipes in C Prentice-Hall, 1993.
15. Russopoulos, N., Kelley, S., and Vincent, F. Narest neighbor queries. In Proc. ACM SIGMOD Int'l Conf. (San Jose, CA, May 1995), pp. 71-79.