Path Traversal Functions for Multi-Hop Entity Matching
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional searching algorithms fail to determine relevant matching entities when there are a significant number of intermediary links and entities between the entity of interest and the matching entity, and they lack the capability to illustrate the path traversal from the entity of interest to the matching entity in a user-friendly manner.
Innovation Solution
The system and method involve defining and executing functions to determine a matching entity relevant to a seed entity, even with numerous intermediary links and entities, by using a combination of built-in and custom functions, and providing a visual depiction of the traversal path to the end user, allowing for the construction of repeatable workflows and alerts with metadata.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If conventional searching algorithms are used to identify entities of interest, then the search process is simple, but the ability to determine connections between entities and effectively use such connections to determine search results deteriorates when there are significant intermediary links and entities
Solution Approach 1:
The patent segments the search process into distinct functional components: path traversal functions that navigate through intermediary entities, connection analysis functions that evaluate relationships, and result generation functions that produce search outcomes. This segmentation allows each component to specialize in handling specific aspects of multi-hop entity connections, thereby maintaining reliability even when intermediary links are numerous and complex.
Solution Approach 2:
The patent introduces intermediary functions and data structures that mediate between the seed entity and the target entity through multiple hops. These intermediary components include path traversal functions that systematically explore intermediate entities, connection metadata that tracks relationships, and workflow orchestrators that coordinate multi-step searches. This intermediary layer enables reliable connection determination across complex entity graphs without requiring the entire path to be processed simultaneously.
2Measurement precision
If path traversal through multiple intermediary entities is performed to determine matching entities, then the accuracy of matching entity determination is improved, but the complexity of illustrating and conveying the traversal path to users increases
Solution Approach 1:
The patent extracts the complex path traversal logic and visualization requirements into separate, independent components. The path traversal functions focus solely on accurately determining matching entities through multiple intermediary hops, while the visualization functions handle the presentation of results to users. This extraction allows the matching determination to achieve high accuracy through comprehensive path exploration without burdening the user interface with unnecessary complexity.
Solution Approach 2:
Instead of presenting the complete complex traversal path to users, the patent inverts the approach by presenting simplified match results first, then optionally providing path details on demand. The system prioritizes delivering accurate matching entity determinations without automatically overwhelming users with the full complexity of intermediary paths, allowing users to drill down into path details only when relevant to their specific needs.
3Ease of operation
If conventional searching techniques are used, then the system operation is simple, but the capability to determine relevant matching entities regardless of intermediary complexity deteriorates
Solution Approach 1:
The patent creates universal path traversal functions and workflow templates that can be applied across diverse search scenarios regardless of the number or type of intermediary entities. These multi-functional components handle everything from direct entity matches to complex multi-hop relationships using the same underlying framework. This universality allows the system to maintain operational simplicity through standardized functions while simultaneously achieving high adaptability to determine matching entities across varying levels of intermediary complexity.
Data Source
AI summary
Described herein are systems, methods, and non-transitory computer readable media for defining and executing functions for determining a matching entity that is relevant to an entity of interest when, for example, there is a significant number of intermediary links and entities between the matching entity and the entity of interest. A visual depiction of a path traversal from a seed input entity to an output matched entity can be presented to an end user in a manner that allows the end user to ascertain the sequence of intermediary links and entities that connect the matched entity to the seed entity.