Labeling Nodes Using Three Degrees of Propagation

@inproceedings{Mostafavi2012LabelingNU,
  title={Labeling Nodes Using Three Degrees of Propagation},
  author={S. Mostafa Mostafavi and Anna Goldenberg and Quaid D Morris},
  booktitle={PloS one},
  year={2012}
}
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… CONTINUE READING
1
Twitter Mention

Topics from this paper.

Similar Papers

References

Publications referenced by this paper.
SHOWING 1-10 OF 49 REFERENCES