Sets of approximating functions with finite Vapnik–Chervonenkis dimension for nearest-neighbors algorithms

► Reformulation of k-NN algorithm to alpha-NN ∗ algorithm (where alpha is a fraction). ► Establishing sets of functions for alpha-NN ∗, with finite capacity. ► Pointing out degrees of freedom for these sets. ► Proving theorems about dichotomies and VC-dimension for the proposed sets. According to a...

Full description

Saved in:

Bibliographic Details
Published in:	Pattern recognition letters Vol. 32; no. 14; pp. 1882 - 1893
Main Authors:	KLCSK, P, KORZEN, M
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 15.10.2011 Elsevier
Subjects:	Applied sciences Complexity selection Exact sciences and technology Generalization Information, signal and communications theory k-Nearest neighbors Signal and communications theory Signal representation. Spectral analysis Signal, noise Statistical learning theory Structural risk minimization Telecommunications and information theory Vapnik–Chervonenkis dimension Statistical learning theory k-Nearest neighbors Vapnik–Chervonenkis dimension Generalization Complexity selection Structural risk minimization Learning Nearest neighbour Vapnik-Chervonenkis dimension Cross validation Algorithm Signal analysis
ISSN:	0167-8655, 1872-7344
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!