首页> 外文会议>IEEE Information Technology and Mechatronics Engineering Conference >Based on Multiple Time Series Affinity Propagation Algorithm
【24h】

Based on Multiple Time Series Affinity Propagation Algorithm

机译:基于多个时间序列的相似性传播算法

获取原文

摘要

In multivariate time series due to its high dimension, high signal-to-noise ratio and different length sequence of factors leading to poor clustering results, so the article by improving a semi-supervised clustering affinity propagation algorithm tries to solve the problem. The improved algorithm AP_DTW is obtained by using dynamic time warp distance measurement and the affinity propagation clustering of component properties. Then, two experiments are carried out on this algorithm. Experiment 1 is to compare it with the traditional distance measurement method, and experiment 2 is to compare it with the traditional clustering algorithm through ten numerical experiments. A method to verify the validity of clustering was used to evaluate the clustering results in high dimensional time series and the final experimental results were obtained.
机译:在多元时间序列中,由于其维数高,信噪比高以及因素的长度顺序不同,导致聚类结果较差,因此本文通过改进半监督聚类亲和力传播算法试图解决该问题。通过使用动态时间扭曲距离测量和组件属性的亲和力传播聚类获得改进的算法AP_DTW。然后,对该算法进行了两个实验。实验1通过10个数值实验将其与传统的距离测量方法进行比较,实验2与传统的聚类算法进行比较。采用一种验证聚类有效性的方法对高维时间序列的聚类结果进行评估,并获得最终的实验结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号