Songrit Maneewongvatana, David M. Mount  Home/Search
Context Related
| umd.edu/~mount/Papers/dimacs99.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: umd.edu/~mount/pubs (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Nearest neighbor searching is a fundamental computational problem. (Update)
Context of citations to this paper: More
.... ANN library as an alternative to the standard kd tree splitting rule for clustered data sets [MA97] It was analyzed empirically in [MM99] where it was shown to be significantly more efficient than the standard kd tree for a number of clustered distributions. Arya and Fu...
...and from real applications. We implemented a simpler variant of the BBD tree, which constructs a kd tree using the sliding midpoint rule [29]. This decomposition method was chosen because our studies have shown that it performs better than the standard kd tree decomposition...
Cited by: More
On the Efficiency of Nearest Neighbor Searching with Data .. - Maneewongvatana, Mount (Correct)
Efficient Expected-Case Algorithms for Planar Point Location - Arya, Cheng, Mount, Ramesh (2000) (Correct)
The Analysis of a Simple k-Means Clustering Algorithm - Kanungo, Mount.. (2000) (Correct)
Similar documents (at the sentence level):
59.7%: Analysis of Approximate Nearest Neighbor Searching with.. - Maneewongvatana, Mount (1999) (Correct)
Active bibliography (related documents): More All
0.4: Expected-Case Complexity of Approximate Nearest Neighbor Searching - Arya, Fu (2000) (Correct)
0.2: It's Okay to Be Skinny, If Your Friends Are Fat - Maneewongvatana, Mount (1999) (Correct)
0.2: Approximate Nearest Neighbors: Towards Removing the Curse of.. - Indyk, Motwani (1998) (Correct)
Similar documents based on text: More All
0.5: An Empirical Study of a New Approach to Nearest Neighbor.. - Maneewongvatana, Mount (2001) (Correct)
0.4: The Analysis of a Probabilistic Approach to - Nearest Neighbor Searching (Correct)
0.2: ANN Programming Manual - Mount (1998) (Correct)
Related documents from co-citation: More All
6: ANN: A library for approximate nearest neighbor searching - Mount, Arya - 1997
6: An optimal algorithm for approximate nearest neighbor searching - Arya, Mount et al. - 1994
5: Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees - Duncan, Goodrich et al. - 1999
BibTeX entry: (Update)
S. Maneewongvatana and D. M. Mount. Analysis of approximate nearest neighbor searching with clustered point sets. In ALENEX, 1999. http://citeseer.ist.psu.edu/maneewongvatana99analysis.html More
@misc{ maneewongvatana99analysis,
author = "S. Maneewongvatana and D. Mount",
title = "Analysis of approximate nearest neighbor searching with clustered point
sets",
text = "S. Maneewongvatana and D. M. Mount. Analysis of approximate nearest neighbor
searching with clustered point sets. In ALENEX, 1999.",
year = "1999",
url = "citeseer.ist.psu.edu/maneewongvatana99analysis.html" }
Citations (may not include all citations):2133 Pattern classification and scene analysis (context) - Duda, Hart - 1973
1262 Classification and regression trees (context) - Breiman, Friedman et al. - 1984
805 Algorithms for clustering data (context) - Jain, Dubes - 1988
643 Query by image and video content: The QBIC system (context) - Flickner, Sawhney et al. - 1995
474 Advances in knowledge discovery and data mining (context) - Fayyad, Piatetsky-Shapiro et al. - 1996
346 Multidimensional binary search trees used for associative se.. (context) - Bentley - 1975
345 Vector quantization and signal compression (context) - Gersho, Gray - 1992
286 Nearest neighbor pattern classification (context) - Cover, Hart - 1967
283 Some methods for classification and analysis of multivariate.. - MacQueen - 1967
266 An optimal algorithm for approximate nearest neighbor search.. - Arya, Mount et al. - 1998
247 An algorithm for finding best matches in logarithmic expecte.. (context) - Friedman, Bentley et al. - 1977
233 tree: A dynamic index for multi-dimensional objects - Sellis, Roussopoulos et al. - 1987
204 tree: An index structure for high-dimensional data (context) - Berchtold, Keim et al. - 1996
171 A weighted nearest neighbor algorithm for learning with symb.. - Cost, Salzberg - 1993
165 The SR-tree: An index structure for high-dimensional nearest.. - Katayama, Satoh - 1997
165 Approximate nearest neighbors: Towards removing the curse of.. - Indyk, Motwani - 1998
97 The TV-tree: An index structure for high-dimensional data - Lin, Jagdish et al. - 1994
91 Two algorithms for nearest-neighbor search in high dimension - Kleinberg - 1997
59 cient and robust access method for points and rectangles (context) - Beckmann, Kriegel et al. - 1990
53 Nearest neighbor queries in metric spaces (context) - Clarkson - 1997
52 Refinements to nearest-neighbor searching in k-dimensional t.. (context) - Sproull - 1991
45 An algorithm for approximate closest-point queries (context) - Clarkson - 1994
36 Algorithms for fast vector quantization - Arya, Mount - 1993
35 Approximate nearest neighbor queries in fixed dimensions - Arya, Mount - 1993
34 An improvement of the minimum distortion encoding algorithm .. (context) - Bei, Gray - 1985
33 Approximate closest-point queries in high dimensions (context) - Bern - 1993
27 Approximate nearest neighbor queries revisited - Chan - 1997
21 cient search for approximate nearest neighbor in high dimems.. (context) - Kushilevitz, Ostrovsky et al. - 1998
19 Private communication (context) - Mitchell - 1993
18 Ann: A library for approximate nearest neighbor searching - Mount, Arya - 1997
10 Nearest neighbor methods in discrimination (context) - Devroye, Wagner - 1982
6 Technical Report VCL (context) - White, Jain et al. - 1996
4 It's okay to be skinny (context) - Maneewongvatana, Mount - 1999
1 Indexing by latend semantic analysis (context) - Deerwester, Dumals et al. - 1990
1 Cluster analysis of multivariate data: E#ciency vs (context) - Forgey - 1965
Documents on the same site (http://www.cs.umd.edu/~mount/pubs.html): More
Efficient Randomized Algorithms for Robust Estimation of.. - Mount, Netanyahu (1997) (Correct)
Approximate Range Searching - Arya, Mount (1995) (Correct)
An Efficient k-Means Clustering Algorithm.. - Kanungo, Mount.. (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC