首页> 外文期刊>IEEE sensors journal >A $k$ -Nearest Neighbor Algorithm-Based Near Category Support Vector Machine Method for Event Identification of $arphi$
【24h】

A $k$ -Nearest Neighbor Algorithm-Based Near Category Support Vector Machine Method for Event Identification of $arphi$

机译: $ k $ -基于最近邻算法的近类别支持向量机方法用于<内联公式> $ varphi $

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

摘要

In order to reduce the nuisance alarm rate (NAR) for the phase-sensitive optical time-domain reflectometer (phi-OTDR), we propose an event identification method based on the near category support vector machines (NC-SVM), which extends the current binary SVM classifier to multi-class problems by using k-nearest neighbor (kNN) algorithm. Five kinds of disturbance events, including watering, climbing, knocking, pressing, and false disturbance event, can be effectively identified for 25.05 km long phi-OTUR system. The experimental results demonstrate that the average identification rate of five disturbance events exceeds 94%, the identification time is 0.55s, and the NAR is 5.62%. Compared with the one against one multi-class SVM classifier, our proposed method has the distinguished advantage of higher identification rate, shorter identification time, and lower NAR.
机译:为了降低相敏光时域反射仪(phi-OTDR)的讨厌警报率(NAR),我们提出了一种基于近类别支持向量机(NC-SVM)的事件识别方法,该方法扩展了当前的二进制SVM分类器通过使用k最近邻(kNN)算法来解决多类问题。对于25.05 km长的phi-OTUR系统,可以有效地识别出五种干扰事件,包括浇水,爬升,爆震,挤压和假干扰事件。实验结果表明,五个扰动事件的平均识别率超过94%,识别时间为0.55s,NAR为5.62%。与针对一类多分类支持向量机的分类器相比,本文提出的方法具有识别率高,识别时间短,NAR较低的显着优势。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号