arXiv · cond-mat/0101237
Data clustering and noise undressing for correlation matrices
Abstract
We discuss a new approach to data clustering. We find that maximum likelihood 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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Lorenzo Giada, Matteo Marsili. 2001-01-16. Data clustering and noise undressing for correlation matrices. https://doi.org/10.1103/physreve.63.061101
Cite the original work for its findings. Save a collection to share your selection of sources.