High-dimensional data approximate nearest neighbor retrieval method and system based on radiation stretching diagram
A technology that approximates the nearest neighbor and high-dimensional data. It is used in other database retrieval, electronic digital data processing, and other database queries. It can solve problems such as large memory space, reduce memory footprint, and improve retrieval accuracy.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0053] In order to make the purpose, technical solution and advantages of the present invention clearer, the present invention will be further described in detail below in conjunction with the accompanying drawings.
[0054] Such as figure 1 As shown, the approximate nearest neighbor retrieval method for high-dimensional data includes an offline phase and an online retrieval phase.
[0055] The purpose of the offline stage is to establish a radiation stretch diagram, including steps S101 to S107 as follows:
[0056] S101, establishing a nearest neighbor graph of the high-dimensional database point set. The nearest neighbor graph is a directed graph. For any point in the graph, the number of outgoing edges is a fixed value k, and the neighbors connected by these k edges are the nearest k. The nearest neighbor graph required in the present invention can be an exact k-nearest neighbor graph, or an approximate k-nearest neighbor graph, that is, the k-nearest neighbors of any poi...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com