Distance-Based Quality Score for Geospatial-Temporal Semantic Graphs
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current computer systems are inadequate for efficiently identifying objects of interest in geospatial-temporal semantic graphs due to the challenge of distinguishing between numerous matches, where it is difficult to determine which matches are most similar to a given search template.
Innovation Solution
A distance-based quality score method is implemented, where a processor specifies a subgraph search template with nodes and edges, defines allowable and preferred ranges for attributes, and computes quality scores for each match based on attribute distances, allowing for the sorting of matches by their similarity to the template.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If a computer searches for objects of interest in geospatial-temporal semantic graphs using traditional methods, then it can find matches, but it cannot effectively distinguish which matches are most similar to the search template
Solution Approach 1:
The patent introduces quality score parameters (required quality score and optional quality score) to transform the match identification process. By calculating distance-based quality scores for each match and sorting them in descending order, the system enables computers to objectively identify the most similar matches without human intervention, resolving the contradiction between measurement precision and ease of operation
Solution Approach 2:
The patent introduces an intermediary quality score calculation mechanism that bridges the gap between raw match data and meaningful similarity assessment. The quality score acts as a mediator that quantifies the similarity between matches and search templates, allowing computers to automatically rank and identify the most relevant objects without requiring human judgment
2Productivity
If the system returns all matches without ranking, then completeness is maintained, but the workload increases and usability decreases
Solution Approach 1:
The patent extracts the most relevant matches from the complete set by sorting them according to quality scores. Instead of presenting all matches equally, the system extracts and prioritizes the top-ranked matches that most closely resemble the search template, thereby reducing the quantity of matches users need to review while maintaining processing completeness
Solution Approach 2:
The patent applies local quality assessment by differentiating between required nodes and optional nodes in the search template. By calculating separate quality scores for required and optional node matches and combining them with appropriate weighting, the system provides a nuanced ranking that reflects the varying importance of different match components, improving productivity without sacrificing review quality
Data Source
AI summary
A computer-implemented method of improving processing of overhead image data by a processor using a distance-based quality score in a geospatial-temporal semantic graph. An allowable range for each attribute in the subgraph search template is defined. For each match in a comparison, attribute values of each match element are compared against the preferred range and the allowable range to compute a corresponding distance of each match attribute from the subgraph search template. A corresponding overall match quality score is determined for each match from the subgraph search template, wherein determining the corresponding overall match qualities is performed using a corresponding required quality score and a corresponding optional quality score. All corresponding overall match quality scores are sorted into an ordered list and then displayed.