Inferring Diffusion Networks with Sparse Cascades by Structure Transfer
نویسندگان
چکیده
Inferring diffusion networks from traces of cascades has been intensively studied to gain a better understanding of information diffusion. Traditional methods normally formulate a generative model to find the network that can generate the cascades with the maximum likelihood. The performance of such methods largely depends on sufficient cascades spreading in the network. In many real-world scenarios, however, the cascades may be rare. The very sparse data make accurately inferring the diffusion network extremely challenging. To address this issue, in this paper we study the problem of transferring structure knowledge from an external diffusion network with sufficient cascade data to help infer the hidden diffusion network with sparse cascades. To this end, we first consider the network inference problem from a new angle: link prediction. This transformation enables us to apply transfer learning techniques to predict the hidden links with the help of a large volume of cascades and observed links in the external network. Meanwhile, to integrate the structure and cascade knowledge of the two networks, we propose a unified optimization framework TrNetInf. We conduct extensive experiments on two real-world datasets: MemeTracker and Aminer. The results demonstrate the effectiveness of the proposed TrNetInf in addressing the network inference problem with insufficient cascades.
منابع مشابه
Inferring Graphs from Cascades: A Sparse Recovery Framework
In the Graph Inference problem, one seeks to recover the edges of an unknown graph from the observations of cascades propagating over this graph. We approach this problem from the sparse recovery perspective. We introduce a general model of cascades, including the voter model and the independent cascade model, for which we provide the first algorithm which recovers the graph’s edges with high p...
متن کاملNetwork reconstruction from infection cascades
Reconstructing propagation networks from observations is a fundamental inverse problem, and it’s crucial to understand and control dynamics in complex systems. Here we show that it is possible to reconstruct the whole structure of an interaction network and to simultaneously infer the complete time course of activation spreading, relying just on single snapshots of a small number of activity ca...
متن کاملDiffusion of Innovations on Random Networks: Understanding the Chasm
We analyze diffusion models on sparse random networks with neighborhood effects. We show how large cascades can be triggered by small initial shocks and compute critical parameters: contagion threshold for a random network, phase transition in the size of the cascade.
متن کاملEstimating Diffusion Networks: Recovery Conditions, Sample Complexity and Soft-thresholding Algorithm
Information spreads across social and technological networks, but often the network structures are hidden from us and we only observe the traces left by the diffusion processes, called cascades. Can we recover the hidden network structures from these observed cascades? What kind of cascades and how many cascades do we need? Are there some network structures which are more difficult than others ...
متن کاملEstimating Diffusion Network Structures: Recovery Conditions, Sample Complexity & Soft-thresholding Algorithm
Information spreads across social and technological networks, but often the network structures are hidden from us and we only observe the traces left by the diffusion processes, called cascades. Can we recover the hidden network structures from these observed cascades? What kind of cascades and how many cascades do we need? Are there some network structures which are more difficult than others ...
متن کامل