Physics – Condensed Matter – Statistical Mechanics
Scientific paper
2002-04-09
Physics
Condensed Matter
Statistical Mechanics
Accepted by Physica A; 12 pag., 5 figures. More information at: http://www.sissa.it/dataclustering
Scientific paper
10.1016/S0378-4371(02)00974-3
We address the problem of data clustering by introducing an unsupervised, parameter free approach based on maximum likelihood principle. Starting from the observation that data sets belonging to the same cluster share a common information, we construct an expression for the likelihood of any possible cluster structure. The likelihood in turn depends only on the Pearson's coefficient of the data. We discuss clustering algorithms that provide a fast and reliable approximation to maximum likelihood configurations. Compared to standard clustering methods, our approach has the advantages that i) it is parameter free, ii) the number of clusters need not be fixed in advance and iii) the interpretation of the results is transparent. In order to test our approach and compare it with standard clustering algorithms, we analyze two very different data sets: Time series of financial market returns and gene expression data. We find that different maximization algorithms produce similar cluster structures whereas the outcome of standard algorithms has a much wider variability.
Giada Lorenzo
Marsili Matteo
No associations
LandOfFree
Algorithms of maximum likelihood data clustering with applications does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Algorithms of maximum likelihood data clustering with applications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithms of maximum likelihood data clustering with applications will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-387200