Method and system for visualizing a graph

Patent metadata

Field	Value
Publication number	US-12561859-B2
Application number	US-202318501462-A
Country	US
Kind code	B2
Filing date	Nov 3, 2023
Priority date	Nov 3, 2023
Publication date	Feb 24, 2026
Grant date	Feb 24, 2026

Abstract

A method for identifying relationships between nodes in a graph is provided. The method comprises determining a count of relationships for each relationship type associated with each node in a pair of nodes on the graph. The relationship types are represented by edges connected to the nodes in the pair of nodes. A number of common relationships are determined between the pair of nodes for each relationship type. A count for each common relationship is determined for the number of common relationships between the pair of nodes. A similarity coefficient for each common relationship is determined based on the count for each common relationship and the count of relationships for each relationship type associated with each node in the pair of nodes. A weighted score is generated to represent strength for relationships between the pair of nodes using the similarity coefficients.

First claim

What is claimed is:

1 . A computer implemented method for visualizing relationships between nodes on a graph, comprising:
determining, by a number of processor units, a count of relationships for each relationship type associated with each node in a pair of nodes on the graph by counting edges that represent relationships of the same relationship type for each node in the pair of nodes, wherein the relationship types are represented by edges connected to the nodes in the pair of nodes; determining, by the number of processor units, a first set of common relationships based on edges of same relationship type between the pair of nodes and common nodes connected to both nodes in the pair of nodes; determining, by the number of processor units, a second set of common relationships based on edges of different relationship types between the pair of nodes and common nodes connected to both nodes in the pair of nodes; generating, by the number of processor units, the number of common relationships by combining the first set of common relationships and the second set of common relationships; determining, by the number of processor units, a count for each common relationship from the number of common relationships between the pair of nodes; generating, by the number of processor units, a similarity coefficient for each common relationship from the number of common relationships between the pair of nodes based on the count for each common relationship for the pair of nodes and counts of common relationships for relationship type of each common relationship from the number of common relationships between the pair of nodes, and wherein the counts of common relationships are determined based on common relationships between each node in the pair of nodes and other nodes on the graph; generating, by the number of processor units, a weighted score to represent strength for relationships between the pair of nodes, wherein the weighted score is generated by assigning a weight to each of the similarity coefficients, and calculating the weighted score using the weights applied to the similarity coefficients; and displaying, by the number of processor units, the pair of nodes on the graph, wherein visualizations for the pair of nodes are adjusted based on the weighted score.

2 . The computer implemented method of claim 1 , wherein displaying, by the number of processor units, the pair of nodes on the graph based on value of the weighted score comprises:
generating, by the number of processor units, an edge between the pair of nodes for the weighted score.

3 . The computer implemented method of claim 2 further comprises:
displaying, by the number of processor units, the edge between the pair of nodes for the weighted score.

4 . The computer implemented method of claim 1 further comprises:
identifying, by the number of processor units, a first node and a second node from the graph; and
identifying, by the number of processor units, a number of paths between the first node and the second node, wherein each path from the number of paths comprises a number of edges.

5 . The computer implemented method of claim 1 , wherein the similarity coefficients are Jaccard coefficients.

6 . A computer system comprising:
a storage device that stores program instructions; one or more processors operably connected to the storage device and configured to execute the program instructions to cause the computer system to: determine a count of relationships for each relationship type associated with each node in a pair of nodes on a graph by counting edges that represent relationships of the same relationship type for each node in the pair of nodes, wherein the relationship types are represented by edges connected to the nodes in the pair of nodes; determine a first set of common relationships based on edges of same relationship type between the pair of nodes and common nodes connected to both nodes in the pair of nodes; determine a second set of common relationships based on edges of different relationship types between the pair of nodes and common nodes connected to both nodes in the pair of nodes; generate the number of common relationships by combining the first set of common relationships and the second set of common relationships; determine a count for each common relationship from the number of common relationships between the pair of nodes; generate a similarity coefficient for each common relationship from the number of common relationships between the pair of nodes based on the count for each common relationship for the pair of nodes and counts of common relationships for relationship type of each common relationship from the number of common relationships between the pair of nodes, and wherein the counts of common relationships are determined based on common relationships between each node in the pair of nodes and other nodes on the graph; generate a weighted score to represent strength for relationships between the pair of nodes, wherein the weighted score is generated by assigning a weight to each of the similarity coefficients, and calculating the weighted score using the weights applied to the similarity coefficients; and display the pair of nodes on the graph, wherein visualizations for the pair of nodes are adjusted based on the weighted score.

7 . The computer system of claim 6 , wherein display the pair of nodes on the graph based on value of the weighted score, the processors further execute instructions to:
generate an edge between the pair of nodes for the weighted score.

8 . The computer system of claim 7 , wherein the processors further execute instructions to:
display the edge between the pair of nodes for the weighted score.

9 . The computer system of claim 6 , wherein the processors further execute instructions to:
identify a first node and a second node from the graph; and identify a number of paths between the first node and the second node, wherein each path from the number of paths comprises a number of edges.

10 . The computer system of claim 6 , wherein the similarity coefficients are Jaccard coefficients.

11 . A computer program product, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a computer system to cause the computer system to:
determine a count of relationships for each relationship type associated with each node in a pair of nodes on a graph by counting edges that represent relationships of the same relationship type for each node in the pair of nodes, wherein the relationship types are represented by edges connected to the nodes in the pair of nodes; determine a first set of common relationships based on edges of same relationship type between the pair of nodes and common nodes connected to both nodes in the pair of nodes; determine a second set of common relationships based on edges of different relationship types between the pair of nodes and common nodes connected to both nodes in the pair of nodes; generate the number of common relationships by combining the first set of common relationships and the second set of common relationships; determine a count for each common relationship from the number of common relationships between the pair of nodes; generate a similarity coefficient for each common relationship from the number of common relationships between the pair of nodes based on the count for each common relationship for the pair of nodes and counts of common relationships for relationship type of each common relationship from the number of common relationships between the pair of nodes, and wherein the counts of common r

Assignees

• S&P Global Inc

Inventors

• Chaudhary Abhishek
• Kaur Harpreet
• Krishnamurthy Shankar
• Kocherlakota Swamy

Classifications

• G06T11/26 Primary

  Drawing of charts or graphs · CPC title

• G06T11/206 Primary

  Physics · mapped topic