首页> 外文会议>Data Mining and Big Data >A Sequential k-Nearest Neighbor Classification Approach for Data-Driven Fault Diagnosis Using Distance- and Density-Based Affinity Measures
【24h】

A Sequential k-Nearest Neighbor Classification Approach for Data-Driven Fault Diagnosis Using Distance- and Density-Based Affinity Measures

机译:基于距离和密度的亲和力度量的数据驱动故障诊断的顺序k最近邻分类方法

获取原文
获取原文并翻译 | 示例

摘要

Machine learning techniques are indispensable in today's data-driven fault diagnosis methodolgoies. Among many machine techniques, k-nearest neighbor (k-NN) is one of the most widely used for fault diagnosis due to its simplicity, effectiveness, and computational efficiency. However, the lack of a density-based affinity measure in the conventional k-NN algorithm can decrease the classification accuracy. To address this issue, a sequential k-NN classification methodology using distance- and density-based affinity measures in a sequential manner is introduced for classification.
机译:在当今的数据驱动的故障诊断方法中,机器学习技术是必不可少的。在许多机器技术中,k最近邻(k-NN)由于其简单性,有效性和计算效率而被广泛用于故障诊断。然而,常规的k-NN算法中缺乏基于密度的亲和力度量会降低分类精度。为了解决这个问题,引入了使用顺序的基于距离和密度的亲和力度量的顺序k-NN分类方法进行分类。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号