Data-Driven Graph Mapping Task
(Redirected from Data-Driven Graph Matching)
Jump to navigation
Jump to search
A Data-Driven Graph Mapping Task is a graph mapping task that is a data-driven record linkage task.
- AKA: Data-Driven Graph Linking, Data-Driven Graph Matching.
- Context:
- It can range from being a Supervised Graph Mapping Task to being an Unsupervised Graph Mapping Task.
- It can range from being an Unsupervised Graph Mapping Task to being a Supervised Graph Mapping Task.
- It can be solved by a Data-Driven Graph Mapping System (that implements a Data-Driven Graph Mapping Algorithm).
- It can be supported by a Data-Driven Graph Node-based Classification Task.
- It can support a Data-Driven Graph Merging Task.
- …
- Example(s):
- Counter-Example(s):
- See: Data-Driven System, Data-Driven Algorithm, Graph Node-based Linking.