期刊文献+

一个模糊时间序列预测模型的集合 被引量:2

A set of fuzzy time series prediction models
下载PDF
导出
摘要 提出一个模糊时间序列预测模型的集合(SPMFTS)。证明了对于任意时间序列S,应用SPMFTS的自动寻优搜索建模法可以筛选出集合的一个模型FMC_j^1(x,f,i),使得预测值C_j(x,f,i)的相对误差均达到0.000 0%。例如预测美国2010—2016年的跑道侵入问题时,建模FMC可以实现的预测值的相对误差均为0.000 0%;对于预测未来的(美国,2017年)跑道侵入数据时,建模FMC实现的预测值也可达到相对误差为0.000 0%。这些预测模型都比灰色模型GM(1,1)和马尔科夫模型的预测精确度高。因此SPMFTS的建模FMC比灰色马尔科夫模型更有优势。 Put forward a set of predict model of fuzzy time series (SPMFTS). It can prove that: for any time series S, the model FMC 1 j(x,f,i ) in the set SPMFTS, can definitely be selected by applying the automatic optimization search modeling method of SPMFTS, makes the predictive value C j(x,f,i) relative error be 0.000 0%. For example, when simulating and predicting runway invasion problems in the United States from 2010 to 2016, FMC can realize predictive value of relative error is 0.000 0%;For the prediction of future (US,2017) runway invasion data, the relative error of the predictive value achieved by the modeling FMC can also reach 0.000 0%. These prediction models are more accurate than the gray model GM(1,1) and markov model. Therefore, the modeling FMC of SPMFTS is more advantageous than the gray markov model.
作者 马树才 马芳 王鸿绪 MA Shucai;MA Fang;WANG Hongxu(College of Economics, Liaoning University, Shenyang 110036, China;School of Business, Hainan Tropical OceanUniversity, Sanya 572000, China)
出处 《沈阳师范大学学报(自然科学版)》 CAS 2019年第1期29-33,共5页 Journal of Shenyang Normal University:Natural Science Edition
基金 国家自然科学基金资助项目(61503254) 辽宁省教育厅高等学校基本科研项目(WQGD2017021)
关键词 时间序列S SPMFTS的预测模型Cj(x f i) SPMFTS的自动寻优建模法 跑道侵入 建模FMC time series S prediction model C j(x,f,i) of SPMFTS SPMFTS automatic optimization modeling method modeling FMC
  • 相关文献

参考文献2

二级参考文献59

  • 1刘涵,刘丁,李琦.基于支持向量机的混沌时间序列非线性预测[J].系统工程理论与实践,2005,25(9):94-99. 被引量:46
  • 2段江娇,薛永生,林子雨,汪卫,施伯乐.一种新的基于隐Markov模型的分层时间序列聚类算法[J].计算机研究与发展,2006,43(1):61-67. 被引量:10
  • 3KEOGH E,KASETTY S.On the need for time series data mining benchmarks:a survey and empirical demonstration[C]//Proc of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.New York:ACM Press,2002:102-111.
  • 4HETLAND M L.A survey of recent methods for efficient retrieval of similar time sequences[EB/OL].(2001).http://citeseer.nj.nec.com/hetland01survey.html.
  • 5HOPPNER K.Time series abstraction methods:a survey[C]//Proc of GI Jahrestagung Informatik,Workshop on Knowledge Discovery in Databases.Dortmund:[s.n.],2002:777-786.
  • 6LAXMAN S,SASTRY P S.A survey of temporal data mining[J].Sādhanā Academy Proceedings in Engineering Sciences,2006,31(2):173-198.
  • 7AGRAWALR,FALOUTSOS C,SWAMI A.Efficient similarity search in sequence databases[C]//Proc of the 4th International Conference on Foundations of Data Organization and Algorithms.London:Springer-Verlag,1993:69-84.
  • 8FALOUTSOS C,RANGANATHAN M,MANOLOPOULOS Y.Fast subsequence matching in time-series databases[C]//Proc of the ACM SIGMOD International Conference on Management of Data.Mineapolis:ACM Press,1994:419-429.
  • 9RAFIEI D,MENDELZON A O.Querying time series data based on similarity[J].IEEE Trans on Knowledge and Data Engineering,2000,12(5):675-693.
  • 10WANG Chang-zhou,WANG Xiao-yang.Multilevel filtering for high dimensional nearest neighbor search[C]//Proc of ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery.Dallas:ACM Press,2000:37-43.

共引文献76

同被引文献13

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部