Salesforce, Inc.

Salesforce Com, Inc.

Kexin Xie

Yuxi Zhang

Shrestha Basu Mallick

Yacov Salomon

Wanderley Liu

David Yourdon

Nathan Irace Burke

Xingyu Wang

Darrell Grissen

Sheng Loong Su

Donglin Hu

Daniel Wilson

Brian Brechbuhl

Matthew David Trepina

Michael Jones

Jonathan Thomas Purnell

Trent Albright

Chen Xu

Armita Peymandoust

Gokhan Cagrici

Jonathan Daniel Showers Belkowitz

Jason Lestina

James Brewer

Daniel Louis Gasperut

Jeffery Allen Zickgraf

Greg Lyman

Zhao Jin

Michael Ronald Brewer

Evan Black

Austin Rauschuber

Victoria Schultz

Todd Swardenski

Peter Stadlinger

A system can recommend a next action for a user. A memory can store user data corresponding to the user and can include historic interaction points. A behavior pattern can be identified based on two or more interaction points stored in the user data. An intent of the user based on the behavior pattern can be identified. The intent can be based on a previous behavior pattern of another user. Several probabilities that the user will meet one or more objectives can be determined based on the intent. The probabilities can be scored using and used to assign a policy to the first user. A next action can be recommended based on the policy and executed with respect to the user. The outcome of the recommended next action can be stored to the user data.

Automatic rule generation for next-action recommendation engine

Systems, devices, and techniques are disclosed for data shards for distributed processing. Data sets of data for users may be received. The data sets may belong to separate groups. User identifiers in the data sets may be hashed to generate hashed identifiers for the data sets. The user identifiers in the data sets may be replaced with the hashed identifiers. The data sets may be split to generate shards. The data sets may be split into the same number of shards. Merged shards may be generated by merging the shards using a separate running process for each of the merged shards. The merged shards may be generated using shards from more than one of the two or more data sets. An operation may be performed on all of the merged shards.

Data shards for distributed processing

A prediction system of an online system deploys one or more machine-learned architectures to generate predictions. In one embodiment, the machine-learned architecture is a stacked ensemble model. The stacked ensemble model includes a plurality of base models, where a base model is coupled to receive input data and generate a base prediction for the input data. The stacked ensemble model includes a meta model that combines the base predictions to generate a meta prediction for the input data. The prediction system also generates a reliability measure that takes advantage of the base predictions to evaluate the reliability of the meta prediction. In this manner, while the quality of individual predictions may differ from one another depending on the values of the input data, the prediction system can dynamically generate the reliability measure to account for this variation.

Generating reliability measures for machine-learned architecture predictions

Methods, systems, and devices for displaying a user interface for frequent pattern (FP) analysis are described. In some cases, data stored at a multi-tenant database server may be analyzed to understand various interactions and patterns between data attributes associated with multiple users, or determine one or more attributes associated with a characterization of an individual (e.g., a persona). The multi-tenant database server may effectively cluster and/or perform calculations on attributes of the data to understand user patterns and determine common personas. The results may then be displayed by a user interface at a user device (e.g., associated with the user).

User interface for frequent pattern analysis

A data processing server may receive a set of data objects for frequent pattern (FP) analysis. The set of data objects may be analyzed using an attribute diversity technique. For the set of data attributes of the set of data objects, the server may arrange the attributes in one or more dimensions. The server may initialize a set of centroids on data points and identify mean values of nearby data points. Based on an iteration of the mean value calculation, the server may identify a set of attributes corresponding to final mean values as being groups of similarly frequent attributes. These groups of similarly frequent attributes may be analyzed using an FP analysis procedure to identify frequent patterns of data attributes.

Attribute diversity for frequent pattern analysis

Methods, systems, and devices supporting data processing are described. In some systems, a data processing platform may support communication message analysis using machine learning. For example, a system may receive a set of communication messages (e.g., social media messages) and perform a machine learning process on the message contents and message interaction data to train a machine learned model. The system may further receive a subject line for a communication message for analysis, input the subject line into the machine learned model, and receive, as an output of the machine learned model, an engagement score based on the subject line. The engagement score may indicate an estimated probability that a user receiving the communication message opens the communication message (e.g., based on the subject line). A user&#x2014;or the system&#x2014;may modify the subject line based on the analysis to improve the engagement score.

Subject line tester

Disclosed embodiments are related to send time optimization technologies for sending messages to users. The send time optimization technologies provide personalized recommendations for sending messages to individual subscribers taking into account the delay and/or lag between the send time and the time when a subscriber engages with a sent message. A machine learning (ML) approach is used to predict the optimal send time to send messages to individual subscribers for improving message engagement. The personalized recommendations are based on unique characteristics of each user's engagement preferences and patterns, and deals with historical feedback that is generally incomplete and skewed towards a small set of send hours. The ML approach automatically discovers hidden factors underneath message and send time engagements. The ML model may be a two-layer non-linear matrix factorization model. Other embodiments may be described and/or claimed.

Technologies for predicting personalized message send times

A cloud platform supports a digital communication system that identifies recommended communication frequencies based on past communication data. The cloud platform may support blending of weights applied to different engagement rates. Based on the weights, the system identifies recommended frequency ranges to maximize engagement rates, including the blended engagement rate using a redistribution simulation process.

Data processing for multi-objective communication engagement

Methods, systems, and devices supporting epsilon (&#x3b5;)-closure for frequent pattern (FP) analysis are described. Some database systems may analyze data sets to determine FPs. In some cases, the FP set may include a large number of semi-redundant patterns, resulting in significant memory or processing overhead. To reduce the redundancy of these patterns, the database system may implement pre-configured or dynamic threshold occurrence differences (e.g., &#x3b5; values) to test against related patterns. For example, the database system may calculate the difference between the data objects covered by a sub-pattern and a super-pattern (e.g., where the super-pattern includes all the same data attributes of the sub-pattern, plus one additional attribute). This difference may be compared to a corresponding &#x3b5; value, and if the difference is less than the &#x3b5; value, the database system may remove one of the patterns (e.g., the sub-pattern) from the set of valid FPs to limit redundancy.

Epsilon-closure for frequent pattern analysis

Methods, systems, and devices supporting differential support for frequent pattern (FP) analysis are described. Some database systems may analyze data sets to determine FPs of data attributes within the data sets. However, if data distributions for different types of data attributes vary greatly, more frequent data attribute types may skew the FPs away from the less frequent types. To reduce the noise of common attributes while maintaining sensitivity to the less common attributes, the database system may implement multiple minimum support (e.g., frequency) thresholds. For example, the database system may adaptively categorize the different data attribute types into data categories based on their distributions and may dynamically determine support thresholds for the categories. Using different minimum support thresholds for different data categories allows the system to filter out data attribute patterns based on the distributions of the data attribute types in the pattern.

Differential support for frequent pattern analysis

A database system performs lookalike analysis on a data set including a plurality of user identifiers, which are associated with one or more attribute records. The database system classifies the user identifiers into one or more segments of user identifiers based on the attribute records. The database system performs Linear Discriminant Analysis (LDA) to calculate a measure of importance of the attribute records relative to the one or more segments. The database system auto-correlates the attribute records based on the numbers of attribute records in the user identifier population and the one or more segments. The database system identifies a set of user identifiers relative to one or more segments using the measures of importance and the auto-correlated parameters.

Method and system for classifying user identifiers into similar segments

A database server may receive or monitor user engagement metadata corresponding to a plurality of communication messages transmitted to the users. The database server analyzes the metadata to determine optimal transmission frequencies for digital communication messages based on engagement rates received in the user engagement metadata.

Growing community of inventors

San Mateo, CA, United States of America

Kexin Xie