Graph Classification Algorithm: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
m (Text replacement - ". ----" to ". ----") |
||
| (4 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
A [[Graph Classification Algorithm]] is a [[classification algorithm]] that can be applied to the [[Graph Classification Task]]. | A [[Graph Classification Algorithm]] is a [[classification algorithm]] that can be applied to the [[Graph Classification Task]]. | ||
* <B | ** … | ||
* <B>Counter-Example(s):</B> | |||
** a [[Graph Node Classification Algorithm]]. | ** a [[Graph Node Classification Algorithm]]. | ||
** a [[Graph Edge Classification Algorithm]]. | ** a [[Graph Edge Classification Algorithm]]. | ||
** a [[Graph Clustering Algorithm]]. | ** a [[Graph Clustering Algorithm]]. | ||
* <B | * <B>See:</B> [[Subgraph Classification]]. | ||
---- | ---- | ||
---- | ---- | ||
Latest revision as of 17:03, 28 June 2021
A Graph Classification Algorithm is a classification algorithm that can be applied to the Graph Classification Task.
- …
- Counter-Example(s):
- See: Subgraph Classification.