Manufacturing Process Graph Search With Structure and Table Comparison
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing graph analysis methods in manufacturing processes fail to accurately consider table information associated with graphs, leading to unreliable search results for complex manufacturing processes.
Innovation Solution
A graph search device and method that includes a processor, memory, and storage unit, utilizing a query data management unit, structure comparison unit, content comparison unit, and results management unit to calculate structural and content similarities between query and existing process graphs and tables, providing a comprehensive evaluation criterion for high-accuracy search results.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If graph analysis methods only consider graph structure (connectivity and topology), then the analysis is simple and fast, but the search accuracy for complex manufacturing processes is insufficient
Solution Approach 1:
The patent combines graph structure analysis with table information analysis into a unified graph similarity evaluation system. The structure comparison unit analyzes graph connectivity and topology, while the content comparison unit analyzes table information, and both are integrated to compute comprehensive graph similarity, resolving the contradiction between simplicity and accuracy.
Solution Approach 2:
The patent segments the graph similarity evaluation into two independent modules: structure comparison (graph connectivity and topology) and content comparison (table information). This segmentation allows each module to specialize in specific aspects while maintaining overall system manageability and accuracy.
2Loss of information
If graph analysis considers only connectivity between nodes, then the analysis is computationally efficient, but it cannot capture semantic information of manufacturing processes
Solution Approach 1:
The patent implements a two-stage search process: first performs rapid structure-based filtering to identify candidate graphs, then applies more time-consuming content-based comparison only to these candidates. This partial application of comprehensive analysis reduces overall computation time while still capturing semantic information.
3Reliability
If comprehensive graph and table information is analyzed, then search accuracy improves, but the computational complexity and processing time increase
Solution Approach 1:
The patent applies comprehensive analysis (both structure and content comparison) only to candidate graphs that pass initial structure-based filtering. This partial comprehensive action maintains high reliability for final results while improving overall search efficiency by avoiding exhaustive comparison of all graphs.
Solution Approach 2:
The patent performs preliminary structure comparison to identify candidate graphs before conducting the more computationally intensive content comparison. This preliminary filtering action reduces the number of graphs requiring full analysis, thereby improving productivity while maintaining reliability.
Data Source
AI summary
A graph search device includes: an existing information database storing existing information that includes a set of existing process graphs and a set of existing process tables; a query data management unit that acquires query data that includes a query graph and a query table; a structure comparison unit that determines, as a first search candidate, an existing process graph satisfying a predetermined structural similarity threshold value with respect to the query graph from among the set of existing process graphs; a content comparison unit that determines, as a second search candidate, an existing process graph associated with an existing process table satisfying a predetermined content similarity threshold value for the query table, from among the set of existing process tables; and a results management unit that determines search results data for the query data among the first search candidate and the second search candidate.