distance between

  • 101Matching distance — In mathematics, the matching distance[1][2] is a metric on the space of size functions. Example: The matching distance between …

    Wikipedia

  • 102Minimum distance estimation — (MDE) is a statistical method for fitting a mathematical model to data, usually the empirical distribution. Contents 1 Definition 2 Statistics used in estimation 2.1 Chi square criterion …

    Wikipedia

  • 103Resistance distance — In graph theory, the resistance distance between two vertices of a simple connected graph, G , is equal to the resistance between two equivalent points on an electrical network, constructed so as to correspond to G , with each edge being replaced …

    Wikipedia

  • 104Unit distance graph — In mathematics, and particularly geometric graph theory, a unit distance graph is a graph formed from a collection of points in the Euclidean plane by connecting two points by an edge whenever the distance between the two points is exactly one.… …

    Wikipedia

  • 105Angular distance — In mathematics (in particular geometry and trigonometry) and all natural sciences (including astronomy, geophysics, etc), the angular distance (angular separation, apparent distance, or apparent separation) between two point objects, as observed… …

    Wikipedia

  • 106Normalized Google distance — Google distance is a semantic similarity measure derived from the number of hits returned by the Google search engine for a given set of keywords. Keywords with the same or similar meanings in a natural language sense tend to be close in units of …

    Wikipedia

  • 107Euclidean distance — In mathematics, the Euclidean distance or Euclidean metric is the ordinary distance between two points that one would measure with a ruler, which can be proven by repeated application of the Pythagorean theorem. By using this formula as distance …

    Wikipedia

  • 108Gilbert–Johnson–Keerthi distance algorithm — The Gilbert–Johnson–Keerthi distance algorithm is a method of determining the minimum distance between two convex sets. Unlike many other distance algorithms, it does not require that the geometry data be stored in any specific format, but… …

    Wikipedia

  • 109Hellinger distance — In probability theory, a branch of mathematics, given two probability measures P and Q that are absolutely continuous in respect to a third probability measure lambda;, the square of the Hellinger distance between P and Q is defined as the… …

    Wikipedia

  • 110Fréchet distance — In mathematics, the Fréchet distance is a measure of similarity between curves that takes into account the location and ordering of the points along the curves. Intuitive explanationThe Fréchet distance between two curves can be defined… …

    Wikipedia