Fraunhofer Institute for Intelligent Analysis and Information Systems
Inverse Dynamical Inheritance in Stack Exchange Taxonomies
Ojeda, César A. (Fraunhofer Institute for Intelligent Analysis and Information Systems) | Cvejoski, Kostadin (Fraunhofer Institute for Intelligent Analysis and Information Systems) | Sifa, Rafet (Fraunhofer Institute for Intelligent Analysis and Information Systems) | Bauckhage, Christian (Fraunhofer Institute for Intelligent Analysis and Information Systems)
Question Answering websites are popular repositories of expert knowledge and cover areas as diverse as linguistics, computer science, or mathematics. Knowledge is commonly organized via user defined tags which implicitly create population folksonomies. However, the interplay between latent knowledge structures and the answering behavior of users has not been fully explored yet. Here, we propose a model of a dynamical tagging process guided by taxonomies, devise a robust algorithm that allow us to uncover hidden topic hierarchies, apply our method to analyze several Stack Exchange websites. Our results show that the dynamics of the system strongly correlate with uncovered taxonomies.
Informed Lifting for Message-Passing
Kersting, Kristian (Fraunhofer Institute for Intelligent Analysis and Information Systems and University of Bonn) | Massaoudi, Youssef El (Fraunhofer Institute for Intelligent Analysis and Information Systems) | Hadiji, Fabian (Fraunhofer Institute for Intelligent Analysis and Information Systems) | Ahmadi, Babak (Fraunhofer Institute for Intelligent Analysis and Information Systems)
Lifted inference, handling whole sets of indistinguishable objects together, is critical to the effective application of probabilistic relational models to realistic real world tasks. Recently, lifted belief propagation (LBP) has been proposed as an efficient approximate solution of this inference problem. It runs a modified BP on a lifted network where nodes have been grouped together if they have — roughly speaking — identical computation trees, the tree-structured “unrolling” of the underlying graph rooted at the nodes. In many situations, this purely syntactic criterion is too pessimistic: message errors decay along paths. Intuitively, for a long chain graph with weak edge potentials, distant nodes will send and receive identical messages yet their computation trees are quite different. To overcome this, we propose iLBP, a novel, easy-to-implement, informed LBP approach that interleaves lifting and modified BP iterations. In turn, we can efficiently monitor the true BP messages sent and received in each iteration and group nodes accordingly. As our experiments show, iLBP can yield significantly faster more lifted network while not degrading performance. Above all, we show that iLBP is faster than BP when solving the problem of distributing data to a large network, an important real-world application where BP is faster than uninformed LBP.