Cargando…
How frequently do clusters occur in hierarchical clustering analysis? A graph theoretical approach to studying ties in proximity
BACKGROUND: Hierarchical cluster analysis (HCA) is a widely used classificatory technique in many areas of scientific knowledge. Applications usually yield a dendrogram from an HCA run over a given data set, using a grouping algorithm and a similarity measure. However, even when such parameters are...
Autores principales: | Leal, Wilmer, Llanos, Eugenio J., Restrepo, Guillermo, Suárez, Carlos F., Patarroyo, Manuel Elkin |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer International Publishing
2016
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4727313/ https://www.ncbi.nlm.nih.gov/pubmed/26816532 http://dx.doi.org/10.1186/s13321-016-0114-x |
Ejemplares similares
-
Renyi entropy driven hierarchical graph clustering
por: Oggier, Frédérique, et al.
Publicado: (2021) -
Hierarchical Information Clustering by Means of Topologically Embedded Graphs
por: Song, Won-Min, et al.
Publicado: (2012) -
Dynamic Networks from Hierarchical Bayesian Graph Clustering
por: Park, Yongjin, et al.
Publicado: (2010) -
A proximity-based graph clustering method for the identification and application of transcription factor clusters
por: Spadafore, Maxwell, et al.
Publicado: (2017) -
Data on cut-edge for spatial clustering based on proximity graphs
por: Aksac, Alper, et al.
Publicado: (2019)