Particle swarm optimization for time series motif discovery.

Knowledge-Based Systems(2016)

引用 32|浏览26
暂无评分
摘要
•We consider the task of finding repeated segments or motifs in time series.•We propose a new standpoint to the task: formulating it as an optimization problem.•We apply particle swarm optimization to solve the problem.•The proposed solution finds comparable motifs in substantially less time.•The proposed standpoint brings in an unprecedented degree of flexibility to the task.
更多
查看译文
关键词
Motifs,Time series,Anytime algorithms,Particle swarm optimization,Multimodal optimization
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要