arXiv (All)
open access
Better Nearest Neighbor Graph Indices via (Efficient) LLM-Guided Pruning
Graph-based approximate nearest neighbor search (ANNS) is widely used for large-scale semantic search. Its indices are constructed primarily based on geometric relationships among embeddings of an input dataset (e.g., documents or images), rather than explicitly optimizing for semantic relevance. Ho
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- FGIM: a Fast Graph-based Indexes Merging Framework for Approximate Nearest Neighbor Search#1084164
- VectorMaton: Efficient Vector Search with Pattern Constraints via an Enhanced Suffix Automaton#1049761
- Out-of-Sample Embedding with Proximity Data: Projection versus Restricted Reconstruction#1013416
- skiniry/Trips-Viz#1053774
- List-distance consistent vertices in trees are confined to a path#926686
Record · ID 1131201
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive