Nearest neighbor search
Nearest neighbor search (NNS), as a form of proximity search, is the optimization problem of finding the point in a given set that is closest (or most similar) to a given point. Closeness is typically expressed in terms of a dissimilarity function: the less similar the objects, the larger the function values.
Wikipage disambiguates
Approximate nearest-neighbor search algorithmApproximation algorithms for nearest-neighbor searchClosest point queryClosest point searchNearest neighbor methodNearest neighbor problemNearest neighbor queryNearest neighbour problemNearest neighbour queryNearest neighbour searchPost-office problemPost-office search algorithmPost office problemProximity search (metric space)
Wikipage redirect
(1+ε)-approximate nearest neighbor searchAngela Y. WuApproximate nearest-neighbor search algorithmApproximation algorithms for nearest-neighbor searchBall treeBarnes–Hut simulationBest bin firstBinary search algorithmBranch and boundCell-probe modelClosest pair of points problemClosest point queryClosest point searchCluster analysisCollaborative filteringCollocation (remote sensing)Computational geometryContent-based image retrievalContent similarity detectionContour advectionCover treeCrime hotspotsCurse of dimensionalityData analysisDavenport–Schinzel Sequences and Their Geometric ApplicationsDavid MountDelone setDimensionality reductionELKIFiveThirtyEightFixed-radius near neighborsFlannGiSTHash functionHierarchical clusteringK-SVDK-d treeK-nearest neighbors algorithmKenneth L. ClarksonLanguage model
Link from a Wikipage to another Wikipage
primaryTopic
Nearest neighbor search
Nearest neighbor search (NNS), as a form of proximity search, is the optimization problem of finding the point in a given set that is closest (or most similar) to a given point. Closeness is typically expressed in terms of a dissimilarity function: the less similar the objects, the larger the function values.
has abstract
La recherche des plus proches ...... en apprentissage automatique.
@fr
Nearest neighbor search (NNS), ...... ngle inequality does not hold.
@en
Задача поиска ближайшего сосед ...... это метрическое пространство.
@ru
Задача пошуку найближчого сусі ...... сть трикутника не виконується.
@uk
مسألة بحث النقطة الأقرب هي مسأ ...... لنقطة معينة في الفضاء المتري.
@ar
最近傍探索（英: Nearest neighbor sear ...... これはすなわち、ある住所に最も近い郵便局を求める問題である。
@ja
最邻近搜索（Nearest Neighbor Search, ...... 一书的第三章中称之为邮局问题，即居民寻找离自己家最近的邮局。
@zh
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,024,694,417
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
hypernym
type
comment
La recherche des plus proches ...... quels sont les k plus proches.
@fr
Nearest neighbor search (NNS), ...... he larger the function values.
@en
Задача поиска ближайшего сосед ...... это метрическое пространство.
@ru
Задача пошуку найближчого сусі ...... для пошуку k найближчих точок.
@uk
مسألة بحث النقطة الأقرب هي مسأ ...... لنقطة معينة في الفضاء المتري.
@ar
最近傍探索（英: Nearest neighbor sear ...... これはすなわち、ある住所に最も近い郵便局を求める問題である。
@ja
最邻近搜索（Nearest Neighbor Search, ...... 一书的第三章中称之为邮局问题，即居民寻找离自己家最近的邮局。
@zh
label
Nearest neighbor search
@en
Recherche des plus proches voisins
@fr
Задача поиска ближайшего соседа
@ru
Пошук найближчого сусіда
@uk
بحث النقطة الأقرب
@ar
最近傍探索
@ja
最邻近搜索
@zh
최근접 이웃 탐색
@ko