Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Nearest_neighbor_graph> ?p ?o. }
Showing items 1 to 25 of
25
with 100 items per page.
- Nearest_neighbor_graph abstract "The nearest neighbor graph (NNG) for a set of n objects P in a metric space (e.g., for a set of points in the plane with Euclidean distance) is a directed graph with P being its vertex set and with a directed edge from p to q whenever q is a nearest neighbor of p (i.e., the distance from p to q is no larger than from p to any other object from P).In many discussions the directions of the edges are ignored and the NNG is defined as an ordinary (undirected) graph. However, the nearest neighbor relation is not a symmetric one, i.e., p from the definition is not necessarily a nearest neighbor for q.In some discussions, in order to make the nearest neighbor for each object unique, the set P is indexed and in the case of a tie the object with, e.g., the largest index is taken for the nearest neighbor.The k-nearest neighbor graph (k-NNG) is a graph in which two vertices p and q are connected by an edge, if the distance between p and q is among the k-th smallest distances from p to other objects from P. The NNG is a special case of the k-NNG, namely it is the 1-NNG. k-NNGs obey a separator theorem: they can be partitioned into two subgraphs of at most n(d + 1)/(d + 2) vertices each by the removal of O(k1/dn1 − 1/d) points.Another special case is the (n − 1)-NNG. This graph is called the farthest neighbor graph (FNG).In theoretical discussions of algorithms a kind of general position is often assumed, namely, the nearest (k-nearest) neighbor is unique for each object. In implementations of the algorithms it is necessary to bear in mind that this is not always the case.NNGs for points in the plane as well as in multidimensional spaces find applications, e.g., in data compression, motion planning, and facilities location. In statistical analysis, the nearest-neighbor chain algorithm based on following paths in this graph can be used to find hierarchical clusterings quickly. Nearest neighbor graphs are also a subject of computational geometry.".
- Nearest_neighbor_graph thumbnail Nearest_neighbor_graph.svg?width=300.
- Nearest_neighbor_graph wikiPageExternalLink www.kgraph.org.
- Nearest_neighbor_graph wikiPageID "12061759".
- Nearest_neighbor_graph wikiPageRevisionID "598278870".
- Nearest_neighbor_graph hasPhotoCollection Nearest_neighbor_graph.
- Nearest_neighbor_graph subject Category:Articles_with_inconsistent_citation_formats.
- Nearest_neighbor_graph subject Category:Geometric_graphs.
- Nearest_neighbor_graph type Abstraction100002137.
- Nearest_neighbor_graph type Communication100033020.
- Nearest_neighbor_graph type GeometricGraphs.
- Nearest_neighbor_graph type Graph107000195.
- Nearest_neighbor_graph type VisualCommunication106873252.
- Nearest_neighbor_graph comment "The nearest neighbor graph (NNG) for a set of n objects P in a metric space (e.g., for a set of points in the plane with Euclidean distance) is a directed graph with P being its vertex set and with a directed edge from p to q whenever q is a nearest neighbor of p (i.e., the distance from p to q is no larger than from p to any other object from P).In many discussions the directions of the edges are ignored and the NNG is defined as an ordinary (undirected) graph.".
- Nearest_neighbor_graph label "Nearest neighbor graph".
- Nearest_neighbor_graph label "Nearest neighbor graph".
- Nearest_neighbor_graph sameAs Graf_nejbližšího_souseda.
- Nearest_neighbor_graph sameAs Nearest_neighbor_graph.
- Nearest_neighbor_graph sameAs m.02vnjny.
- Nearest_neighbor_graph sameAs Q2855103.
- Nearest_neighbor_graph sameAs Q2855103.
- Nearest_neighbor_graph sameAs Nearest_neighbor_graph.
- Nearest_neighbor_graph wasDerivedFrom Nearest_neighbor_graph?oldid=598278870.
- Nearest_neighbor_graph depiction Nearest_neighbor_graph.svg.
- Nearest_neighbor_graph isPrimaryTopicOf Nearest_neighbor_graph.