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
113 Citations
Mining frequent subgraphs over uncertain graph databases under probabilistic semantics
  • 32
Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases
  • 73
  • PDF
Graph similarity search on large uncertain graph databases
  • 23
Towards Frequent Subgraph Mining on Single Large Uncertain Graphs
  • 16
Efficient subgraph search over large uncertain graphs
  • 79
  • Highly Influenced
  • PDF
Efficient Probabilistic Supergraph Search Over Large Uncertain Graphs
  • 9
  • Highly Influenced
  • PDF
Threshold-Based Shortest Path Query over Large Correlated Uncertain Graphs
  • 2
Discovering highly reliable subgraphs in uncertain graphs
  • 82
  • Highly Influenced
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 16 REFERENCES
Efficient discovery of frequent subgraph patterns in uncertain graph databases
  • 54
  • Highly Influential
  • PDF
Efficient mining of frequent subgraphs in the presence of isomorphism
  • 685
  • Highly Influential
  • PDF
Discovering Frequent Graph Patterns Using Disjoint Paths
  • 61
  • Highly Influential
  • PDF
Finding frequent items in probabilistic data
  • 211
  • Highly Influential
  • PDF
Probabilistic frequent itemset mining in uncertain databases
  • 289
  • Highly Influential
  • PDF
Mining of Frequent Itemsets from Streams of Uncertain Data
  • C. Leung, Boyu Hao
  • Computer Science
  • 2009 IEEE 25th International Conference on Data Engineering
  • 2009
  • 104
  • Highly Influential
  • PDF
Mining Frequent Itemsets from Uncertain Data
  • 376
  • Highly Influential
  • PDF
gSpan: graph-based substructure pattern mining
  • X. Yan, Jiawei Han
  • Mathematics, Computer Science
  • 2002 IEEE International Conference on Data Mining, 2002. Proceedings.
  • 2002
  • 2,213
  • Highly Influential
  • PDF
Mining uncertain data with probabilistic guarantees
  • 155
  • Highly Influential
  • PDF
An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data
  • 1,089
  • Highly Influential
  • PDF
...
1
2
...