Search and classification of high dimensional data

DOI10.1007/3-540-45753-4_1MaRDI QIDQ4411271zbMATH OpenFDO

Authors Yuval Rabani

Publication date 7 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2462/24620001.htm

Mathematics Subject Classification ID

Searching and sorting (68P10) Computing methodologies and applications (68U99) Approximation algorithms (68W25)

Recommendations

• scientific article; zbMATH DE number 1559575
• Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
• scientific article; zbMATH DE number 1775451
• scientific article; zbMATH DE number 1775450
• scientific article; zbMATH DE number 2065612

Cited in

(7)

• Integrative exploration of large high-dimensional datasets
• New algorithms for efficient high-dimensional nonparametric classification
• Compression techniques based on concave cluster geometries for efficient high-dimensional nearest neighbor retrieval
• scientific article; zbMATH DE number 1775451 (Why is no real title available?)
• Parametric approximation algorithms for high-dimensional Euclidean similarity
• Subquadratic approximation algorithms for clustering problems in high dimensional spaces
• Subquadratic approximation algorithms for clustering problems in high dimensional spaces

This page was built for publication: Search and classification of high dimensional data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4411271)