A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Mining Highly Reliable Dense Subgraphs from Uncertain Graphs
2019
KSII Transactions on Internet and Information Systems
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
doi:10.3837/tiis.2019.06.012
fatcat:ienbpcvt4rbz5fdbov5awx3s44