Data clustering and noise undressing of correlation matrices
M. Marsili
Abstract
We discuss a new approach to data clustering. We find that maximum likelyhood leads naturally to an Hamiltonian of Potts variables which 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 non trivial clustering.
Create a lesson
Related papers
Mutual linearity from classical response theory
Timur Aslyamov, Massimiliano Esposito
Universal Boolean Computation in Negatively Coupled Circle Map Lattices
Priyanka D. Bhoyar, Prashant M. Gade
Developing the Statistical Mechanics of Evolving Assembly Spaces
Anisha K. Yeddanapudi, Abhishek Sharma, Ian Seet et al.
Ergodicity breaking transition beyond qubits
Tanay Pathak, Abhik Kumar Saha
Extended-range percolation on lattices with cubic and non-compact neighborhoods in three dimensions
Zhe Zhang, Yuxuan Fan, Yang Yang et al.
Competitive scaling of small-subsystem-optimization heuristics for LABS
Ginger E. Lau, Adil A. Gangat