Graph Classification Algorithm: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
m (Text replacement - "<U>Counter-Example(s)</U>" to "Counter-Example(s)") |
||
| 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]]. | ||
Revision as of 16:15, 10 September 2014
A Graph Classification Algorithm is a classification algorithm that can be applied to the Graph Classification Task.
- Counter-Example(s):
- See: Subgraph Classification.