Data-Driven Graph Mapping Algorithm: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - ". ---- " to ". ---- ") |
m (Text replacement - "__NOTOC__ " to "__NOTOC__ ") |
||
| Line 13: | Line 13: | ||
__NOTOC__ | __NOTOC__ | ||
[[Category:Concept]] | [[Category:Concept]] | ||
Latest revision as of 02:32, 6 January 2023
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.