Cargando…
A simulated annealing heuristic for maximum correlation core/periphery partitioning of binary networks
A popular objective criterion for partitioning a set of actors into core and periphery subsets is the maximization of the correlation between an ideal and observed structure associated with intra-core and intra-periphery ties. The resulting optimization problem has commonly been tackled using heuris...
Autores principales: | Brusco, Michael, Stolze, Hannah J., Hoffman, Michaela, Steinley, Douglas |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2017
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5423590/ https://www.ncbi.nlm.nih.gov/pubmed/28486475 http://dx.doi.org/10.1371/journal.pone.0170448 |
Ejemplares similares
-
A comparison of 71 binary similarity coefficients: The effect of base rates
por: Brusco, Michael, et al.
Publicado: (2021) -
Hybrid Binary Dragonfly Algorithm with Simulated Annealing for Feature Selection
por: Chantar, Hamouda, et al.
Publicado: (2021) -
Polycomb-lamina antagonism partitions heterochromatin at the nuclear periphery
por: Siegenfeld, Allison P., et al.
Publicado: (2022) -
Emergence of core–peripheries in networks
por: Verma, T., et al.
Publicado: (2016) -
Core–periphery structure in directed networks
por: Elliott, Andrew, et al.
Publicado: (2020)