Short-term bitcoin market prediction via machine learning
Open accessThe DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Abstract
We analyze the predictability of the bitcoin market across prediction horizons ranging from 1 to 60 min. In doing so, we test various machine learning models and find that, while all models outperform a random classifier, recurrent neural networks and gradient boosting classifiers are especially well-suited for the examined prediction tasks. We use a comprehensive feature set, including technical, blockchain-based, sentiment-/interest-based, and asset-based features. Our results show that technical features remain most relevant for most methods, followed by selected blockchain-based and sentiment-/interest-based features. Additionally, we find that predictability increases for longer prediction horizons. Although a quantile-based long-short trading strategy generates monthly returns of up to 39% before transaction costs, it leads to negative returns after taking transaction costs into account due to the particularly short holding periods.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
Hochreiter, S., & Schmidhuber, J. (1997) · Neural Computation · doi:10.1162/neco.1997.9.8.1735 · Cited by 102,318
Greedy function approximation: A gradient boosting machine
Friedman, J. H. (2001) · The Annals of Statistics · doi:10.1214/aos/1013203451 · Cited by 30,731
Efficient capital markets: A review of theory and empirical work
Fama, E. F. (1970) · The Journal of Finance · doi:10.2307/2325486 · Cited by 13,635
Empirical Evaluation of Gated Recurrent Neural Networks on Sequence Modeling
Chung, J., Gulcehre, C., Cho, K., & Bengio, Y. (2014) · arXiv · doi:10.48550/arxiv.1412.3555 · Cited by 11,008
Speech recognition with deep recurrent neural networks
Graves, A., Mohamed, A.-R., & Hinton, G. (2013) · 2013 IEEE International Conference on Acoustics, Speech and Signal Processing · doi:10.1109/icassp.2013.6638947 · Cited by 8,893
Approximation capabilities of multilayer feedforward networks
Hornik, K. (1991) · Neural Networks · doi:10.1016/0893-6080(91)90009-t · Cited by 6,091
Graves, A., Fernández, S., Gomez, F., & Schmidhuber, J. (2006) · Proceedings of the 23rd international conference on Machine learning - ICML '06 · doi:10.1145/1143844.1143891 · Cited by 5,370
Shleifer, A., & Vishny, R. W. (1997) · The Journal of Finance · doi:10.1111/j.1540-6261.1997.tb03807.x · Cited by 5,291 · cited 1×
“16 Informed traders exploit these inefficiencies so that prices reflect all available information again.”
On the impossibility of informationally efficient markets
Stiglitz, J. E., & Grossman, S. J. (1980) · Columbia University · doi:10.7916/d8765r99 · Cited by 3,645
The Disposition to Sell Winners Too Early and Ride Losers Too Long: Theory and Evidence
SHEFRIN, H., & STATMAN, M. (1985) · The Journal of Finance · doi:10.1111/j.1540-6261.1985.tb05002.x · Cited by 3,553
Generating Sequences With Recurrent Neural Networks
Graves, A. (2013) · arXiv · doi:10.48550/arxiv.1308.0850 · Cited by 2,894
Fama (1998) · doi:10.1016/s0304-405x(98)00026-9 · Cited by 2,576
Empirical Asset Pricing via Machine Learning
Gu, S., Kelly, B., & Xiu, D. (2020) · The Review of Financial Studies · doi:10.1093/rfs/hhaa009 · Cited by 2,545
Neural Networks: Tricks of the Trade: Second Edition
(2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-35289-8 · Cited by 2,116
Prechelt, L. (1998) · Lecture Notes in Computer Science · doi:10.1007/3-540-49430-8_3 · Cited by 1,649
Urquhart, A. (2016) · Economics Letters · doi:10.1016/j.econlet.2016.09.019 · Cited by 1,338
Deep neural networks, gradient-boosted trees, random forests: Statistical arbitrage on the S&P 500
Krauss, C., Do, X. A., & Huck, N. (2017) · European Journal of Operational Research · doi:10.1016/j.ejor.2016.10.031 · Cited by 750 · cited 1×
“In line with Takeuchi and Lee 51 and Krauss et al, 52 we choose a more granular resolution for the most recent feature history.”
The inefficiency of Bitcoin revisited: A dynamic approach
Bariviera, A. F. (2017) · Economics Letters · doi:10.1016/j.econlet.2017.09.013 · Cited by 617
The supraview of return predictive signals
Green, J., Hand, J. R. M., & Zhang, X. F. (2013) · Review of Accounting Studies · doi:10.1007/s11142-013-9231-1 · Cited by 219
Predicting bitcoin returns using high-dimensional technical indicators
Huang, J.-Z., Huang, W., & Ni, J. (2019) · The Journal of Finance and Data Science · doi:10.1016/j.jfds.2018.10.001 · Cited by 177
Monnier, L., Benichou, M., Charra-Ebrard, S., Boegner, C., & Colette, C. (2005) · Diabetes & Metabolism · doi:10.1016/s1262-3636(07)70174-x · Cited by 69
Bitcoin: Predictability and Profitability via Technical Analysis
Detzel, A. L., Liu, H., Strauss, J., Zhou, G., & Zhu, Y. (2018) · SSRN Electronic Journal · doi:10.2139/ssrn.3115846 · Cited by 20
Metadata
- Authors
- Jaquart, P., Dann, D., & Weinhardt, C.
- Venue
- The Journal of Finance and Data Science
- Publisher
- Elsevier BV
- Published
- 2021-11
- Volume
- 7
- Pages
- 45-66
- ISSN
- 2405-9188 (ISSN-L)
- OpenAlex
- W3136959963
- Cited by
- 160
- References
- 23
- FWCI
- 19.08
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.