Graph Clustering Algorithm

A Graph Clustering Algorithm is a graph analysis algorithm that is a clustering algorithm.

• Context:
  • It can be applied by a Graph Clustering System (to solve a graph clustering task).
• Example(s):
  • a Blockmodeling Algorithm.
• Counter-Example(s):
  • a Graph Classification Algorithm.
• See: Graph Classification Algorithm.

---

---

References

2008

• (Sato et al., 2008) ⇒ Issei Sato, Minoru Yoshida, Hiroshi Nakagawa. (2008). “Knowledge Discovery of Semantic Relationships between Words Using Nonparametric Bayesian Graph Model.” In: Proceedings of KDD-2008 (KDD-2008).

2007

• (Schaeffer, 2007) ⇒ Satu Elisa Schaeffer. (2007). “Survey: Graph Clustering.” In: Computer Science Review Journal, 1(1). doi:10.1016/j.cosrev.2007.05.001

---