Introduction to fast Super-Paramagnetic Clustering

We map stock market interactions to spin models to recover their hierarchical structure using a simulated annealing based Super-Paramagnetic Clustering (SPC) algorithm. This is directly compared to a modified implementation of a maximum likelihood approach to fast-Super-Paramagnetic Clustering (f-SP...

Full description

Bibliographic Details
Main Author: Yelibi, Lionel
Other Authors: Gebbie, Timothy
Format: Dissertation
Language:English
Published: Faculty of Science 2020
Subjects:
Online Access:http://hdl.handle.net/11427/31332
id ndltd-netd.ac.za-oai-union.ndltd.org-uct-oai-localhost-11427-31332
record_format oai_dc
spelling ndltd-netd.ac.za-oai-union.ndltd.org-uct-oai-localhost-11427-313322020-10-06T05:11:13Z Introduction to fast Super-Paramagnetic Clustering Yelibi, Lionel Gebbie, Timothy maximum likelihood Potts Models unsupervised learning clustering maximum entropy We map stock market interactions to spin models to recover their hierarchical structure using a simulated annealing based Super-Paramagnetic Clustering (SPC) algorithm. This is directly compared to a modified implementation of a maximum likelihood approach to fast-Super-Paramagnetic Clustering (f-SPC). The methods are first applied standard toy test-case problems, and then to a dataset of 447 stocks traded on the New York Stock Exchange (NYSE) over 1249 days. The signal to noise ratio of stock market correlation matrices is briefly considered. Our result recover approximately clusters representative of standard economic sectors and mixed clusters whose dynamics shine light on the adaptive nature of financial markets and raise concerns relating to the effectiveness of industry based static financial market classification in the world of real-time data-analytics. A key result is that we show that the standard maximum likelihood methods are confirmed to converge to solutions within a Super-Paramagnetic (SP) phase. We use insights arising from this to discuss the implications of using a Maximum Entropy Principle (MEP) as opposed to the Maximum Likelihood Principle (MLP) as an optimization device for this class of problems. 2020-02-25T12:08:37Z 2020-02-25T12:08:37Z 2019 2020-02-25T09:19:34Z Master Thesis Masters MSc http://hdl.handle.net/11427/31332 eng application/pdf Faculty of Science Department of Statistical Sciences
collection NDLTD
language English
format Dissertation
sources NDLTD
topic maximum likelihood
Potts Models
unsupervised learning
clustering
maximum entropy
spellingShingle maximum likelihood
Potts Models
unsupervised learning
clustering
maximum entropy
Yelibi, Lionel
Introduction to fast Super-Paramagnetic Clustering
description We map stock market interactions to spin models to recover their hierarchical structure using a simulated annealing based Super-Paramagnetic Clustering (SPC) algorithm. This is directly compared to a modified implementation of a maximum likelihood approach to fast-Super-Paramagnetic Clustering (f-SPC). The methods are first applied standard toy test-case problems, and then to a dataset of 447 stocks traded on the New York Stock Exchange (NYSE) over 1249 days. The signal to noise ratio of stock market correlation matrices is briefly considered. Our result recover approximately clusters representative of standard economic sectors and mixed clusters whose dynamics shine light on the adaptive nature of financial markets and raise concerns relating to the effectiveness of industry based static financial market classification in the world of real-time data-analytics. A key result is that we show that the standard maximum likelihood methods are confirmed to converge to solutions within a Super-Paramagnetic (SP) phase. We use insights arising from this to discuss the implications of using a Maximum Entropy Principle (MEP) as opposed to the Maximum Likelihood Principle (MLP) as an optimization device for this class of problems.
author2 Gebbie, Timothy
author_facet Gebbie, Timothy
Yelibi, Lionel
author Yelibi, Lionel
author_sort Yelibi, Lionel
title Introduction to fast Super-Paramagnetic Clustering
title_short Introduction to fast Super-Paramagnetic Clustering
title_full Introduction to fast Super-Paramagnetic Clustering
title_fullStr Introduction to fast Super-Paramagnetic Clustering
title_full_unstemmed Introduction to fast Super-Paramagnetic Clustering
title_sort introduction to fast super-paramagnetic clustering
publisher Faculty of Science
publishDate 2020
url http://hdl.handle.net/11427/31332
work_keys_str_mv AT yelibilionel introductiontofastsuperparamagneticclustering
_version_ 1719348780191449088