Discussing a new Divisive Hierarchical Clustering algorithm
We present DHClus, a new Divisive Hierarchical Clustering algorithm developed to detect clusters with arbitrary shapes. Our algorithm is able to solve clustering problems defined by different scales, i.e. clusters with arbitrarily dissimilar densities, connectivity or between cluster distances. The...
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2014
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/41716 http://43jaiio.sadio.org.ar/proceedings/ASAI/6.pdf |
| Aporte de: |
| Sumario: | We present DHClus, a new Divisive Hierarchical Clustering algorithm developed to detect clusters with arbitrary shapes. Our algorithm is able to solve clustering problems defined by different scales, i.e. clusters with arbitrarily dissimilar densities, connectivity or between cluster distances. The algorithm not only works under this difficult connditions but it is also able to find the number of clusters automatically.
This paper describes this new algorithm and then present results on real gene expression data. We compare the results of DHClus with other algorithms to provide a reference frame. |
|---|