Graph Clustering Algorithm: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - ". ----" to ". ----") |
m (Text replacement - "]]↵*" to "]]. *") |
||
| Line 3: | Line 3: | ||
** It can be applied by a [[Graph Clustering System]] (to solve a [[graph clustering task]]). | ** It can be applied by a [[Graph Clustering System]] (to solve a [[graph clustering task]]). | ||
* <B>Example(s):</B> | * <B>Example(s):</B> | ||
** a [[Blockmodeling Algorithm]] | ** a [[Blockmodeling Algorithm]]. | ||
* <B>Counter-Example(s):</B> | * <B>Counter-Example(s):</B> | ||
** a [[Graph Classification Algorithm]]. | ** a [[Graph Classification Algorithm]]. | ||
Latest revision as of 17:52, 4 October 2023
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):
- Counter-Example(s):
- 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