Rank Evaluation System for Digraph Node Ranking Visualization

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing rank evaluation systems for digraphs make it difficult for users to understand the factors behind changes in node rankings or the reasoning behind node ranking calculations.

Innovation Solution

A rank evaluation system that includes matrix generation, ranking calculation, and visualization components. The system generates a transition probability matrix based on a digraph and node evaluation criteria, calculates node rankings using a potential function, and visualizes the state of the potential function for selected nodes.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Loss of information

If a traditional rank evaluation system is used to calculate node rankings in a digraph, then the ranking can be computed, but users cannot easily grasp the factors behind ranking changes or the reasoning behind the calculation

Engineering Contradiction:
Improveinformation about ranking factorsVSAvoidcomplexity of ranking calculation
Core Design Contradiction:
Loss of informationVSDevice complexity

Solution Approach 1:

The patent segments the ranking calculation process into distinct components: a transition probability matrix that captures transition dynamics, a potential function that represents node characteristics, and a ranking calculation unit that combines these elements. This segmentation allows each component to be analyzed and visualized separately, making the overall ranking factors more graspable for users.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent introduces a potential function as an intermediary concept that bridges the transition probability matrix and the final ranking. The potential function serves as a mediator that translates complex transition dynamics into interpretable node characteristics, enabling users to understand the reasoning behind rankings without needing to directly analyze the full transition matrix.

Inventive Principle:
Principle #24Intermediary (Mediator)

2Ease of operation

If detailed analysis of ranking factors is provided, then user understanding improves, but the system becomes more complex and harder to operate

Engineering Contradiction:
Improveease of understanding rankingVSAvoidcomplexity of evaluation system
Core Design Contradiction:
Ease of operationVSDevice complexity

Solution Approach 1:

The patent employs visualization techniques that use color coding and graphical representations to display ranking factors and potential function states. By transforming complex numerical data into visual formats with intuitive color variations, the system makes ranking factors easily graspable while maintaining a relatively simple system architecture.

Inventive Principle:
Principle #32Color changes

Solution Approach 2:

The patent transforms the complex multi-dimensional ranking calculation into a more manageable representation by visualizing the potential function in reduced dimensional spaces. This dimensional transformation allows users to perceive ranking factors through simplified graphical representations rather than complex numerical matrices.

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

Data Source

PatentUS20250190825A1Rank evaluation system, rank evaluation method, and non-transitory computer-readable medium
Publication Date: 2025.06.12 TOYOTA JIDOSHA KK
  • US20250190825A1 patent drawing
  • US20250190825A1 patent drawing
  • US20250190825A1 patent drawing

AI summary

When the ranking of nodes changes or when a user wants to know the reason for the node ranking calculation, the user can easily and intuitively grasp the factors of change in the ranking of nodes. A rank evaluation system for evaluating ranking of nodes in a digraph composed of a plurality of interconnected nodes, the system including: matrix generation means for generating a transition probability matrix for defining a probability of transition among the nodes based on the digraph; ranking calculation means for calculating the ranking of all the nodes by calculating, using a potential function, an eigen vector of the transition probability matrix generated by the matrix generation means; and ranking visualization means for visualizing a state of the potential function corresponding to a predetermined node partitively selected from all the nodes based on the ranking of all nodes calculated by the ranking calculation means.