Contact Identification Service Using Graph Subsets
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current cloud-based systems lack the ability to automatically detect mentioned names in communication messages and retrieve associated contact information, due to inadequate robust contact libraries and unreliable identity determination, especially when dealing with similar names.
Innovation Solution
A contact extraction and identification service that utilizes a robust connection graph based on user interactions, performs natural language processing, and applies name identification heuristics to extract and identify mentioned names, scoring and filtering contacts for accurate display.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If a robust contact library is built to improve contact identification accuracy, then contact identification accuracy is improved, but system complexity and data processing requirements increase
Solution Approach 1:
The patent segments the contact identification process into distinct modules: name extraction from messages, graph-based relationship analysis, contact library matching, and result ranking. This modular approach improves identification accuracy while managing system complexity through organized, independent components that can be developed and maintained separately.
Solution Approach 2:
The patent introduces a graph-based relationship model as an intermediary between the contact library and message analysis. This graph structure mediates the matching process by representing relationships between contacts, enabling more accurate identification without directly increasing the complexity of the contact library itself.
2Reliability
If comprehensive contact analysis is performed to improve identification reliability, then identification reliability is improved, but processing time increases
Solution Approach 1:
The patent applies local quality by analyzing only the relevant portions of the contact graph related to the specific message and participants involved. Instead of performing comprehensive analysis on the entire contact library, the system focuses computational resources on localized graph subsets, improving reliability for the specific query while reducing overall processing time.
Solution Approach 2:
The patent implements partial action by performing contact identification only when names are explicitly mentioned in messages, rather than continuously analyzing all communications. The system selectively applies analysis based on message content and context, achieving reliable identification where needed while minimizing unnecessary processing.
3Measurement precision
If the entire contact graph is analyzed to ensure complete contact identification, then contact identification completeness is improved, but processing overhead increases
Solution Approach 1:
The patent segments the large contact graph into manageable subsets based on message context, participant relationships, and interaction history. This segmentation enables the system to analyze only relevant portions of the graph for each query, ensuring complete identification of mentioned contacts while avoiding the processing overhead of analyzing the entire graph.
Solution Approach 2:
The patent performs preliminary actions by pre-processing and indexing contact relationships in the graph structure before queries are made. Relationship patterns, interaction frequencies, and contact hierarchies are established in advance, enabling efficient querying that ensures completeness without requiring full graph analysis for each message.
Data Source
AI summary
A database server may identify mentioned names in a body of a message and extract the names using name identification heuristics and algorithms. The service retrieves or utilizes a distributed connection graph to identify contacts associated with the parties to the conversation that may match or be similar to the mentioned name. Contacts may be scored based on similarities between the extracted name the names associated with nodes of the graph, as well as other factors. The highest scoring contact may be surfaced or displayed to one or more of the parties to the communication message.