IP Library › Granted Patent US 10,672,155
Granted Patent B2
US 10,672,155 · App. 15/238,814 · Granted Jun 2, 2020

Non-linear, multi-resolution visualization of a graph

Inventors: Danish Contractor (Bangalore, IN); Varun Parashar (New Delhi, IN); Nitendra Rajput (Bangalore, IN)
Assignee: International Business Machines Corporation
G06T11/206G06F16/35G06F16/9024G06K9/6219G06T3/4076
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 10,672,155
App. No.
15/238,814
Granted
Jun 2, 2020
Kind
B2
Abstract

Methods, systems, and computer program products for non-linear, multi-resolution visualization of a graph are provided herein. A computer-implemented method includes generating multiple sub-graphs derived from an input knowledge graph, wherein the input knowledge graph comprises multiple nodes and multiple edges, and wherein each of the generated sub-graphs comprises a distinct level of resolution; processing an input comprising at least one area of user interest on the input knowledge graph; generating a multi-resolution version of the input knowledge graph by combining two or more of the generated sub-graphs, wherein the two or more sub-graphs are selected based on the at least one area of user interest; and outputting the multi-resolution version of the input knowledge graph to the user via an interactive mechanism.

Claims (44)

1. A computer-implemented method, comprising:

generating multiple sub-graphs derived from an input knowledge graph, wherein the input knowledge graph comprises multiple nodes and multiple edges, and wherein each of the generated sub-graphs comprises a distinct level of resolution, wherein each distinct level of resolution comprises a distinct granularity of at least a portion of the input knowledge graph that prioritizes one or more of the multiple nodes of the input knowledge graph relative to the other nodes of the input knowledge graph;

processing an input corresponding to at least one area of user interest on the input knowledge graph;

generating a multi-resolution version of the input knowledge graph that non-linearly varies a zoom level at different points of the multi-resolution version by (i) combining two or more of the generated sub-graphs and (ii) displaying the combined sub-graphs within at least a portion of the input knowledge graph, wherein the two or more sub-graphs are selected based on the at least one area of user interest, wherein said zoom level varies non-linearly at the different points of the multi-resolution version based on the following equation: K/d 2 , wherein d is the distance from the at least one area of user interest, and wherein K is a constant; and

outputting the multi-resolution version of the input knowledge graph to the user via an interactive mechanism;

wherein the steps are carried out by at least one computing device.

2. The computer-implemented method of claim 1 , comprising:

calculating a level of resolution for all portions of the multi-resolution version of the input knowledge graph in response to an input comprising an updated area of user interest.

3. The computer-implemented method of claim 1 , wherein said generating multiple sub-graphs comprises identifying multiple clusters of two or more of the multiple nodes of the input knowledge graph.

4. The computer-implemented method of claim 3 , wherein said identifying multiple clusters comprises implementing one or more semantics-based clustering techniques.

5. The computer-implemented method of claim 1 , wherein said generating multiple sub-graphs comprises summarizing the input knowledge graph via one or more degree distributions.

6. The computer-implemented method of claim 1 , wherein said generating multiple sub-graphs comprises summarizing the input knowledge graph via one or more clustering coefficients.

7. The computer-implemented method of claim 1 , wherein the at least one area of user interest comprise (i) a source node and (ii) a target node.

8. The computer-implemented method of claim 1 , wherein said combining two or more of the generated sub-graphs comprises:

inserting the selected two or more sub-graphs at corresponding positions of the input knowledge graph; and

removing one or more remaining positions of the input knowledge graph.

9. The computer-implemented method of claim 1 , comprising:

adjusting the size of the one or more nodes of the two or more selected sub-graphs.

10. The computer-implemented method of claim 9 , wherein said adjusting is based on screen resolution of a device from which the at least one area of user interest input is provided.

11. The computer-implemented method of claim 9 , wherein said adjusting is based on screen size of a device from which the at least one area of user interest input is provided.

12. The computer-implemented method of claim 9 , wherein said adjusting is based on the number of nodes present in a path captured in the two or more selected sub-graphs.

13. The computer-implemented method of claim 9 , wherein said adjusting is based on at least one of: (i) a predetermined maximum node size, and (ii) a predetermined minimum node size.

14. A computer program product comprising a non-transitory computer readable storage medium having program instructions embodied therewith, the program instructions executable by a device to cause the device to:

generate multiple sub-graphs derived from an input knowledge graph, wherein the input knowledge graph comprises multiple nodes and multiple edges, and wherein each of the generated sub-graphs comprises a distinct level of resolution, wherein each distinct level of resolution comprises a distinct granularity of at least a portion of the input knowledge graph that prioritizes one or more of the multiple nodes of the input knowledge graph relative to the other nodes of the input knowledge graph;

process an input corresponding to at least one area of user interest on the input knowledge graph;

generate a multi-resolution version of the input knowledge graph that non-linearly varies a zoom level at different points of the multi-resolution version by (i) combining two or more of the generated sub-graphs and (ii) displaying the combined sub-graphs within at least a portion of the input knowledge graph, wherein the two or more sub-graphs are selected based on the at least one area of user interest, wherein said zoom level varies non-linearly at the different points of the multi-resolution version based on the following equation: K/d 2 , wherein d is the distance from the at least one area of user interest, and wherein K is a constant; and

output the multi-resolution version of the input knowledge graph to the user via an interactive mechanism.

15. A system comprising:

a memory; and

at least one processor coupled to the memory and configured for:

generating multiple sub-graphs derived from an input knowledge graph, wherein the input knowledge graph comprises multiple nodes and multiple edges, and wherein each of the generated sub-graphs comprises a distinct level of resolution, wherein each distinct level of resolution comprises a distinct granularity of at least a portion of the input knowledge graph that prioritizes one or more of the multiple nodes of the input knowledge graph relative to the other nodes of the input knowledge graph;

processing an input corresponding to at least one area of user interest on the input knowledge graph;

generating a multi-resolution version of the input knowledge graph that non-linearly varies a zoom level at different points of the multi-resolution version by (i) combining two or more of the generated sub-graphs and (ii) displaying the combined sub-graphs within at least a portion of the input knowledge graph, wherein the two or more sub-graphs are selected based on the at least one area of user interest, wherein said zoom level varies non-linearly at the different points of the multi-resolution version based on the following equation: K/d 2 , wherein d is the distance from the at least one area of user interest, and wherein K is a constant; and

outputting the multi-resolution version of the input knowledge graph to the user via an interactive mechanism.

16. A computer-implemented method, comprising:

generating multiple sub-maps derived from an input map, wherein the input map comprises multiple nodes and multiple edges, and wherein each of the generated sub-maps comprises a distinct level of resolution, wherein each distinct level of resolution comprises a distinct granularity of at least a portion of the input map that prioritizes one or more of the multiple nodes of the input map relative to the other nodes of the input map;

processing an input corresponding to at least one area of user interest on the input map;

generating multi-resolution version of the input map that non-linearly varies a zoom level at different points of the multi-resolution version by (i) combining two or more of the generated sub-maps and (ii) displaying the combined sub-maps within at least a portion of the input map, wherein said zoom level varies non-linearly at the different points of the multi-resolution version based on the following equation: K/d 2 , wherein d is the distance from the at least one area of user interest, and wherein K is a constant; and

outputting the multi-resolution version of the input map to the user via an interactive mechanism;

wherein the steps are carried out by at least one computing device.

17. The computer-implemented method of claim 16 , comprising:

calculating a level of resolution for all portions of the multi-resolution version of the input map in response to an input comprising an updated area of user interest.

18. The computer-implemented method of claim 16 , wherein said generating multiple sub-maps comprises identifying multiple clusters of two or more of the multiple nodes of the input map.

19. The computer-implemented method of claim 16 , wherein the at least one area of user interest comprise (i) a source node and (ii) a target node.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 17, 2016
From: CONTRACTOR, DANISH; PARASHAR, VARUN; RAJPUT, NITENDRA
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 039463/0174 →
Continuity (1)
Related Publication 20180053327A1 · Feb 22, 2018
Cited By (1)
US 12,271,981