- nearest neighbour distance
-
расстояние между ближайшими соседями
Англо-русский словарь терминов металлургии и сварки. 2011.
nearest neighbour distance
Смотреть что такое "nearest neighbour distance" в других словарях:
nearest neighbour analysis — a measure of how clustered or evenly spaced a distribution of points on a plane is. Rn = 2đ √ (n/A) where đ is the mean distance between nearest neighbours, n is the number of points, A is the area in which the distribution occurs Values… … Geography glossary
k-nearest neighbor algorithm — KNN redirects here. For other uses, see KNN (disambiguation). In pattern recognition, the k nearest neighbor algorithm (k NN) is a method for classifying objects based on closest training examples in the feature space. k NN is a type of instance… … Wikipedia
Variable range hopping — IntroductionVariable range hopping or Mott variable range hopping, is a model describing low temperature conduction in strongly disordered systems with localized states. [Mott, N.F., Phil. Mag. ,19,835,1969] It has a characteristic temperature… … 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
Entropy estimation — Estimating the differential entropy of a system or process, given some observations, is useful in various science/engineering applications, such as Independent Component Analysis [Dinh Tuan Pham (2004) Fast algorithms for mutual information based … 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
Scale-invariant feature transform — Feature detection Output of a typical corner detection algorithm … 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
crystal — crystallike, adj. /kris tl/, n., adj., v., crystaled, crystaling or (esp. Brit.) crystalled, crystalling. n. 1. a clear, transparent mineral or glass resembling ice. 2. the transparent form of crystallized quartz. 3. Chem., Mineral. a solid body… … Universalium
Crystal — /kris tl/, n. 1. a city in SE Minnesota, near Minneapolis. 25,543. 2. a female given name. * * * I Any solid material whose atoms are arranged in a definite pattern and whose surface regularity reflects its internal symmetry. Each of a crystal s… … Universalium
Neighbourhood components analysis — is a supervised learning method for clustering multivariate data into distinct classes according to a given distance metric over the data. Functionally, it serves the same purposes as the K nearest neighbour algorithm, and makes direct use of a… … Wikipedia
