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...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Sara Mostafavi, Anna Goldenberg, Quaid Morris
Formato:	article
Lenguaje:	EN
Publicado:	Public Library of Science (PLoS) 2012
Materias:	Medicine R Science Q
Acceso en línea:	https://doaj.org/article/8e1040e46e8a42ba98d886188261ab14
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:8e1040e46e8a42ba98d886188261ab14
record_format	dspace
spelling	oai:doaj.org-article:8e1040e46e8a42ba98d886188261ab142021-11-18T08:03:21ZLabeling nodes using three degrees of propagation.1932-620310.1371/journal.pone.0051947https://doaj.org/article/8e1040e46e8a42ba98d886188261ab142012-01-01T00:00:00Zhttps://www.ncbi.nlm.nih.gov/pmc/articles/pmid/23284828/pdf/?tool=EBIhttps://doaj.org/toc/1932-6203The 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 through the network. These algorithms are fast, simple and scale to large networks but nonetheless regularly perform better than slower and much more complex algorithms on benchmark problems. We show here, however, that these algorithms have an intrinsic limitation that prevents them from adapting to some common patterns of network node labeling; we introduce a new algorithm, 3Prop, that retains all their advantages but is much more adaptive. As we show, 3Prop performs very well on node labeling problems ill-suited to label propagation, including predicting gene function in protein and genetic interaction networks and gender in friendship networks, and also performs slightly better on problems already well-suited to label propagation such as labeling blogs and patents based on their citation networks. 3Prop gains its adaptability by assigning separate weights to label information from different steps of the propagation. Surprisingly, we found that for many networks, the third iteration of label propagation receives a negative weight.Sara MostafaviAnna GoldenbergQuaid MorrisPublic Library of Science (PLoS)articleMedicineRScienceQENPLoS ONE, Vol 7, Iss 12, p e51947 (2012)
institution	DOAJ
collection	DOAJ
language	EN
topic	Medicine R Science Q
spellingShingle	Medicine R Science Q Sara Mostafavi Anna Goldenberg Quaid Morris Labeling nodes using three degrees of propagation.
description	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 through the network. These algorithms are fast, simple and scale to large networks but nonetheless regularly perform better than slower and much more complex algorithms on benchmark problems. We show here, however, that these algorithms have an intrinsic limitation that prevents them from adapting to some common patterns of network node labeling; we introduce a new algorithm, 3Prop, that retains all their advantages but is much more adaptive. As we show, 3Prop performs very well on node labeling problems ill-suited to label propagation, including predicting gene function in protein and genetic interaction networks and gender in friendship networks, and also performs slightly better on problems already well-suited to label propagation such as labeling blogs and patents based on their citation networks. 3Prop gains its adaptability by assigning separate weights to label information from different steps of the propagation. Surprisingly, we found that for many networks, the third iteration of label propagation receives a negative weight.
format	article
author	Sara Mostafavi Anna Goldenberg Quaid Morris
author_facet	Sara Mostafavi Anna Goldenberg Quaid Morris
author_sort	Sara Mostafavi
title	Labeling nodes using three degrees of propagation.
title_short	Labeling nodes using three degrees of propagation.
title_full	Labeling nodes using three degrees of propagation.
title_fullStr	Labeling nodes using three degrees of propagation.
title_full_unstemmed	Labeling nodes using three degrees of propagation.
title_sort	labeling nodes using three degrees of propagation.
publisher	Public Library of Science (PLoS)
publishDate	2012
url	https://doaj.org/article/8e1040e46e8a42ba98d886188261ab14
work_keys_str_mv	AT saramostafavi labelingnodesusingthreedegreesofpropagation AT annagoldenberg labelingnodesusingthreedegreesofpropagation AT quaidmorris labelingnodesusingthreedegreesofpropagation
_version_	1718422616248680448

Labeling nodes using three degrees of propagation.

Ejemplares similares