Cargando…
Normalized lmQCM: An Algorithm for Detecting Weak Quasi-Cliques in Weighted Graph with Applications in Gene Co-Expression Module Discovery in Cancers
In this paper, we present a new approach for mining weighted networks to identify densely connected modules such as quasi-cliques. Quasi-cliques are densely connected subnetworks in a network. Detecting quasi-cliques is an important topic in data mining, with applications such as social network stud...
Autores principales: | Zhang, Jie, Huang, Kun |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Libertas Academica
2016
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4962959/ https://www.ncbi.nlm.nih.gov/pubmed/27486298 http://dx.doi.org/10.4137/CIN.S14021 |
Ejemplares similares
-
Monochromatic Clique Decompositions of Graphs
por: Liu, Henry, et al.
Publicado: (2015) -
Iterated Clique Reductions in Vertex Weighted Coloring for Large Sparse Graphs
por: Fan, Yi, et al.
Publicado: (2023) -
MSClique: Multiple Structure Discovery through the Maximum Weighted Clique Problem
por: Sanroma, Gerard, et al.
Publicado: (2016) -
The Smallest Spectral Radius of Graphs with a Given Clique Number
por: Zhang, Jing-Ming, et al.
Publicado: (2014) -
Clustering cliques for graph-based summarization of the biomedical research literature
por: Zhang, Han, et al.
Publicado: (2013)