k-最近邻算法
分类器(UML)
计算机科学
模式识别(心理学)
公制(单位)
相似性(几何)
人工智能
最近邻搜索
算法
数据挖掘
相似性度量
运营管理
图像(数学)
经济
作者
Dileep Kumar Appana,Md. Rashedul Islam,Jong-Myon Kim
标识
DOI:10.1007/978-3-319-51691-2_17
摘要
The k-nearest neighbor (k-NN) method is a simple and highly effective classifier, but the classification accuracy of k-NN is degraded and becomes highly sensitive to the neighborhood size k in multi-classification problems, where the density of data samples varies across different classes. This is mainly due to the method using only a distance-based measure of similarity between different samples. In this paper, we propose a density-weighted distance similarity metric, which considers the relative densities of samples in addition to the distances between samples to improve the classification accuracy of standard k-NN. The performance of the proposed k-NN approach is not affected by the neighborhood size k. Experimental results show that the proposed approach yields better classification accuracy than traditional k-NN for fault diagnosis of rolling element bearings.
科研通智能强力驱动
Strongly Powered by AbleSci AI