Efficient Query-Sensitive Embeddings for Approximate Nearest Neighbor Retrieval
This paper introduces an innovative method for approximate nearest neighbor retrieval tailored for high-dimensional databases, which often struggle with slow performance due to computationally expensive similarity measures. The proposed approach utilizes embedding-based techniques to map objects into a real vector space while preserving proximity structures. A key feature is the development of a query-sensitive distance measure that adapts based on the query object, enhancing retrieval efficiency and accuracy. Experiments with handwritten digit images and time-series data demonstrate significant performance improvements over existing methods.
Download Presentation 
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.During download, if you can't get a presentation, the file might be deleted by the publisher.
E N D
