• DOI:10.1145/1835804.1835885
Corpus ID: 17034243

Discovering frequent subgraphs over uncertain graph databases under probabilistic semantics

@article{Zou2010DiscoveringFS,
  title={Discovering frequent subgraphs over uncertain graph databases under probabilistic semantics},
  author={Zhaonian Zou and Hong Gao and J. Li},
  journal={Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining},
  year={2010}
}

• Zhaonian Zou, Hong Gao, J. Li
• Published 2010
• Computer Science, Mathematics
• Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining

Frequent subgraph mining has been extensively studied on certain graph data. However, uncertainties are inherently accompanied with graph data in practice, and there is very few work on mining uncertain graph data. This paper investigates frequent subgraph mining on uncertain graphs under probabilistic semantics. Specifically, a measure called φ-frequent probability is introduced to evaluate the degree of recurrence of subgraphs. Given a set of uncertain graphs and two numbers 0 < φ,τ < 1, the… Expand

View on ACM

users.cis.fiu.edu

Save to Library

Create Alert

Cite

Launch Research Feed