Discovering frequent subgraphs over uncertain graph databases under probabilistic semantics
An efficient algorithm for discovering frequent subgraphs