Two algorithms for nearest-neighbor search in high dimensions

Locality-preserving hashing in multidimensional spaces

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing

Trees and Euclidean metrics

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing

Approximate nearest neighbors: towards removing the curse of dimensionality

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing

Efficient search for approximate nearest neighbor in high dimensional spaces

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing

Effective nearest neighbors searching on the hyper-cube, with applications to molecular clustering

Proceedings of the fourteenth annual symposium on Computational geometry

An optimal algorithm for approximate nearest neighbor searching fixed dimensions

Journal of the ACM (JACM)

A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing

Lower bounds for high dimensional nearest neighbor search and related problems

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing

Sublinear time algorithms for metric space problems

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing

Subquadratic approximation algorithms for clustering problems in high dimensional spaces

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing

Tighter bounds for nearest neighbor search and related problems in the cell probe model

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing

Approximate nearest neighbors and sequence comparison with block operations

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing

Finding generalized projected clusters in high dimensional spaces

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data

Locally lifting the curse of dimensionality for nearest neighbor search (extended abstract)

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms

Dimensionality reduction techniques for proximity problems

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms

Expected-case complexity of approximate nearest neighbor searching

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms

Approximation algorithms for projective clustering

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms

Reductions among high dimensional proximity problems

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms

Database-friendly random projections

PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

Exact L∞ nearest neighbor search in high dimensions

SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry

Random projection in dimensionality reduction: applications to image and text data

Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining

Polynomial-time approximation schemes for geometric min-sum median clustering

Journal of the ACM (JACM)

Approximate nearest neighbor algorithms for Frechet distance via product metrics

Proceedings of the eighteenth annual symposium on Computational geometry

The nearest neighbor

Computational Discrete Mathematics

On computing the diameter of a point set in high dimensional Euclidean space

Theoretical Computer Science

Redefining Clustering for High-Dimensional Applications

IEEE Transactions on Knowledge and Data Engineering

Clustering for Approximate Similarity Search in High-Dimensional Spaces

IEEE Transactions on Knowledge and Data Engineering

High-dimensional nearest neighbor search with remote data centers

Knowledge and Information Systems

Approximation of protein structure for fast similarity measures

RECOMB '03 Proceedings of the seventh annual international conference on Research in computational molecular biology

Pass efficient algorithms for approximating large matrices

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms

Better algorithms for high-dimensional proximity problems via asymmetric embeddings

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms

An Efficient Incremental Lower Bound Approach for Solving Approximate Nearest-Neighbor Problem of Complex Vague Queries

FQAS '02 Proceedings of the 5th International Conference on Flexible Query Answering Systems

Indexing and Dictionary Matching with One Error

WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures

An Empirical Study of a New Approach to Nearest Neighbor Searching

ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation

Search and Classification of High Dimensional Data

APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization

Efficient Image Retrieval through Vantage Objects

VISUAL '99 Proceedings of the Third International Conference on Visual Information and Information Systems

On Computing the Diameter of a Point Set in High Dimensional Euclidean Space

ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms

A Fast Descriptor Matching Algorithm for Exhaustive Search in Large Databases

PCM '01 Proceedings of the Second IEEE Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing

Nearest Neighbor Queries in a Mobile Environment

STDBM '99 Proceedings of the International Workshop on Spatio-Temporal Database Management

An Architecture of a Web-Based Collaborative Image Search Engine

On the Move to Meaningful Internet Systems, 2002 - DOA/CoopIS/ODBASE 2002 Confederated International Conferences DOA, CoopIS and ODBASE 2002

On the Efficiency of Nearest Neighbor Searching with Data Clustered in Lower Dimensions

ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I

Simple termination conditions for k-nearest neighbor method

Pattern Recognition Letters

Tighter lower bounds for nearest neighbor search and related problems in the cell probe model

Journal of Computer and System Sciences - Special issue on STOC 2000

Cell-probe lower bounds for the partial match problem

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing

Approximation algorithms for projective clustering

Journal of Algorithms

An Algorithmic Theory of Learning: Robust Concepts and Random Projection

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science

Database-friendly random projections: Johnson-Lindenstrauss with binary coins

Journal of Computer and System Sciences - Special issu on PODS 2001

Efficient similarity search and classification via rank aggregation

Proceedings of the 2003 ACM SIGMOD international conference on Management of data

Fast and accurate text classification via multiple linear discriminant projections

The VLDB Journal — The International Journal on Very Large Data Bases

Approximate Nearest Neighbor under edit distance via product metrics

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms

Locality-sensitive hashing scheme based on p-stable distributions

SCG '04 Proceedings of the twentieth annual symposium on Computational geometry

Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces

Machine Learning

A strong lower bound for approximate nearest neighbor searching

Information Processing Letters

Mobile services discovery and selection in the publish/subscribe paradigm

CASCON '04 Proceedings of the 2004 conference of the Centre for Advanced Studies on Collaborative research

Cell-probe lower bounds for the partial match problem

Journal of Computer and System Sciences - Special issue: STOC 2003

Array-index: a plug&search K nearest neighbors method for high-dimensional data

Data & Knowledge Engineering

Dynamic algorithms for approximating interdistances

Nordic Journal of Computing

The complexity of low-distortion embeddings between point sets

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms

Audio Fingerprinting: Nearest Neighbor Search in High Dimensional Binary Spaces

Journal of VLSI Signal Processing Systems

Entropy based nearest neighbor search in high dimensions

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm

Efficient algorithms for substring near neighbor problem

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm

An algorithmic theory of learning: Robust concepts and random projection

Machine Learning

Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing

Hierarchical bottom-up analog optimization methodology validated by a delta--sigma A/D converter design for the 802.11a/b/g standard

Proceedings of the 43rd annual Design Automation Conference

Indexing for function approximation

VLDB '06 Proceedings of the 32nd international conference on Very large data bases

A hierarchical bitmap indexing method for content based multimedia retrieval

IMSA'06 Proceedings of the 24th IASTED international conference on Internet and multimedia systems and applications

Neighborhood Property--Based Pattern Selection for Support Vector Machines

Neural Computation

Embeddings of surfaces, curves, and moving points in euclidean space

SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry

An efficient methodology for hierarchical synthesis of mixed-signal systems with fully integrated building block topology selection

Proceedings of the conference on Design, automation and test in Europe

Principles of hash-based text retrieval

SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval

Fast and accurate text classification via multiple linear discriminant projections

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases

Approximate range searching in higher dimension

Computational Geometry: Theory and Applications

Hierarchical document classification using automatically generated hierarchy

Journal of Intelligent Information Systems

Algorithms for clustering high dimensional and distributed data

Intelligent Data Analysis

Efficiency-quality tradeoffs for vector score aggregation

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30

Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions

Communications of the ACM - 50th anniversary issue: 1958 - 2008

Disorder inequality: a combinatorial approach to nearest neighbor search

WSDM '08 Proceedings of the 2008 International Conference on Web Search and Data Mining

Fast mining of distance-based outliers in high-dimensional datasets

Data Mining and Knowledge Discovery

Decomposable algorithms for nearest neighbor computing

Journal of Parallel and Distributed Computing

Nearest Local Hyperplane Rules for Pattern Classification

AI*IA '07 Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing

Similarity computing model of high dimension data for symptom classification of Chinese traditional medicine

Applied Soft Computing

The Johnson-Lindenstrauss lemma almost characterizes Hilbert space, but not quite

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms

Random projections preserving the Hamming distance between words

Proceedings of the 2009 conference on New Directions in Neural Networks: 18th Italian Workshop on Neural Networks: WIRN 2008

Combinatorial Framework for Similarity Search

SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications

Curse of Dimensionality in Pivot Based Indexes

SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications

Faster dimension reduction

Communications of the ACM

A Fast Nearest Neighbor Method Using Empirical Marginal Distribution

KES '09 Proceedings of the 13th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems: Part II

Probably correct k-nearest neighbor search in high dimensions

Pattern Recognition

Fast Approximate kNN Graph Construction for High Dimensional Data via Recursive Lanczos Bisection

The Journal of Machine Learning Research

Dynamic algorithms for approximating interdistances

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming

An improved algorithm finding nearest neighbor using Kd-trees

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics

Efficient and accurate nearest neighbor and closest pair search in high-dimensional space

ACM Transactions on Database Systems (TODS)

Nearest neighbour group-based classification

Pattern Recognition

Intrinsic plagiarism analysis

Language Resources and Evaluation

A comparison of extended fingerprint hashing and locality sensitive hashing for binary audio fingerprints

Proceedings of the 1st ACM International Conference on Multimedia Retrieval

Generalized dictionary learning for symmetric positive definite matrices with application to nearest neighbor retrieval

ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part III

Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions

SIAM Review

Fast GPU-based locality sensitive hashing for k-nearest neighbor computation

Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems

A hybrid data and space partitioning technique for similarity queries on bounded clusters

PReMI'05 Proceedings of the First international conference on Pattern Recognition and Machine Intelligence

On approximation algorithms for data mining applications

Efficient Approximation and Online Algorithms

Locality-sensitive hashing scheme based on dynamic collision counting

SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data

Scalable distributed algorithm for approximate nearest neighbor search problem in high dimensional general metric spaces

SISAP'12 Proceedings of the 5th international conference on Similarity Search and Applications

Estimation of the click volume by large scale regression analysis

CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications

Maximal intersection queries in randomized graph models

CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications

Random direction divisive clustering

Pattern Recognition Letters

Approximate high-dimensional nearest neighbor queries using R-forests

Proceedings of the 17th International Database Engineering & Applications Symposium

Real-time image recognition with the parallel directed enumeration method

ICVS'13 Proceedings of the 9th international conference on Computer Vision Systems