@article { ISI:000313051500018,
	title = {Labeling Nodes Using Three Degrees of Propagation},
	journal = {PLOS ONE},
	volume = {7},
	number = {12},
	year = {2012},
	month = {DEC 28},
	pages = {e51947},
	publisher = {PUBLIC LIBRARY SCIENCE},
	type = {Article},
	address = {1160 BATTERY STREET, STE 100, SAN FRANCISCO, CA 94111 USA},
	abstract = {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 {\textquoteleft}{\textquoteleft}label propagation algorithms{\textquoteright}{\textquoteright} 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.},
	issn = {1932-6203},
	doi = {10.1371/journal.pone.0051947},
	author = {Mostafavi, Sara and Goldenberg, Anna and Morris, Quaid}
}
