Please use this identifier to cite or link to this item: https://ah.lib.nccu.edu.tw/handle/140.119/136486
題名: 利用SVM模型判斷股票資料的隨機性成分
Using SVM Model to Classify the Random Components of Stock Data
作者: 賴彥儒
Lai, Yan-Ru
貢獻者: 曾正男
Tzeng, Jeng-Nan
賴彥儒
Lai, Yan-Ru
關鍵詞: 預測模型
類神經網路
長短期記憶模型
機器學習
支持向量機
總體經驗模態分解
Forecasting model
Artificial Neural Network
Long­-short term memory,
Machine learning
Support vector machine
EEMD
日期: 2021
上傳時間: 4-Aug-2021
摘要: 該研究的目的是對股票的資料進行分類,以判斷在一段時間內的資料為函數行為或隨機噪音。為了訓練該模型什麼是函數行為和什麼是隨機噪音,我們用三種數學模型對股票資料進行了模擬,並利用訊號處理的技巧從真實股票資料中找出建立數學模型所需要的參數。 我們使用支持向量機(SVM)和具有長期短期記憶(LSTM)的深度學習模型進行分類。 我們的結果表明,由我們的模擬數據訓練的模型使用在實際數據的預測結果,在顯著水準alpha = 0.05下,我們的分類在統計上有顯著差異。
The purpose of the study was to classify the stock price as functional behavior or random noise in a fixed period. We simulated the data with three kinds of mathematics models to train the model what is functional behavior or random noise. The parameter of mathematics models calculated by the technique of signal processing, such as EEMD. We use the support vector machine(SVM) and the deep learning model with long short-term memory(LSTM) to classification. Our results showed that our model trained by our simulated data used prediction results based on actual data, which are statistically significantly different at the significance level alpha = 0.05 for our classification.
參考文獻: [1] Abien Fred Agarap. Deep learning using rectified linear units (relu). arXiv preprint arXiv:1803.08375, 2018.\n[2] Léon Bottou. Stochastic gradient descent tricks. In Neural networks: Tricks of the trade, pages 421–436. Springer, 2012.\n[3] Léon Bottou, Frank E Curtis, and Jorge Nocedal. Optimization methods for large­scale machine learning. Siam Review, 60(2):223–311, 2018.\n[4] Chris Chatfield and Mohammad Yar. Holt­winters forecasting: some practical issues. Journal of the Royal Statistical Society: Series D (The Statistician), 37(2):129–140, 1988.\n[5] J. X. Chen. The evolution of computing: Alphago. Computing in Science Engineering, 18(4):4–7, 2016.\n[6] Trevor Hastie, Robert Tibshirani, and Jerome Friedman. The elements of statistical learning: data mining, inference, and prediction. Springer Science & Business Media, 2009.\n[7] Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. Delving deep into rectifiers: Surpassing human­level performance on imagenet classification, 2015.\n[8] Mikael Henaff, Arthur Szlam, and Yann LeCun. Recurrent orthogonal networks and long­ memory tasks. arXiv preprint arXiv:1602.06662, 2016.\n[9] Geoffrey E Hinton, Simon Osindero, and Yee­Whye Teh. A fast learning algorithm for deep belief nets. Neural computation, 18(7):1527–1554, 2006.\n[10] Sepp Hochreiter and Jürgen Schmidhuber. Long short­term memory. Neural computation, 9(8):1735–1780, 1997.\n[11] Chih­WeiHsu,Chih­ChungChang,Chih­JenLin,etal.Apracticalguidetosupportvector classification, 2003.\n[12] Norden Eh Huang. Hilbert­Huang transform and its applications, volume 16. World Scientific, 2014.\n[13] Sergey Ioffe and Christian Szegedy. Batch normalization: Accelerating deep network training by reducing internal covariate shift. In International conference on machine learning, pages 448–456. PMLR, 2015.\n[14] Gareth James, Daniela Witten, Trevor Hastie, and Robert Tibshirani. An introduction to statistical learning, volume 112. Springer, 2013.\n[15] Alex Krizhevsky, Ilya Sutskever, and Geoffrey E Hinton. Imagenet classification with deep convolutional neural networks. Advances in neural information processing systems, 25:1097–1105, 2012.\n[16] Guohui Li, Zhichao Yang, and Hong Yang. Noise reduction method of underwater acoustic signals based on uniform phase empirical mode decomposition, amplitude­aware permutation entropy, and pearson correlation coefficient. Entropy, 20(12), 2018.\n[17] K­R Muller, Sebastian Mika, Gunnar Ratsch, Koji Tsuda, and Bernhard Scholkopf. An introduction to kernel­based learning algorithms. IEEE transactions on neural networks, 12(2):181–201, 2001.\n[18] David E Rumelhart, Geoffrey E Hinton, and Ronald J Williams. Learning representations by back­propagating errors. nature, 323(6088):533–536, 1986.\n[19] Mike Schuster and Kuldip K Paliwal. Bidirectional recurrent neural networks. IEEE transactions on Signal Processing, 45(11):2673–2681, 1997.\n[20] Ohad Shamir and Tong Zhang. Stochastic gradient descent for non­smooth optimization: Convergence results and optimal averaging schemes. In International conference on machine learning, pages 71–79. PMLR, 2013.\n[21] Alex J Smola and Bernhard Schölkopf. A tutorial on support vector regression. Statistics and computing, 14(3):199–222, 2004.\n[22] Nitish Srivastava, Geoffrey Hinton, Alex Krizhevsky, Ilya Sutskever, and Ruslan Salakhutdinov. Dropout: a simple way to prevent neural networks from overfitting. The journal of machine learning research, 15(1):1929–1958, 2014.\n[23] EugeneVorontsov,ChihebTrabelsi,SamuelKadoury,andChrisPal.Onorthogonalityand learning recurrent networks with long term dependencies. In International Conference on Machine Learning, pages 3570–3578. PMLR, 2017.\n[24] Xing Wan. Influence of feature scaling on convergence of gradient iterative algorithm. In Journal of Physics: Conference Series, volume 1213, page 032021. IOP Publishing, 2019.\n[25] Zhaohua Wu and Norden E Huang. Ensemble empirical mode decomposition: a noise­ assisted data analysis method. Advances in adaptive data analysis, 1(01):1–41, 2009.
描述: 碩士
國立政治大學
應用數學系
109751005
資料來源: http://thesis.lib.nccu.edu.tw/record/#G0109751005
資料類型: thesis
Appears in Collections:學位論文

Files in This Item:
File Description SizeFormat
100501.pdf551.68 kBAdobe PDF2View/Open
Show full item record

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.