Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/237162 
Year of Publication: 
2019
Citation: 
[Journal:] Financial Innovation [ISSN:] 2199-4730 [Volume:] 5 [Issue:] 1 [Publisher:] Springer [Place:] Heidelberg [Year:] 2019 [Pages:] 1-12
Publisher: 
Springer, Heidelberg
Abstract: 
Introduction: Nowadays, the most significant challenges in the stock market is to predict the stock prices. The stock price data represents a financial time series data which becomes more difficult to predict due to its characteristics and dynamic nature. Case description: Support Vector Machines (SVM) and Artificial Neural Networks (ANN) are widely used for prediction of stock prices and its movements. Every algorithm has its way of learning patterns and then predicting. Artificial Neural Network (ANN) is a popular method which also incorporate technical analysis for making predictions in financial markets. Discussion and evaluation: Most common techniques used in the forecasting of financial time series are Support Vector Machine (SVM), Support Vector Regression (SVR) and Back Propagation Neural Network (BPNN). In this article, we use neural networks based on three different learning algorithms, i.e., Levenberg-Marquardt, Scaled Conjugate Gradient and Bayesian Regularization for stock market prediction based on tick data as well as 15-min data of an Indian company and their results compared. Conclusion: All three algorithms provide an accuracy of 99.9% using tick data. The accuracy over 15-min dataset drops to 96.2%, 97.0% and 98.9% for LM, SCG and Bayesian Regularization respectively which is significantly poor in comparison with that of results obtained using tick data.
Subjects: 
Neural Networks
Indian Stock Market Prediction
Levenberg-Marquardt
Scale Conjugate Gradient
Bayesian Regularization
Tick by tick data
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article

Files in This Item:
File
Size





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