计算机应用 ›› 2011, Vol. 31 ›› Issue (11): 3104-3107.DOI: 10.3724/SP.J.1087.2011.03104

• 人工智能 • 上一篇    下一篇

窗口式蚁群序列分割算法

刘会彬,何振峰   

  1. 福州大学 数学与计算机科学学院,福州 350108
  • 收稿日期:2011-05-10 修回日期:2011-07-04 发布日期:2011-11-16 出版日期:2011-11-01
  • 通讯作者: 刘会彬
  • 作者简介:刘会彬(1987-),男,江西吉安人,硕士研究生,主要研究方向:数据挖掘;何振峰(1971-),男,安徽石台人,副教授,博士,主要研究方向:机器学习、编译器优化。

Ant colony optimization based on window updating for time series segmentation

LIU Hui-bin,HE Zhen-feng   

  1. School of Mathematics and Computer Science, Fuzhou University, Fuzhou Fujian 350108, China
  • Received:2011-05-10 Revised:2011-07-04 Online:2011-11-16 Published:2011-11-01
  • Contact: LIU Hui-bin

摘要: 应用蚁群优化算法(ACO)对时间序列进行分割,为提高算法寻优效率,依据时间序列内在的连续性,采用信息素窗口式更新策略。依据序列连续性指导信息素进行窗口式的加强,从而使蚂蚁的正反馈机制得到增强,更利于蚂蚁的路径选择。实验结果表明,基于信息素窗口式更新策略的蚁群序列分割方法一定程度上可以加快算法收敛,同时可以有效地降低序列分割代价。

关键词: 数据挖掘, 时间序列, 蚁群优化算法, 线性表示, 分割

Abstract: This paper applied a modified algorithm of Ant Colony Optimization (ACO) for time series segmentation, which updated pheromone based on window according to the inner continuity of time series for improving optimization efficiency. The algorithm strengthened pheromone according to series continuity; thus, it can improve the positive feedbacks of ants. Then the positive feedbacks were a help for ants to choose paths in the next cycle. The experiments with true data sets validate that the modified method can accelerate the algorithm's convergence and reduce the segmentation cost to a certain extent.

Key words: data mining, time series, Ant Colony Optimization (ACO), linear representation, segmentation