# US 2021/0342397 A1 · Method for weighting a graph

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2021/0342397 A1
- Document ID: US20210342397A1
- Status: Published application
- Kind: A1
- Application number: 17/234,835
- Filed: 2021-04-20
- Published: 2021-11-04
- Earliest claimed: 2020-04-29
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Martin Oberhofer; Mike W. Grasselt; Claudio Andrea Fanconi; Thuany Karoline Stuart; Yannick Saillet; Basem Elasioty; Hemanth Kumar Babu; Robert Kern
- Web page: https://patentgrep.com/patent/US20210342397A1

## CPC

- G06F 16/9024: {Graphs; Linked lists (G06F16/9027 takes precedence)}
- G06F 16/367: {Ontology}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

The present disclosure relates to a method for a weighting graph comprising nodes representing entities and edges representing relationships between entities in accordance with one or more domains. The method comprises: pre-processing the graph comprising assigning weights to the nodes and/or the edges of the graph in accordance with a specific domain of the domains, wherein the weight indicates a domain specific data quality problem of attribute values representing an edge of the edges and/or an entity involved in that edge. The weighted graph may be provided for enabling a processing of the graph in accordance with the specific domain.

## Claims

### Claim 1

A computer implemented method comprising:
weighting a graph comprising nodes representing entities and edges representing relationships between entities in accordance with one or more domains;
pre-processing the graph comprising assigning weights to the nodes and the edges of the graph in accordance with a specific domain of the domains, the weight indicating a domain specific data quality problem of attribute values representing an edge of the edges and/or a node connected to that edge; and
providing the weighted graph for enabling a processing of the graph in accordance with the specific domain.

### Claim 2 (depends on 1)

The computer implemented method of claim 1, further comprising:
performing the pre-processing of another graph resulting in another weighted graph; and
matching the two weighted graphs using the weights.

### Claim 3 (depends on 1)

The computer implemented method of claim 1, wherein assigning of the weights comprises:
using semantic rules of the specific domain for determining a consistency level between attribute values of a node and attribute values of an edge connected to the node, and assigning the weights based on the consistency level.

### Claim 4 (depends on 1)

The computer implemented method of claim 1, wherein the assigning of the weights comprises:
determining a set of ontology rules descriptive of an ontology of the specific domain; and
determining whether the attribute values of the nodes and/or edges fulfil the set of ontology rules, and assigning the weights based on the determining step.

### Claim 5 (depends on 4)

The computer implemented method of claim 4, wherein the set of ontology rules are automatically determined or user defined.

### Claim 6 (depends on 4)

The computer implemented method of claim 4, wherein the set of ontology rules are derived from a given dataset representing the specific domain, based on determining common or uncommon edges to nodes of another domain, wherein the uncommon edges are assigned higher weights.

### Claim 7 (depends on 1)

The computer implemented method of claim 1, further comprising:
removing nodes or edges having weights that fulfil a predefined filtering condition; and
providing the resulting graph.

### Claim 8 (depends on 1)

The computer implemented method of claim 1, wherein the weights indicate a reliability of the nodes and optionally edges for being used as a basis for a matching decision by a matching program.

### Claim 9 (depends on 1)

The computer implemented method of claim 1, further comprising:
receiving a request from a database matching engine, the request indicating the specific domain; and
in response to receiving the request, performing the pre-processing, wherein the weighted graph is provided to the database matching engine.

### Claim 10 (depends on 1)

The computer implemented method of claim 1, further comprising:
processing the weighted graph using the weights.

### Claim 11 (depends on 1)

A computer program product comprising a computer-readable storage medium having computer-readable program code embodied therewith, the computer-readable program code configured to implement the method of claim 1.

### Claim 12

A computer system comprising:
one or more computer processors;
one or more computer readable storage media; and
program instructions stored on the one or more computer readable storage media for execution by at least one of the one or more computer processors, the program instructions comprising:
program instructions to weight a graph comprising nodes representing entities and edges representing relationships between entities in accordance with one or more domains;
program instructions to pre-process the graph comprising assigning weights to the nodes and the edges of the graph in accordance with a specific domain of the domains, the weight indicating a domain specific data quality problem of attribute values representing an edge of the edges and/or a node connected to that edge; and
program instructions to provide the weighted graph for enabling a processing of the graph in accordance with the specific domain.
