Please use this identifier to cite or link to this item:
http://hdl.handle.net/10609/150756
Title: | Core decomposition of uncertain graphs |
Author: | Bonchi, Francesco Gullo, Francesco Kaltenbrunner, Andreas Volkovich, Yana |
Citation: | Bonchi, F. [Francesco], Gullo, F. [Francesco], Kaltenbrunner, A. [Andreas], & Volkovich, Y. [Yana] (2014). Core decomposition of uncertain graphs. Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 1316–1325. |
Abstract: | Core decomposition has proven to be a useful primitive for a wide range of graph analyses. One of its most appealing features is that, unlike other notions of dense subgraphs, it can be computed linearly in the size of the input graph. In this paper we provide an analogous tool for uncertain graphs, i.e., graphs whose edges are assigned a probability of existence. The fact that core decomposition can be computed efficiently in deterministic graphs does not guarantee efficiency in uncertain graphs, where even the simplest graph operations may become computationally intensive. Here we show that core decomposition of uncertain graphs can be carried out efficiently as well. We extensively evaluate our definitions and methods on a number of real-world datasets and applications, such as influence maximization and task-driven team formation. |
Keywords: | uncertain graphs dense subgraph core decomposition |
DOI: | https://doi.org/10.1145/2623330.2623655 |
Document type: | info:eu-repo/semantics/conferenceObject |
Version: | info:eu-repo/semantics/acceptedVersion |
Issue Date: | Aug-2014 |
Appears in Collections: | Articles |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Bonchi_ProceedACMSIGKDD_Core.pdf | 429,7 kB | Adobe PDF | View/Open |
Share:
Items in repository are protected by copyright, with all rights reserved, unless otherwise indicated.