-
公开(公告)号:US20190138653A1
公开(公告)日:2019-05-09
申请号:US15803412
申请日:2017-11-03
Applicant: salesforce.com, inc.
Inventor: William Christopher Fama Roller , Shardul Vikram , Alex Michael Noe , Noah William Burbank , Alexis Roos , Rohith Ramprasad , Joseph Gerald Keller , Gabriel Starr Krupa , Scott Walter Bishel , Praveen Innamuri
Abstract: Methods, systems, and devices for analyzing communication messages (e.g., emails or activities) to determine relationship strength using a distributed graph are described. In some systems, a user may be associated with a specific tenant. A database server of the system may receive communication messages associated with the user and a target user. The server may perform a natural language processing (NLP) analysis on the communication messages to extract metadata, and may generate or update a distributed graph indicating connections between users based on the extracted metadata. Using the connections of the graph, the server may calculate a closeness score between the user and the target user. Additionally, the server may calculate closeness scores between the target and other users associated with the tenant, and may determine the users with the greatest closeness scores. The server may send a suggestion for the determined users to initiate communication with the target.
-
公开(公告)号:US10992612B2
公开(公告)日:2021-04-27
申请号:US16262508
申请日:2019-01-30
Applicant: salesforce.com, inc.
Inventor: Noah William Burbank , Gabriel Starr Krupa , Bradford William Powley , Alexis Roos
IPC: H04L12/58 , H04L15/16 , G06F15/16 , G06F40/205
Abstract: 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.
-
公开(公告)号:US20200153765A1
公开(公告)日:2020-05-14
申请号:US16262508
申请日:2019-01-30
Applicant: salesforce.com, inc.
Inventor: Noah William Burbank , Gabriel Starr Krupa , Bradford William Powley , Alexis Roos
Abstract: 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.
-
公开(公告)号:US10897520B2
公开(公告)日:2021-01-19
申请号:US16262488
申请日:2019-01-30
Applicant: salesforce.com, inc.
Inventor: Noah William Burbank , Gabriel Starr Krupa , Bradford William Powley , Alexis Roos
IPC: G06F16/00 , H04L29/08 , G06F16/901 , G06Q30/00
Abstract: A database server may analyze interaction data including communication to generate a graph representation of various users and connections between the users. The database server may utilize the graph representation of connections to identify sufficiently connected target user identifiers in one or more external organizations. A connection metric may be assigned to each user identifier of one or more groups of user identifiers generated using the graph representation, and the target user identifiers may be identified based on the connection metrics.
-
公开(公告)号:US20200153934A1
公开(公告)日:2020-05-14
申请号:US16262488
申请日:2019-01-30
Applicant: Salesforce.com, Inc.
Inventor: Noah William Burbank , Gabriel Starr Krupa , Bradford William Powley , Alexis Roos
IPC: H04L29/08 , G06F16/901
Abstract: A database server may analyze interaction data including communication to generate a graph representation of various users and connections between the users. The database server may utilize the graph representation of connections to identify sufficiently connected target user identifiers in one or more external organizations. A connection metric may be assigned to each user identifier of one or more groups of user identifiers generated using the graph representation, and the target user identifiers may be identified based on the connection metrics.
-
-
-
-