Access the full text.
Sign up today, get DeepDyve free for 14 days.
E. Chan (2013)
Algorithmic Trading: Winning Strategies and Their Rationale
S. Foster, Frank Zeyda (1981)
OpticsPostgraduate Medical Journal, 57
J. Armstrong (2001)
Principles of forecasting
I. Jolliffe (2002)
Principal Component Analysis
J. Armstrong (2001)
Principles of forecasting : a handbook for researchers and practitioners
M. Ester, H. Kriegel, J. Sander, Xiaowei Xu (1996)
A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise
M. Ankerst, M. Breunig, H. Kriegel, J. Sander (1999)
OPTICS: ordering points to identify the clustering structure
R. Bellman (1957)
Dynamic ProgrammingScience, 153
M. Avellaneda, Jeong-Hyun Lee (2010)
Statistical arbitrage in the US equities marketQuantitative Finance, 10
R. Kissell (2021)
Algorithmic TradingAlgorithmic Trading Methods
M. Avellaneda, Jeong-Hyun Lee (2008)
Statistical Arbitrage in the U.S. Equities MarketPolitical Methods: Quantitative Methods eJournal
J. Ramos-Requena, J. Trinidad-Segovia, M. Sánchez-Granero (2017)
Introducing Hurst exponent in pair tradingPhysica A-statistical Mechanics and Its Applications, 488
P. Berkhin (2006)
A Survey of Clustering Data Mining Techniques
P. Rousseeuw (1987)
Silhouettes: a graphical aid to the interpretation and validation of cluster analysisJournal of Computational and Applied Mathematics, 20
S. Ross (1976)
The arbitrage theory of capital asset pricingJournal of Economic Theory, 13
[This chapter proposes a new framework for pairs selection aiming to answer this work’s first research question (introduced in Chap. 1): “Can Unsupervised Learning find more promising pairs?”. It starts by describing the problems associated with the most commonly used approaches to select pairs, and how they may guide us in the quest for a novel approach. Next, a framework composed of 3 stages, (i) dimensionality reduction, (ii) Unsupervised Learning and (iii) pairs selection, is introduced. Each stage is described separately. First, a useful tool for reducing data dimensionality, Principal Component Analysis, is explored. Then, the pursuit of the most suitable Unsupervised Learning algorithm for clustering is followed in detail. Finally, the criteria adopted to select potentially profitable pairs from the clusters previously formed are outlined. In the end, a summary diagram connecting the different concepts introduced throughout the chapter is presented, for consolidation purposes.]
Published: Jul 14, 2020
Keywords: Dimensionality reduction; PCA; Unsupervised Learning; DBSCAN; OPTICS
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.