Jun 29, 2019 · The subgraph obtained by maximizing expected density from an uncertain graph always has many low edge-probability data, which makes it low ...

Abstract: The uncertainties of the uncertain graph make the traditional definition and algorithms on mining dense graph for certain graph not applicable.

Jun 30, 2019 · The uncertainties of the uncertain graph make the traditional definition and algorithms on mining dense graph for certain graph not ...

In this paper, we investigate the highly reliable subgraph problem, which arises in the context of uncertain graphs. This problem attempts to identify all ...

Based on the concept of β -subgraph, to overcome the low reliability of the densest subgraph, the concept of optimal β -subgraph is proposed and an ...

Aug 24, 2011 · ABSTRACT. In this paper, we investigate the highly reliable subgraph problem, which arises in the context of uncertain graphs.

The densest-subgraph problem is to find a subset of vertices S [??] V that maximizes the degree density. Due to experimental errors, noise and other reasons, ...

A novel sampling scheme is introduced which enables approximate discovery of highly reliable subgraphs with high probability and enables the development of ...

This paper investigates the problem that mining top-k dense subgraphs from uncertain graphs. Since uncertainties are inherent in graph data, ...

Abstract. The Densest Subgraph Problem requires to find, in a given graph, a subset of vertices whose induced subgraph maximizes a measure of density.