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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: KSII Transactions on Internet and Information Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
