This HTML5 document contains 119 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dcthttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
n12http://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Nearest_neighbor_search
rdf:type
dbo:Disease
rdfs:label
Nearest neighbor search
rdfs:comment
Nearest neighbor search (NNS), as a form of proximity search, is the optimization problem of finding the point in a given set that is closest (or most similar) to a given point. Closeness is typically expressed in terms of a dissimilarity function: the less similar the objects, the larger the function values.
owl:sameAs
yago-res:Nearest_neighbor_search freebase:m.025ytbk
dbp:wikiPageUsesTemplate
dbt:Reflist dbt:Commons_category dbt:Div_col dbt:Div_col_end dbt:Confusing dbt:Cite_journal dbt:Cite_book dbt:Short_description
dct:subject
dbc:Classification_algorithms dbc:Mathematical_optimization dbc:Discrete_geometry dbc:Data_mining dbc:Geometric_algorithms dbc:Machine_learning dbc:Approximation_algorithms dbc:Search_algorithms
gold:hypernym
dbr:Problem
prov:wasDerivedFrom
n12:Nearest_neighbor_search?oldid=1068801798&ns=0
dbo:wikiPageID
7309022
dbo:wikiPageLength
25290
dbo:wikiPageRevisionID
1068801798
dbo:wikiPageWikiLink
dbr:Collaborative_filtering dbr:R*-tree dbr:Donald_Knuth dbr:Best_bin_first dbr:Ball_tree dbr:Nearest-neighbor_interpolation dbr:Wavelet dbr:Cluster_analysis dbr:Database dbr:K-d_tree dbr:Content_similarity_detection dbr:Fixed-radius_near_neighbors dbr:Contextual_advertising dbr:Branch_and_bound dbr:Optical_character_recognition dbr:Linear_least_squares dbr:MinHash dbr:Recommender_system dbr:Content-based_image_retrieval dbr:Spatial_database dbr:Lp_space dbr:Bregman_divergence dbr:Balanced_box-decomposition_tree dbr:Sparse_distributed_memory dbr:Digital_signal_processing dbr:Vector_quantization dbr:Euclidean_space dbr:Singular_value_decomposition dbc:Classification_algorithms dbr:Range_searching dbr:Vector_space dbr:Metric_tree dbr:Motion_planning dbr:K-nearest_neighbors_algorithm dbc:Machine_learning dbr:Chemical_similarity dbc:Geometric_algorithms dbr:Euclidean_distance dbr:Triangle_inequality dbr:Cover_tree dbr:Entropy_estimation dbr:Robotics dbr:Coding_theory dbr:Nearest_neighbor_distance_ratio dbr:Taxicab_geometry dbr:Decoding_methods dbr:Spell_checker dbr:Vantage-point_tree dbc:Mathematical_optimization dbc:Approximation_algorithms dbr:Metric_space dbr:Predictive_analytics dbc:Data_mining dbr:The_Art_of_Computer_Programming dbr:Targeted_advertising dbr:Doubling_constant dbr:MPEG-2 dbr:Voronoi_diagram dbr:Data_compression dbr:Time_series dbr:(1+ε)-approximate_nearest_neighbor_search dbr:Pattern_matching dbr:Principal_component_analysis dbr:Statistical_classification dbr:Similarity_learning dbr:Digital_marketing dbr:Locality-sensitive_hashing dbr:R-tree dbr:Neighbor_joining dbr:Pattern_recognition dbc:Search_algorithms dbr:Similarity_score dbr:Multidimensional_analysis dbr:Binary_space_partitioning dbr:Statistical_distance dbr:Metric_(mathematics) dbr:BK-tree dbr:Closest_pair_of_points_problem dbr:Space_partitioning dbr:Optimization_problem dbc:Discrete_geometry dbr:Computer_vision dbr:Fourier_analysis dbr:Time_complexity dbr:Instance-based_learning dbr:Computational_geometry dbr:Expansive_homeomorphism dbr:Dimensionality_reduction dbr:Cardinality dbr:DNA_sequencing dbr:Curse_of_dimensionality
dbo:abstract
Nearest neighbor search (NNS), as a form of proximity search, is the optimization problem of finding the point in a given set that is closest (or most similar) to a given point. Closeness is typically expressed in terms of a dissimilarity function: the less similar the objects, the larger the function values. Formally, the nearest-neighbor (NN) search problem is defined as follows: given a set S of points in a space M and a query point q ∈ M, find the closest point in S to q. Donald Knuth in vol. 3 of The Art of Computer Programming (1973) called it the post-office problem, referring to an application of assigning to a residence the nearest post office. A direct generalization of this problem is a k-NN search, where we need to find the k closest points. Most commonly M is a metric space and dissimilarity is expressed as a distance metric, which is symmetric and satisfies the triangle inequality. Even more common, M is taken to be the d-dimensional vector space where dissimilarity is measured using the Euclidean distance, Manhattan distance or other distance metric. However, the dissimilarity function can be arbitrary. One example is asymmetric Bregman divergence, for which the triangle inequality does not hold.
foaf:isPrimaryTopicOf
n12:Nearest_neighbor_search