Graph Path Classification Visual Indicia

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Conventional methods for visualizing data through workflow diagrams or flowcharts often lose important information when compressing paths in graphs, making it difficult to compare and analyze sequential actions effectively.

Innovation Solution

Classifying paths in graphs based on various criteria and representing them with distinct visual indicia such as color and line thickness to differentiate between classes, allowing for a more informative and readable visualization of data.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If paths are compressed by varying thickness of transitions to reflect frequency of occurrence, then the importance of individual steps and hot spots can be identified, but properties of overall paths are lost and too much information is lost to support comparison of certain actions

Engineering Contradiction:
Improveidentification of hot spots and individual stepsVSAvoidloss of path properties and comparison information
Core Design Contradiction:
Measurement precisionVSLoss of information

Solution Approach 1:

The patent segments the visualization into two complementary representations: (1) compressed summary graph showing frequency-based importance with varying line thickness, and (2) detailed path enumeration showing individual path sequences with their frequencies. This segmentation allows simultaneous viewing of both aggregate statistics and individual path characteristics, resolving the contradiction between identifying hot spots and preserving path comparison information.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent adds a new dimension to the visualization by displaying paths in a tabular format alongside the graph, where each row represents a complete path sequence. This additional dimension preserves the sequential action information that would be lost in traditional compression, enabling comparison of specific actions while maintaining the visual benefits of the compressed graph representation.

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

2Ease of operation

If conventional compression methods are used to represent paths, then the graph becomes more readable by highlighting important steps, but the ability to compare sequential actions is reduced

Engineering Contradiction:
Improvereadability of graphVSAvoidloss of sequential action details
Core Design Contradiction:
Ease of operationVSLoss of information

Solution Approach 1:

The patent merges two visualization approaches into a unified system: the compressed summary graph (providing readability and hot spot identification) and the detailed path enumeration (providing sequential action comparison capability). By presenting both representations simultaneously and linking them through shared node and edge identifiers, the system achieves both readability and detailed comparison functionality.

Inventive Principle:
Principle #5Merging (Combining)

Solution Approach 2:

The patent uses an intermediary tabular representation that acts as a bridge between the compressed graph and the detailed path information. This intermediate format lists complete path sequences with frequency counts, allowing users to compare sequential actions while the compressed graph provides the visual overview. The intermediary preserves information that would otherwise be lost in compression while maintaining the benefits of visual compression for overall readability.

Inventive Principle:
Principle #24Intermediary (Mediator)

Data Source

PatentUS10402430B2Method and system for representing paths on a graph based on a classification
Publication Date: 2019.09.03 ALCATEL LUCENT SA
  • US10402430B2 patent drawing
  • US10402430B2 patent drawing
  • US10402430B2 patent drawing

AI summary

A system and method includes providing a graph having a plurality of paths from data. Each of the paths is classified into one of a plurality of classes based upon a criterion. Each of the paths are associated with indicia for representing paths of a class on the graph as being visually distinct from paths of another class on the graph.