Abstract: Disclosed herein are system, apparatus, article of manufacture, method and/or computer program product embodiments, and/or combinations and sub-combinations thereof, for generating a scene emotion value for a scene based on a sequence of frame emotion values for a sequence of frames within the scene of a content. The content can include multiple scenes, and a scene can include multiple frames, where a frame emotion value can be generated for each frame. A frame emotion value can be generated based on scene metadata related to the scene, content metadata related to the content, and a frame metadata related to the frame.

Abstract: Disclosed herein are system, apparatus, article of manufacture, method and/or computer program product embodiments, and/or combinations and sub-combinations thereof, for utilizing a content acquisition recommendation system to generating a set of candidate content assets, generate embeddings and popularity score estimates for the set of candidate content assets, aggregate the set of candidate content assets with a set of existing content assets to generate a simulation set of content assets, determine a target set of users for the simulation set of content assets, generate, for at least a portion of the target set of users and based on a trained machine learning model, a result set of recommended content assets, determining an impact of the candidate content assets located in the result set of recommended content assets and generate a proposal for an acquisition of candidate content assets.

Abstract: Disclosed herein are system, apparatus, article of manufacture, method and/or computer program product embodiments, and/or combinations and sub-combinations thereof, for online automatic hyperparameter tuning of a machine learning model that provides a user experience to media devices such that the machine learning model maximizes (or minimizes) an objective function. An example embodiment operates by generating an initial set of hyperparameter configurations for a machine learning model based on sampling data received from media devices over a network. The embodiment then determines, using an hyperparameter tuning method, a hyperparameter configuration based on the initial set of hyperparameter configurations that causes a training of the machine learning model using a learning algorithm to maximize an objective function. The embodiment then trains the machine learning model according to the determined hyperparameter configuration using the learning algorithm.

Abstract: Disclosed herein are system, apparatus, article of manufacture, method and/or computer program product embodiments, and/or combinations and sub-combinations thereof, for candidate ranking for content recommendation. An embodiment operates by receiving category candidates over a network, wherein each of the category candidates comprises content candidates associated with one or more applications operating on media devices. The embodiment then ranks the category candidates based on a machine model trained using a learning algorithm based on the time series data, and ranks the content candidates in the each of category candidates based on the time series data. The embodiment then causes the ranked category candidates and the ranked content candidates to be outputted for display.

Abstract: Disclosed herein are system, apparatus, article of manufacture, method and/or computer program product embodiments, and/or combinations and sub-combinations thereof, for stochastic candidate selection for content recommendation. An example embodiment operates by a computer-implemented method for stochastic candidate selection for content recommendation. The method includes receiving, by at least one computer processor, a first plurality of content candidates and selecting a second plurality of content candidates from the first plurality of content candidates. The method further include ranking the second plurality of content candidates based on one or more parameters and selecting a third plurality of content candidates from the ranked second plurality of content candidates. The method can further include displaying the third plurality of content candidates using a display device.

Abstract: Disclosed herein are various embodiments, for a content display and clustering system. An example embodiment operates by receiving a request to display the plurality of content items. At each of multiple levels different pairs of content items are identified and a similarity score is computed for each pair. A subset of pairs for which their similarity score exceeds a similarity threshold for the respective level are identified and clustered. This process is repeated for one or more iterations at the same level, and then the process is repeated for each of the multiple levels. A final clustered subset is identified, and output for display, responsive to the request to display the plurality of content items.

Abstract: Disclosed herein are various embodiments, for a content display and clustering system. An example embodiment operates by receiving a request to display the plurality of content items. At each of multiple levels different pairs of content items are identified and a similarity score is computed for each pair. A subset of pairs for which their similarity score exceeds a similarity threshold for the respective level are identified and clustered. This process is repeated for one or more iterations at the same level, and then the process is repeated for each of the multiple levels. A final clustered subset is identified, and output for display, responsive to the request to display the plurality of content items.

Abstract: Disclosed herein are system, apparatus, article of manufacture, method and/or computer program product embodiments, and/or combinations and sub-combinations thereof, for generating a scene emotion value for a scene based on a sequence of frame emotion values for a sequence of frames within the scene of a content. The content can include multiple scenes, and a scene can include multiple frames, where a frame emotion value can be generated for each frame. A frame emotion value can be generated based on scene metadata related to the scene, content metadata related to the content, and a frame metadata related to the frame.

Abstract: Disclosed are mechanisms for selecting a recommended item for a current item being viewed by a user account based on a view history of the user account with reduced bias. For a current item being viewed by the user account represented by a current node of a co-watch graph, embodiments can select a recommended item represented by an associated node in the co-watch graph likely being viewed by the user account, and determine a probability of the recommended item likely being viewed. The co-watch graph can be generated based on a view history of the user account. An edge between a first node and a second node of the co-watch graph can have a weight representing a number of co-occurrence times when the first item represented by the first node and the second item represented by the second node are viewed in sequence within a predetermined time interval.

Abstract: Disclosed herein are system, apparatus, article of manufacture, method and/or computer program product embodiments, and/or combinations and sub-combinations thereof, for generating a scene emotion value for a scene based on a sequence of frame emotion values for a sequence of frames within the scene of a content. The content can include multiple scenes, and a scene can include multiple frames, where a frame emotion value can be generated for each frame. A frame emotion value can be generated based on scene metadata related to the scene, content metadata related to the content, and a frame metadata related to the frame.

Abstract: Disclosed herein are system, apparatus, article of manufacture, method and/or computer program product aspects, and/or combinations and sub-combinations thereof, for generating trailers (previews) for multimedia content. An example aspect operates by generating an initial set of candidate points to generate a trailer for a media content; determining conversion data for each of the initial set of candidate points; determining an updated set of candidate points based on the conversion data; determining an estimated mean and upper bound for each of the updated set of candidate points; computing a value for each of the updated set of candidate points; generating a ranked list based on the value computed for each of the updated set of candidate points; and repeating the process until an optimal candidate point is converged upon.

Abstract: Methods, systems, and computer programs are presented for the determination of optimal communication scheduling. One method includes an operation for training a machine-learning program to generate a frequency model that determines a frequency for sending communications to users. The training utilizes training data defined by features related to user information and responses of users to previous communications to the users. The method further includes determining, by the frequency model and based on information about a first user, a first frequency for the first user. The first frequency identifies the number of communications to transmit to the first user per period of time. Further, the method includes operations for receiving a communication request to send one or more communications to the first user and determining send times for the one or more communications to the first user based on the first frequency. The communications are sent at the determined send times.

Abstract: Methods, systems, and computer programs are presented for the determination of optimal communication scheduling. One method includes an operation for training a machine-learning program to generate a frequency model that determines a frequency for sending communications to users. The training utilizes training data defined by features related to user information and responses of users to previous communications to the users. The method further includes determining, by the frequency model and based on information about a first user, a first frequency for the first user. The first frequency identifies the number of communications to transmit to the first user per period of time. Further, the method includes operations for receiving a communication request to send one or more communications to the first user and determining send times for the one or more communications to the first user based on the first frequency. The communications are sent at the determined send times.

Abstract: Methods, systems, and computer programs are presented for the determination of optimal communication scheduling. Send Time Optimization (STO) uses machine learning (ML) to recommend a personalized send time based on a recipient's past engagement patterns. The purpose of the ML model is to learn patterns in the data automatically and use the patterns to make personalized predictions for each recipient. The send time recommended by the model is the time at which the model believes the recipient will be most likely to engage with the message, such as clicking or opening, and use of the send time mode is expected to increase engagement from recipients. Additional customizations include communication-frequency optimization, communication-channel selection, and engagement-scoring model.

Abstract: Methods, systems, and computer programs are presented for the determination of optimal communication scheduling. One method includes an operation for training a machine-learning program to generate a frequency model that determines a frequency for sending communications to users. The training utilizes training data defined by features related to user information and responses of users to previous communications to the users. The method further includes determining, by the frequency model and based on information about a first user, a first frequency for the first user. The first frequency identifies the number of communications to transmit to the first user per period of time. Further, the method includes operations for receiving a communication request to send one or more communications to the first user and determining send times for the one or more communications to the first user based on the first frequency. The communications are sent at the determined send times.

Abstract: Methods, systems, and computer programs are presented for the determination of optimal communication scheduling. Send Time Optimization (STO) uses machine learning (ML) to recommend a personalized send time based on a recipient's past engagement patterns. The purpose of the ML model is to learn patterns in the data automatically and use the patterns to make personalized predictions for each recipient. The send time recommended by the model is the time at which the model believes the recipient will be most likely to engage with the message, such as clicking or opening, and use of the send time mode is expected to increase engagement from recipients. Additional customizations include communication-frequency optimization, communication-channel selection, and engagement-scoring model.