When is nearest neighbor meaningful pdf

Faloutsos and V. Analysis of n-dimensional trivial solutions e. References [17] C. Faloutsos and I. Beyond uniformity and inde- pendence: Analysis of R-trees using the concept of frac- [1] R. Agrawal, C. Faloutsos, and A.

Fayyad and P. Automated analysis and [2] S. Altschul, W. Gish, W. Miller, E. Myers, and D. Basic local alignment search tool. Journal of challenges. Ang, Zhao Li, and S. Image retrieval [19] N. Katayama and S. The SR-tree: An index based on multidimensional feature properties. In SPIE structure for high-dimensional nearest neighbor queries.

Nearest Neighbor Searching and Applications. PhD thesis, Univ. Lin, H. Jagadish, and C. The TV- [5] S. Arya, D. Mount, and O. Accounting Tree: An index structure for high-dimensional data. Manjunath and W. Mount, N. Netanyahu, R. Mehrotra and J. In 9th Data Engineering Conference, [7] R. Adaptive Control Processes. University Press, Murase and S.

Visual learning and recogni- [8] A. Belussi and C. Estimating the selectivity of tion of 3D objects from appearance. Nene and S. A simple algorithm for [9] J. Bentley, B. Weide, and A. Opti- nearest neighbor search in high dimensions. In IEEE mal expected-time algorithms for closest point problem.

Pentland, R. Picard, and S. Photo- [10] S. Berchtold, C. Keim, book: Tools for content based manipulation of image and H. Fast parallel similarity search in mul- databases. Multivariate Density Estimation. Interscience, Keim, and H. Swain and D. Color indexing. Swets and J. Analysis and Machine Learning, volume 18 8 , pages [12] M. Taubin and D.

Recognition and position- Beyer, J. Goldstein, R. Ramakrishnan, and U. When is nearest neighbors meaningful? Technical [30] D. White and R. Wisconsin-Madison, June Open navigation menu. Close suggestions Search Search. User Settings. Skip carousel. Carousel Previous. Carousel Next.

What is Scribd? When Is Nearest Neighbor Meaningful. Uploaded by tobytripp. Did you find this document useful? Is this content inappropriate? Report this Document. In Information Processing Letters, Vol.

Beyer, K. Technical Report No. TR, Computer Sciences Dept. Bozkaya, T. Faloutsos, C. Fayyad, U. In Journal of intelligent information systems, Vol. Katayama, N. Lin, K. Manjunath, B. Mehrotra, R. Murase, H. In Int. Nene, S. Pentland, A. Scott, D. Wiley Interscience, Chapter 2 Google Scholar. Shaft, U. Background Citations. Methods Citations.

Results Citations. Figures and Topics from this paper. Citation Type. Has PDF. Publication Type. More Filters. Non-parametric detection of meaningless distances in high dimensional data. View 15 excerpts, cites results, background and methods.

View 2 excerpts, cites background. Multiplicative distance: a method to alleviate distance instability for high-dimensional data. View 1 excerpt, cites background. Can unbounded distance measures mitigate the curse of dimensionality?

Highly Influenced. View 6 excerpts, cites background. It turns out that , in these settings , the answer to the first two questions recovers.