Hierarchical objects linkage data visualization

Patent metadata

Field	Value
Publication number	US-11055359-B2
Application number	US-201815972241-A
Country	US
Kind code	B2
Filing date	May 7, 2018
Priority date	May 7, 2018
Publication date	Jul 6, 2021
Grant date	Jul 6, 2021

Abstract

A computer-implemented method, computerized apparatus and computer program product for hierarchical objects linkage data visualization. A visualization of linkage data comprising a plurality of connections between a set of source objects and a set of target objects is obtained with respect to a predetermined level of hierarchy defined over attributes of at least one of the sets, wherein attributes of the objects and connections therebetween are represented in the visualization as nodes and links of a bipartite graph respectively. A spatial layout of links of a node is modified based on a relative position of each neighbor node thereof in an adjacent level, wherein neighboring nodes represent attributes of one or more objects which share in common an attribute represented by the node, wherein the relative position is determined based on a visualization restricted to the neighboring nodes so as to obtain a position preserving layout.

First claim

What is claimed is:

1. A computer-implemented method comprising:
rendering a visualization of linkage data by applying a visualization tool to the linkage data, the linkage data comprising a plurality of connections between a plurality of objects, wherein an object at a first endpoint of a connection is a source object and an object at a second endpoint of the connection is a target object, whereby a set of source objects and a set of target objects are defined,
wherein the visualization tool is configured for rendering linkage data as a bipartite graph, wherein the bipartite graph comprises links representing the plurality of connections between the plurality of objects, wherein the bipartite graph comprises nodes representing attributes of the plurality of objects, wherein the visualization tool is configured for ordering the nodes with a minimal number of crossings between the links and a minimal length of each link, thereby optimizing an aspect of a spatial layout of the links of the graph representing the plurality of connections,
wherein a node representing objects in the set of source objects or in the set of target objects associated with a set of attributes of the objects having a hierarchical ordering from a top-most level to a bottom-most level,
wherein the visualization is rendered by applying the visualization tool with respect to a first level of the set of attributes associated with the node; and

for the node in the visualization and at least one descendant node thereof associated with a subset of one or more objects sharing in common an attribute represented by the at least one descendant node of the node, modifying a link from the spatial layout of links that is connected to the node based on an order assigned to descendant nodes representing a second level of the set of attributes, wherein the order comprises relative positions of the descendant nodes relative to each other, wherein the second level consists of an adjacent level of the first level, wherein said modifying is performed by the visualization tool when applied with respect to the at least one descendant node in the second level,
wherein said modifying comprises splitting the link connected to the node into a plurality of links, wherein at least one link of the plurality of links is connected to the at least one descendant node, respectively.

2. The computer-implemented method of claim 1 , wherein the nodes by which the attributes are represented are rendered along parallel axes, wherein each level of the hierarchical ordering is assigned a single axis.

3. The computer-implemented method of claim 1 , wherein each link from the spatial layout of links is rendered with a width indicative of an amount transferred between nodes connected thereby.

4. The computer-implemented method of claim 1 , wherein the hierarchical ordering of the set of attributes is arranged in a tree-like structure, and wherein said modifying is performed iteratively by traversing the tree-like structure from a root node downwards to descendant nodes until all leaf nodes are reached, wherein all links of a traversed node are modified based on the relative positions assigned to descendant nodes of the traversed node by the visualization tool when being applied with respect to the descendant nodes.

5. The computer-implemented method of claim 1 , wherein the visualization tool is a Sankey diagram plotting tool.

6. The computer-implemented method of claim 1 , wherein said modifying is performed selectively and reversibly in response to user demand, whereby allowing the user to examine the linkage data in a drill-down fashion.

7. The computer-implemented method of claim 1 , wherein said modifying is performed for one or more respective nodes with a common attribute in the first level and/or for one or more successive levels, wherein results of said modifying are stored in a designated storage means for fast-retrieval upon user demand.

8. A computerized apparatus having a processor and coupled memory, the processor being adapted to perform the steps of:
rendering a visualization of linkage data by applying a visualization tool to the linkage data, the linkage data comprising a plurality of connections between a plurality of objects, wherein an object at a first endpoint of a connection is a source object and an object at a second endpoint of the connection is a target object, whereby a set of source objects and a set of target objects are defined,
wherein the visualization tool is configured for rendering linkage data as a bipartite graph, wherein the bipartite graph comprises links representing the plurality of connections between the plurality of objects, wherein the bipartite graph comprises nodes representing attributes of the plurality of objects, wherein the visualization tool is configured for ordering the nodes with a minimal number of crossings between the links and a minimal length of each link, thereby optimizing an aspect of a spatial layout of the links of the graph representing the plurality of connections,
wherein a node representing objects in the set of source objects or in the set of target objects is associated with a set of attributes of the objects having a hierarchical ordering from a top-most level to a bottom-most level,
wherein the visualization is rendered by applying the visualization tool with respect to a first level of the set of attributes associated with the node; and

for the node in the visualization and at least one descendant node thereof associated with a subset of one or more objects sharing in common an attribute represented by the at least one descendant node of the node, modifying a link from the spatial layout of links that is connected to the node based on an order assigned to descendant nodes representing a second level of the set of attributes, wherein the order comprises relative positions of the descendant nodes relative to each other, wherein the second level consists of an adjacent level of the first level, wherein said modifying is performed by the visualization tool when applied with respect to the at least one descendant node in the second level,
wherein said modifying comprises splitting the link connected to the node into a plurality of links, wherein at least one link of the plurality of links is connected to the at least one descendant node, respectively.

9. The computerized apparatus of claim 8 , wherein the nodes by which the attributes are represented are rendered along parallel axes, wherein each level of the hierarchical ordering is assigned a single axis.

10. The computerized apparatus of claim 8 , wherein each link from the spatial layout of links is rendered with a width indicative of an amount transferred between nodes connected thereby.

11. The computerized apparatus of claim 8 , wherein the hierarchical ordering of the set of attributes is arranged in a tree-like structure, and wherein said modifying is performed iteratively by traversing the tree-like structure from a root node downwards to descendant nodes until all leaf nodes are reached, wherein all links of a traversed node are modified based on the relative positions assigned to descendant nodes of the traversed node by the visualization tool when being applied with respect to the descendant nodes.

12. The computerized apparatus of claim 8 , wherein the processor being adapted to perform said modifying selectively and reversibly in response to user demand, whereby allowing the user to examine the linkage data in a drill-down fashion.

13. The computerized apparatus of claim 8 , wherein the processor being adapted to perform said modifying for one or more respective nodes with a common attribute in

Assignees

• IBM

Inventors

• Bak Peter
• Biller Ofer Haim
• Blinder Rotem
• Daniel Tal
• Even Adir
• Sofer Oded
• Yakoobov Mazal

Classifications

• G06T11/26

  Drawing of charts or graphs · CPC title

• G06F16/9024

  Graphs; Linked lists (G06F16/9027 takes precedence) · CPC title

• G06F16/9027

  Trees · CPC title

• G06F16/26 Primary

  Visual data mining; Browsing structured data · CPC title

• G06F16/904 Primary

  Browsing; Visualisation therefor (for navigating the web G06F16/954; browsing optimisation for the web G06F16/957) · CPC title