Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Nearest_neighbor_search> ?p ?o. }
Showing items 1 to 58 of
58
with 100 items per page.
- Nearest_neighbor_search abstract "Nearest neighbor search (NNS), also known as proximity search, similarity search or closest point search, is an optimization problem for finding closest (or most similar) points. Closeness is typically expressed in terms of a dissimilarity function: The less similar are the objects the larger are the function values. Formally, the nearest-neighbor (NN) search problem is defined as follows: given a set S of points in a space M and a query point q ∈ M, find the closest point in S to q. Donald Knuth in vol. 3 of The Art of Computer Programming (1973) called it the post-office problem, referring to an application of assigning to a residence the nearest post office. A direct generalization of this problem is a k-NN search, where we need to find the k closest points.Most commonly M is a metric space and dissimilarity is expressed as a distance metric, which is symmetric and satisfies the triangle inequality. Even more common, M is taken to be the d-dimensional vector space where dissimilarity is measured using the Euclidean distance, Manhattan distance or other distance metric. However, the dissimilarity function can be arbitrary. One example are asymmetric Bregman divergences, for which the triangle inequality does not hold.".
- Nearest_neighbor_search wikiPageExternalLink messif.
- Nearest_neighbor_search wikiPageExternalLink knnlsb.
- Nearest_neighbor_search wikiPageExternalLink nearpy.io.
- Nearest_neighbor_search wikiPageExternalLink neartree.sourceforge.net.
- Nearest_neighbor_search wikiPageExternalLink tutorial.html.
- Nearest_neighbor_search wikiPageExternalLink ?f=library.
- Nearest_neighbor_search wikiPageExternalLink sswiki.tierra-aoi.net.
- Nearest_neighbor_search wikiPageExternalLink SpatialSearchingD.
- Nearest_neighbor_search wikiPageExternalLink flann.
- Nearest_neighbor_search wikiPageExternalLink ANN.
- Nearest_neighbor_search wikiPageExternalLink 184401449.
- Nearest_neighbor_search wikiPageExternalLink ann.php.
- Nearest_neighbor_search wikiPageExternalLink www.kgraph.org.
- Nearest_neighbor_search wikiPageExternalLink www.obsearch.net.
- Nearest_neighbor_search wikiPageExternalLink NonMetricSpaceLib.
- Nearest_neighbor_search wikiPageID "7309022".
- Nearest_neighbor_search wikiPageRevisionID "603708985".
- Nearest_neighbor_search hasPhotoCollection Nearest_neighbor_search.
- Nearest_neighbor_search subject Category:Approximation_algorithms.
- Nearest_neighbor_search subject Category:Classification_algorithms.
- Nearest_neighbor_search subject Category:Data_mining.
- Nearest_neighbor_search subject Category:Discrete_geometry.
- Nearest_neighbor_search subject Category:Geometric_algorithms.
- Nearest_neighbor_search subject Category:Information_retrieval.
- Nearest_neighbor_search subject Category:Machine_learning.
- Nearest_neighbor_search subject Category:Mathematical_optimization.
- Nearest_neighbor_search subject Category:Numerical_analysis.
- Nearest_neighbor_search subject Category:Search_algorithms.
- Nearest_neighbor_search subject Category:Searching.
- Nearest_neighbor_search type Abstraction100002137.
- Nearest_neighbor_search type Act100030358.
- Nearest_neighbor_search type Activity100407535.
- Nearest_neighbor_search type Algorithm105847438.
- Nearest_neighbor_search type ApproximationAlgorithms.
- Nearest_neighbor_search type ClassificationAlgorithms.
- Nearest_neighbor_search type Event100029378.
- Nearest_neighbor_search type GeometricAlgorithms.
- Nearest_neighbor_search type Procedure101023820.
- Nearest_neighbor_search type PsychologicalFeature100023100.
- Nearest_neighbor_search type Rule105846932.
- Nearest_neighbor_search type SearchAlgorithms.
- Nearest_neighbor_search type YagoPermanentlyLocatedEntity.
- Nearest_neighbor_search comment "Nearest neighbor search (NNS), also known as proximity search, similarity search or closest point search, is an optimization problem for finding closest (or most similar) points. Closeness is typically expressed in terms of a dissimilarity function: The less similar are the objects the larger are the function values. Formally, the nearest-neighbor (NN) search problem is defined as follows: given a set S of points in a space M and a query point q ∈ M, find the closest point in S to q.".
- Nearest_neighbor_search label "Nearest neighbor search".
- Nearest_neighbor_search label "Recherche des plus proches voisins".
- Nearest_neighbor_search label "Задача поиска ближайшего соседа".
- Nearest_neighbor_search label "بحث النقطة الأقرب".
- Nearest_neighbor_search label "最近傍探索".
- Nearest_neighbor_search label "最邻近搜索".
- Nearest_neighbor_search sameAs Recherche_des_plus_proches_voisins.
- Nearest_neighbor_search sameAs 最近傍探索.
- Nearest_neighbor_search sameAs m.025ytbk.
- Nearest_neighbor_search sameAs Q608751.
- Nearest_neighbor_search sameAs Q608751.
- Nearest_neighbor_search sameAs Nearest_neighbor_search.
- Nearest_neighbor_search wasDerivedFrom Nearest_neighbor_search?oldid=603708985.
- Nearest_neighbor_search isPrimaryTopicOf Nearest_neighbor_search.