Dense subgraph mining in probabilistic graphs

In this dissertation we consider the problem of mining cohesive (dense) subgraphs in probabilistic graphs, where each edge has a probability of existence. Mining probabilistic graphs has become the focus of interest in analyzing many real-world datasets, such as social, trust, communication, and bio...

Full description

Bibliographic Details
Main Author: Esfahani, Fatemeh
Other Authors: Srinivasan, Venkatesh
Format: Others
Language:English
en
Published: 2021
Subjects:
Online Access:http://hdl.handle.net/1828/13575