High-speed detection of emergent market clustering via an unsupervised parallel genetic algorithm
DOI:
https://doi.org/10.17159/sajs.2016/20140340Keywords:
unsupervised clustering, genetic algorithms, parallel algorithms, financial data processing, maximum likelihood clusteringAbstract
We implement a master-slave parallel genetic algorithm with a bespoke log-likelihood fitness function to identify emergent clusters within price evolutions. We use graphics processing units (GPUs) to implement a parallel genetic algorithm and visualise the results using disjoint minimal spanning trees. We demonstrate that our GPU parallel genetic algorithm, implemented on a commercially available general purpose GPU, is able to recover stock clusters in sub-second speed, based on a subset of stocks in the South African market. This approach represents a pragmatic choice for low-cost, scalable parallel computing and is significantly faster than a prototype serial implementation in an optimised C-based fourth-generation programming language, although the results are not directly comparable because of compiler differences. Combined with fast online intraday correlation matrix estimation from high frequency data for cluster identification, the proposed implementation offers cost-effective, near-real-time risk assessment for financial practitioners.
Published
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
All articles are published under a Creative Commons Attribution 4.0 International Licence
Copyright is retained by the authors. Readers are welcome to reproduce, share and adapt the content without permission provided the source is attributed.
Disclaimer: The publisher and editors accept no responsibility for statements made by the authors
How to Cite
- Abstract 563
- PDF 395
- EPUB 171
- XML 287