Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from http://reference.wolfram.com/language/ref/Nearest.html below:

Nearest—Wolfram Language Documentation

We deliver solutions for the AI era—combining symbolic computation, data-driven insights and deep technology expertise.

• Data & Computational Intelligence
• Model-Based Design
• Algorithm Development
• Wolfram|Alpha for Business
• Blockchain Technology
• Education Technology
• Quantum Computation

WolframConsulting.com

• See Also
  • GeoNearest
  • RegionNearest
  • FeatureNearest
  • NearestTo
  • NearestNeighborGraph
  • DistanceMatrix
  • Predict
  • Classify
  • FindClusters
  • Norm
  • Sort
  • Quantile
  • Interpolation
  • NearestFunction
  • DistanceTransform
• Related Guides
  • Logic & Boolean Algebra
  • Boolean Computation
  • Computational Geometry
  • Supervised Machine Learning
  • Text Analysis
  • Natural Language Processing
  • Sequence Alignment & Comparison
  • Distance and Similarity Measures
  • Date & Time
  • Machine Learning
  • Scientific Models
  • Linguistic Data
  • Math & Counting Operations on Lists
  • Computer Vision
  • Audio Analysis
  • Audio Processing
  • Speech Computation
• Tech Notes
  • Partitioning Data into Clusters
  • Using Nearest

Nearest[{elem₁,elem₂,…},x]

gives the list of elem_i to which x is nearest.

Nearest[{elem₁v₁,elem₂v₂,…},x]

gives the v_i corresponding to the elem_i to which x is nearest.

Nearest[{elem₁,elem₂,…}{v₁,v₂,…},x]

gives the same result.

Nearest[{elem₁,elem₂,…}prop,x]

gives the property prop for the elem_i to which x is nearest.

Nearest[data,{x₁,x₂,…}]

effectively gives {Nearest[data,x₁],Nearest[data,x₂],…}.

Nearest[data,x,n]

gives the n nearest elem_i to x.

Nearest[data,x,{n,r}]

gives the n or fewer nearest elem_i to x that are within radius r of x.

• Nearest works for a variety of data, including numerical, geospatial, textual, and visual, as well as dates and times.
• The data can also be given as an association. In this case, Nearest[<|key₁val₁,key₂val₂,…|>] is equivalent to Nearest[{val₁key₁,val₂key₂,…}].
• In Nearest[{elem₁,elem₂,…}prop,…], possible forms for prop include:
• "Element" the elem_i found to be nearest "Index" the index i of the elem_i found to be nearest "Distance" the distance to the nearest elem_i {prop₁,prop₂,…} a list of multiple forms All an association giving element, index and distance
• When Nearest returns several elements elem_i, the nearest ones are given first.
• If several elements are at the same distance, they are returned in the order they appear in data.
• Nearest[data,x,{All,r}] can be used to get all elem_i within radius r.
• The following options can be given:
• By default, the following distance functions are used for different types of elem_i:
• Nearest with geospatial data uses GeoDistance to compute distances. The data can be given as a list of GeoPosition objects, or a GeoPosition containing an array of points.
• For images or colors and a distance function f, DistanceFunction->f is passed to ImageDistance and ColorDistance, respectively. »
• All images are conformed using ConformImages. With DistanceFunction->Automatic, dimensionality reduction based on discrete cosine transform is applied to the set of images.
• Using Norm[#1-#2,p]& for or named distance functions such as ManhattanDistance, ChessboardDistance, and EuclideanDistance can invoke special optimizations for numeric vector data.
• Possible settings for Method include "Octree", "KDtree", and "Scan".
• Possible settings for the WorkingPrecision option are:

Find the element nearest to 20:

Find the 3 elements nearest to 20:

Find which element is nearest to {2,3} in 2D:

Find "nearest" strings:

Find nearest colors:

Find the nearest image partition to a subimage:

Give the 3 nearest elements:

Give the elements within radius 2:

Give at most 3 nearest elements within radius 2:

Find the nearest matrix:

Find which element is nearest to {2,3} in 2D and return the appropriate label:

Compute the same using an Association:

Return the index for the nearest string:

Return an Association giving the string element, index, and distance:

Find the 3 elements nearest to 20, simultaneously reporting the elements and their distance to 20:

For uniform random points in 3D, give the distances for the 10 nearest to the origin:

For each of the 10 nearest, give an Association including the point element, index and distance:

Create a lookup function for future use:

Find the date nearest to a given DateObject:

Find out which of these {lat,lon} points on Earth is closest to you:

Express the input as a list of separate GeoPosition objects instead:

Report simultaneously the closest point and the distance to it:

By default, normal Euclidean distance is used for points:

Use the ManhattanDistance, which sums the length of each side:

The ChessboardDistance only takes into account the dimension with the largest separation:

The DistanceFunction can be given as a symbol:

Or as a pure function:

Find nearest colors using a color distance different from the default distance in ColorDistance:

Compare different methods for machine-precision data:

In three dimensions, the "KDtree" method is faster:

In 20 dimensions, a simple scan is faster:

The setting Method->{"KDtree","LeafSize"->s} may be used to control the maximum number of points in any leaf of the KD tree constructed:

Plot the tree setup time:

Plot the lookup time for different points:

Using WorkingPrecision->MachinePrecision ensures the fastest evaluation method is used:

The results may not be correct if the numbers are not all distinct to machine precision:

All the points are effectively the same to machine precision:

An appropriate higher value of precision will work:

Plot the Nearest of a list of:

Create a Voronoi diagram:

Use higher resolution:

Use a 1-norm ("taxicab distance"):

Highlight the 200 random points closest to the origin:

Use the "taxicab" metric:

Create a nearest function from all the words in a dictionary:

Look up words closest to a given word:

Go farther:

Find the outputs from running a sequence of elementary cellular automata:

Generate a complete list of outputs from all 256 elementary cellular automata:

Find which rules give outputs nearest the specified sequences:

Use a negative distance function to find the element farthest away from the given element:

Show the returned element for all values between 1 and 5:

Take the polygon of Mexico:

Compute the nearest of the points of that polygon from your current geo location:

Draw the geodesic from your location to that point:

In the case of a tie, all nearest elements are returned in order:

The single argument form of Nearest returns a NearestFunction object:

This is an optimized lookup function, which is faster than calling Nearest repeatedly:

Find successive nearest words in a dictionary:

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4