Graph Shortcut Edge Deletion for Search Integrity
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional technologies for generating graph data by deleting shortcut edges often result in excessive deletion, lacking sufficient consideration for processing procedures and determination conditions, leading to inefficient graph generation.
Innovation Solution
An information processing apparatus that acquires first graph information and condition information to determine and delete shortcut edges based on specific determination conditions, generating a second graph with optimized edge deletion to maintain graph structure integrity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If shortcut edges are deleted from the graph, then the number of edges is reduced and search efficiency is improved, but the graph structure integrity may be compromised and excessive deletion occurs
Solution Approach 1:
The patent applies parameter changes by introducing specific determination conditions (Equations 1-3) that evaluate multiple parameters including node degrees, edge weights, and path lengths before deleting shortcut edges. This ensures that only edges meeting specific parameter thresholds are removed, maintaining graph integrity while improving search efficiency.
Solution Approach 2:
The patent implements feedback mechanisms by continuously evaluating whether deletion conditions are satisfied before removing edges. The determination conditions act as feedback loops that prevent excessive deletion by checking if the graph structure still maintains necessary connectivity and performance characteristics after each potential edge removal.
2Speed
If conventional shortcut edge deletion is performed, then processing speed is improved, but determination conditions are insufficient and excessive edges are deleted
Solution Approach 1:
The patent segments the edge deletion process into distinct evaluation stages by separating the determination of deletion conditions into specific equations. Each equation evaluates different aspects (node degrees, path lengths, edge weights) independently, allowing for precise control over which edges are deleted while maintaining processing efficiency.
Solution Approach 2:
The patent introduces multiple parameters for evaluating edge deletion candidates including node degrees (deg(u), deg(v)), path lengths (d(u,w), d(w,v)), and edge weights (w(u,v)). By changing from simple deletion criteria to multi-parameter evaluation, the system achieves both speed and precision in edge deletion.
3Productivity
If the number of edges is reduced, then search performance is improved, but the graph may lose important connectivity information
Solution Approach 1:
The patent uses feedback through determination conditions that check whether alternative paths exist before deleting edges. The conditions evaluate connectivity metrics to ensure that removing an edge does not lose critical connectivity information, maintaining search performance while preserving graph structure.
Solution Approach 2:
The patent performs preliminary evaluation of edge deletion candidates using determination conditions before actual deletion. This preliminary action assesses whether removing an edge would lose important connectivity information by checking for alternative paths and evaluating graph structure impact in advance.
Data Source
AI summary
An information processing apparatus according to the present application includes an acquisition unit that acquires first graph information indicating a first graph in which a plurality of nodes corresponding to each of a plurality of objects to be searched are connected by edges and condition information indicating a determination condition of a shortcut edge to be deleted in a graph, and a generation unit that generates second information indicating a second graph in which the edge satisfies the determination condition of the shortcut edge is deleted as the shortcut edge from the first graph.