Node classification in uncertain graphs

In many real applications that use and analyze networked data, the links in the network graph may be erroneous, or derived from prob-abilistic techniques. In such cases, the node classification problem can be challenging, since the unreliability of the links may affect the final results of the classification process. In this paper, we focus on situations that require the analysis of the uncertainty that is present in the graph structure. We study the novel problem of node classification in uncertain graphs, by treating uncertainty as a first-class citizen. We propose two techniques based on a Bayes model, and show the benefits of incorporating uncertainty in the classification process as a first-class citizen. The experimental re-sults demonstrate the effectiveness of our approaches. 1