Search Results for author:
Found 3 papers, 2 papers with code
Instance-based learning using the Half-Space Proximal Graph
Surprisingly, when using a probabilistic index to approximate the HSP graph and consequently speeding-up the classification task, our method could {\em improve} its accuracy in stark contrast with the kNN classifier, which worsens with a probabilistic index.
A scalable solution to the nearest neighbor search problem through local-search methods on neighbor graphs
Near neighbor search (NNS) is a powerful abstraction for data access; however, data indexing is troublesome even for approximate indexes.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
