Parametric approximation algorithms for high-dimensional Euclidean similarity

DOI10.1007/3-540-44794-6_7MaRDI QIDQ4802575zbMATH OpenFDO

Authors Ömer Eğecioğlu

Publication date 21 April 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/2168/21680079.htm

Mathematics Subject Classification ID

Database theory (68P15) Information storage and retrieval of data (68P20) Computing methodologies and applications (68U99) Approximation algorithms (68W25)

Recommendations

• Dimension independent similarity computation
• Binary vectors for fast distance and similarity estimation
• scientific article; zbMATH DE number 1786224
• Real-valued embeddings and sketches for fast distance and similarity estimation
• scientific article; zbMATH DE number 1947041

Cited in

(2)

• Clustering-based multipopulation approaches in MOEA/D for many-objective problems
• Dimension independent similarity computation

This page was built for publication: Parametric approximation algorithms for high-dimensional Euclidean similarity

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