About: (1+ε)-approximate nearest neighbor search

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: (1+ε)-approximate nearest neighbor search Goto Sponge NotDistinct Permalink

An Entity of Type : dbo:SupremeCourtOfTheUnitedStatesCase, within Data Space : el.dbpedia.org associated with source document(s)

(1+ε)-approximate nearest neighbor search is a special case of the nearest neighbor search problem. The solution to the (1+ε)-approximate nearest neighbor search is a point or multiple points within distance (1+ε) R from a query point, where R is the distance between the query point and its true nearest neighbor. Reasons to approximate nearest neighbor search include the space and time costs of exact solutions in high-dimensional spaces (see curse of dimensionality) and that in some domains, finding an approximate nearest neighbor is an acceptable solution.

Attributes	Values
rdf:type	Supreme Court of the United States case
rdfs:label	(1+ε)-approximate nearest neighbor search (en)
rdfs:comment	(1+ε)-approximate nearest neighbor search is a special case of the nearest neighbor search problem. The solution to the (1+ε)-approximate nearest neighbor search is a point or multiple points within distance (1+ε) R from a query point, where R is the distance between the query point and its true nearest neighbor. Reasons to approximate nearest neighbor search include the space and time costs of exact solutions in high-dimensional spaces (see curse of dimensionality) and that in some domains, finding an approximate nearest neighbor is an acceptable solution. (en)
sameAs	(1+ε)-approximate nearest neighbor search
dbp:wikiPageUsesTemplate	dbt:Algorithm-stub
Subject	Approximation algorithms Classification algorithms Search algorithms
gold:hypernym	Case
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/(1+ε)-approximate_nearest_neighbor_search?oldid=1023256842&ns=0
Wikipage page ID	32003319 (xsd:integer)
page length (characters) of wiki page	1585 (xsd:nonNegativeInteger)
Wikipage revision ID	1023256842 (xsd:integer)
Link from a Wikipage to another Wikipage	Locality-sensitive hashing Brute-force search Approximation algorithms Classification algorithms Search algorithms Curse of dimensionality K-d tree Nearest neighbor search
has abstract	(1+ε)-approximate nearest neighbor search is a special case of the nearest neighbor search problem. The solution to the (1+ε)-approximate nearest neighbor search is a point or multiple points within distance (1+ε) R from a query point, where R is the distance between the query point and its true nearest neighbor. Reasons to approximate nearest neighbor search include the space and time costs of exact solutions in high-dimensional spaces (see curse of dimensionality) and that in some domains, finding an approximate nearest neighbor is an acceptable solution. Approaches for solving (1+ε)-approximate nearest neighbor search include kd-trees, Locality Sensitive Hashing and brute force search. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/(1+ε)-approximate_nearest_neighbor_search
is Wikipage redirect of	Ε-approximate nearest neighbor search
is Link from a Wikipage to another Wikipage of	Nearest neighbor search
is foaf:primaryTopic of	http://en.wikipedia.org/wiki/(1+ε)-approximate_nearest_neighbor_search

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software