Local dimensionality reduction: A new approach to indexing high dimensional spaces

Proceedings of the 26th International Conference on Very Large Data Bases, VLDB'00

Volumn , Issue , 2000, Pages 89-100

  Chakrabarti, Kaushik ^a   Mehrotra, Sharad ^b  

^a Digital Computer Laboratory   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIMENSIONALITY REDUCTION; EMERGING APPLICATIONS; HIGH DIMENSIONAL DATASETS; HIGH DIMENSIONAL SPACES; K-NEAREST-NEIGHBOR QUERIES; MULTI-DIMENSIONAL DATASETS; MULTI-DIMENSIONAL INDEX STRUCTURES; STATE-OF-THE-ART TECHNIQUES;

COST REDUCTION; DATA MINING; DATABASE SYSTEMS; INDEXING (OF INFORMATION); PRINCIPAL COMPONENT ANALYSIS; REDUCTION;

DATA REDUCTION;

EID: 0005287692     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. R. Agarwal, J. Gehrke, D. Gunopolos, and P. Raghavan. Automatic subspace clustering of high dimensional data for data mining applications. Proc. of SIGMOD. 1998.
2. C. Aggarwal, C. Procopiuc, J. Wolf, P. Yu, and J. Park. Fast algorithms for projected clustering. Proc. of SIGMOD. 1999.
3. S. Berchiold, D. A. Keim, and H. P. Knegel. The s-tree: An index structure for high-dimensional data. Proc. of VLDB, 1996.
4. K. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft. When is "nearest neighbor" meaningful? Proc. of ICDT. 1998.
5. K. Chakrabarti and S. Mehro(ra. The hybrid tree: An index struclure for high dimensional feature spaces. Proceedings of the IEEE lntenwjionoJ Conference on Data Engineering. March 1999.
6. K. Chakabartj and S. Mehro(ra, Local dimensionality reduction: A new approach to indexing high dimensional spaces. Technical Report, TR-MARS-OO-04, University of Coltforn.a at Irvine, http.//Www-db.tcs.uci.edwpages/pubiications/ , 2000.
7. C. Faloutsos, W. Equitz, M. Flickner, W. Niblack, D. Peikovic, and R. Barber. Efficient and effective querying by image content. In Journal of Intelligent Information Systems, Vol. 3, No. 3/4. pages 231-262. July 1994.
8. C. Faloutsos and K.-I. D. Liii. Fastmap: A fast algorithm for indexing, data-mining and visualization of traditional and multi- media datasets. In Proc. ACM SIGMOD. pages 163-174, May 1995.
9. K. Fukunaga. Introduction to Statistical Pastern Recognition. Academic Press, second edition edition, 1990.
10. T. Gonzalez. austeiing to minimize the maximum intercluste distance. Theoretical Computer Science, 1985.
11. J. Gray and A. Reuter. Transaction Processing: Concepts and Techniques. Moipn Kaufmann, Saji Matco, CA, 1993.
12. S. Guha, R. Raslogi. and K. Shim. Cure: An efficient clustering algonthm for large databases. Proc. of SIGMOD, 1998.
13. A. Gunman, k-trees: A dynamic index stnacture for spatial searching. In Proc. ACM SIGMOD Conf. pp. 47-57., 1984.
14. K. V. R. Kanth, D. Agrawal. and A. K. Siagh. DimeasjonaJ redectice for similarity searching dynamic databases. Proc. of SIGMOD, 1998.
15. N. Katayama and S. Such. The sr-tree: An index structure for high dimen,iona) nearest neighbor queries. Proc. of SJGMOD, '997.
16. K. Liii, H. V. Jagadish, and C. Faloutsos. The TV-tree - an index slucture for high dimensional data. In VU)R Journal, 1994.
17. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
18. R. Ng and J. Han. Efficient and effective clustering methods for spatial data mining. Proc. of VLDB, 1994.
19. M. Thomas, C. Carson, and J. Hellerstein, Creating a customized access method for blobworld. Prnc. of ICDE, 2000.
20. R. Weber, H. Schek, and S. Blott. A quantitative analysis and performance study for similarity-search methods in high dimensional spaces. Proc. of VLDB. 1998.
21. T. Zhang, R. Ramaknshnan, and M. Livny. Birch: An efficient data clustering method for very large databases. Proc. of SIGMOD. 1996.