On Embedding Uncertain Graphs
Title | On Embedding Uncertain Graphs |
Publication Type | Conference Proceedings |
Year of Publication | 2017 |
Authors | Hu, Jiafeng, Cheng Reynold, Huang Zhipeng, Fang Yixiang, and Luo Siqiang |
Conference Name | The 26th ACM International Conference on Information and Knowledge Management |
Abstract | Graph data are prevalent in communication networks, social media, and biological networks. These data, which are often noisy or inexact, can be represented by uncertain graphs, whose edges are associated with probabilities to indicate the chances that they exist. Recently, researchers have studied various algorithms (e.g., clustering, classification, and k-NN) for uncertain graphs. These solutions face two problems: (1) high dimensionality: uncertain graphs are often highly complex, which can affect the mining quality; and (2) low reusability, where an existing mining algorithm has to be redesigned to deal with uncertain graphs on different tasks. To tackle these problems, we propose a solution called URGE, or UnceRtain Graph Embedding. Given an uncertain graph G, URGE generates G’s embedding, or a set of low-dimensional vectors, which carry the proximity information of nodes in G. This embedding enables the dimensionality of G to be reduced, without destroying node proximity information. Due to its simplicity, existing mining solutions can be used on the embedding. We investigate two low- and high-order node proximity measures in the embedding generation process, and develop novel algorithms to enable fast evaluation. |
DOI | http://dx.doi.org/10.1145/3132847.3132885 |
Refereed Designation | Unknown |