Investigation of the latent space of stock market patterns with genetic programming
Pages 1254 - 1261
Abstract
We suggest a use of genetic programming for transformation from a vector space to an understandable graph representation, which is part of a project to inspect the latent space in matrix factorization. Given a relation matrix, we can apply standard techniques such as non-negative matrix factorization to extract low dimensional latent space in vector representation. While the vector representation of the latent space is useful, it is not intuitive and hard to interpret. The transformation with the help of genetic programming allows us to better understand the underlying latent structure. Applying the method in the context of a stock market, we show that it is possible to recover the tree representation of technical patterns from a relation matrix. Leveraging the properties of the vector representations, we are able to find patterns that correspond to cluster centers of technical patterns. We further investigate the geometry of the latent space.
References
[1]
D Anand. 2012. Feature Extraction for Collaborative Filtering: A Genetic Programming Approach. International Journal of Computer Science Issues 9, 5 (2012), 348--354.
[2]
James Bennett and Stan Lanning. 2007. The Netflix Prize. In KDD-Cup and Workshop at International Conference on Knowledge Discovery and Data Mining.
[3]
Jesus Bobadilla, Fernando Ortega, Antonio Hernando, and Javier Alcalá. 2011. Improving collaborative filtering recommender system results and performance using genetic algorithms. Knowledge-Based Systems 24, 8 (2011), 1310--1316.
[4]
Gabriel Doyle and Charles Elkan. 2009. Financial Topic Models. In NIPS Workshop on Applications for Topic Models: Text and Beyond.
[5]
Konstantinos Drakakis, Scott Packard, Ruairí de Fréin, and Andrzej Cichocki. 2008. Analysis of financial data using non-negative matrix factorisation. International Mathematical Forum 3, 38 (2008), 1853--1870.
[6]
Simon Fong, Yvonne Ho, and Yang Hang. 2008. Using Genetic Algorithm for Hybrid Modes of Collaborative Filtering in Online Recommenders. In International Conference on Hybrid Intelligent Systems. 174--179.
[7]
Adolfo Guimarães, Thaies F Costa, Anisio Lacerda, Gisele L Pappa, and Nivio Ziviani. 2013. GUARD: A Genetic Unified Approach for Recommendation. Journal of Information and Data Management 4, 3 (2013), 295--310.
[8]
Sungjoo Ha and Byung Ro Moon. 2015. Fast Knowledge Discovery in Time Series with GPGPU on Genetic Programming. In Genetic and Evolutionary Computation Conference. 1159--1166.
[9]
Yehuda Koren. 2009. The hellkor solution to the netflix grand prize. Technical Report.
[10]
Yehuda Koren, Robert Bell, and Chris Volinsky. 2009. Matrix Factorization Techniques for Recommender Systems. IEEE Computer 42, 8 (2009), 30--37.
[11]
Daniel D. Lee and H. Sebastian Seung. 2001. Algorithms for Non-negative Matrix Factorization. In Advances in Neural Information Processing Systems 13. 556--562.
[12]
Seung-Kyu Lee and Byung Ro Moon. 2010. A new modular genetic programming for finding attractive technical patterns in stock markets. In Genetic and Evolutionary Computation Conference. 1219--1226.
[13]
Piotr Lipinski. 2007. ECGA vs. BOA in discovering stock market trading experts. In Genetic and Evolutionary Computation Conference (2007-08-21). 531--538.
[14]
PawełLiskowski and Wojciech Jaśkowski. 2017. Accelerating Coevolution with Adaptive Matrix Factorization. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO '17). ACM, New York, NY, USA, 457--464.
[15]
PawełLiskowski and Krzysztof Krawiec. 2016. Non-negative Matrix Factorization for Unsupervised Derivation of Search Objectives in Genetic Programming. In Proceedings of the Genetic and Evolutionary Computation Conference 2016 (GECCO '16). ACM, New York, NY, USA, 749--756.
[16]
Tang Liu. 2009. Non-Negative Matrix Factorization for Stock Market Pricing. In International Conference on Biomedical Engineering and Informatics. 1--5.
[17]
Alberto Moraglio, Krzysztof Krawiec, and Colin G Johnson. 2012. Geometrie Semantic Genetic Programming. In Parallel Problem Solving from Nature. 21--31.
[18]
Jean-Yves Potvin, Patrick Soriano, and Maxime Vallée. 2004. Generating Trading Rules on the Stock Markets with Genetic Programming. Computers and Operations Research 31, 7 (June 2004), 1033--1047.
[19]
Steffen Rendle. 2010. Factorization Machines. In International Conference on Data Mining. 995--1000.
[20]
Ruslan Salakhutdinov, Andriy Mnih, and Geoffrey Hinton. 2007. Restricted Boltzmann Machines for Collaborative Filtering. In International Conference on Machine Learning. 791--798.
[21]
Felix Ming Fai Wong, Zhenming Liu, and Mung Chiang. 2014. Stock Market Prediction from WSJ: Text Mining via Sparse Matrix Factorization. In International Conference on Data Mining. 430--439.
[22]
Zhao Xu, Volker Tresp, Achim Rettinger, and Kristian Kersting. 2010. Social Network Mining with Nonparametric Relational Models. In Advances in Social Network Mining and Analysis. Vol. 5498. 77--96.
[23]
Zhong-Yuan Zhang. 2012. Nonnegative Matrix Factorization: Models, Algorithms and Applications. In Data Mining: Foundations and Intelligent Paradigms. Vol. 24. 99--134.
[24]
Marinka Žitnik and Blaž Zupan. 2012. Nimfa: A Python Library for Nonnegative Matrix Factorization. Journal of Machine Learning Research 13 (2012), 849--853.
Index Terms
- Investigation of the latent space of stock market patterns with genetic programming
Recommendations
Inspecting the Latent Space of Stock Market Data with Genetic Programming
GECCO '16 Companion: Proceedings of the 2016 on Genetic and Evolutionary Computation Conference CompanionWe suggest a method of inspecting the latent space of stock market data using genetic programming. Given black box patterns and (stock, day) tuples a relation matrix is constructed. Applying a low-rank matrix factorization technique to the relation ...
A new modular genetic programming for finding attractive technical patterns in stock markets
GECCO '10: Proceedings of the 12th annual conference on Genetic and evolutionary computationWe propose a new modular genetic programming for finding attractive and statistically sound technical patterns forstock trading. We restrict the problem space to combinations of modules for more effective space search. We carefully prepared the set of ...
Co‐evolved genetic programs for stock market trading
SummaryThe profitability of trading rules evolved by three different optimised genetic programs, namely a single population genetic program (GP), a co‐operative co‐evolved GP, and a competitive co‐evolved GP is compared. Profitability is determined by ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
July 2018
1578 pages
Copyright © 2018 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 02 July 2018
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
GECCO '18
Sponsor:
Acceptance Rates
Overall Acceptance Rate 1,669 of 4,410 submissions, 38%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 171Total Downloads
- Downloads (Last 12 months)4
- Downloads (Last 6 weeks)0
Reflects downloads up to 30 Dec 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in