| 基于复杂网络的时间序列转换算法 |
| |
| 引用本文： | 何茂雨,周银,周静曦,沈黎.基于复杂网络的时间序列转换算法[J].吉首大学学报(自然科学版),2021,41(6):28-31. |
| |
| 作者姓名： | 何茂雨 周银 周静曦 沈黎 |
| |
| 作者单位： | (湖南农业大学信息与智能科学技术学院，湖南 长沙 410128) |
| |
| 基金项目： | 湖南省大学生创新训练项目(S201910537030)；湖南省教育厅科学研究项目(17C0755) |
| |
| 摘 要： | 引入最大值分裂算法和凸包发现算法，分别对时间序列转换为复杂网络的经典可视图算法进行改进，并将经典可视图算法及其2种改进算法应用于分形布朗运动时间序列中.实验结果表明，2种改进算法能明显降低时间复杂度.
|
Time Series Transformation Algorithms Based on Complex Networks |
| |
| HE Maoyu,ZHOU Yin,ZHOU Jingxi,SHEN Li.Time Series Transformation Algorithms Based on Complex Networks[J].Journal of Jishou University(Natural Science Edition),2021,41(6):28-31. |
| |
| Authors: | HE Maoyu ZHOU Yin ZHOU Jingxi SHEN Li |
| |
| Institution: | (College of Information and Intelligence Science and Technology, Hunan Agricultural University, Changsha 410128,China) |
| |
| Abstract: | To improve classic visibility algorithm of transformation from time series to complex networks, this paper proposes maximum value split algorithm and convex hull algorithm and applies them in the fractal Brown time series respectively. Experimental results show that improved algorithm can reduce time complexity remarkably. |
| |
| Keywords: | time series visibility algorithm maximum value split convex hull |
|
| 点击此处可从《吉首大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《吉首大学学报(自然科学版)》下载免费的PDF全文 |
