K- NEAREST NEIGHBOR ALGORITHM FOR INSTANCE BASED LEARNING

Cristina Ofelia Stanciu ()
Additional contact information
Cristina Ofelia Stanciu: ”TIBISCUS” UNIVERSITY OF TIMIŞOARA, FACULTY OF ECONOMIC SCIENCE

Anale. Seria Stiinte Economice. Timisoara, 2012, vol. XVIII/Supplement, 134-138

Abstract: 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.

Keywords: kowledge; Instance Based Learning; algorithm; K-NN (search for similar items in EconPapers)
JEL-codes: C38 D80 (search for similar items in EconPapers)
Date: 2012
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://fse.tibiscus.ro/anale/Lucrari2012_2/AnaleFSE_2012_2_020.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:tdt:annals:v:xviii/supplement:y:2012:p:134-138

Access Statistics for this article

More articles in Anale. Seria Stiinte Economice. Timisoara from Faculty of Economics, Tibiscus University in Timisoara Contact information at EDIRC.
Bibliographic data for series maintained by Ramona Violeta Vasilescu ( this e-mail address is bad, please contact ).