Solve tough clustering problem
2 visualizaciones (últimos 30 días)
Mostrar comentarios más antiguos
Lorenco Santos Vasconcelos
el 1 de Sept. de 2023
Editada: Lorenco Santos Vasconcelos
el 1 de Sept. de 2023
Hi, I'm having some trouble to solve a hard clustering problem.
I have a 2D dataset characterized by non spherical and partially overlaping clusters with different densities.
I've read a lot about clustering methods and for this type of data DBSCAN, Optics and other stuff wouldn't work very well. I think fuzzy clustering with mahalanobis inducing norm is a good choice. I've coded fuzzy c-means, k-means++ initialization, gustafson-kessel and gath-geva clustering methods but none of then can really separate the data. They are working really well for non overlapping clusters.
I also know that the problem is not the initialization, because even if I manually initialize the prototypes where I want, the algorithms converge to points that are not well separating the data. Typically I'm running kmeans++ and fcm to initialize the fuzzy partition and than I run gustafson-kessel or gath-geva
Also, tried different data normalization, like normalization by variance, by range, zscore, pca. None of this helps.
Here is the data:
Here is the typical result of gustafson-kessel and gath-geva
The desired result would be some thing like this: ( i know that because these groups represent different physical processes and we can realize that by eye)
Can someone help me with this please? The data is attached.
0 comentarios
Respuestas (0)
Ver también
Categorías
Más información sobre Statistics and Machine Learning Toolbox en Help Center y File Exchange.
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!