k-最近邻算法
计算机科学
相似性(几何)
人工智能
班级(哲学)
最近邻搜索
数据挖掘
统计分类
模式识别(心理学)
机器学习
图像(数学)
作者
Kashvi Taunk,Sanjukta De,Srishti Verma,Aleena Swetapadma
出处
期刊:International Conference Intelligent Computing and Control Systems
日期:2019-05-01
卷期号:: 1255-1260
被引量:543
标识
DOI:10.1109/iccs45141.2019.9065747
摘要
k-Nearest Neighbor (kNN) algorithm is an effortless but productive machine learning algorithm. It is effective for classification as well as regression. However, it is more widely used for classification prediction. kNN groups the data into coherent clusters or subsets and classifies the newly inputted data based on its similarity with previously trained data. The input is assigned to the class with which it shares the most nearest neighbors. Though kNN is effective, it has many weaknesses. This paper highlights the kNN method and its modified versions available in previously done researches. These variants remove the weaknesses of kNN and provide a more efficient method.
科研通智能强力驱动
Strongly Powered by AbleSci AI