Labeling nodes using three degrees of propagation.
The properties (or labels) of nodes in networks can often be predicted based on their proximity and their connections to other labeled nodes. So-called "label propagation algorithms" predict the labels of unlabeled nodes by propagating information about local label density iteratively thro...
Guardado en:
Autores principales: | Sara Mostafavi, Anna Goldenberg, Quaid Morris |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Public Library of Science (PLoS)
2012
|
Materias: | |
Acceso en línea: | https://doaj.org/article/8e1040e46e8a42ba98d886188261ab14 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Automatic detect lung node with deep learning in segmentation and imbalance data labeling
por: Ting-Wei Chiu, et al.
Publicado: (2021) -
Perturbation of resting-state network nodes preferentially propagates to structurally rather than functionally connected regions
por: Davide Momi, et al.
Publicado: (2021) -
The H-index of a network node and its relation to degree and coreness
por: Linyuan Lü, et al.
Publicado: (2016) -
Spatiotemporal observation of light propagation in a three-dimensional scattering medium
por: Tomoyoshi Inoue, et al.
Publicado: (2021) -
Equal opportunity for low-degree network nodes: a PageRank-based method for protein target identification in metabolic graphs.
por: Dániel Bánky, et al.
Publicado: (2013)