检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:宋士豹 杨淑莹 Song Shibao;Yang Shuying(School of Computer Science & Engineering,Tianjin University of Technology,Tianjin 300384,China;Key Laboratory of Computer Vision & System for Ministry of Education,Tianjin 300384,China)
机构地区:[1]天津理工大学计算机科学与工程学院,天津300384 [2]计算机视觉与系统教育部重点实验室,天津300384
出 处:《计算机应用研究》2018年第8期2270-2273,2319,共5页Application Research of Computers
基 金:国家自然科学基金资助项目(61001174);天津市科技支撑;天津市自然科学基金资助项目(13JCYBJC17700)
摘 要:针对高维混沌复杂系统的多步预测问题,提出了一种基于邻近相点聚类分析的多变量局域多步预测模型。首先对于多变量邻近相点的选取,结合邻近相点多步回溯后的演化规律和变量间的关联信息对演化轨迹的影响,提出了一种新的多变量演化轨迹相似度综合判据;然后针对选取全局最优邻近相点耗时长的缺点,提出了一种基于邻近相点聚类分析的新方案来降低多步预测时间,提高预测效率。最后通过Lorenz混沌数据仿真实验,表明该模型具有优良的预测性能。In order to solve the problem of multi-step prediction for high dimensional chaotic complex systems, this paper proposed a multivariate local multi-step prediction model based on cluster analysis of adjacent phase points. First, it considered the evolution rule of adjacent phase points after multi-step backtracking and the influence of related information on evolutionary trajectory for selecting adjacent phase points. So this paper proposed a new multivariate evolutionary trajectory similarity criterion. Then, the traditional model took a long time to select the optimal phase points. To overcome this shortcoming, it proposed a new method based on cluster analysis of adjacent phase points. This method can reduce the multi-step prediction time and improve prediction efficiency. Finally, the simulation results of Lorenz chaotic data show that this model has good prediction performance.
分 类 号:TP301.6[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:13.59.96.255