2 citations · 3 across the 5 of their papers we have counts for
8 papers
Building Navigable Graphs Without Search in Three Composable Stages
Édgar Chávez
Navigable graphs can be built without searching for neighbors: partition the data, evaluate every pair inside each part, and select each point's edges from the candidates. We give…
SOLO: Certified-Recall Metric Similarity Search with Scan-Only Sampled Inverted Lists
Édgar Chávez
In every fast nearest-neighbor index, recall is measured, never predicted: each operating point is tuned by serving it against ground truth. SOLO is an index whose recall is comput…
Batched Feedback and the Random-Access Wall in Search-Based Graph Construction
Édgar Chávez
Navigable graphs for nearest-neighbor search are built either incrementally, each inserted point searching a graph that mutates as construction proceeds, or in batch over a fixed s…
misi: a Metric Inverted Sample Index
Edgar Chavez
We present misi, an inverted index for approximate nearest-neighbor search over general metric spaces whose vocabulary is a random sample of the database, of size proportional to $…
Instance-based learning using the Half-Space Proximal Graph
Ariana Talamantes, Edgar Chavez
The primary example of instance-based learning is the -nearest neighbor rule (kNN), praised for its simplicity and the capacity to adapt to new unseen data and toss away old dat…
A scalable solution to the nearest neighbor search problem through local-search methods on neighbor graphs
Eric S. Tellez, Guillermo Ruiz, Edgar Chavez +1
Near neighbor search (NNS) is a powerful abstraction for data access; however, data indexing is troublesome even for approximate indexes. For intrinsically high-dimensional data, h…
Proximal Navigation Graphs and t-spanners
Guillermo Ruiz, Edgar Chávez
Let be a metric space, a finite set, and . We call the graph a {\em metric} graph if each edge has we…
Polygon Matching and Indexing Under Affine Transformations
Edgar Chávez, Ana C. Chávez-Cáliz, Jorge L. López-López
Given a collection of -sided polygons in the plane and a query polygon we give algorithms to find all such that with an u…