Hakan Ferhatosmanoglu, Ertem Tuncel, Divyakant Agrawal, Amr El Abbadi  Home/Search
Context Related
Links: ACM DBLP | ucsb.edu/~hakan/publication...approx.ps 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: ucsb.edu/~hakan/publicati...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper, we develop a general framework for approximate nearest neighbor queries. We first categorize the current approaches for nearest neighbor query processing based on either their ability to reduce the data set that needs to be examined, or their ability to reduce the representation of each data object. We first propose modifications to well-known techniques to support the progressive processing of approximate nearest neighbor queries. A user may therefore stop the retrieval... (Update)
Cited by: More
Exploring Bit-Difference for Approximate KNN Search in.. - Cui, Shen, Shen, Tan (2005) (Correct)
Efficiency-Quality Tradeoffs for Vector Score Aggregation - Singitham, Mahabhashyam.. (2004) (Correct)
Analysis and Comparison of Methods and Algorithms.. - Catarci, Ciaccia.. (2000) (Correct)
Similar documents (at the sentence level):
56.7%: Approximate Nearest Neighbor Searching in Multimedia.. - Ferhatosmanoglu.. (2001) (Correct)
Active bibliography (related documents): More All
1.0: VQ-Index: An Index Structure for Similarity Searching.. - Tuncel.. (2002) (Correct)
0.8: Efficient Processing of Conical Queries - Ferhatosmanoglu, Agrawal, Abbadi (2001) (Correct)
0.6: Vector Approximation based Indexing for Non-uniform.. - Ferhatosmanoglu.. (2000) (Correct)
Similar documents based on text: More All
0.5: Optimal Partitioning for Efficient I/O in Spatial Databases - Ferhatosmanoglu, Agrawal, .. (Correct)
0.4: Constrained Nearest Neighbor Queries - Ferhatosmanoglu, Stanoi, Agrawal.. (2001) (Correct)
0.4: Synchronization in Nested Transactions - Resende (Correct)
Related documents from co-citation: More All
8: Nearest neighbor queries - Roussopoulos, Kelley et al. - 1995
6: A quantitative analysis and performance study for Similarity Search Methods in H.. - Weber, Schek et al. - 1998
6: An optimal algorithm for approximate nearest neighbor searching - Arya, Mount et al. - 1994
BibTeX entry: (Update)
H. Ferhatosmanoglu, E. Tuncel, D. Agrawal, and A. El Abbadi. Approximate nearest neighbor searching in multimedia databases. Technical Report TRCS00-24, Comp. Sci. Dept., UC, Santa Barbara, 2000. http://citeseer.ist.psu.edu/article/ferhatosmanoglu01approximate.html More
@inproceedings{ ferhatosmanoglu01approximate,
author = "Hakan Ferhatosmanoglu and Ertem Tuncel and Divyakant Agrawal and Amr El Abbadi",
title = "Approximate Nearest Neighbor Searching in Multimedia Databases",
booktitle = "{ICDE}",
pages = "503-511",
year = "2001",
url = "citeseer.ist.psu.edu/article/ferhatosmanoglu01approximate.html" }
Citations (may not include all citations):765 trees: A dynamic index structure for spatial searching (context) - Guttman - 1984
534 An algorithm for vector quantizer design (context) - Linde, Buzo et al. - 1980
516 tree: An efficient and robust access method for points and r.. (context) - Beckmann, Kriegel et al. - 1990
443 Discrete-Time Signal Processing (context) - Oppenheim, Schafer - 1989
283 Some methods for classification and analysis of multivariate.. - MacQueen - 1967
283 Efficient and effective querying by image content - Faloutsos, Barber et al. - 1994 ACM DBLP
266 An optimal algorithm for approximate nearest neighbor search.. - Arya, Mount et al. - 1994 ACM DBLP
220 Texture features for browsing and retrieval of image data (context) - Manjunath, Ma - 1996
205 Efficient similarity search in sequence databases - Agrawal, Faloutsos et al. - 1993 ACM DBLP
204 tree: An index structure for high-dimensional data (context) - Berchtold, Keim et al. - 1996
193 Nearest neighbor queries - Roussopoulos, Kelly et al. - 1995 ACM DBLP
162 Similarity indexing with the SS-tree (context) - White, Jain - 1996
147 A quantitative analysis and performance study for similarity.. - Weber, Schek et al. - 1998 ACM DBLP
121 A cost model for nearest neighbor search in high-dimensional.. (context) - Berchtold, Bohm et al. - 1997 ACM DBLP
111 Digital Image Processing (context) - Castleman - 1996 ACM
97 The TV-tree: An index structure for high-dimensional data - Lin, Jagadish et al. - 1995
88 The hb-tree: A multi-attribute indexing method with good gua.. (context) - Lomet, Salzberg - 1990
86 The Pyramid-Technique: Towards breaking the curse of dimensi.. (context) - Berchtold, Bohm et al. - 1998 DBLP
75 The Asilomar report on database research (context) - Bernstein, Brodie et al. - 1998 ACM DBLP
72 nearest neighbor (context) - Beyer, Goldstein et al. - 1999
70 Active disks: Programming model (context) - Acharya, Uysal et al. - 1998
50 The hybrid tree: An index structure for high dimensional fea.. - Chakrabarti, Mehrotra - 1999 DBLP
47 The kdb-tree: A search structure for large multi-dimensional.. (context) - Robinson - 1981
43 Dimensionality reduction for similarity searching in dynamic.. - Kanth, Agrawal et al. - 1998
41 Approximate range searching - Arya, Mount - 1995 ACM DBLP
38 Principles of Multimedia Database Systems (context) - Subrahmanian - 1999 ACM
33 Efficient user-adaptable similarity search in large multimed.. - Seidl - 1997
22 Scalable access within the context of digital libraries - Cheng, Dolin et al. - 1997 ACM DBLP
18 Uber lineare methoden in der wahrscheinlich-keitsrechnung (context) - Karhunen - 1947
14 Vector approximation based indexing for non-uniform high dim.. - Ferhatosmanoglu, Tuncel et al. - 2000
13 Approximate similarity retrieval with M-trees (context) - Zezula, Savino et al. - 1998
13 Concentric hyperspaces and disk allocation for fast parallel.. - Ferhatosmanoglu, Agrawal et al. - 1999
12 PAC nearest neighbor queries: Approximate and controlled sea.. (context) - Ciaccia, Patella - 2000 DBLP
10 Trading quality for time with nearest-neighbor search - Weber, Bohm - 2000
10 Similarity searching in high dimensions via hashing (context) - Gionis, Indyk et al. - 1999
9 Airphoto dataset (context) - Manjunath - 2000
7 Modern Signal Processing (context) - Kailath - 1985 ACM
6 Circular data-space partitioning for similarity queries and .. - Egecioglu, Ferhatosmanoglu - 1999 ACM
5 Dynamic dimensionality reduction and similarity distance com.. - Egecioglu, Ferhatosmanoglu - 1999
5 Processus Stochastiques et Mouvement Brownien (context) - Loeve, de seconde - 1948
3 Clustering declustered data for efficient retrieval - Ferhatosmanoglu, Agrawal et al. - 1999 ACM DBLP
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.ucsb.edu/~hakan/publications/index.html): More
Dynamic Dimensionality Reduction and Similarity.. - Egecioglu.. (1999) (Correct)
Circular Data-Space Partitioning For Similarity Queries .. - Egecioglu.. (1999) (Correct)
Clustering Declustered Data for Efficient Retrieval - Ferhatosmanoglu, Agrawal.. (1999) (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