• Publications
  • Influence
Discovering frequent subgraphs over uncertain graph databases under probabilistic semantics
TLDR
This paper investigates frequent subgraph mining on uncertain graphs under probabilistic semantics and proposes an approximate mining algorithm. Expand
  • 113
  • 12
  • PDF
A novel approach for efficient supergraph query processing on graph databases
TLDR
This paper first proposes an optimal compact method for organizing graph databases. Expand
  • 51
  • 7
  • PDF
Mining Frequent Subgraph Patterns from Uncertain Graph Data
TLDR
This paper investigates the problem of mining uncertain graph data and especially focuses on mining frequent subgraph patterns on an uncertain graph database. Expand
  • 159
  • 4
Frequent subgraph pattern mining on uncertain graph data
TLDR
This paper investigates the problem of mining frequent subgraph patterns from uncertain graph data. Expand
  • 53
  • 4
  • PDF
Bitruss Decomposition of Bipartite Graphs
TLDR
In this paper, we propose bitruss, a new notion of a dense subgraph of a bipartite graph that can be computed in polynomial time. Expand
  • 12
  • 4
Finding top-k maximal cliques in an uncertain graph
TLDR
An optimized branch-and-bound algorithm is developed to find top-k maximal cliques, which adopts efficient pruning rules, a new searching strategy and effective preprocessing methods. Expand
  • 91
  • 3
Mining frequent subgraphs over uncertain graph databases under probabilistic semantics
TLDR
This paper focuses on mining frequent subgraphs over uncertain graph data under the probabilistic semantics. Expand
  • 32
  • 2
A new heuristic for task scheduling in heterogeneous computing environment
TLDR
We propose a new task scheduling heuristic, high standard deviation first (HSTDF), which considers the standard deviation of the expected execution time of a task as a selection criterion. Expand
  • 16
  • 2
  • PDF
Polynomial-Time Algorithm for Finding Densest Subgraphs in Uncertain Graphs
This paper studies the problem of finding the densest subgraph in an uncertain graph. Due to uncertainty in graphs, the traditional definitions of dense subgraphs are not applicable to uncertainExpand
  • 11
  • 1
  • PDF
Structural-Context Similarities for Uncertain Graphs
  • Zhaonian Zou, J. Li
  • Mathematics, Computer Science
  • IEEE 13th International Conference on Data Mining
  • 1 December 2013
TLDR
We propose a generic definition of structural-context similarity for uncertain graphs. Expand
  • 9
  • 1
...
1
2
3
4
5
...