Graph Node-to-Node Mapping Task: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - ". ----" to ". ----") |
m (Text replacement - "__NOTOC__ " to "__NOTOC__ ") |
||
Line 15: | Line 15: | ||
__NOTOC__ | __NOTOC__ | ||
[[Category:Concept]] | [[Category:Concept]] |
Latest revision as of 02:42, 6 January 2023
A Graph Node-to-Node Mapping Task is a record linkage task for graph data.
- Context:
- It can range from being a Heuristic Graph Mapping Task to being a Data-Driven Graph Mapping Task.
- It can be solved by a Graph Mapping System (that implements a Graph Mapping Algorithm).
- Example(s):
- a KB Mapping Task, such as taxonomy node-to-node matching and ontology matching.
- …
- Counter-Example(s):
- See: Graph Clustering.