NP-completeness of the problem of prototype selection in the nearest neighbor method

ISSN： 1054-6618

Source： Pattern Recognition and Image Analysis, Vol.20, Iss.4, 2010-12, pp. : 484-494

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On NP-Completeness for Linear Machines

By Gasner C.

Journal of Complexity, Vol. 13, Iss. 2, 1997-02 ,pp. : 259-271

Academic Press

Access to resources Recommend Favorite

Bi-immunity separates strong NP-completeness notions

By Pavan A. Selman A.L.

Information and Computation, Vol. 188, Iss. 1, 2004-01 ,pp. : 116-126

Elsevier

Access to resources Recommend Favorite

Liquid li structure and dynamics: A comparison between OFDFT and second nearest‐neighbor embedded‐atom method

AICHE JOURNAL, Vol. 61, Iss. 9, 2015-09 ,pp. : 2841-2853

John Wiley & Sons Inc

Access to resources Recommend Favorite

Gene Assessment and Sample Classification for Gene Expression Data Using a Genetic Algorithm / k-nearest Neighbor Method

Combinatorial Chemistry & High Throughput Screening, Vol. 4, Iss. 8, 2001-12 ,pp. : 727-739

Bentham Science Publishers

Access to resources Recommend Favorite

Construction of the nearest neighbor embracing graph of a point set

By Chan M. Chen Danny Chin Francis Wang Cao

Journal of Combinatorial Optimization, Vol. 11, Iss. 4, 2006-06 ,pp. : 435-443

Springer Publishing Company

Access to resources Recommend Favorite