Joint Inference of Diffusion and Structure in Partially Observed Social Networks Using Coupled Matrix Factorization
원문 초록
Access to complete data in large-scale networks is often infeasible. Therefore, the problem of missing data is a crucial and unavoidable issue in the analysis and modeling of real-world social networks. However, most of the research on different aspects of social networks does not consider this limitation. One effective way to solve this problem is to recover the missing data as a pre-processing step. In this paper, a model is learned from partially observed data to infer unobserved diffusion and structure networks. To jointly discover omitted diffusion activities and hidden network structures, we develop a probabilistic generative model called "DiffStru." The interrelations among links of nodes and cascade processes are utilized in the proposed method via learning coupled with low-dimensional latent factors. Besides inferring unseen data, latent factors such as community detection may also aid in network classification problems. We tested different missing data scenarios on simulated independent cascades over LFR networks and real datasets, including Twitter and Memtracker. Experiments on these synthetic and real-world datasets show that the proposed method successfully detects invisible social behaviors, predicts links, and identifies latent features.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
How Low Can You Go? Searching for the Intrinsic Dimensionality of Complex Networks using Metric Node Embeddings
Unified Graph Networks (UGN): A Deep Neural Framework for Solving Graph Problems
Large Language Models Meet Graph Neural Networks: A Perspective of Graph Mining
Representation learning of dynamic networks
Multi-Scale Node Embeddings for Graph Modeling and Generation
Hierarchical-Graph-Structured Edge Partition Models for Learning Evolving Community Structure
토론
이 논문과 연결된 포럼 글이 아직 없습니다.