- nearest neighbor rule
- правило "ближайшего соседа"
Большой англо-русский и русско-английский словарь. 2001.
nearest neighbor rule
Смотреть что такое "nearest neighbor rule" в других словарях:
Nearest-neighbor chain algorithm — In the theory of cluster analysis, the nearest neighbor chain algorithm is a method that can be used to perform several types of agglomerative hierarchical clustering, using an amount of memory that is linear in the number of points to be… … Wikipedia
Self-propelled particles — SPP models predict robust emergent behaviours occur in swarms independent of the type of animal that is in the swarm. Self propelled particles (SPP), also referred to as self driven particles or as the Couzin–Vicsek algorithm,[1][2] … Wikipedia
Anomaly detection — Anomaly detection, also referred to as outlier detection[1] refers to detecting patterns in a given data set that do not conform to an established normal behavior.[2] The patterns thus detected are called anomalies and often translate to critical … Wikipedia
Computer-aided diagnosis — Computer aided detection (CADe) and computer aided diagnosis (CADx) are procedures in medicine that assist doctors in the interpretation of medical images. Imaging techniques in X ray, MRI, and Ultrasound diagnostics yield a great deal of… … Wikipedia
Collective animal behavior — Sort sol. Starling flock at sunset in Denmark Collective animal behavior describes the coordinated behavior of large groups of similar animals and the emergent properties of these groups. Facets of this topic include the costs and benefits of… … Wikipedia
List of numerical analysis topics — This is a list of numerical analysis topics, by Wikipedia page. Contents 1 General 2 Error 3 Elementary and special functions 4 Numerical linear algebra … Wikipedia
Species distribution — A species range maps represents the geographical region where individuals of a species can be found. This is a range map of Juniperus communis, the common juniper. Species distribution is the manner in which a biological taxon is spatially… … Wikipedia
Kd-trie — A k d trie is a spatial data structure for indexing points in k dimensional space. It is a variation on the k d tree that only stores points in the leaf nodes, sometimes in small collections called bins or buckets. Internal nodes only store the… … Wikipedia
Kd-tree — In computer science, a k d tree (short for k dimensional tree ) is a space partitioning data structure for organizing points in a k dimensional space. k d trees are a useful data structure for several applications, such as searches involving a… … Wikipedia
Tight binding — Electronic structure methods Tight binding Nearly free electron model Hartree–Fock method Modern valence bond Generalized valence bond Møller–Plesset perturbat … Wikipedia
Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… … Wikipedia
