Abstract: Systems and methods for frequency management, including: an online media service configured to: receive a request for a media item, the request including a recipient identifier; identify a set of candidate media items ranked by a set of matching criteria; a frequency management service configured to: perform a query against a lookup service, where the query includes (i) an entity identifier of at least one candidate media item of the set of candidate media items, and (ii) the recipient identifier; receive a response from the lookup service including a quantity of impressions associated with the entity identifier and the recipient identifier; identify a predefined frequency threshold; determine that the frequency threshold is exceeded and exclude the at least one candidate media item from a result set based on the determination; and provide the result set including an identifier of at least one other candidate media item.

Abstract: Systems and methods for entity detection using artificial intelligence, including: a deep learning model service configured to: select and analyze a set of frames from a media item to determine a set of candidate brand-probability pairs; a voting engine configured to: determining that a first brand-probability pair of a set of candidate brand-probability pairs based on at least one obtained hyperparameter value does not meet a threshold for determining whether candidate brand-probability pairs are to be included in a result set; excluding the first brand-probability pair from the result set based on the determination; sorting the result set; and selecting at least one final brand-probability pair from the result set; and an offline transcoding service configured to: store the final brand-probability pair in a repository with a relation to an identifier of the media item.

Abstract: Systems and methods for programmatic generation of training data, including: a training data generation engine configured to: identify an image asset corresponding to an entity; identify a training video; select a consecutive subset of frames of the training video based on a procedure for ranking frames on their candidacy for overlaying content; for at least one frame of the subset of frames: perform an augmentation technique on the identified logo image to generate an augmented image asset; overlay at least one variation of the image asset, including the augmented image asset, onto each of the subset of frames to generate a set of overlayed frames; and generate an augmented version of the training video including the overlayed frames; and a model training engine configured to: train an artificial intelligence model for entity detection using the augmented version of the training video.

Abstract: Systems and methods for frequency management, including: an online media service configured to: receive a request for a media item, the request including a recipient identifier; identify a set of candidate media items ranked by a set of matching criteria; a frequency management service configured to: perform a query against a lookup service, where the query includes (i) an entity identifier of at least one candidate media item of the set of candidate media items, and (ii) the recipient identifier; receive a response from the lookup service including a quantity of impressions associated with the entity identifier and the recipient identifier; identify a predefined frequency threshold; determine that the frequency threshold is exceeded and exclude the at least one candidate media item from a result set based on the determination; and provide the result set including an identifier of at least one other candidate media item.

Abstract: Techniques disclosed herein provide more efficient and more relevant item recommendations to users in large-scale environments in which only positive interest information is known. The techniques use a rank-constrained formulation that generalizes relationships based on known user interests in items and/or use a randomized singular value decomposition (SVD) approximation technique to solve the formulation to identify items of interest to users in an efficiently, scalable manner.

Abstract: Techniques disclosed herein provide more efficient and more relevant item recommendations to users in large-scale environments in which only positive interest information is known. The techniques use a rank-constrained formulation that generalizes relationships based on known user interests in items and/or use a randomized singular value decomposition (SVD) approximation technique to solve the formulation to identify items of interest to users in an efficiently, scalable manner.

Abstract: Techniques disclosed herein provide more efficient and more relevant item recommendations to users in large-scale environments in which only positive interest information is known. The techniques use a rank-constrained formulation that generalizes relationships based on known user interests in items and/or use a randomized singular value decomposition (SVD) approximation technique to solve the formulation to identify items of interest to users in an efficiently, scalable manner.

Abstract: A deep collaborative filtering (DCF) approach is employed in a recommender system to provide item recommendations to users. The DCF approach combines deep learning models with matrix factorization based collaborative filtering. To provide item recommendations, a user-item rating matrix, user side information, and item side information are provided as input to a recommender system. The recommender system learns user latent factors and item latent factors by jointly: (1) decomposing the user-item rating matrix to extract latent factors, and (2) extracting latent factors from hidden layers of deep learning models using the user side information and item side information. The learned user latent factors and item latent factors are used to predict item ratings for missing ratings in the user-item rating matrix. The predicted item ratings are then used to select item recommendations for a given user, which are then communicated to a user device of the user.

Abstract: Techniques disclosed herein provide more efficient and more relevant item recommendations to users in large-scale environments in which only positive interest information is known. The techniques use a rank-constrained formulation that generalizes relationships based on known user interests in items and/or use a randomized singular value decomposition (SVD) approximation technique to solve the formulation to identify items of interest to users in an efficiently, scalable manner.

Abstract: A deep collaborative filtering (DCF) approach is employed in a recommender system to provide item recommendations to users. The DCF approach combines deep learning models with matrix factorization based collaborative filtering. To provide item recommendations, a user-item rating matrix, user side information, and item side information are provided as input to a recommender system. The recommender system learns user latent factors and item latent factors by jointly: (1) decomposing the user-item rating matrix to extract latent factors, and (2) extracting latent factors from hidden layers of deep learning models using the user side information and item side information. The learned user latent factors and item latent factors are used to predict item ratings for missing ratings in the user-item rating matrix. The predicted item ratings are then used to select item recommendations for a given user, which are then communicated to a user device of the user.

Abstract: Techniques are provided through which query associations are made between initial queries and corresponding query modifications to the initial queries previously made. Each query modification is made with respect to a searchable source. Based on these query associations, modified queries are generated on a per-source basis. Query associations may be stored on a per user or per community basis, where a community can include many users. Frequently used query modifications may be stored as templates.

Abstract: Generally, a method and apparatus provides for rating user generated content (UGC) with respect to search engine results. The method and apparatus includes recognizing a UGC data field collected from a web document located at a web location. The method and apparatus calculates: a document goodness factor for the web document; an author rank for an author of the UGC data field; and a location rank for web location. The method and apparatus thereby generates a rating factor for the UGC field based on the document goodness factor, the author rank and the location rank. The method and apparatus also outputs a search result that includes the UGC data field positioned in the search results based on the rating factor.

Abstract: A massively multiplayer online game (MMOG) monetization analysis computer system may include an electronic data processing system configured to electronically analyze data, including player behavioral logs, in accordance with one or more algorithms. Based on the analysis, the electronic data processing system may predict player changes that are relevant to monetization of the MMOG and generate a report relating to these predicted changes. The analysis may identify players whom are predicted to terminate their subscriptions to the MMOG, an amount of time each of several players is likely to spend playing the MMOG, and/or a number of transactions each of a several players is likely to engage in while playing the MMOG.

Abstract: Generally, a method and apparatus provides for rating user generated content (UGC) with respect to search engine results. The method and apparatus includes recognizing a UGC data field collected from a web document located at a web location. The method and apparatus calculates: a document goodness factor for the web document; an author rank for an author of the UGC data field; and a location rank for web location. The method and apparatus thereby generates a rating factor for the UGC field based on the document goodness factor, the author rank and the location rank. The method and apparatus also outputs a search result that includes the UGC data field positioned in the search results based on the rating factor.

Abstract: Generally, a method and apparatus provides for rating user generated content (UGC) with respect to search engine results. The method and apparatus includes recognizing a UGC data field collected from a web document located at a web location. The method and apparatus calculates: a document goodness factor for the web document; an author rank for an author of the UGC data field; and a location rank for web location. The method and apparatus thereby generates a rating factor for the UGC field based on the document goodness factor, the author rank and the location rank. The method and apparatus also outputs a search result that includes the UGC data field positioned in the search results based on the rating factor.

Abstract: Generally, a method and apparatus provides for rating user generated content (UGC) with respect to search engine results. The method and apparatus includes recognizing a UGC data field collected from a web document located at a web location. The method and apparatus calculates: a document goodness factor for the web document; an author rank for an author of the UGC data field; and a location rank for web location. The method and apparatus thereby generates a rating factor for the UGC field based on the document goodness factor, the author rank and the location rank. The method and apparatus also outputs a search result that includes the UGC data field positioned in the search results based on the rating factor.

Abstract: Techniques are provided through which query associations are made between initial queries and corresponding query modifications to the initial queries previously made. Each query modification is made with respect to a searchable source. Based on these query associations, modified queries are generated on a per-source basis. Query associations may be stored on a per user or per community basis, where a community can include many users. Frequently used query modifications may be stored as templates.