Salesforce, Inc.

Rohith Ramprasad

Alexis Roos

Noah William Burbank

Praveen Innamuri

Shardul Vikram

Gabriel Starr Krupa

Scott Walter Bishel

Alex Michael Noe

William Christopher Fama Roller

Joseph Gerald Keller

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.

Calculating relationship strength using an activity-based distributed graph

Growing community of inventors

San Francisco, CA, United States of America

Rohith Ramprasad