.png){kind=icon}
.png){kind=icon}
Return
Collective Graph Identification
.png){kind=icon}
PRE
AI
DOI：10.1145/2818378.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Data describing networks-such as communication networks, transaction networks, disease transmission networks, collaboration networks, etc.-are becoming increasingly available. While observational data can be useful, it often only hints at the actual underlying process that governs interactions and attributes. For example, an email communication network provides insight into its users and their relationships, but is not the same as the real underlying social network. In this article, we introduce the problem of graph identification, i.e., discovering the latent graph structure underlying an observed network. We cast the problem as a probabilistic inference task, in which we must infer the nodes, edges, and node labels of a hidden graph, based on evidence. This entails solving several canonical problems in network analysis: entity resolution (determining when two observations correspond to the same entity), link prediction (inferring the existence of links), and node labeling (inferring hidden attributes). While each of these subproblems has been well studied in isolation, here we consider them as a single, collective task. We present a simple, yet novel, approach to address all three subproblems simultaneously. Our approach, which we refer to as C-3, consists of a collection of Coupled Collective Classifiers that are applied iteratively to propagate inferred information among the subproblems. We consider variants of C-3 using different learning and inference techniques and empirically demonstrate that C-3 is superior, both in terms of predictive accuracy and running time, to state-of-the-art probabilistic approaches on four real problems.
Keywords:
Algorithm
Design
Experimentation
Performance
Entity resolution
link prediction
collective classification
semi-supervised learning
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.8
Papers:
1.3K
Citations:
4.4K