期刊文献+

意愿计算的股市突变点预测方法

Prediction method of stock market mutation point prediction with willingness calculation
下载PDF
导出
摘要 由于传统分段线性表示方法没有考虑股市数据分布变化导致分段不合理,同时股市突变点相关特征的局部性导致突变点难以有效预测,所以在分段线性表示方法的基础上提出一种意愿计算的股市突变点预测方法(WC-WSVM)。首先,给出一种波动率分布变化的分段线性表示(V-PLR)方法,通过波动率分布变化自适应地优化PLR分段阈值;然后,提取与主力买卖股票意愿相关的股市特征并进行量化,利用逻辑回归(LR)对于所提取的特征进行融合得到意愿计算结果;最后,将意愿计算结果与PLR-WSVM算法输入特征共同代入到WSVM中,进行突变点预测。在真实数据上的实验结果表明,算法具有强适应性,预测精度得到有效提升。 Because the traditional piecewise linear representation method does not consider the stock market data distribution changes,which leads to unreasonable segmentation.Meanwhile the locality of the stock market mutation point related characte-ristics makes the mutation point difficult to predict effectively.Therefore,based on the piecewise linear representation method,this paper proposed a prediction method of stock market mutation point with willingness calculation(WC-WSVM).Firstly,it gave a piecewise linear representation(V-PLR)method of volatility distribution change,and the volatility distribution change optimized the PLR segmentation threshold.Secondly,itextracted the stock market characteristics related to the main willingness to buy and sell stocks to quantify,using logistic regression(LR)to fuse the extracted features to obtain the willingness calculation results.Finally,it brought the willingness calculation results and the PLR-WSVM algorithm input features into the WSVM together,to predict the mutation point.Experimental results on real data show that the algorithm is more adaptable and the prediction accuracy is effectively improved.
作者 姚宏亮 董伟伟 王浩 杨静 Yao Hongliang;Dong Weiwei;Wang Hao;Yang Jing(School of Computer&Information,Hefei University of Technology,Hefei 230601,China)
出处 《计算机应用研究》 CSCD 北大核心 2021年第4期1108-1112,1118,共6页 Application Research of Computers
基金 安徽省关键研究与开发计划资助项目(201904a05020073) 国家自然科学基金面上项目(61876206)。
关键词 突变点 分段线性表示 支持向量机 意愿计算 逻辑回归 mutation point PLR SVM willingness calculation logistic regression
  • 相关文献

参考文献7

二级参考文献65

  • 1丁圣,高风.小波神经网络在股票平均线交易规则中的应用[J].计算机仿真,2006,23(11):259-262. 被引量:3
  • 2凌晓峰,SHENG Victor S..代价敏感分类器的比较研究(英文)[J].计算机学报,2007,30(8):1203-1212. 被引量:35
  • 3Faloutsos C, Ranganathan M, Yannis M. Fast Subsequence Matching in Time series Databases[A]. Proc. ACM SIGMOD[ C] ,1994:419-429.
  • 4Agrawal R, Faloutsos C, Swami A. Efficient Similarity Search in Sequence Databases [ A]. Proc. of the 4th Conf. on Foundations of Data Organization and Algorithms [ C ], 1993:69 - 84.
  • 5Chan K,Fu W. Efficient Time Series Matching by Wavelets[ A]. Proc. of the 15th IEEE International Conference on Data Engineering [ C ], 1999:126- 133.
  • 6Agrawal R,Lin K, Sawhney H S,Shim K, Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time Series Databases [ A ]. Proc. of the VLDB [ C ], 1995:490 - 501.
  • 7Ge X,Smyth P. Segmental Semi-Markov Models for Endpoint Detection in Plasma Etching[ J]. IEEE Transactions on Semiconductor Engineering, 2000.
  • 8Pavlidis T, Horowitz S. Segmentation of Plane Curves [ J ]. IEEE Transactions on Computers, 1974,23 ( 8 ) :860 - 870.
  • 9Keogh E,Chakrabarti K, Pazzani M. Dimensionality Reduction for Fast Similarity Search in Large Time Series Databases [ J ]. Journal of Knowledge and Information Systems,2000,3 (3) :263 -286.
  • 10Wang C, Wang S. Supporting Content-based Searches on Time Series via Approximation[ A]. Proceedings of the 12th International Conference on Scientific and Statistical Database Management [ C] ,2000.

共引文献61

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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