Systems and methods for maintaining an electronic activity derived member node network

Patent metadata

Field	Value
Publication number	US-2021117455-A1
Application number	US-202017113843-A
Country	US
Kind code	A1
Filing date	Dec 7, 2020
Priority date	May 24, 2018
Publication date	Apr 22, 2021
Grant date	—

Abstract

The present disclosure relates to maintaining an electronic activity derived member node network. Exemplary implementations may: generate a plurality of node profiles; generate a node graph generated from the plurality of node profiles; identify a second electronic activity identifying a pair of electronic accounts; identify using the node graph, a pair of participant node profiles corresponding to the pair of electronic accounts identified by the second electronic activity; identify, using the node graph, an edge between a pair of nodes corresponding to the pair of participant node profiles; determine a relevancy score for the second electronic activity corresponding to the pair of the participant node profiles based on context of the second electronic activity; and update the node graph by modifying the connection corresponding to the edge between the pair of participant node profiles based on the relevancy score determined for the second electronic activity.

First claim

What is claimed is:

1 . A system, comprising:
one or more processors coupled with memory, configured to:
generate a plurality of node profiles, each node profile including one or more field-value pairs, each value of the one or more field-value pairs extracted from at least one electronic activity of a plurality of first electronic activities;
generate a node graph generated from the plurality of node profiles, the node graph including a plurality of nodes and a plurality of edges connecting pairs of nodes in the plurality of nodes, each node corresponding to a respective node profile of the plurality of node profiles, each edge identifying a corresponding connection between a respective pair of nodes identified by the plurality of first electronic activities;
identify a second electronic activity identifying a pair of electronic accounts;
identify using the node graph, a pair of participant node profiles corresponding to the pair of electronic accounts identified by the second electronic activity;
identify using the node graph, an edge between a pair of nodes corresponding to the pair of participant node profiles, the edge corresponding to a connection between the pair of participant node profiles;
determine a relevancy score for the second electronic activity corresponding to the pair of the participant node profiles based on context of the second electronic activity; and
update the node graph by modifying the connection corresponding to the edge between the pair of participant node profiles based on the relevancy score determined for the second electronic activity.

2 . The system of claim 1 , wherein the one or more processors are further configured to:
determine, from the second electronic activity, a first header field identifying a first electronic account of the pair of electronic accounts; determine, from the second electronic activity, a second header field identifying a first electronic account of the pair of electronic accounts; determine the connection between the electronic accounts based on the first header field and the second header field.

3 . The system of claim 1 , wherein the one or more processors are configured to:
compare a field-value pair of a first participant node profile of the pair with a corresponding field-value pair of a second participant node profile of the pair; determine a connection strength or type based on the comparison between the field-value pair of the first participant node profile and the corresponding field-value pair of the second participant node profile; and modify the connection corresponding to the edge between the first participant node profile and the second participant node profile based on the connection strength or type.

4 . The system of claim 1 , wherein the one or more processors are configured to:
identify a timestamp at which the second electronic activity is transmitted or received via the electronic accounts; and update the node graph by modifying the connection based on the timestamp at which the second electronic activity is transmitted or received.

5 . The system of claim 1 , wherein the one or more processors are configured to:
identify an electronic activity type of the second electronic activity; and update the node graph by modifying the connection based on the electronic activity type of the second electronic activity.

6 . The system of claim 1 , wherein the one or more processors are configured to:
identify a tag assigned to the second electronic activity; and update the node graph by modifying the connection based on the tag assigned to the second electronic activity.

7 . The system of claim 1 , wherein the one or more processors are further configured to:
identify a third electronic activity transmitted or received via the electronic accounts; determine that none of the plurality of node profiles in the node graph corresponds to a first electronic account of the electronic accounts via which the third electronic activity is transmitted or received; generate, by the one or more processors responsive to the determination, a new node profile using the third electronic activity corresponding to an entity identified by the first electronic account; insert the new node profile into the plurality of node profiles of the node graph.

8 . The system of claim 7 , wherein the one or more hardware processors are further configured to:
identify a participant node profile corresponding to a second electronic account of the electronic accounts via which the third electronic activity is transmitted or received; establish a new edge between the new node profile and the participant node profile in the node graph, the new edge identifying a new connection between the new node profile and the participant node profile.

9 . The system of claim 1 , wherein the pair of participant nodes include a first node profile and a second node profile;
wherein the one or more hardware processors are further configured to detect a change in a third node profile not identified in the second electronic activity and to update the node graph based on the change in the at third node profile of the plurality of node profiles.

10 . The system of claim 1 , wherein the one or more processors are further configured to:
determine the relevancy score in accordance to a time decaying function; and determine a connection strength of the connection based the relevancy score of the second electronic activity.

11 . A method, comprising:
generating, by one or more processors, a plurality of node profiles, each node profile including one or more field-value pairs, each value of the one or more field-value pairs extracted from at least one electronic activity of a plurality of first electronic activities; generating, by one or more processors, a node graph generated from the plurality of node profiles, the node graph including a plurality of nodes and a plurality of edges connecting pairs of nodes in the plurality of nodes, each node corresponding to a respective node profile of the plurality of node profiles, each edge identifying a corresponding connection between a respective pair of nodes identified by the plurality of first electronic activities; identifying, by the one or more processors, a second electronic activity identifying a pair of electronic accounts; identifying, by the one or more processors, using the node graph, a pair of participant node profiles corresponding to the pair of electronic accounts identified by the second electronic activity; identifying, by the one or more processors, using the node graph, an edge between a pair of nodes corresponding to the pair of participant node profiles, the edge corresponding to a connection between the pair of participant node profiles; determining, by the one or more processors, a relevancy score for the second electronic activity corresponding to the pair of the participant node profiles based on context of the second electronic activity; and updating, by the one or more processors, the node graph by modifying the connection corresponding to the edge between the pair of participant node profiles based on the relevancy score determined for the second electronic activity.

12 . The method of claim 11 , further comprising:
determining, by the one or more processors, from the second electronic activity, a first header field identifying a first electronic account of the pair of electronic accounts; determining, by the one or more processors, from the second electronic activity, a second header field identifying a first electronic account of the pair of electronic accounts; determining, by the one or more processors, the connectio

Assignees

• People Ai Inc

Inventors

• Rogynskyy Oleg
• Brunets Yurii
• Rice Devin

Classifications

• G06N3/08

  Learning methods · CPC title

• G06N3/09

  Supervised learning · CPC title

• G06F16/2358

  Change logging, detection, and notification (replication G06F16/27) · CPC title

• G06F9/542

  Event management; Broadcasting; Multicasting; Notifications · CPC title

• G06Q10/1093

  Calendar-based scheduling for persons or groups · CPC title