K- NEAREST NEIGHBOR ALGORITHM FOR INSTANCE BASED LEARNING

Instance Based Learning (IBL) results in classifying a new instance by examining and comparing it to the rest of the instances in the dataset. An example of this type of learning is the K-Nearest Neighbor algorithm which is based on examining an average Euclidian distance of the nearest k neighbors' parameters given a certain situation.

MoreLess

Year of publication:	2012
Authors:	STANCIU, CRISTINA OFELIA
Published in:	Anale. Seria Stiinte Economice. Timisoara. - Facultatea de Ştiinţe Economice. - Vol. XVIII/Supplement.2012, November, p. 134-138
Publisher:	Facultatea de Ştiinţe Economice
Subject:	kowledge \| Instance Based Learning \| algorithm \| K-NN

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	application/pdf
Type of publication:	Article
Classification:	D80 - Information and Uncertainty. General ; c38
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10010815296