Buscar
Mostrando ítems 1-10 de 330
Nearest Neighbors Distance Ratio Open-set Classifier
(SpringerDordrecht, 2017)
Exotic lagomorph may influence eagle abundances and breeding spatial aggregations: A field study and meta- analysis on the nearest neighbor distance
(PeerJ, 2018-05-10)
The introduction of alien species could be changing food source composition, ultimately restructuring demography and spatial distribution of native communities. In Argentine Patagonia, the exotic European hare has one of ...
Compact distance histogram: a novel structure to boost k-nearest neighbor queries
(University of CaliforniaAssociation for Computing Machinery - ACMLa Jolla, 2015-06)
The k-Nearest Neighbor query (k-NNq) is one of the most useful similarity queries. Elaborated k-NNq algorithms depend on an initial radius to prune regions of the search space that cannot contribute to the answer. Therefore, ...
An efficient algorithm for approximated self-similarity joins in metric spaces
(Elsevier, 2020)
Similarity join is a key operation in metric databases. It retrieves all pairs of elements that are similar. Solving such a problem usually requires comparing every pair of objects of the datasets, even when indexing and ...
Near neighbor searching with K nearest references
(Elsevier, 2015)
Proximity searching is the problem of retrieving,from a given database, those objects
closest to a query.To avoid exhaustive searching,data structures called indexes are builton
the database prior to serving queries.The ...
Size matters: point pattern analysis biases the estimation of spatial properties of stomata distribution
(Blackwell Publishing Ltd, 2017)
© 2016 The Authors. New Phytologist © 2016 New Phytologist Trust Stomata distribution is an example of biological patterning. Formal methods used to study stomata patterning are generally based on point-pattern analysis, ...
Practical construction of k-nearest neighbor graphs in metric spaces
(SPRINGER-VERLAG BERLIN, 2006)
Let U be a set of elements and d a distance function defined among them. Let NNk (u) be the k elements in U - {u} having the smallest distance to u. The k-nearest neighbor graph (kNNG) is a weighted directed graph G(U,E) ...