Supervised Graph-Edge Prediction Algorithm: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - " ↵--" to "--") |
m (Text replacement - "]]↵*" to "]]. *") |
||
| Line 1: | Line 1: | ||
A [[Supervised Graph-Edge Prediction Algorithm]] is a [[graph-edge prediction algorithm]] that is a [[supervised prediction algorithm]] and can be implemented into a [[Supervised Graph-Edge Prediction System]] (to solve a [[supervised graph-edge prediction task]]). | A [[Supervised Graph-Edge Prediction Algorithm]] is a [[graph-edge prediction algorithm]] that is a [[supervised prediction algorithm]] and can be implemented into a [[Supervised Graph-Edge Prediction System]] (to solve a [[supervised graph-edge prediction task]]). | ||
* <B>Example(s):</B> | * <B>Example(s):</B> | ||
** [[Supervised Friendship Prediction Algorithm]] | ** [[Supervised Friendship Prediction Algorithm]]. | ||
* <B>Counter-Example(s):</B> | * <B>Counter-Example(s):</B> | ||
** [[Supervised Graph-Node Prediction Algorithm]]. | ** [[Supervised Graph-Node Prediction Algorithm]]. | ||
Latest revision as of 18:41, 4 October 2023
A Supervised Graph-Edge Prediction Algorithm is a graph-edge prediction algorithm that is a supervised prediction algorithm and can be implemented into a Supervised Graph-Edge Prediction System (to solve a supervised graph-edge prediction task).
- Example(s):
- Counter-Example(s):
- See:----