Evaluation of Alternative Approaches in Classification Algorithms for Prediction of Stock Market Index: Case of Crobex

Evaluation of Alternative Approaches in Classification Algorithms for Prediction of Stock Market Index: Case of Crobex

Silvija Vlah Jerić
DOI: 10.4018/978-1-7998-5083-0.ch010
OnDemand:
(Individual Chapters)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

This chapter tackles the problem of automatic recognition of favorable days for intra-day trading. The problem is modeled as a binary classification problem, and several approaches are tested for solving it. Croatian stock index CROBEX data is used and 22 technical indicators are calculated as predictor variables. Performance of five classifiers is evaluated and compared by using Cohen's kappa as evaluation metric: artificial neural network, support network machine, random forest, k-nearest neighbors, and naïve Bayes classifier. The results give insight to effectiveness of technical analysis in predicting the day favorability for CROBEX index and suggest that technical analysis makes sense and might work for this case.
Chapter Preview
Top

Introduction

Stock market index is often used to describe the aggregate movements in a market as it represents a measurement of value of a section of the stock market and reflects the level of the free float value. Since its changes involve a stochastic component, it is very difficult to predict and forecasting stock market index value has always been one of the hottest topics in research. One of the ways of analyzing stock movement is technical analysis which consists of using past market information to predict the direction of prices.

The problem of automatic recognition of favorable days for intra-day trading can be modeled as a binary classification problem. Day trading consists in buying and selling financial instruments within the same trading day and favorable for intra-day trading means that the increase between the opening price and the closing price of the same day is large enough for obtaining a profit by buying at the opening price and selling at the closing price. Thereby “large enough” is defined by selecting a certain threshold. The underlying classification problem consists of attribution of one of two labels to daily records according to values of a selection of technical indicators. The class that is assigned to each daily record is 1 if the subsequent day is favorable for intra-day trading and 0 otherwise. The problem is to discover the relation between the selected indicators at a certain day and the market situation at the following day that would determine the class of day that is observed, according to technical analysis (Lo & Hasanhodzic, 2010). The objective, as in any classification problem, is to achieve the highest accuracy possible when comparing the prediction with the real class.

The goal of this chapter is to evaluate and compare different classification algorithms on automatic recognition of favorable days for intra-day trading. Classification problems has been intensively studied and there are many classification algorithms available today (Bruni & Bianchi, 2015; Hastie, Tibshirani, & Friedman, 2001). Different families of algorithms are tested: neural network, support vector machine, random forest, as well as k-nearest neighbors and naïve Bayes classifier as more typical classifiers. The idea is to test different families of algorithms but to give more attention to algorithms which are used more rarely than typical statistical methods which are still considered to be “mainstream” although is a lot of research in alternative approaches nowadays too. The algorithms will be applied to Croatian stock index CROBEX and it is the first attempt of such kind to the best of authors’ knowledge and should fill some gap in this area of research observed in literature (Šego & Škrinjarić, 2018). The results will give insight to effectiveness of technical analysis in predicting the index value, as well to observe the accuracy of different classification methods.

Key Terms in this Chapter

K-Nearest Neighbors: Classification method in which an object is classified by a plurality vote of its neighbors, with the object being assigned to the class most common among its k nearest neighbors.

Support Vector Machine: A computational model that finds a hyperplane in an N-dimensional space that distinctly classifies the data points.

Binary Classification: The task of classifying the elements of a given set into two groups.

Favorable for Intra-Day Trading: The increase between the opening price and the closing price of the same day is large enough for obtaining a profit by buying at the opening price and selling at the closing price.

Artificial Neural Network: A computational model that is inspired by the way biological neural networks in the human brain process information.

Day Trading: Buying and selling financial instruments within the same trading day.

CROBEX: Croatian stock index.

Naïve Bayes Classifier: A probabilistic machine learning model used for classification problems based on the Bayes theorem.

Complete Chapter List

Search this Book:
Reset