Data-Driven Graph Mapping Algorithm: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - "---- ---- [[Category" to "---- ---- __NOTOC__ [[Category") |
m (Text replacement - ". ---- " to ". ---- ") |
||
| Line 8: | Line 8: | ||
** [[Data-Driven Taxonomy Matching Algorithm]]. | ** [[Data-Driven Taxonomy Matching Algorithm]]. | ||
* <B>See:</B> [[Data-Driven Graph Mapping System]], [[Data-Driven Graph Mapping Task]]. | * <B>See:</B> [[Data-Driven Graph Mapping System]], [[Data-Driven Graph Mapping Task]]. | ||
---- | ---- | ||
---- | ---- | ||
Revision as of 02:38, 17 June 2021
A Data-Driven Graph Mapping Algorithm is a Graph Mapping Algorithm that is a Data-Driven Record-Linkage Algorithm.
- Context:
- It can be applied by a Data-Driven Graph Mapping System.
- It can range from being a Supervised Graph Mapping Algorithm to being an Unsupervised Graph Mapping Algorithm.
- It can be supported by a Data-Driven Graph Node-based Classification Algorithm.
- …
- Example(s):
- See: Data-Driven Graph Mapping System, Data-Driven Graph Mapping Task.