International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 105 - Issue 11 |
Published: November 2014 |
Authors: Rashmi Agrawal |
![]() |
Rashmi Agrawal . K-Nearest Neighbor for Uncertain Data. International Journal of Computer Applications. 105, 11 (November 2014), 13-16. DOI=10.5120/18420-9714
@article{ 10.5120/18420-9714, author = { Rashmi Agrawal }, title = { K-Nearest Neighbor for Uncertain Data }, journal = { International Journal of Computer Applications }, year = { 2014 }, volume = { 105 }, number = { 11 }, pages = { 13-16 }, doi = { 10.5120/18420-9714 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2014 %A Rashmi Agrawal %T K-Nearest Neighbor for Uncertain Data%T %J International Journal of Computer Applications %V 105 %N 11 %P 13-16 %R 10.5120/18420-9714 %I Foundation of Computer Science (FCS), NY, USA
The classifications of uncertain data become one of the tedious processes in the data-mining domain. The uncertain data are contains tuples with different data and thus to find similar class of tuples is a complex process. The attributes which have a higher level of uncertainty needs to be treated differently as compared to the attributes having lower level of uncertainty. Different algorithms exist in literature for users to choose a suitable one as per their need. This research paper deals with the fundamentals of various existing data classification techniques for uncertain data using the k nearest neighbor approach. The literature shows that much work has been done in this area but still there are certain performance issues in the k nearest neighbor classifier. K nearest neighbor is one of the important algorithms in top 10 data mining algorithms.