168
views
0
recommends
+1 Recommend
2 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      High-speed detection of emergent market clustering via an unsupervised parallel genetic algorithm

      Preprint
      , ,

      Read this article at

      ScienceOpenPublisherArXiv
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          We implement a master-slave parallel genetic algorithm (PGA) with a bespoke log-likelihood fitness function to identify emergent clusters within price evolutions. We use graphics processing units (GPUs) to implement a PGA and visualise the results using disjoint minimal spanning trees (MSTs). We demonstrate that our GPU PGA, 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 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 due to 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.

          Related collections

          Most cited references45

          • Record: found
          • Abstract: not found
          • Book: not found

          An Introduction to Genetic Algorithms for Scientists and Engineers

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Dynamic clustering using particle swarm optimization with application in image segmentation

              Bookmark
              • Record: found
              • Abstract: found
              • Article: not found

              Data clustering and noise undressing of correlation matrices.

              We discuss an approach to data clustering. We find that maximum likelihood leads naturally to an Hamiltonian of Potts variables that depends on the correlation matrix and whose low temperature behavior describes the correlation structure of the data. For random, uncorrelated data sets no correlation structure emerges. On the other hand, for data sets with a built-in cluster structure, the method is able to detect and recover efficiently that structure. Finally we apply the method to financial time series, where the low-temperature behavior reveals a nontrivial clustering.
                Bookmark

                Author and article information

                Journal
                2014-03-17
                2015-08-02
                Article
                10.17159/sajs.2016/20140340
                1403.4099
                f9536c8a-2790-44d0-a09a-7e0187fdd5f6

                http://arxiv.org/licenses/nonexclusive-distrib/1.0/

                History
                Custom metadata
                S Afr J Sci. 2016;112(1/2), Art. #2014-0340, 9 pages
                10 pages, 5 figures, 4 tables, More thorough discussion of implementation
                q-fin.CP cs.DC cs.NE

                Neural & Evolutionary computing,Networking & Internet architecture,Computational finance

                Comments

                Comment on this article