Mining Highly Reliable Dense Subgraphs from Uncertain Graphs

• LU Yihong,
• HUANG Ruizhi,
• HUANG Decai,

Vol. 13, No. 6, June 29, 2019
10.3837/tiis.2019.06.012, Download Paper (Free):

• uncertain graph
• Network Reliability
• surplus average degree
• optimal β-subgraph
• graph mining

Abstract

The uncertainties of the uncertain graph make the traditional definition and algorithms on mining dense graph for certain graph not applicable. The subgraph obtained by maximizing expected density from an uncertain graph always has many low edge-probability data, which makes it low reliable and low expected edge density. Based on the concept of β-subgraph, to overcome the low reliability of the densest subgraph, the concept of optimal β-subgraph is proposed. An efficient greedy algorithm is also developed to find the optimal β-subgraph. Simulation experiments of multiple sets of datasets show that the average edge-possibility of optimal β-subgraph is improved by nearly 40%, and the expected edge density reaches 0.9 on average. The parameter β is scalable and applicable to multiple scenarios.

Statistics

Cite this article