Combining supervised and unsupervised learning methods to predict financial market movements

• URL: http://arxiv.org/abs/2409.03762v1
• Date: Mon, 19 Aug 2024 13:17:36 GMT
• Title: Combining supervised and unsupervised learning methods to predict financial market movements
• Authors: Gabriel Rodrigues Palma, Mariusz Skoczeń, Phil Maguire,
• Abstract summary: We identify novel features extracted from emergent and well-established financial markets. We used approximately six months of data consisting of minute candles from the Bitcoin, Pepecoin, and Nasdaq markets. We explored the performance of various machine learning strategies, such as Random Forests (RF) and K-Nearest Neighbours (KNN) to classify market movements.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The decisions traders make to buy or sell an asset depend on various analyses, with expertise required to identify patterns that can be exploited for profit. In this paper we identify novel features extracted from emergent and well-established financial markets using linear models and Gaussian Mixture Models (GMM) with the aim of finding profitable opportunities. We used approximately six months of data consisting of minute candles from the Bitcoin, Pepecoin, and Nasdaq markets to derive and compare the proposed novel features with commonly used ones. These features were extracted based on the previous 59 minutes for each market and used to identify predictions for the hour ahead. We explored the performance of various machine learning strategies, such as Random Forests (RF) and K-Nearest Neighbours (KNN) to classify market movements. A naive random approach to selecting trading decisions was used as a benchmark, with outcomes assumed to be equally likely. We used a temporal cross-validation approach using test sets of 40%, 30% and 20% of total hours to evaluate the learning algorithms' performances. Our results showed that filtering the time series facilitates algorithms' generalisation. The GMM filtering approach revealed that the KNN and RF algorithms produced higher average returns than the random algorithm.

Related papers

• Cryptocurrency Portfolio Optimization by Neural Networks [81.20955733184398]
  This paper proposes an effective algorithm based on neural networks to take advantage of these investment products. A deep neural network, which outputs the allocation weight of each asset at a time interval, is trained to maximize the Sharpe ratio. A novel loss term is proposed to regulate the network's bias towards a specific asset, thus enforcing the network to learn an allocation strategy that is close to a minimum variance strategy.
  arXiv  Detail & Related papers  (2023-10-02T12:33:28Z)
• Anytime Model Selection in Linear Bandits [61.97047189786905]
  We develop ALEXP, which has an exponentially improved dependence on $M$ for its regret. Our approach utilizes a novel time-uniform analysis of the Lasso, establishing a new connection between online learning and high-dimensional statistics.
  arXiv  Detail & Related papers  (2023-07-24T15:44:30Z)
• TM-vector: A Novel Forecasting Approach for Market stock movement with a Rich Representation of Twitter and Market data [1.5749416770494706]
  We will introduce TM-vector and then use this vector to train an IndRNN and ultimately model the market users' behaviour. In the proposed model, TM-vector is simultaneously trained with both the extracted Twitter features and market information. Various factors have been used for the effectiveness of the proposed forecasting approach.
  arXiv  Detail & Related papers  (2023-03-13T18:55:41Z)
• Feature Selection with Annealing for Forecasting Financial Time Series [2.44755919161855]
  This study provides a comprehensive method for forecasting financial time series based on tactical input output feature mapping techniques using machine learning (ML) models. Experiments indicate that the FSA algorithm increased the performance of ML models, regardless of problem type.
  arXiv  Detail & Related papers  (2023-03-03T21:33:38Z)
• Optimal Stopping with Gaussian Processes [2.126171264016785]
  We show that structural properties commonly exhibited by financial time series allow the use of Gaussian and Deep Gaussian Process models. We additionally quantify uncertainty in the value function by propagating the price model through the optimal stopping analysis. We show that our family of algorithms outperforms benchmarks on three historical time series datasets.
  arXiv  Detail & Related papers  (2022-09-22T21:19:27Z)
• Quantum computational finance: martingale asset pricing for incomplete markets [69.73491758935712]
  We show that a variety of quantum techniques can be applied to the pricing problem in finance. We discuss three different methods that are distinct from previous works.
  arXiv  Detail & Related papers  (2022-09-19T09:22:01Z)
• Application of Convolutional Neural Networks with Quasi-Reversibility Method Results for Option Forecasting [11.730033307068405]
  We create and evaluate new empirical mathematical models for the Black-Scholes equation to analyze data for 92,846 companies. We solve the Black-Scholes (BS) equation forwards in time as an ill-posed inverse problem, using the Quasi-Reversibility Method (QRM) to predict option price for the future one day. The current stage of research combines QRM with Convolutional Neural Networks (CNN), which learn information across a large number of data points simultaneously.
  arXiv  Detail & Related papers  (2022-08-25T04:08:59Z)
• Bayesian Bilinear Neural Network for Predicting the Mid-price Dynamics in Limit-Order Book Markets [84.90242084523565]
  Traditional time-series econometric methods often appear incapable of capturing the true complexity of the multi-level interactions driving the price dynamics. By adopting a state-of-the-art second-order optimization algorithm, we train a Bayesian bilinear neural network with temporal attention. By addressing the use of predictive distributions to analyze errors and uncertainties associated with the estimated parameters and model forecasts, we thoroughly compare our Bayesian model with traditional ML alternatives.
  arXiv  Detail & Related papers  (2022-03-07T18:59:54Z)
• Machine Learning for Stock Prediction Based on Fundamental Analysis [13.920569652186714]
  We investigate three machine learning algorithms: Feed-forward Neural Network (FNN), Random Forest (RF) and Adaptive Neural Fuzzy Inference System (ANFIS) RF model achieves the best prediction results, and feature selection is able to improve test performance of FNN and ANFIS. Our findings demonstrate that machine learning models could be used to aid fundamental analysts with decision-making regarding stock investment.
  arXiv  Detail & Related papers  (2022-01-26T18:48:51Z)
• Machine Learning for Online Algorithm Selection under Censored Feedback [71.6879432974126]
  In online algorithm selection (OAS), instances of an algorithmic problem class are presented to an agent one after another, and the agent has to quickly select a presumably best algorithm from a fixed set of candidate algorithms. For decision problems such as satisfiability (SAT), quality typically refers to the algorithm's runtime. In this work, we revisit multi-armed bandit algorithms for OAS and discuss their capability of dealing with the problem. We adapt them towards runtime-oriented losses, allowing for partially censored data while keeping a space- and time-complexity independent of the time horizon.
  arXiv  Detail & Related papers  (2021-09-13T18:10:52Z)
• A Sharp Analysis of Model-based Reinforcement Learning with Self-Play [49.88233710867315]
  We present a sharp analysis of model-based self-play algorithms for multi-agent Markov games. We design an algorithm -- Optimistic Nash Value Iteration (Nash-VI) for two-player zero-sum Markov games. We further adapt our analysis to designing a provably efficient task-agnostic algorithm for zero-sum Markov games.
  arXiv  Detail & Related papers  (2020-10-04T15:27:39Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.