Systems and methods for classifying electronic activities based on sender and recipient information

• US 10,505,888 B1
• Filed: 03/21/2019
• Issued: 12/10/2019
• Est. Priority Date: 05/24/2018
• Status: Active Grant

• Current Assignee: People.ai, Inc.
• Original Assignee: People.ai, Inc.
• Inventors: Joseph, Rajit, Hermanek, Stefan, Muniz Navarro, Jose Alberto, Halladay, Dylan, Kozlov, Heorhiy, Rogynskyy, Oleg
• Primary Examiner(s): Recek, Jason D
• Application Number:
  US16/360,933
• Publication Number:
  US 20190364009A1
• Time in Patent Office: 264 Days
• CPC Class Codes: G06F 11/3024 where the computing system component is a central processing unit [CPU]
• CPC Class Codes: G06F 11/3452 Performance evaluation by statistical analysis
• CPC Class Codes: G06F 11/3495 for systems
• CPC Class Codes: G06F 16/122 using management policies backup systems G06F11/1446; file migration policies for HSM systems G06F16/185
• CPC Class Codes: G06F 16/1734 Details of monitoring file system events, e.g. by the use of hooks, filter drivers, logs
• CPC Class Codes: G06F 16/178 Techniques for file synchronisation in file systems
• CPC Class Codes: G06F 16/182 Distributed file systems
• CPC Class Codes: G06F 16/212 with details for data modelling support
• CPC Class Codes: G06F 16/215 Improving data quality; Data cleansing, e.g. de-duplication, removing invalid entries or correcting typographical errors
• CPC Class Codes: G06F 16/219 Managing data history or versioning querying versioned data G06F16/2474; querying temporal data G06F16/2477
• CPC Class Codes: G06F 16/22 Indexing; Data structures therefor; Storage structures
• CPC Class Codes: G06F 16/221 Column-oriented storage; Management thereof
• CPC Class Codes: G06F 16/2228 Indexing structures
• CPC Class Codes: G06F 16/2264 Multidimensional index structures
• CPC Class Codes: G06F 16/2272 Management thereof
• CPC Class Codes: G06F 16/23 Updating
• CPC Class Codes: G06F 16/235 Update request formulation
• CPC Class Codes: G06F 16/2358 Change logging, detection, and notification replication G06F16/27
• CPC Class Codes: G06F 16/2365 Ensuring data consistency and integrity
• CPC Class Codes: G06F 16/2379 Updates performed during online database operations; commit processing
• CPC Class Codes: G06F 16/2386 : Bulk updating operations data conversion details G06F16/258
• CPC Class Codes: G06F 16/245 : Query processing
• CPC Class Codes: G06F 16/24558 : Binary matching operations
• CPC Class Codes: G06F 16/24564 : Applying rules; Deductive queries
• CPC Class Codes: G06F 16/2457 : with adaptation to user needs
• CPC Class Codes: G06F 16/24575 : using context
• CPC Class Codes: G06F 16/24578 : using ranking
• CPC Class Codes: G06F 16/2477 : Temporal data queries
• CPC Class Codes: G06F 16/254 : Extract, transform and load [ETL] procedures, e.g. ETL data flows in data warehouses
• CPC Class Codes: G06F 16/256 : in federated or virtual databases
• CPC Class Codes: G06F 16/26 : Visual data mining; Browsing structured data
• CPC Class Codes: G06F 16/27 : Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
• CPC Class Codes: G06F 16/273 : Asynchronous replication or reconciliation
• CPC Class Codes: G06F 16/28 : Databases characterised by their database models, e.g. relational or object models
• CPC Class Codes: G06F 16/285 : Clustering or classification
• CPC Class Codes: G06F 16/288 : Entity relationship models
• CPC Class Codes: G06F 16/289 : Object oriented databases
• CPC Class Codes: G06F 16/29 : Geographical information databases
• CPC Class Codes: G06F 16/313 : Selection or weighting of terms for indexing
• CPC Class Codes: G06F 16/337 : Profile generation, learning or modification
• CPC Class Codes: G06F 16/355 : Class or cluster creation or modification
• CPC Class Codes: G06F 16/901 : Indexing; Data structures therefor; Storage structures for retrieval from the web G06F16/951
• CPC Class Codes: G06F 16/9024 : Graphs; Linked lists G06F16/9027 takes precedence
• CPC Class Codes: G06F 16/90344 : by using string matching techniques
• CPC Class Codes: G06F 16/9035 : Filtering based on additional data, e.g. user or group profiles
• CPC Class Codes: G06F 16/906 : Clustering; Classification
• CPC Class Codes: G06F 16/93 : Document management systems
• CPC Class Codes: G06F 16/9535 : Search customisation based on user profiles and personalisation
• CPC Class Codes: G06F 21/6218 : to a system of files or objects, e.g. local or distributed file system or database
• CPC Class Codes: G06F 21/6245 : Protecting personal data, e.g. for financial or medical purposes
• CPC Class Codes: G06F 40/20 : Natural language analysis semantic analysis of natural language G06F40/30
• CPC Class Codes: G06F 40/205 : Parsing
• CPC Class Codes: G06F 40/237 : Lexical tools
• CPC Class Codes: G06F 40/295 : Named entity recognition
• CPC Class Codes: G06F 40/30 : Semantic analysis
• CPC Class Codes: G06F 7/14 : Merging, i.e. combining at least two sets of record carriers each arranged in the same ordered sequence to produce a single set having the same ordered sequence
• CPC Class Codes: G06F 9/542 : Event management; Broadcasting; Multicasting; Notifications
• CPC Class Codes: G06N 20/00 : Machine learning
• CPC Class Codes: G06N 3/08 : Learning methods
• CPC Class Codes: G06N 5/022 : Knowledge engineering; Knowledge acquisition
• CPC Class Codes: G06N 5/025 : Extracting rules from data
• CPC Class Codes: G06N 5/04 : Inference or reasoning models
• CPC Class Codes: G06N 7/02 : using fuzzy logic computing arrangements based on biological models G06N3/00; computing arrangements using knowledge-based models G06N5/00
• CPC Class Codes: G06Q 10/04 : Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem" market predictions or forecasting for commercial activities G06Q30/0202
• CPC Class Codes: G06Q 10/063114 : Status monitoring or status determination for a person or group
• CPC Class Codes: G06Q 10/06312 : Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
• CPC Class Codes: G06Q 10/06315 : Needs-based resource requirements planning or analysis
• CPC Class Codes: G06Q 10/06393 : Score-carding, benchmarking or key performance indicator [KPI] analysis
• CPC Class Codes: G06Q 10/06398 : Performance of employee with respect to a job function
• CPC Class Codes: G06Q 10/10 : Office automation; Time management
• CPC Class Codes: G06Q 10/107 : Computer-aided management of electronic mailing [e-mailing]
• CPC Class Codes: G06Q 10/109 : Time management, e.g. calendars, reminders, meetings or time accounting
• CPC Class Codes: G06Q 10/1091 : Recording time for administrative or management purposes
• CPC Class Codes: G06Q 10/1095 : Meeting or appointment
• CPC Class Codes: G06Q 30/0201 : Market modelling; Market analysis; Collecting market data
• CPC Class Codes: G06Q 50/01 : Social networking
• CPC Class Codes: G06Q 50/22 : Social work or social welfare, e.g. community support activities or counselling services
• CPC Class Codes: G16H 15/00 : ICT specially adapted for medical reports, e.g. generation or transmission thereof
• CPC Class Codes: G16H 50/20 : for computer-aided diagnosis, e.g. based on medical expert systems
• CPC Class Codes: G16H 50/30 : for calculating health indices; for individual health risk assessment
• CPC Class Codes: H04L 12/14 : Charging , metering or billing arrangements for data wireline or wireless communications
• CPC Class Codes: H04L 12/1407 : Policy-and-charging control [PCC] architecture
• CPC Class Codes: H04L 12/1831 : Tracking arrangements for later retrieval, e.g. recording contents, participants activities or behavior, network status
• CPC Class Codes: H04L 2101/00 : Indexing scheme associated with group H04L61/00
• CPC Class Codes: H04L 2101/35 : containing special prefixes
• CPC Class Codes: H04L 2101/37 : E-mail addresses
• CPC Class Codes: H04L 41/082 : the condition being updates or upgrades of network functionality
• CPC Class Codes: H04L 41/14 : Network analysis or design
• CPC Class Codes: H04L 43/026 : using flow identification
• CPC Class Codes: H04L 43/045 : for graphical visualisation of monitoring data
• CPC Class Codes: H04L 43/062 : related to network traffic
• CPC Class Codes: H04L 43/065 : related to network devices
• CPC Class Codes: H04L 43/067 : using time frame reporting
• CPC Class Codes: H04L 43/08 : Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
• CPC Class Codes: H04L 43/0876 : Network utilisation, e.g. volume of load or congestion level
• CPC Class Codes: H04L 43/14 : using software, i.e. software packages network security related monitoring H04L63/1408
• CPC Class Codes: H04L 51/046 : Interoperability with other network applications or services
• CPC Class Codes: H04L 51/212 : using filtering or selective blocking
• CPC Class Codes: H04L 51/234 : for tracking messages
• CPC Class Codes: H04L 51/42 : Mailbox-related aspects, e.g. synchronisation of mailboxes
• CPC Class Codes: H04L 61/45 : Network directories; Name-to-address mapping
• CPC Class Codes: H04L 61/4594 : Address books, i.e. directories containing contact information about correspondents telephone directories in user terminals H04M1/27453
• CPC Class Codes: H04L 67/125 : involving control of end-device applications over a network
• CPC Class Codes: H04L 67/30 : Profiles
• CPC Class Codes: H04L 67/303 : Terminal profiles
• CPC Class Codes: H04L 67/306 : User profiles
• CPC Class Codes: H04L 67/535 : Tracking the activity of the user network monitoring arrangements H04L43/00; recording of computer activity G06F11/34
• CPC Class Codes: H04M 15/00 : Arrangements for metering, time-control or time indication ; Metering, charging or billing arrangements for voice wireline or wireless communications, e.g. VoIP
• CPC Class Codes: H04M 15/41 : Billing record details, i.e. parameters, identifiers, structure of call data record [CDR]
• CPC Class Codes: H04M 15/50 : for cross-charging network operators
• CPC Class Codes: H04M 15/58 : based on statistics of usage or network monitoring
• CPC Class Codes: H04M 15/60 : based on actual use of network resources
• CPC Class Codes: H04M 15/66 : Policy and charging system
• CPC Class Codes: H04M 15/755 : Account identification
• CPC Class Codes: H04M 2203/556 : Statistical analysis and interpretation
• CPC Class Codes: H04M 3/2218 : Call detail recording
• CPC Class Codes: H04M 3/436 : Arrangements for screening incoming calls , i.e. evaluating the characteristics of a call before deciding whether to answer it based on the calling party profile H04M3/42059; based on location H04M3/42348; based on presence H04M3/42365; diversion H04M3/54
• CPC Class Codes: H04M 3/5175 : Call or contact centers supervision arrangements
• CPC Class Codes: H04M 3/56 : Arrangements for connecting several subscribers to a common circuit, i.e. affording conference facilities video conference systems H04N7/15
• CPC Class Codes: H04W 4/24 : Accounting or billing

Abstract

The system and methods described herein can classify electronic activities based on sender and recipient information. The system can determine a relationship between a sender of an electronic activity and at least one recipient of the electronic activity using a sender node profile and a recipient node profile. The system can assign a tag to the electronic activity based on the relationship between the sender and one or more recipients of the electronic activity. The system can process the electronic activity based on the assigned tag.

Claims

1. A method comprising:

maintaining, by one or more processors, a plurality of node profiles corresponding to a plurality of unique entities, each node profile including a plurality of fields, each field of the plurality of fields including one or more values;

accessing, by the one or more processors, a plurality of electronic activities transmitted or received via electronic accounts associated with one or more data source providers, the one or more processors configured to update the plurality of node profiles using the plurality of electronic activities;

identifying, by the one or more processors, an electronic activity of the plurality of electronic activities to process;

determining, by the one or more processors, a relationship between a sender of the electronic activity and at least one recipient of one or more recipients of the electronic activity using the node profiles of the sender and the at least one recipient included in the plurality of node profiles;

assigning, by the one or more processors, a first tag to the electronic activity based on the relationship between the sender and the one or more recipients;

processing, by the one or more processors, the electronic activity based on the assigned first tag;

parsing, by the one or more processors, the electronic activity to determine whether to match the electronic activity to one or more record objects of a system of record corresponding to the data source provider; and

storing, by the one or more processors, in one or more data structures, an association between the electronic activity and a second tag, the second tag

i) indicating to match the electronic activity responsive to determining to match the electronic activity to at least one record object of the one or more record objects;

or

ii) generated, responsive to matching the electronic activity to the at least one record object, based on information associated with the at least one record object.

2. The method of claim 1, further comprising:

identifying, by the one or more processors, a data source provider of the electronic activity;

identifying, by the one or more processors, a system of record of the data source provider; and

selecting, by the one or more processors, one or more candidate record objects of the system of record with which to match the electronic activity based on the first tag assigned to the electronic activity.

3. The method of claim 1, further comprising assigning, by the one or more processors, a third tag based on one of i) information included in a first node profile of the sender of the electronic activity or a second node profile of the at least one recipient, or ii) information included in a signature block of the sender or the recipient.

4. The method of claim 3, wherein the information included in the first node profile of the sender of the electronic activity or the second node profile of the at least one recipient includes a value of a field corresponding to a title of the sender or the at least one recipient.

5. The method of claim 1, further comprising:

determining, by the one or more processors, that a system of record of the data source provider of the electronic activity identifies a first record object corresponding to a first entity;

determining, by the one or more processors, that one or more recipients of the electronic activity correspond to the first entity; and

assigning, by the one or more processors, a third tag to the electronic activity responsive to determining that the sender or one or more recipients of the electronic activity correspond to the first entity associated with the first record object, the third tag indicating that the electronic activity is a candidate for matching to a record object of the system of record.

6. The method of claim 1, further comprising:

determining, by the one or more processors, that the sender of the electronic activity belongs to an entity corresponding to the data source provider;

predicting, by the one or more processors, an amount of time the sender spent to draft the electronic activity based on a number of characters included in the electronic activity; and

assigning, by the one or more processors, a third tag to the electronic activity based on the predicted amount of time.

7. The method of claim 6, wherein predicting, by the one or more processors, an amount of time the sender spent to draft contents of the electronic activity is further based on a relationship between the sender and the one or more recipients of the electronic activity.

8. The method of claim 6, further comprising determining, by the one or more processors, that the electronic activity is not to be classified as a blast electronic activity responsive to determining that no other previous or subsequent electronic activities sent by the sender within a predetermined time window satisfy a match condition with the electronic activity.

9. The method of claim 6, wherein predicting, by the one or more processors, an amount of time the sender spent to draft contents of the electronic activity is further based on a language complexity algorithm.

10. The method of claim 1, further comprising:

assigning, by the one or more processors, a confidence score of the first tag based on the data included in the electronic activity;

identifying, by the one or more processors, a second electronic activity to process, the second electronic activity determined to be linked to the first node profile and the second node profile, the second electronic activity transmitted subsequent to the first electronic activity;

parsing, by the one or more processors, the contents of the second electronic activity; and

updating, by the one or more processors, the confidence score of the first tag assigned to the first electronic activity responsive to parsing the contents of the second electronic activity.

11. A system configured for managing an electronic activity, the system comprising:

one or more hardware processors configured by machine-readable instructions to;

maintain a plurality of node profiles corresponding to a plurality of unique entities, each node profile including a plurality of fields, each field of the plurality of fields including one or more values;

access a plurality of electronic activities transmitted or received via electronic accounts associated with one or more data source providers, the one or more processors configured to update the plurality of node profiles using the plurality of electronic activities;

identify an electronic activity of the plurality of electronic activities to process;

determine a relationship between a sender of the electronic activity and at least one recipient of the one or more recipients of the electronic activity using the node profiles of the sender and the at least one recipient included in the plurality of node profiles;

assign a first tag to the electronic activity based on the relationship between the sender and the one or more recipients;

process the electronic activity based on the assigned first tag;

parse the electronic activity to determine whether to match the electronic activity to one or more record objects of a system of record corresponding to the data source provider; and

store, in one or more data structures, an association between the electronic activity and a second tag, the second tag

i) indicating to match the electronic activity responsive to determining to match the electronic activity to at least one record object of the one or more record objects;

or

ii) generated, responsive to matching the electronic activity to the at least one record object, based on information associated with the at least one record object.

12. The system of claim 11, wherein the one or more hardware processors are further configured by machine-readable instructions to:

identify a data source provider of the electronic activity;

identify a system of record of the data source provider;

select one or more candidate record objects of the system of record with which to match the electronic activity based on the first tag assigned to the electronic activity.

13. The system of claim 11, further comprising assigning a third tag based on one of information included in a first node profile of the sender of the electronic activity or a second node profile of the at least one recipient, or information included in a signature block of the sender or the recipient.

14. The system of claim 13, wherein the information included in the first node profile of the sender of the electronic activity or the second node profile of the at least one recipient includes a value of a field corresponding to a title of the sender or the at least one recipient.

15. The system of claim 11, wherein the one or more hardware processors are further configured by machine-readable instructions to:

determine that a system of record of the data source provider of the electronic activity identifies a first record object corresponding to a first entity;

determine that one or more recipients of the electronic activity correspond to the first entity;

assign a third tag to the electronic activity responsive to determining that the sender or one or more recipients of the electronic activity correspond to the first entity associated with the first record object, the third tag indicating that the electronic activity is a candidate for matching to a record object of the system of record.

16. The system of claim 11, wherein the one or more hardware processors are further configured by machine-readable instructions to:

determine that the sender of the electronic activity belongs to an entity corresponding to the data source provider;

predict an amount of time the sender spent to draft the electronic activity based on a number of characters included in the electronic activity;

assign a third tag to the electronic activity based on the predicted amount of time.

17. The system of claim 16, wherein predicting an amount of time the sender spent to draft contents of the electronic activity is further based on a relationship between the sender and the one or more recipients of the electronic activity.

18. The system of claim 16, wherein the one or more hardware processors are further configured by machine-readable instructions to determine that the electronic activity is not to be classified as a blast electronic activity responsive to determining that no other previous or subsequent electronic activities sent by the sender within a predetermined time window satisfy a match condition with the electronic activity.

19. A non-transitory computer-readable storage medium having instructions embodied thereon, the instructions being executable by one or more processors to perform a method for managing an electronic activity, the method comprising:

maintaining a plurality of node profiles corresponding to a plurality of unique entities, each node profile including a plurality of fields, each field of the plurality of fields including one or more values;

accessing a plurality of electronic activities transmitted or received via electronic accounts associated with one or more data source providers, the one or more processors configured to update the plurality of node profiles using the plurality of electronic activities;

identifying an electronic activity of the plurality of electronic activities to process;

determining a relationship between a sender of the electronic activity and at least one recipient of the one or more recipients of the electronic activity using the node profiles of the sender and the at least one recipient included in the plurality of node profiles;

assigning a first tag to the electronic activity based on the relationship between the sender and the one or more recipients;

processing the electronic activity based on the assigned first tag;

parsing, the electronic activity to determine whether to match the electronic activity to one or more record objects of a system of record corresponding to the data source provider; and

storing, in one or more data structures, an association between the electronic activity and a second tag, the second tag

i) indicating to match the electronic activity responsive to determining to match the electronic activity to at least one record object of the one or more record objects;

or

ii) generated, responsive to matching the electronic activity to the at least one record object, based on information associated with the at least one record object.