Graph Mining Algorithm

A graph mining algorithm is a relational mining algorithm that can solve a graph mining task.

• AKA: Network Analysis Algorithm.
• Context:
  • It can range from being a Directed Graph Mining Algorithm to being an Undirected Graph Mining Algorithm.
• Examples:
  • a Graph Classification Algorithm.
  • a Graph Node Classification Algorithm.
  • a Graph Edge Classification Algorithm.
  • a Graph Value Regression Algorithm.
    • a Graph Node Value Regression Algorithm.
    • a Graph Edge Value Regression Algorithm.
  • a Graph Clustering Algorithm.
  • a Graph Node Clustering Algorithm.
  • a Graph Edge Clustering Algorithm.
• Counter-Example(s):
  • a Tuple Classification Algorithm.
  • a Tuple Association Learning Algorithm.
  • a Tuple Clustering Algorithm.
  • a Graph Design Task.
• See: Social Network Analysis, Protein-Protein Interaction Analysis, Inductive Database Graph Mining Algorithm.

---

---

References

2005

• (Getoor & Diehl, 2005) ⇒ Lise Getoor, and Christopher P. Diehl. (2005). "Link Mining: A survey." In: [[SIGKDD Explorations], 7(2).

1995

• (Blum & Furst, 1995) ⇒ Avrim L. Blum, and Merrick L. Furst. (1995). "Fast Planning Through Planning Graph Analysis." In: Proceedings of the 14th International Joint Conference on AI (IJCAI 1995). doi:10.1016/S0004-3702(96)00047-1
  • Planning Graph

---