Frequent Subgraph Mining Task

A Frequent Subgraph Mining Task is a Frequent Pattern Mining Task that produces frequent subgraphs.

• Context:
  • It can be solved by a Frequent Subgraph Mining System (that implements a Frequent Subgraph Mining algorithm).
  • …
• Counter-Example(s):
  • Frequent Substring Mining Task.
  • Frequent Tree Mining Task.
• See: Subgraph Mining Task, Frequent Itemset Mining Task.

---

---

References

2010

• (Zou et al., 2010) ⇒ Zhaonian Zou, Hong Gao, and Jianzhong Li. (2010). “Discovering Frequent Subgraphs over Uncertain Graph Databases under Probabilistic Semantics.” In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2010). doi:10.1145/1835804.1835885

2006

• (Horváth et al., 2006) ⇒ Tamás Horváth, Jan Ramon, and Stefan Wrobel. (2006). “Frequent Subgraph Mining in Outerplanar Graphs.” In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. doi:10.1145/1150402.1150427
  • QUOTE: In recent years there has been an increased interest in algorithms that can perform frequent pattern discovery in large databases of graph structured objects.

---