• Aucun résultat trouvé

Linearizing Belief Propagation for Efficient Label Propagation

N/A
N/A
Protected

Academic year: 2022

Partager "Linearizing Belief Propagation for Efficient Label Propagation"

Copied!
1
0
0

Texte intégral

(1)

Linearizing Belief Propagation for Efficient Label Propagation

Stephan G¨unnemann

Carnegie Mellon University, USA Technische Universit¨at M¨unchen, Germany [email protected] [email protected]

Abstract. How can we tell when accounts are fake or real in a social network? And how can we tell which accounts belong to liberal, conser- vative or centrist users? Often, we can answer such questions and label nodes in a network based on the labels of their neighbors and appro- priate assumptions of homophily (”birds of a feather flock together”) or heterophily (”opposites attract”). One of the most widely used methods for this kind of inference is Belief Propagation (BP), which can effec- tively been used as a principle for label propagation in partially labeled networks. One main problem with BP, however, is that the convergence in graphs with loops is not guaranteed.

In this talk, I will present two principles for efficient label propagation that are based on the idea of linearizing Belief Propagation [1]. First, I will introduce ’Linearized Belief Propagation’ (LinBP), a linearization of BP that allows a closed-form solution via intuitive matrix equations and, thus, comes with convergence guarantees. It handles homophily, heterophily, and more general cases that arise in multi-class settings. In the second part, I will present ’Single-pass Belief Propagation’ (SBP), a

”localized” version of LinBP that propagates information across every edge at most once and for which the final class assignments depend only on the nearest labeled neighbors. In addition, SBP allows fast incremen- tal updates in dynamic networks. Runtime experiments show that LinBP and SBP are orders of magnitude faster than standard BP, while leading to almost identical node labels.

References

1. W. Gatterbauer, S. G¨unnemann, D. Koutra, and C. Faloutsos. Linearized and single-pass belief propagation.PVLDB, 8(5):581–592, 2015.

Copyright© 2015 by the paper’s authors. Copying permitted only for private and academic purposes.In: R. Bergmann, S. G¨org, G. M¨uller (Eds.): Proceedings of the LWA 2015 Workshops:

KDML, FGWM, IR, and FGDB. Trier, Germany, 7.-9. October 2015, published at http://ceur- ws.org

105

Références

Documents relatifs

An application of Generalized Belief Propagation: splitting trapping sets in LDPC codes.. Jean-Christophe Sibel, Sylvain Reynal,

Kaneko, "Modified belief propagation decoding algorithm for low-density parity check code based on oscillation," in IEEE VTC, vol.. Lechner, "Convergence of sum-product algorithm

In this paper we presented a new version of this optimization algorithm, using belief propagation to optimize the proposed configuration inside each iteration to obtain a relevant

In this work, we employ a transductive label propagation method that is based on the manifold assumption to make predictions on the entire dataset and use these predictions to

Based on the definition of node influence and the label propagation strategy, the labels of central nodes are more easily adopted by the border nodes.. If the update order is set to

One of the most famous decoding algorithm is the Belief Propagation (BP) introduced in [3], extensively studied in [4], [5], [6], which is deemed to be the optimal

Then, we explain how to build the nonbinary Tanner graph of a turbo code based on a clustering technique and describe how the group BP decoding algorithm can be used to efficiently

We have presented a novel approach to generating panoramic images from a multi-sensor camera system, bor- rowing the success of Markov random fields and belief propagation as applied