Graph Node Prediction Algorithm: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - "be implemented in a" to "be applied by a") |
m (Text replacement - "]]. * <B>Example" to "]]. ** ... * <B>Example") |
||
Line 2: | Line 2: | ||
* <B>Context:</B> | * <B>Context:</B> | ||
** It can range from being a [[Heuristic Graph Node-based Classification Algorithm]] to being a [[Data-Driven Graph Node-based Classification Algorithm]]. | ** It can range from being a [[Heuristic Graph Node-based Classification Algorithm]] to being a [[Data-Driven Graph Node-based Classification Algorithm]]. | ||
** ... | |||
* <B>Example(s):</B> | * <B>Example(s):</B> | ||
** ([[Melli, 2005a]]). | ** ([[Melli, 2005a]]). |
Revision as of 02:14, 22 February 2021
A Graph Node Prediction Algorithm is a multi-class classification algorithm that can be applied by a graph node prediction system (to solve a graph node prediction task).
- Context:
- It can range from being a Heuristic Graph Node-based Classification Algorithm to being a Data-Driven Graph Node-based Classification Algorithm.
- ...
- Example(s):
- (Melli, 2005a).
- Counter-Example(s):
- See: Supervised Product Taxonomy Matching Algorithm.