Thimani Ranathungage

dblp:365/4758 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2024
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 3 · 2 first-author · 3 since 2021Applied, interdisciplinary, general and emerging computing · 3 · 2 first-author · 3 since 2021
YearPublicationVenuePosition
2024 A Cryptocurrency Multiple Trading Strategy with Kalman Filter Innovation Volatility Interval Forecasts
abstract
Pairs trading and multiple trading strategies are types of market-neutral strategies to use a pair or a combination of stocks and other financial instruments with co-integration or co-movements to generate potential profits, which may not be affected by the direction of the overall market. Commonly used pairs and multiple trading strategies are constructed using the Kalman Filter (KF) to utilize mean reversion in nonstationary but co-integrated asset prices. In this paper, we propose novel resilient pairs trading and multiple trading strategies using the combination of the KF algorithm and the KF innovation volatility interval forecasts using neural networks. The proposed trading strategies are implemented and investigated using the hourly prices of Bitcoin, Ethereum and Bitcoin Cash in the bear market. Those crypto assets are selected because they move in the same direction in the long term and have high trading volumes. The experimental results reveal performance for the proposed trading strategies with the upper and lower trading intervals using KF innovation volatility interval forecasts superior to that of the trading strategies with upper and lower trading bands using KF innovation volatility point forecasts. The performance and robustness of the proposed trading strategies using a proper assumption of transaction costs have also been examined. The strategies using innovation volatility interval forecasts consistently generate higher profits and a more robust number of transactions with or without transaction costs than those using innovation volatility point forecasts.
You Liang, A. Thavaneswaran, Juan Liyau, Areebah Muhammad, Thimani Ranathungage, Ruppa K. Thulasiram
COMPSAC5
2024 Application of a Novel Fuzzy Pattern Mining Algorithm for Sequence Data
abstract
For many Markov chains that arise in applications (health, finance, etc.), state spaces are huge, and existing matrix methods may not be practical or even not possible to implement. In the literature, the expected waiting time for Markov chain (with a smaller number of states) generated patterns are obtained by finding an appropriate pattern matrix and solving a set of linear equations. In this paper, a fuzzy transition probability (TP) matrix is introduced, and a data-driven fuzzy pattern mining algorithm is proposed for sequence data of any length. The proposed algorithm, which avoids the inversion of the pattern matrix, is applicable to Markov chains with huge state spaces. The proposed algorithm studies two examples involving DNA sequence data with 3954 base pairs and patterns generated by the log-returns of the stocks/cryptocurrencies. Expected weighting times are compared with the traditional matrix approach. Incorporating stochastic variation in the TP estimates through fuzzy matrices, the new approach provides an alternative path to produce$\alpha$-cuts for TP matrices. The main contribution of this paper is to fit an appropriate MC model to a given sequence data and use the proposed fuzzy pattern mining algorithm to obtain resilient probabilistic forecasts and expected waiting time to reach patterns of interest.
Thimani Ranathungage, Sulalitha Bowala, Md. Erfanul Hoque, A. Thavaneswaran, Ruppa K. Thulasiram
COMPSAC1
2024 Novel Data-Driven Dynamic Network Science Application in Algorithmic Trading
abstract
One of the recent developments in computational finance has been the rise in using graph-based approaches to analyse stock market dynamics systematically. In algo trading literature, stocks for pairs trading and multiple trading are commonly selected by using Engle Granger and Johansen co-integration tests. Identifying all pairs eligible for trading in large datasets, entails a significant computational burden. In this paper, price correlation-based dynamic networks and differenced price series-based correlation networks and their importance ranks are used to pre-select pairs for trading. Algorithmic trading profits using commonly used co-integration methods are compared with the profits made by proposed correlation-based financial networks. Unlike the existing work, the novelty of the paper is that it uses data-driven correlation-based financial network approach to propose a stock selection method for pairs trading. In this paper, profit per transaction is used to compare the trading strategies. The superiority of the financial network stock selection method is discussed as well in some detail.
Thimani Ranathungage, A. Thavaneswaran, You Liang, Ruppa K. Thulasiram, Alexander Paseka
COMPSAC1