METHODS AND APPARATUS FOR AUTOMATICALLY PROVIDING DIGITAL ADVERTISEMENTS

TECHNICAL FIELD

The disclosure relates generally to digital advertising and, more specifically, to automatically determining and providing digital advertisements.

BACKGROUND

An advertisement may be a presentation or communication to promote an item, such as a product or service, for purchase. At least some advertisements are digital advertisements, which include a digital representation of the presentation or communication, such as one displayed on a website. A sponsor of an advertisement, such as a business, may seek to sell the item in the advertisement. The sponsor may advertise the item in the advertisement to notify potential buyers of the sale of the item, thereby increasing the chances of selling the item. For example, the sponsor may advertise the item on a website, such as a retailer's website. In at least some examples, the advertisement may be part of an advertising campaign that identifies one or more products to promote on the website.

At least some sponsors of digital advertisements pay a fee to have an item advertised. For example, some sponsors of advertisements pay a fee to a retailer to advertise a sponsor's item on the retailer's website, or through an advertising campaign. The amount of the fee may depend on a number of user interactions, such as user clicks or views, the item advertisement receives. In addition, at least some retailer websites allow a customer to purchase the item advertised, allowing the retailer to profit from the sold item. However, items advertised on a retailer's website, such as via an advertising campaign, may not be of interest to all customers. For example, not all customers are interested in the same item. As such, it is beneficial to a retailer to provide customers with advertisements of item that interest those customers such that they are more likely to interact with the item advertisement or purchase the advertised item.

SUMMARY

The embodiments described herein are directed to automatically providing advertisements, such as, for example, digital advertisements, on a website. The embodiments may select and provide a digital advertisement to a customer with which the customer is more likely to interact. For example, the embodiments may select digital advertisements for items that a particular customer is more likely to purchase, thereby personalizing the digital advertisements to each customer. As a result, the embodiments may allow a retailer to increase the amount of fees collected from advertisers (e.g., increase digital advertisement revenue), as well as from item sales, among other advantages. For example, other advantages may be recognized by those of ordinary skill in the art having the benefit of these disclosures.

In accordance with various embodiments, exemplary systems may be implemented in any suitable hardware or hardware and software, such as in any suitable computing device. For example, in some embodiments, a computing device is configured to receive campaign data identifying a first plurality of items. The computing device may generate first user data based on the first plurality of items, where the first user data identifies a first user that has engaged the first plurality of items. For example, the computing device generates a first user profile with the assumption that the first user has purchased the first plurality of items. The computing device may also obtain attribute data identifying at least one attribute of each of a plurality of users. The computing device may then determine a portion of the plurality of users based on application of a nearest neighbor algorithm to the first user data and the attribute data.

In some examples, the computing device determines at least one attribute value for at least one attribute of a second plurality of items for each of the plurality of the users, and generates user representation data for each user of the plurality of users based on application of a neural network to the at least one attribute value and the attribute data corresponding to each user of the plurality of users. In some of these examples, the computing device determines the portion of the plurality of users based on application of a nearest neighbor algorithm to the first user data and the user representation data.

The portion of the plurality of users are candidate users that may be selected to view an advertisement of one or more of the first plurality of items, for example. The computing device may also determine user-item values for each of the first plurality of items for each of the candidate users, where each user-item value identifies a relational value between the corresponding user and item. The computing device may determine at least one of the first plurality of items for each user of the portion of the plurality of users based on the user-item values, which may then be advertised to each corresponding user. In some examples, the computing device ranks the first plurality of items, which are then advertised to each corresponding user according to the ranking.

In some embodiments, a method is provided that includes receiving campaign data identifying a first plurality of items. The method includes generating first user data based on the first plurality of items, where the first user data identifies a first user that has engaged the first plurality of items. The method may also include obtaining attribute data identifying at least one attribute of each of a plurality of users, and determining a portion of the plurality of users based on application of a nearest neighbor algorithm to the first user data and the attribute data.

In some examples, the method includes determining at least one attribute value for at least one attribute of a second plurality of items for each of the plurality of the users, and generating user representation data for each user of the plurality of users based on application of a neural network to the at least one attribute value and the attribute data corresponding to each user of the plurality of users. In some of these examples, the method includes determining the portion of the plurality of users based on application of a nearest neighbor algorithm to the first user data and the user representation data.

The method may also include determining user-item values for each of the first plurality of items for each of the candidate users, where each user-item value identifies a relational value between the corresponding user and item. The method may include determining at least one of the first plurality of items for each user of the portion of the plurality of users based on the user-item values, which may then be advertised to each corresponding user. In some examples, the method includes ranking the first plurality of items, which are then advertised to each corresponding user according to the ranking.

In some examples, the operations include determining at least one attribute value for at least one attribute of a second plurality of items for each of the plurality of the users, and generating user representation data for each user of the plurality of users based on application of a neural network to the at least one attribute value and the attribute data corresponding to each user of the plurality of users. In some of these examples, the operations include determining the portion of the plurality of users based on application of a nearest neighbor algorithm to the first user data and the user representation data.

The operations may also include determining user-item values for each of the first plurality of items for each of the candidate users, where each user-item value identifies a relational value between the corresponding user and item. The operations may include determining at least one of the first plurality of items for each user of the portion of the plurality of users based on the user-item values, which may then be advertised to each corresponding user. In some examples, the operations include ranking the first plurality of items, which are then advertised to each corresponding user according to the ranking.

In some examples, a plurality of advertising campaigns, each for advertising a plurality of items, are assigned to a plurality of advertising campaign zones of a website for a user. For example, the plurality of advertising campaigns may be ranked for a user. The advertising campaigns may be assigned to an advertising campaign zone of the website for the user based on the rankings. In addition, the plurality of items for each advertising campaign assigned to the user may also be ranked. At least a portion of each of the plurality of items for each advertising campaign may then be displayed to the user in each corresponding advertising campaign zone of the website.

In some embodiments, a computing device is configured to receive campaign data identifying a plurality of advertising campaigns, each of the plurality of advertising campaigns identifying a plurality of items. For each campaign, the computing device may be configured to generate campaign user data based on each advertising campaign's plurality of items. The campaign user data identifies a campaign user that has engaged the campaign's plurality of items. For example, the computing device generates a campaign user profile based on the assumption that the campaign user has purchased all of the advertising campaign's plurality of items. The computing device may also be configured to obtain user attribute data identifying at least one attribute of a user, such as a user browsing a website. The computing device may, for each of the plurality of advertising campaigns, determine a user campaign value based on the campaign user data and the user attribute data. The computing device may also be configured to assign to the user a number of the plurality of advertising campaigns based on the campaign values. The computing device may further be configured to transmit the number of the plurality of advertising campaigns to display to the user. For example the computing device may transmit the number of the plurality of advertising campaigns to a web server, and the web server may display the plurality of items for each of the plurality of advertising campaigns on a webpage to the user.

In some examples, the number of the plurality of advertising campaigns to be advertised to the user are assigned to a plurality of advertising campaign zones of a webpage. For example, the computing device may be configured to determine a distance value between the advertising campaign zones of the webpage, and may further determine a campaign similarity value between the number of the plurality of advertising campaigns. The computing device may be further configured to determine an assignment of the number of the plurality of advertising campaigns to the plurality of the advertising campaign zones of the webpage based on the distance values and the campaign similarity values. The computing device may be configured to transmit the assignment of the number of the plurality of advertising campaigns to the plurality of the advertising campaign zones of the webpage.

In some examples, for each of the number of the plurality of advertising campaigns, the computing device ranks the corresponding plurality of items. For example, the computing device may be configured to determine user-item values for each of the plurality of items for each of the advertising campaigns, where each user-item value identifies a relational value between the user and item. The computing device may be configured to rank the plurality of items for each advertising campaign based on the user-item values. The computing device may also be configured to transmit the ranking of the plurality of items for each of the number of the plurality of advertising campaigns, which may be displayed to the user according to the ranking.

In some embodiments, a method is provided that includes receiving campaign data identifying a plurality of advertising campaigns, each of the plurality of advertising campaigns identifying a plurality of items. For each campaign, the method may include generating campaign user data based on each advertising campaign's plurality of items. The campaign user data identifies a campaign user that has engaged the campaign's plurality of items. For example, the method may include generating a campaign user profile based on the assumption that the campaign user has purchased all of the advertising campaign's plurality of items. The method may also include obtaining user attribute data identifying at least one attribute of a user, such as a user browsing a website. The method may further include, for each of the plurality of advertising campaigns, determining a user campaign value based on the campaign user data and the user attribute data. The method may also include assigning to the user a number of the plurality of advertising campaigns based on the campaign values. The method may further include transmitting the number of the plurality of advertising campaigns to display to the user.

In some examples, the method includes determining a distance value between the advertising campaign zones of a webpage, and determining a campaign similarity value between the number of the plurality of advertising campaigns. The method may further include assigning the number of the plurality of advertising campaigns to the plurality of the advertising campaign zones of the webpage based on the distance values and the campaign similarity values. The method may further include transmitting the assignment of the number of the plurality of advertising campaigns to the plurality of the advertising campaign zones of the webpage.

In some examples, for each of the number of the plurality of advertising campaigns, the method includes determining user-item values for each of the plurality of items for each of the advertising campaigns, where each user-item value identifies a relational value between the user and item. The method may also include ranking the plurality of items for each advertising campaign based on the user-item values. The method may further include transmitting the ranking of the plurality of items for each of the number of the plurality of advertising campaigns, which may be displayed to the user according to the ranking.

In yet other embodiments, a non-transitory computer readable medium has instructions stored thereon, where the instructions, when executed by at least one processor, cause a computing device to perform operations that include receiving campaign data identifying a plurality of advertising campaigns, each of the plurality of advertising campaigns identifying a plurality of items. For each campaign, the operations may include generating campaign user data based on each advertising campaign's plurality of items. The campaign user data identifies a campaign user that has engaged the campaign's plurality of items. For example, the operations may include generating a campaign user profile based on the assumption that the campaign user has purchased all of the advertising campaign's plurality of items. The operations may also include obtaining user attribute data identifying at least one attribute of a user, such as a user browsing a website. The operations may further include, for each of the plurality of advertising campaigns, determining a user campaign value based on the campaign user data and the user attribute data. The operations may also include assigning to the user a number of the plurality of advertising campaigns based on the campaign values. The operations may further include transmitting the number of the plurality of advertising campaigns to display to the user.

In some examples, the operations include determining a distance value between the advertising campaign zones of a webpage, and determining a campaign similarity value between the number of the plurality of advertising campaigns. The operations may further include assigning the number of the plurality of advertising campaigns to the plurality of the advertising campaign zones of the webpage based on the distance values and the campaign similarity values. The operations may further include transmitting the assignment of the number of the plurality of advertising campaigns to the plurality of the advertising campaign zones of the webpage.

In some examples, for each of the number of the plurality of advertising campaigns, the operations include determining user-item values for each of the plurality of items for each of the advertising campaigns, where each user-item value identifies a relational value between the user and item. The operations may also include ranking the plurality of items for each advertising campaign based on the user-item values. The operations may further include transmitting the ranking of the plurality of items for each of the number of the plurality of advertising campaigns, which may be displayed to the user according to the ranking.

BRIEF DESCRIPTION OF THE DRAWINGS

The features and advantages of the present disclosures will be more fully disclosed in, or rendered obvious by the following detailed descriptions of example embodiments. The detailed descriptions of the example embodiments are to be considered together with the accompanying drawings wherein like numbers refer to like parts and further wherein:

FIG. 1 is a block diagram of a digital advertisement identification system in accordance with some embodiments;

FIG. 2 is a block diagram of the digital advertisement computing device of the digital advertisement identification system of FIG. 1 in accordance with some embodiments;

FIG. 3 is a block diagram illustrating examples of various portions of the digital advertisement identification system of FIG. 1 in accordance with some embodiments;

FIG. 4A is a block diagram illustrating examples of various portions of the digital advertisement computing device of FIG. 1 in accordance with some embodiments;

FIG. 4B is a block diagram illustrating examples of various portions of the digital advertisement computing device of FIG. 1 in accordance with some embodiments;

FIG. 5 is an example webpage displaying recommended items in accordance with some embodiments;

FIG. 6 is a flowchart of an example method that can be carried out by the digital advertisement identification system of FIG. 1 in accordance with some embodiments;

FIG. 7 is a flowchart of another example method that can be carried out by the digital advertisement identification system of FIG. 1 in accordance with some embodiments;

FIGS. 8A and 8B illustrate example websites each with multiple advertising campaign zones and advertising campaigns;

FIG. 9 is a block diagram of the digital advertisement computing device of the digital advertisement identification system of FIG. 1 in accordance with some embodiments;

FIG. 10 is a flowchart of an example method that can be carried out by the digital advertisement identification system of FIG. 1 in accordance with some embodiments;

FIG. 11 is a flowchart of an example method that can be carried out by the digital advertisement identification system of FIG. 1 in accordance with some embodiments;

FIG. 12 is a flowchart of an example method that can be carried out by the digital advertisement identification system of FIG. 1 in accordance with some embodiments;

FIG. 13 is a flowchart of an example method that can be carried out by the digital advertisement identification system of FIG. 1 in accordance with some embodiments;

FIG. 14 graphically illustrates the assignment of advertisement campaigns to a single advertising campaign zone of a website for a plurality of users in accordance with some embodiments;

FIG. 15 graphically illustrates the assignment of advertisement campaigns to a plurality of advertising campaign zone of a website for a plurality of users in accordance with some embodiments; and

FIG. 16 illustrates an example equation to determine the assignment of an advertising campaign to an advertising campaign zone of a website in accordance with some embodiments.

DETAILED DESCRIPTION

The description of the preferred embodiments is intended to be read in connection with the accompanying drawings, which are to be considered part of the entire written description of these disclosures. While the present disclosure is susceptible to various modifications and alternative forms, specific embodiments are shown by way of example in the drawings and will be described in detail herein. The objectives and advantages of the claimed subject matter will become more apparent from the following detailed description of these exemplary embodiments in connection with the accompanying drawings.

It should be understood, however, that the present disclosure is not intended to be limited to the particular forms disclosed. Rather, the present disclosure covers all modifications, equivalents, and alternatives that fall within the spirit and scope of these exemplary embodiments. The terms “couple,” “coupled,” “operatively coupled,” “operatively connected,” and the like should be broadly understood to refer to connecting devices or components together either mechanically, electrically, wired, wirelessly, or otherwise, such that the connection allows the pertinent devices or components to operate (e.g., communicate) with each other as intended by virtue of that relationship.

Turning to the drawings, FIG. 1 illustrates a block diagram of a digital advertisement identification system 100 that includes a digital advertisement computing device 102 (e.g., a server, such as an application server), a server 104 (e.g., a web server), workstation(s) 106, database 116, campaign data server 110, and multiple customer computing devices 112, 114 operatively coupled over network 118. Digital advertisement computing device 102, workstation(s) 106, server 104, campaign data server 110, and multiple customer computing devices 112, 114 can each be any suitable computing device that includes any hardware or hardware and software combination for processing and handling information. For example, each can include one or more processors, one or more field-programmable gate arrays (FPGAs), one or more application-specific integrated circuits (ASICs), one or more state machines, digital circuitry, or any other suitable circuitry. In addition, each can transmit data to, and receive data from, communication network 118.

In some examples, digital advertisement computing device 102 and campaign data server 110 can be a computer, a workstation, a laptop, a server such as a cloud-based server, or any other suitable device. In some examples, each of multiple customer computing devices 112, 114 can be a cellular phone, a smart phone, a tablet, a personal assistant device, a voice assistant device, a digital assistant, a laptop, a computer, or any other suitable device. In some examples, digital advertisement computing device 102 is operated by a retailer, campaign data server 110 is operated by a third party, such as a manufacturer of products, and multiple customer computing devices 112, 114 are operated by customers of the retailer.

Although FIG. 1 illustrates two customer computing devices 112, 114, digital advertisement identification system 100 can include any number of customer computing devices 110, 112, 114. Similarly, digital advertisement identification system 100 can include any number of workstation(s) 106, digital advertisement computing devices 102, campaign data servers 110, servers 104, and databases 116.

Workstation(s) 106 are operably coupled to communication network 118 via router (or switch) 108. Workstation(s) 106 and/or router 108 may be located at a store 109, for example. Workstation(s) 106 can communicate with digital advertisement computing device 102 over communication network 118. The workstation(s) 106 may send data to, and receive data from, digital advertisement computing device 102. For example, the workstation(s) 106 may transmit data related to an order purchased by a customer at store 109 to digital advertisement computing device 102. In response, digital advertisement computing device 102 may transmit an indication of one or more items to advertise or promote to the purchasing customer. For example, the items may be displayed on a receipt handed to the customer for the purchase order.

In some examples, server 104 may be a web server and host one or more web pages, such as a retailer's website. Web server 104 may transmit data related to an order purchased on the website by a customer to digital advertisement computing device 102. In response, digital advertisement computing device 102 may transmit an indication of one or more items to advertise or promote on the website to the purchasing customer. For example, the items may be displayed on the homepage of the website when the customer is browsing the website.

First customer computing device 112, and N^thcustomer computing device 114 may communicate with web server 104 over communication network 118. For example, each of multiple computing devices 112, 114 may be operable to view, access, and interact with webpages hosted by web server 104. In some examples, web server 104 hosts a web page for a retailer that allows for the purchase of items. For example, the web page may list prices for advertised items. An operator of one of multiple computing devices 112, 114 may access the web page hosted by web server 104, add one or more items to an online shopping cart of the web page, and perform an online checkout of the shopping cart to purchase the items.

Digital advertisement computing device 102 is operable to communicate with database 116 over communication network 118. For example, digital advertisement computing device 102 can store data to, and read data from, database 116. Database 116 can be a remote storage device, such as a cloud-based server, a memory device on another application server, a networked computer, or any other suitable remote storage. Although shown remote to digital advertisement computing device 102, in some examples, database 116 can be a local storage device, such as a hard drive, a non-volatile memory, or a USB stick.

Communication network 118 can be a WiFi® network, a cellular network such as a 3GPP® network, a Bluetooth® network, a satellite network, a wireless local area network (LAN), a network utilizing radio-frequency (RF) communication protocols, a Near Field Communication (NFC) network, a wireless Metropolitan Area Network (MAN) connecting multiple wireless LANs, a wide area network (WAN), or any other suitable network. Communication network 118 can provide access to, for example, the Internet.

Digital advertisement computing device 102 may generate, for each customer, a ranking of digital advertisements, such as digital advertisements of an advertising campaign, that may be displayed on a web page, such as a web page hosted by web server 104. For example, given a pool of products to promote in a campaign, digital advertisement computing device 102 may identify (e.g., select) a set of customers that may be more likely to be interested in the promoted products. For each of the customers, digital advertisement computing device 102 may generate a personalized ranking of the promotional products. Based on the ranking, the promotional products may be advertised accordingly to each customer. The promoted products may be displayed, for example, as recommended items on a web page of a retailer's website hosted by web server 104. As a result, each customer may see more relevant advertisements when viewing the corresponding web pages.

In one example, digital advertisement computing device 102 employs a recommender system (or “recommendation system,” as is known in the art), to predict a rating for the promoted items. For example, digital advertisement computing device 102 may employ a recommender system, such as one based on collaborative filtering, that generates user-item affinity scores for each promoted item for each customer. The recommender system may generate user-item affinity scores based on past item engagement activity for each user. For example, web server 104 may store data related to what items a customer has engaged (e.g., clicked on, viewed, added to cart, etc.) during past browsing sessions. Digital advertisement computing device 102 may employ the recommender system to generate user-item affinity scores for each customer based on the stored data. For each promoted item, the recommender system may generate a user-item affinity score for that particular customer. If the user-item affinity score for a particular promotional item is above a minimum threshold, digital advertisement computing device 102 may store an indication that the particular promotional item is to be advertised to the customer. For example, digital advertisement computing device 102 may store data identifying and characterizing the digital advertisement in database 116. Web server 104 may then obtain the stored data, and display the digital advertisement to the customer, for example, when the customer browses the retailer's website.

In some examples, digital advertisement computing device 102 receives campaign data from campaign data server 110 identifying and characterizing a plurality of items to promote. Digital advertisement computing device 102 may, for each of a plurality of customers, generate user-item affinity scores for each promotional item based on execution of a recommender system. Digital advertisement computing device 102 may then determine how many user-item affinity scores for the promotional items of the campaign are above a first minimum threshold. If the number of user-item affinity scores above the first minimum threshold is above a second minimum threshold, digital advertisement computing device 102 determines that the campaign (i.e., advertisements for the items being promoted in the campaign) be displayed to the customer. For example, the campaign may only be shown to those customers that have at least the second minimum threshold number of user-item affinity scores above the first threshold.

In some examples, digital advertisement computing device 102 generates product embeddings for a plurality of items, where each product embedding identifies one or more attributes of an item. For example, a product embedding for an item may identify and characterize a brand, a description, or any other attribute of the item. Each product embedding may be represented by a product embedding vector, where each element of the product embedding vector identifies a value for a particular attribute of the corresponding item. Digital advertisement computing device 102 may generate the product embeddings based on user session data, where the user session data identifies one or more item engagements, such as on a website. For example, user session data for a user may identify that an item was added to an online shopping cart, that an item (e.g., item advertisement) was clicked on, that an item was viewed (e.g., an advertisement for the item was viewed), or that an item was searched for (e.g., via a search bar on the website). Digital advertisement computing device 102 may generate product embeddings for one or more items identified by the user session data. For example, based on user session data, digital advertisement computing device 102 may identify a sequence of items w₁, w₂, w₃, . . . , w_T(e.g., the sequence of items may have been clicked on by a user during a browsing session of the website). To generate the product embeddings for these items, digital advertisement computing device 102 may maximize an average log probability according to the equation below:

$\begin{matrix} \frac{1}{T} \sum_{t = 1}^{T} \sum_{- c \leq j \leq c, j \neq 0} \log p (w_{t + j} | w_{t}) & (eq . 1) \end{matrix}$

- where:
  - c=length of the context (e.g., c-sized window of words surrounding w_t);
  - T=total number of words/items in the sequence;

In some examples, the term p( custom-character ) is defined by a softmax function, such as one according to the equation below:

$\begin{matrix} p (w_{O} | w_{I}) = \frac{\exp (v_{w_{O}}^{'} T_{v_{w_{I}}})}{\sum_{w = 1}^{W} \exp (v_{w}^{'} T_{v_{w_{I}}})} & (eq . 2) \end{matrix}$

- where:
  - =output representations of words (e.g., output product embeddings);
  - =input representations of words (e.g., input product embeddings);
  - W=vocabulary size;

In some examples, digital advertisement computing device 102 generates the product embeddings based on user transaction data, where the user transaction data identifies one or more purchased items and corresponding attributes, such as items purchased at store 109 or on online (e.g., a website hosted by web server 104). In some examples, the product embeddings are based on a combination of user session data and user transaction data. For example, for each user, and for a list of items associated with the user (e.g., items based on user transaction data), product embeddings generated for those items (e.g., using equation (2) above) are averaged. In some examples, product embeddings of variable lengths are combined into a fixed width vector representing the averaged product embeddings.

Digital advertisement computing device 102 may then determine a value for each attribute of the items based on the product embeddings for the items (e.g., sequence of items w₁, w₂, w₃, . . . , w_t). For example, digital advertisement computing device 102 may average each of the product embeddings for similar attributes of the items to determine a product embedding average vector, where each element of the product embedding average vector identifies an average value for a particular attribute. This allows, for example, a variable number of items (e.g., w_titems) to be represented by a fixed width vector.

In some examples, digital advertisement computing device 102 combines the product average vector with user attribute data representing one or more user attributes to generate a user vector. User attributes may include, for example, an age, gender, address, demographic information, or any other user attributes. As such, each user vector identifies product embeddings based on user session data of a particular user, and user attributes of the same particular user.

Digital advertisement computing device 102 may then generate user embeddings, which identify one or more features, such as latent features, based on application of a neural network to the user vectors. For example, digital advertisement computing device 102 may apply a stacked denoising auto-encoder to the user vectors to generate the user embeddings. The user embeddings may represent a lower dimensional representation of the user vector.

In some examples, digital advertisement computing device 102 trains the neural network with user vectors generated from a plurality of users. The neural network may be trained with noisy user vectors, and may be performed by minimizing the loss between the output of the neural network and the input of the neural network. For example, the training may be performed such that the least squared loss identified by the equation below is minimized.

∥x−y∥₂² (eq. 3)

- where:
  - x=input to neural network;
  - y=output from neural network;

In some examples, digital advertisement computing device 102 trains a stacked denoising auto-encoder, which includes one or more encoder layers and one or more decoder layers, with noisy user vectors, minimizing the least squared loss between the stacked denoising auto-encoder's output and input. After training, digital advertisement computing device 102 employs only the encoder layer(s) to generate user embeddings.

Digital advertisement computing device 102 may generate user embeddings for a plurality of users, such as users with user session data or user transaction data identifying activity over a previous period (e.g., over the past month, year, etc.). Digital advertisement computing device 102 may then determine a subset of the plurality of users (herein referred to as “candidate users”) to which particular item advertisements may be shown.

For example, digital advertisement computing device 102 may obtain campaign data from campaign data server 110 identifying one or more items to be promoted with a particular advertising campaign. Based on the campaign data, digital advertisement computing device 102 generates a campaign user, defined to be a user who has engaged one or more of the promotional items. For example, the campaign user may be one who has purchased all of the items promoted in the advertising campaign. Digital advertisement computing device 102 may generate a campaign user profile for the campaign user based on the attributes for the promotional items. For example, digital advertisement computing device 102 may generate a campaign user average vector identifying and characterizing the campaign user based on the product embeddings for each of the promotional items, similar to the product user embedding average vector discussed above. In some examples, user attributes are also assumed for the campaign user. For example, the campaign user may be assigned an age attribute, where the age of the campaign user is an average age of all customers. Similarly, other user attributes may be assigned.

To determine the candidate users, digital advertisement computing device 102 may determine a subset of the plurality of users represented by the generated user embeddings that are most similar (e.g., closest) to the campaign user. For example, digital advertisement computing device 102 may employ a nearest neighbor algorithm, such as an approximate nearest neighbor (ANN) algorithm identified by the equation below, to identify the candidate users.

$\begin{matrix} d (p_{i}, q) \leq c \cdot \min_{p_{j}} d (p_{j}, q) & (eq . 4) \end{matrix}$

- where:
  - q is the query point;
  - d(p_i,q) is the distance from the query point q to the point p_i,;
  - p_i, p_j=any two points in a set P, where P={p₁, p₂, . . . , p_n}

The ANN algorithm finds the approximate set of points whose distance is at most c times the distance from the query point q to its nearest points. Digital advertisement computing device 102 may generate a user-campaign value (e.g., score) for the user and corresponding advertising campaign based on the ANN algorithm. For example, the user-campaign values may be determined based on a function of the reciprocal of the distance d(p_i,q). In this example, a smaller distance (e.g., larger score) would indicate a campaign is more relevant to a user than a larger distance (e.g., smaller score). For example, the function may be represented as:

$\begin{matrix} User - campaign value \propto \frac{1}{d (p_{i}, q)} & (eq . 5) \end{matrix}$

The candidate users may then be determined based on the user-campaign values. In some examples, the required maximum distance is a predetermined distance. In some examples, an algorithm such as a k-nearest neighbors, locality-sensitivity hashing, best bin first, or kd-trees algorithm may be employed to generate user-campaign values and to determine the candidate users.

In some examples, the identified candidate users are shown one or more of the promoted items. For example, digital advertisement computing device 102 may transmit the candidate users to web server 104. Web server 104 may detect when a user corresponding to one of the candidate users is browsing a website hosted by web server 104, and may cause one or more of the promoted items of the advertising campaign to be displayed to the user.

In some examples, digital advertisement computing device 102 ranks the promoted items of the advertising campaign for each user, and web server 104 displays the items to each candidate user based on their personalized ranking of the promoted items. Digital advertisement computing device 102 may determine a ranking of the promoted items for each candidate user based on user-item affinity scores. For example, user-item affinity scores may be generated for all items in a catalog, but the ranked list may contain user-item affinity scores only for the promoted items. The promoted items may be displayed on a website to each user.

In some examples, the user-item affinity scores are generated based on a recommender system, as discussed above. For example, digital advertisement computing device 102 may employ a recommender system to generate user-item affinity scores for the promoted items. Promoted items with higher user-item affinity scores are then ranked higher than those with lower user-item affinity scores. Web server 104 may then display one or more of the promoted items to the corresponding candidate user based on the ranking. For example, web server 104 may display a number of recommended item advertisements, such as three, at a time, and in accordance with the ranking.

In some examples, digital advertisement computing device 102 may employ a matrix decomposition method, such as singular value decomposition (SVD) or singular value decomposition++ (SVD++), to determine the user-item affinity scores. For example, digital advertisement computing device 102 may generate user-item affinity scores in accordance with the SVD equation identified below.

{circumflex over (r)}
_ui
=b
_ui
+p
_u
^T
q
_i (eq. 6)

- where:
  - {circumflex over (r)}_ui=user-item affinity score;
  - b_ui=μ+b_u+b_i, and represents the bias added;
  - p_u=user factor, represented by a vector;
  - q_i=item factor;
  - T=transpose of the vector p_u

The user factor p_uand item factor q_imay be determined by a minimizing loss function operating on user transaction data. For example, the factors may be determined by the loss function given below, which minimizes the difference between the actual user-item interaction value (r_ui) from the user transaction data and predicted user-item interaction value ({circumflex over (r)}_ui) through gradient descent. Once training is complete, the user and item factors can be used to obtain the user-item affinity scores for all (user, item) pairs.

min Σ_∀u,i(r_ui−{circumflex over (r)}_ui)² (eq. 7)

- where:
  - r_ui=number of times a user ‘u’ purchased item T;
  - {circumflex over (r)}_ui=predicted user-item affinity score;

As another example, digital advertisement computing device 102 may generate user-item affinity scores in accordance with the SVD++ equation identified below.

$\begin{matrix} {\hat{r}}_{ui} = b_{ui} + q_{i}^{T} (p_{u} + {\langle N (u) \rangle}^{- \frac{1}{2}} \sum_{j \in N (u)} y_{j}) & (eq . 8) \end{matrix}$

- where:
  - N(u)=number of times a user ‘u’ purchased item ‘i’;
  - y_jsignifies implicit feedback (for example product ratings);

Digital advertisement computing device 102 may then determine the ranking of the promoted items for each candidate user based on the user-item affinity scores. For example, digital advertisement computing device 102 may rank promoted items with higher user-item affinity scores higher than those with lower user-item affinity scores. Web server 104 may then display one or more of the promoted items on a website to the corresponding candidate user when that candidate user is browsing the website.

In some examples, when a user is purchasing items at store 109, a message is transmitted to digital advertisement computing device 102 requesting recommended items for one or more campaigns for that user. In response, Digital advertisement computing device 102 may transmit a message identifying one or more recommended items based on the user-item affinity scores for that user for the requested campaign, and the one or more recommended items may be advertised in a receipt given to the user at store 109.

In some examples, digital advertisement computing device 102 generates and transmits communication messages, such as emails, and SMS (e.g., texts) messages, advertising the recommended items to the candidate users based on each user's personalized item ranking. The communication messages may be transmitted to a customer computing device 112, 114 associated with the candidate user, for example. In yet other examples, digital advertisement computing device 102 may personalize searches, such as website searches, conducted on a website hosted by web server 104 based on item rankings. For example, a candidate user may conduct a search on the website, and web server 104 may transmit a message to digital advertisement computing device 102 with the search request. Based on the search request, digital advertisement computing device may determine user item affinity scores for items related to the search, and determine item rankings for those items. Digital advertisement computing device 102 may then transmit the item rankings to web server 104, and web server 104 may display one or more of the ranked items according to the item ranking.

FIG. 2 illustrates the digital advertisement computing device 102 of FIG. 1. Digital advertisement computing device 102 can include one or more processors 201, working memory 202, one or more input/output devices 203, instruction memory 207, a transceiver 204, one or more communication ports 209, and a display 206, all operatively coupled to one or more data buses 208. Data buses 208 allow for communication among the various devices. Data buses 208 can include wired, or wireless, communication channels.

Processors 201 can include one or more distinct processors, each having one or more cores. Each of the distinct processors can have the same or different structure. Processors 201 can include one or more central processing units (CPUs), one or more graphics processing units (GPUs), application specific integrated circuits (ASICs), digital signal processors (DSPs), and the like.

Processors 201 can be configured to perform a certain function or operation by executing code, stored on instruction memory 207, embodying the function or operation. For example, processors 201 can be configured to perform one or more of any function, method, or operation disclosed herein.

Instruction memory 207 can store instructions that can be accessed (e.g., read) and executed by processors 201. For example, instruction memory 207 can be a non-transitory, computer-readable storage medium such as a read-only memory (ROM), an electrically erasable programmable read-only memory (EEPROM), flash memory, a removable disk, CD-ROM, any non-volatile memory, or any other suitable memory.

Processors 201 can store data to, and read data from, working memory 202. For example, processors 201 can store a working set of instructions to working memory 202, such as instructions loaded from instruction memory 207. Processors 201 can also use working memory 202 to store dynamic data created during the operation of digital advertisement computing device 102. Working memory 202 can be a random access memory (RAM) such as a static random access memory (SRAM) or dynamic random access memory (DRAM), or any other suitable memory.

Input-output devices 203 can include any suitable device that allows for data input or output. For example, input-output devices 203 can include one or more of a keyboard, a touchpad, a mouse, a stylus, a touchscreen, a physical button, a speaker, a microphone, or any other suitable input or output device.

Communication port(s) 209 can include, for example, a serial port such as a universal asynchronous receiver/transmitter (UART) connection, a Universal Serial Bus (USB) connection, or any other suitable communication port or connection. In some examples, communication port(s) 209 allows for the programming of executable instructions in instruction memory 207. In some examples, communication port(s) 209 allows for the transfer (e.g., uploading or downloading) of data, such as machine learning algorithm training data.

Display 206 can display user interface 205. User interfaces 205 can enable user interaction with digital advertisement computing device 102. For example, user interface 205 can be a user interface for an application of a retailer that allows a customer to view and interact with a retailer's webpage. In some examples, a user can interact with user interface 205 by engaging input-output devices 203. In some examples, display 206 can be a touchscreen, where user interface 205 is displayed on the touchscreen.

Transceiver 204 allows for communication with a network, such as the communication network 118 of FIG. 1. For example, if communication network 118 of FIG. 1 is a cellular network, transceiver 204 is configured to allow communications with the cellular network. In some examples, transceiver 204 is selected based on the type of communication network 118 digital advertisement computing device 102 will be operating in. Processor(s) 201 is operable to receive data from, or send data to, a network, such as communication network 118 of FIG. 1, via transceiver 204.

FIG. 3 is a block diagram illustrating examples of various portions of the digital advertisement identification system 100 of FIG. 1. As indicated in the figure, database 116 stores user attribute data 360, user session data 320, and user transaction data 340. User attribute data 360 may include, for each user of a plurality of users, an age 362, gender 364, demographic data 366, address 368 (or other contact information, such as email address, phone number, etc.), and a user ID 334 (e.g., a customer ID, retailer website login ID, etc.).

Digital advertisement computing device 102 may receive user session data 320 from web server 104 and may identify, for each user, data related to a browsing session, such as when browsing a retailer's webpage hosted by web server 104. In this example, user session data 320 may include a session ID 322, item clicks 324 identifying items which the user clicked, items added-to-cart 326 identifying items added to the user's online shopping cart, advertisements viewed 328 identifying advertisements the user viewed during the browsing session, advertisements clicked 330 identifying advertisements the user clicked on, search queries 332 identifying one or more searches conducted by the user during the browsing session, and user ID 334.

Digital advertisement computing device 102 may receive in-store purchase data 302 identifying and characterizing one or more purchases from one or more stores 109. Similarly, digital advertisement computing device 102 may receive online purchase data 304 from web server 104, which identifies and characterizes one or more online purchases, such as from a retailer's website. Digital advertisement computing device 102 may parse in-store purchase data 302 and online purchase data 304 to generate user transaction data 340.

User transaction data 340 may identify, for each user, data related to previous transactions, such as in-store or online purchases. In this example, user transaction data 340 includes an order number 342 identifying a purchase order, item IDs 334 identifying one or more items purchased in the purchase order, item brands 344 identifying a brand for each item purchased, item prices 346 identifying the price of each item purchased, item categories 348 identifying one or more categories of each item purchased, a purchase date 350 identifying the purchase date of the purchase order, and user ID 334 for the user making the corresponding purchase.

Database 116 also stores catalog data 370, which may identify one or more attributes of a plurality of items, such as a portion of or all items a retailer carries. Catalog data 370 may identify, for each of the plurality of items, an item ID 372 (e.g., an SKU number), item brand 374, item type 376 (e.g., grocery item such as milk, clothing item), item description 378 (e.g., a description of the product including product features, such as ingredients, benefits, use or consumption instructions, or any other suitable description), and item options 380 (e.g., item colors, sizes, flavors, etc.).

Based on user session data 320, digital advertisement computing device 102 may generate product embeddings for each of a plurality of items. For example, digital advertisement computing device 102 may determine one or more items based on user session data 320 (e.g., items corresponding to user session data 320, such as items corresponding to item clicks 324). Digital advertisement computing device 102 may then obtain catalog data 370 corresponding to each determined item to determine one or more attributes for the item, such as item brand 374 and item description 378. Digital advertisement computing device 102 may then generate a product embedding vector based on the attributes for the item, for example, in accordance with equations (1) and (2) above. For each user, digital advertisement computing device 102 may then average the product embedding vectors to generate a product embedding average vector for each user. Digital advertisement computing device 102 may concatenate the product embedding average vector with one or more user attributes identified by user attribute data 360, such as age 362 and gender 364, to generate a user vector for each user of the plurality of users.

Digital advertisement computing device 102 may apply a neural network, such as a stacked denoising auto-encoder, to the generated user vectors, to generate user embeddings, which in some examples may identify lower dimensional representations of the user vectors.

Digital advertisement computing device 102 may also obtain campaign data 310 from campaign data server 110. Campaign data 310 may identify one or more items to promote for an advertising campaign. Digital advertisement computing device 102 may store campaign data in database 116. Campaign data may include, for example, a campaign identification (ID) 312 identifying an advertising campaign, campaign items 314 identifying one or more items to promote, and campaign advertisements (ADs) 316 identifying one or more corresponding advertisements for the campaign items 314.

Digital advertisement computing device 102 may generate a campaign user profile 318 based on the campaign items 314 to promote for campaign ID 312. For example, digital advertisement computing device 102 may obtain catalog data 370 corresponding to each promotional item to determine one or more attributes for each item, and may determine the campaign user profile 318 for campaign ID 312 based on the attributes of all of the items being promoted. Digital advertisement computing device 102 may store the campaign user profile 318 in database 116.

Digital advertisement computing device 102 may then determine one or more candidate users based on the user embeddings for the plurality of users and the generated campaign user profile. For example, digital advertisement computing device 102 may employ a nearest neighbor algorithm, such as the approximate nearest neighbor algorithm identified by equation (4) above, to determine a subset of the plurality of users (i.e., candidate users).

To determine one or more items to be promoted to each candidate user, digital advertisement computing device 102 may generate user-item affinity scores. For example, the user-item affinity scores may be generated based on execution of an SVD algorithm (e.g., in accordance with equation (5) above) or SVD++ algorithm (e.g., in accordance with equation (6) above) operating on user transaction data 340. Digital advertisement computing device 102 may then determine a ranking of the promotional items to be advertised to each of the identified candidate users based on the user-item affinity scores. Digital advertisement computing device 102 may generate user item ad data 390 that identifies and characterizes the items to be promoted to each candidate user, and may transmit user item ad data 390 to web server 104. In some examples, digital advertisement computing device 102 transmits user item ad data 390 to store 109 when a candidate user is making a purchase, as identifying by in-store purchase data 302.

FIGS. 4A and 4B illustrate examples of various portions of the digital advertisement computing device 102 of FIG. 1. As indicated in FIG. 4A, digital advertisement computing device 102 includes product embedding generation engine 402, user vectorization engine 404, neural network engine 406, candidate user determination engine 408, and campaign user profile determination engine 410. As illustrated in FIG. 4B, digital advertisement computing device 102 also includes user item affinity score generation engine 422 and campaign/item recommendation determination engine 424. In some examples, one or more of product embedding generation engine 402, user vectorization engine 404, neural network engine 406, candidate user determination engine 408, campaign user profile determination engine 410, user item affinity score generation engine 422, and campaign/item recommendation determination engine 424 may be implemented in hardware. In some examples, one or more of product embedding generation engine 402, user vectorization engine 404, neural network engine 406, candidate user determination engine 408, campaign user profile determination engine 410, user item affinity score generation engine 422, and campaign/item recommendation determination engine 424 may be implemented as an executable program maintained in a tangible, non-transitory memory, such as instruction memory 207 of FIG. 2, that may be executed by one or processors, such as processor 201 of FIG. 2.

Referring to FIG. 4A, product embedding generation engine 402 obtains user session data 320, user transaction data 340, and catalog data 370, and generates product embedding data 412 identifying and characterizing a product embedding vector. For example, product embedding generation engine 402 identifies items based on one or more of user session data 320 and user transaction data 340, and determines attributes for those items based on catalog data 370. Product embedding generation engine 402 may then generate a product embedding vector (e.g., a product embedding average vector), identified by product embedding data 412.

User vectorization engine 404 obtains product embedding data 412 and user attribute data 360, and generates user vector data 414, which identifies and characterizes user vectors for corresponding users. Neural network engine 406 obtains user vector data 414, applies a neural network to the user vector data 414 (e.g., such as a stacked denoising auto-encoder), and generates user embedding data 416 identifying and characterizing user embeddings for the corresponding users. User embedding data 416 is provided to candidate user determination engine 408.

Campaign user profile determination engine 410 obtains campaign data 310, such as from campaign server 110, and based on the campaign data 310, generates campaign user profiles 418. For example, campaign user profile 418 may identify and characterize a user that has purchased at least a portion of all promotional items for a campaign identified by campaign data 310. Campaign user profile determination engine 410 provides the campaign user profiles 418 to candidate user determination engine 408.

Candidate user determination engine 408 determines a set of candidate users 420 based on the user embeddings identified by user embedding data 416 and the campaign user profiles 418. For example, the set of candidate users 420 may identify a subset of the plurality of users corresponding to the user embeddings that are closest to a campaign user identified by campaign user profiles 418.

Referring to FIG. 4B, user item affinity score generation engine 422 obtains user session data 320 and user transaction data 340, for example, from database 116. Based on one or more of user session data 320 and user transaction data 340, user item affinity score generation engine 422 generates user-item affinity scores 426. For example, user item affinity score generation engine 422 may generate a user-item affinity score for items for each user as identified by user transaction data 340 based on execution of an SVD or SVD++ algorithm.

User item affinity score generation engine 422 provides the user item affinity scores 426 to campaign/item recommendation determination engine 424. Campaign/item recommendation determination engine 424 also obtains candidate users 420 from candidate user determination engine 408. Based on the user item affinity scores 426 and candidate users 420, campaign/item recommendation determination engine 424 determines user item ad data 390 that identifies and characterizes the items to be promoted to each candidate user. For example, user item ad data 390 may include a ranking of the items to be promoted for each candidate user. User item ad data 390 may be provided to, for example, web server 104, which may display advertisements and/or promotions for the identified items. In some examples, web server 104 displays the advertisements and/or promotions to each candidate user according to the item rankings.

FIG. 5 illustrates an example retailer's webpage hosted by, for example, web server 104, that may display recommended items 504. For example, web server 104 may receive user item ad data 390 identifying one or more ranked items to promote. In this example, we assume that three items are ranked including first item 510, second item 520, and third item 530. For each ranked item, web server 104 may display one or more of an image of the item, a price for the item, and an add-to-cart icon that allows a user to add the item to an online shopping cart associated with retailer webpage 502. For example, as illustrated, first item 510 includes image 512, price 514, and add-to-cart icon 516. Similarly, second item 520 includes image 522, price 524, and add-to-cart icon 526. Third item 530 includes image 532, price 534, and add-to-cart icon 536. Retailer webpage 502 also includes checkout icon 550, which, when engaged (e.g., clicked on) by a user, facilitates the purchase of any items added to the online shopping cart.

FIG. 6 is a flowchart of an example method 600 that can be carried out by the digital advertisement identification system 100 of FIG. 1. Beginning at step 602, a computing device, such as digital advertisement computing device 102, obtains item attribute data identifying a plurality of attributes for a plurality of items engaged by each of a plurality of users. For example, the item attribute data may identify, for each user, items that the user viewed or clicked on during a browsing session on a retailer's website. At step 604, a product embedding vector value is determined for each similar attribute of the plurality of attributes of the items associated with each user. The product embedding vector value is determined based on the plurality of attributes for the plurality of items engaged by each user. In some examples, the product embedding vector value is an average value for a particular attribute of the same attribute for the plurality of items engaged by the user.

Proceeding to step 606, a plurality of user attribute values for a plurality of user attributes are obtained for each user. For example, the user attribute values may represent an age, a gender, demographic information, contact information, or any other attribute of a user. At step 608, a user vector is generated for each user. Each user vector is generated based on the product vector values and the user attribute values corresponding to each user. For example, digital advertisement computing device 102 may concatenate a product vector that includes the product vector values with a user attribute vector that includes the user attribute values to generate the user vectors.

At step 610, a neural network, such as a stacked denoising auto-encoder, is trained based on the generated user vectors. For example, the training may be executed by minimizing a least squared loss between the input user vectors and the output of the neural network. At step 612, a new user vector for a new user is generated. The new user vector is generated based on items the new user added to a website shopping cart, and user attributes for the new user. For example, the user may be browsing a retailer's website, and may add items to an online shopping cart associated with the retailer's website. Proceeding to step 614, user embedding data is generated for the new user based on execution of the trained neural network to the new user vector for the new user. The generated user embedding data may be stored, for example, in database 116. The method then ends.

FIG. 7 is a flowchart of an example method 700 that can be carried out by the digital advertisement identification system 100 of FIG. 1. At step 702, a computing device, such as digital advertisement computing device 102, obtains campaign data identifying a plurality of items to promote. At step 704, item attribute data identifying a plurality of attributes for each of the plurality of items to promote is obtained. For example, item attribute data may identify a brand, a description, and an identification number of each of the plurality of items identified by the campaign data. At step 706, campaign user data is generated. The campaign user data identifies a campaign user that has purchased the plurality of items to promote.

Proceeding to step 708, product vector values are determined for attributes of items previously purchased by each of a plurality of users. For example, for each user, digital advertisement computing device 102 may obtain user transaction data 340 to determine one or more items previously purchased by the user. Digital advertisement computing device 102 may then obtain, for each previously purchased item, catalog data 370 identifying one or more attributes of each item. At step 710, a user vector is generated for each user based on the product vector values and user attribute values for each user. The user attribute values may be obtained, for example, from user attribute data 360 stored in database 116. At step 712, user embedding data is generated for each user based on the application of a trained neural network to the generated user vectors. The trained neural network may be, for example, a stacked denoising auto-encoder trained with user vectors.

Proceeding to step 714, candidate user data identifying a portion of the plurality of users is determined. The candidate user data may be determined based on the generated campaign user data and the generated user embedding data for each of the plurality of users. At step 716, a user-item affinity score is generated for each of the plurality of users. For example, the user-item affinity scores may be determined based on a recommender system, or based on a matrix decomposition method, such as SVD or SVD++. At step 718, for each user of the plurality of users, a ranking of the plurality of items to promote is determined for each user. Each ranking is based on the user item affinity scores for the user and the candidate user data identifying a portion of the plurality of users. Proceeding to step 720, for each user of the plurality of users, at least one item of the plurality of items to promote is advertised based on the rankings. For example, a website hosted by web server 104 may advertise to a user of the plurality of users the highest ranked item during a browsing session. The item may be advertised, for example, on a homepage of the website, or as a result of a search query. The method then ends.

FIG. 8 illustrates a webpage 800, which may be a retailer's webpage for items may be advertised and offered for sale. Webpage 800 may include a plurality of advertising campaign zones. Each advertising campaign zone may allow for the display of item advertisements associated with an advertising campaign. In this example, webpage 800 may include a first advertising campaign zone 802, a second advertising campaign zone 804, and a third advertising campaign zone 806. Each advertising campaign zone 802, 804, 806 may include item advertisements for items of a particular category. Each item advertisement may include an image 512 of the item, a price 514 of the item, and an add-to-cart icon 516.

A category of items may include, for example, items of a same type, items with similar descriptions, items used for a similar purpose, or any other suitable grouping of items. As an example, a category of items may include “Baby items,” which may include items such as diapers, baby bottles, baby wipes, and baby toys. In this example, first advertising campaign zone 802 includes first item advertisement 808, second item advertisement 810, and third item advertisement 812, all of which belong to a first advertisement category 814 and may be item advertisements of a first advertising campaign. First advertising campaign zone 802 may also include scroll icon 816, which, if engaged, allows for the display of additional items in first advertising campaign zone 802. For example, clicking scroll icon 816 may replace one or more item advertisements 808, 810, 812 with other item advertisements (e.g., in ranked order).

Second advertising campaign zone 804 includes first item advertisement 818, second item advertisement 820, and third item advertisement 822, all of which belong to a second advertisement category 824 and may be item advertisements of a second advertising campaign. Second advertising campaign zone 804 also includes scroll icon 826. Similarly, third advertising campaign zone 806 includes first item advertisement 828, second item advertisement 830, and third item advertisement 832, all of which belong to a third advertisement category 834 and may be item advertisements of a third advertising campaign. Third advertising campaign zone 806 may also include scroll icon 836.

As is described further below, digital advertisement computing device 102 may rank a plurality of advertising campaigns for a user. Digital advertisement computing device 102 may determine and provide for display, such as on webpage 800, a number of the plurality of advertising campaigns to advertise to the user based on the ranking. Further, digital advertisement computing device 102 may assign the number of the plurality of advertising campaigns to be advertised to the user are assigned to a plurality of advertising campaign zones of a website. For example, digital advertisement computing device 102 may assign, for a first user visiting webpage 800, a first campaign to first advertising campaign zone 802, a second campaign to second advertising campaign zone 804, and a third campaign to third advertising campaign zone 806.

For a second user visiting webpage 800, digital advertisement computing device 102 may determine a different set of advertising campaigns based on a ranking of the plurality of advertising campaigns for the second user. For example, digital advertisement computing device 102 may assign a fourth campaign to first advertising campaign zone 802, a fifth campaign to second advertising campaign zone 804, and a sixth campaign to third advertising campaign zone 806.

As illustrated in FIG. 8B, for a second user visiting webpage 800, first advertising campaign zone 802 may display first item advertisement 858, second item advertisement 860, and third item advertisement 862, all of which may be part of a fourth campaign including item advertisements in a fourth advertisement category 864. Similarly, second advertising campaign zone 804 may display first item advertisement 868, second item advertisement 870, and third item advertisement 872, all of which may be part of a fifth campaign including item advertisements in a fifth advertisement category 874. Third advertising campaign zone 806 may display first item advertisement 878, second item advertisement 880, and third item advertisement 882, all of which may be part of a sixth campaign including item advertisements in a sixth advertisement category 884.

In some examples, the item advertisements in each of first advertising campaign zone 802, second advertising campaign zone 804, and third advertising campaign zone 806 appear in a ranked order. For example, digital advertisement computing device 102 may rank the item advertisements for each campaign based on user-item values, and may cause the item advertisements to be displayed in each advertising campaign zone 802, 804, 806 in the ranked order.

FIG. 9 illustrates exemplary portions of the digital advertisement computing device 102 of FIG. 1. As indicated in FIG. 9, digital advertisement computing device 102 may include user campaign assignment determination engine 902 and user-based campaign zone assignment engine 904. In some examples, one or more of user campaign assignment determination engine 902 and user-based campaign zone assignment engine 904 may be implemented in hardware. In some examples, one or more of user campaign assignment determination engine 902 and user-based campaign zone assignment engine 904 may be implemented as an executable program maintained in a tangible, non-transitory memory, such as instruction memory 207 of FIG. 2, that may be executed by one or processors, such as processor 201 of FIG. 2.

User campaign assignment determination engine 902 is operable to assign one or more advertising campaigns to one or more users. For example, as noted above with respect to FIGS. 4A and 4B, candidate user determination engine 408 can determine and provide a set of candidate users 420. In the example of FIG. 9, candidate user determination engine 408 further provides user-campaign values 903 generated for each of the users in the set of candidate users 420. As described further above, user-campaign values 903 identify a relationship value between each user and one or more advertising campaigns. User campaign assignment determination engine 902 receives the set of candidate users 420 and the user-campaign values 903 from candidate user determination engine 408.

In addition, user campaign assignment determination engine 902 may also receive campaign data 310, which further identifies a campaign capacity for each advertising campaign. The campaign capacity identifies a minimum and/or maximum number of users that an advertising campaign may be displayed to. For example, the campaign capacity for an advertising campaign may indicate that the advertising campaign is to be displayed to at most a number of users. The advertising campaign may be displayed to additional users based on one or more rules. For example, the rules may specify that the advertising campaign may be placed back into a queue of available campaigns once a threshold number of other campaigns have been displayed to users.

User campaign assignment determination engine 902 may further receive user-item affinity scores 426 from user item affinity score generation engine 422. User campaign assignment determination engine 902 is operable to assign one or more of the advertising campaigns identified by campaign data 310 to one or more of the set of candidate users 420 based on user-campaign values 903 and the campaign capacity for each advertising campaign.

For example, FIG. 14 illustrates a bipartite graph 1400 that represents the assignment of advertising campaigns 1402 (campaign nodes) to users 1404 (user nodes) for a website that includes a single advertising campaign zone. The bipartite graph 1400 further includes a source node 1406 and a sink node 1408. Edges from the source node 1406 to each advertising campaign 1402 indicate a campaign capacity “b” which, in this example, is the same for all advertising campaigns 1402. Edges from each of the advertising campaigns nodes to the user nodes indicate a weight “s(x,y)” for each edge, where “x” refers to a campaign node and “y” refers to a user node (as such, “n” denotes a number of campaign nodes). For example, s(2,1) denotes weight of the edge from the 2^ndcampaign node to the 1^stuser node. The weight may represent user-campaign values 903, for example. Although not illustrated for simplification purposes, an edge may exist between each advertising campaign node and each user node. Further, edges from each user node to the sink indicate a number of advertising campaigns that are assigned to each user. In this example, a single advertising campaign is assigned to each user. The single advertising campaign may be displayed to the user, for example, in the single advertising campaign zone of the website.

Referring back to FIG. 9, to determine what advertising campaign (e.g., as identified by campaign data 310) is assigned to each user (e.g., the set of candidate users 420), user campaign assignment determination engine 902 may implement (e.g., execute) the following optimization and minimization functions. In this optimization problem, we want to assign (i.e., match) campaigns to users with some constraints. x_ijis constrained to have only two values, 0 or 1, where x_ij=1 implies that campaign i is assigned to user j (after optimization is solved) and x_ij=0 implies that the campaign i is not assigned to user j.

Optimization Function (eq. 9):

$\max \sum_{(i, j)} s_{ij} x_{ij}$

such that:

$\sum_{j} x_{ij} \leq b \forall i$

- where:
- x_ij∈{0,1}, where x_ij=1 if a campaign is matched to a user and 0 otherwise;
- i=an advertising campaign;
- j=a user;
- b=campaign capacity;
- s_ij=user-campaign value.

Minimization Function (eq. 10):

$\min \sum_{j} b_{j} y_{j} + \sum_{i} z_{i}$

such that:

$\begin{matrix} y_{j} + z_{i} \geq s_{ij} & \forall (i, j) \\ y_{j} \geq 0 & \forall j \\ z_{i} \geq 0 & \forall i \end{matrix}$

- where:
- b_j=campaign capacity;
- y_j=a distance (e.g., radii) from the user j; and
- z_i=a distance from the advertising campaign i.

For the optimization function above (eq. 9), assume each user j's page has a zone available (e.g., free), when a campaign i is matched to a user j. As such, x_ij=1 indicates a campaign i has been assigned to a free zone of the user j. When x_ij=0, a campaign has not been assigned to a free zone for the user j, and the free zone either remains free or, in some examples, a default campaign is assigned to the zone.

FIG. 15 illustrates a bipartite graph 1500 that represents the assignment of advertising campaigns 1502 (campaign nodes) to users 1504 (user nodes) for a website that includes a plurality of advertising campaign zones. The bipartite graph 1500 further includes a source node 1506 and a sink node 1508. Edges from the source node 1506 to each advertising campaign 1502 indicate a campaign capacity “b(x)” which, in this example, is different for all advertising campaigns 1502. Edges from each of the advertising campaigns nodes to the user nodes indicate a value (e.g., weight) “s(x,y)” for each edge. The value may represent user-campaign values 903, for example. Although not illustrated for simplification purposes, an edge may exist between each advertising campaign node and each user node. Further, edges from each user node to the sink indicate a number of advertising campaigns that are assigned to each user. In this example, “k” advertising campaigns are assigned to each user. The advertising campaigns may be displayed to each user, for example, in the plurality of advertising campaign zones of the website.

Referring back to FIG. 9, to determine what “k” advertising campaigns (e.g., as identified by campaign data 310) are assigned to each user (e.g., the set of candidate users 420), user campaign assignment determination engine 902 may implement (e.g., execute) the optimization function from above (eq. 9) or the following relaxed optimization function, and the following minimization function.

Relaxed Optimization Function (eq. 11):

$\max \sum_{(i, j)} s_{ij} x_{ij}$

such that:

$\sum_{j} x_{ij} \leq b \forall i$

- where:
- 0≤x_ij≤1 ∀(i,j);
- i=an advertising campaign;
- j=a user;
- b=campaign capacity;
- s_ij=user-campaign value.

Minimization Function (eq. 12):

$\min \sum_{j} b_{j} y_{j} + k \sum_{i} z_{i} + \sum_{(i, j)} θ_{ij}$

such that:

$\begin{matrix} y_{j} + z_{i} \geq s_{ij} & \forall (i, j) \\ y \geq 0 & \forall j \\ z_{i} \geq 0 & \forall i \\ θ_{ij} \geq 0 & \forall (i, j) \end{matrix}$

- where:
- b_i=capacity of advertising campaign i;
- y_j=a distance (e.g., radii) from the user j;
- z_i=a distance from the advertising campaign i; and
- θ_ij=a distance from a center of edge i, j.

In some examples, user campaign assignment determination engine 902 may assign advertising campaigns to the set of candidate users 420 based on linear programming algorithms, such as by executing a linear programming (LP) solver (e.g., a classical LP solver). The LP solver may be based on, for example, a simplex algorithm, an interior point method, or an ellipsoid algorithm. The range of variables fed to the LP solver may be relaxed to real domains, and the output values of the LP solver may be rounded, for example, to 0 or 1. User campaign assignment determination engine 902 may assign advertising campaigns to the set of candidate users 420 based on the rounded output values.

In some examples, user campaign assignment determination engine 902 may assign advertising campaigns to the set of candidate users 420 based on a score-based greedy algorithm. For example, user campaign assignment determination engine 902 may sort advertising campaign node to user node edges by weight (e.g., s(x,y), user-campaign values). The edges are looped through as sorted (e.g., from greatest to least weight), where an advertising campaign is matched to a user if no constraints (e.g., campaign and user constrains) are violated. Otherwise, if a constraint is violated, the edge is skipped, and the next edge is considered. One constraint may be, for example, a campaign capacity for an advertising campaign. Another constraint may be a total number of advertising campaigns a user may be matched to (e.g., “k”). If the advertising campaign has already been assigned (e.g., or displayed) to more than a maximum number of users identified by the campaign capacity, the edge is skipped. For example, user campaign assignment determination engine 902 may implement the following algorithm to match advertising campaigns to users:

Input: A weighted bipartite graph G(C, U, E) where C is a set of campaigns, U is a set of users and

E is the set of edges (u_i, c_j) representing the score of a campaign c_jfor a user u_i.

Assumptions:

1:
Let k be the number of campaigns that we need to show to each user.

2:
Let capacity(u_i) be the number of campaigns that can be shown to the user u_i.

3:
Let capacity(c_j) be the maximum number of users to which we can match the campaign c_j.

4:
Let score(u_i, c_j) be the score of the campaign c_jwith respect to the user u_i

Greedy Algorithm:

1:
Initialize capacity(u_i) and capacity(c_j) to k and b_j, respectively for u_i∈ U and c_j∈ C.

2:
Let S be the sorted list of edges of E based on their assigned scores in descending order.

3:
for the next edge (u_i, c_j) in S do

4:
if capacity(c_j) > and capacity(u_i) > 0 then

5:
Assign the campaign c_jto the user u_i.

6:
capacity(c_j) ← capacity(c_j) − 1

7:
capacity(u_i) ← capacity(u_i) − 1

Output: Report the assigned campaigns to each user.

As another example, user campaign assignment determination engine 902 may assign advertising campaigns to the set of candidate users 420 based on a user-based greedy algorithm. For example, user campaign assignment determination engine 902 may, for each user, loop through advertising campaigns. If constraints are satisfied for the user and an advertising campaign, the advertising campaign is matched to the user. Otherwise, the advertising campaign is skipped for the user. Once a user has been matched with a predetermined number of advertising campaigns, advertising campaigns are attempted to be matched to a next user. The users may be considered in any order, such as a random order, for example. As an example, user campaign assignment determination engine 902 may implement the following algorithm to match advertising campaigns to users:

Input: A weighted bipartite graph G(C, U, E) where C is a set of campaigns, U is a set of users and

E is the set of edges (u_i, c_j) representing the score of a campaign c_jfor a user u_i.

Assumptions:

1:
Let k be the number of campaigns that we can show to each user.

2:
Let capacity(u_i) be the number of campaigns that can be shown to the user u_i.

3:
Let capacity(c_j) be the maximum number of users to which we can match the campaign c_j.

4:
Let score(u_i, c_j) be the score of the campaign c_jwith respect to the user u_i

Greedy Algorithm:

1:
Initialize capacity(u_i) and capacity(c_j) to k and b_j, respectively for u_i∈ U and c_j∈ C.

2:
for each user u_ido

3:
while there exists a campaign c_jfor which score(u_i, c_j) > 0 do

4:
Let c_jbe the next campaign whose score(u_i, c_j) is maximum among campaigns left for u_i

5:
if capacity(c_j) > 0 and capacity(u_i) > 0 then

6:
Assign the campaign c_jto the user u_i.

7:
capacity(c_j) ← capacity(c_j) − 1

8:
capacity(u_i) ← capacity(u_i) − 1

Output: Report the assigned campaigns to each user.

In yet another example, user campaign assignment determination engine 902 may assign advertising campaigns to the set of candidate users 420 based on a “revenue-based greedy” algorithm. For example, user campaign assignment determination engine 902 may, for each user, loop through advertising campaigns. For each advertising campaign, user campaign assignment determination engine 902 determines a top number (e.g., a percentage, such as 25%) of items for the user (e.g., based on user-item affinity scores), and adjusts the weights of the corresponding advertising campaign node to user node edge (e.g., s(x,y), user-campaign value) based on a revenue of the top number of items for the user. The revenue for each item may be determined, for example, by determining a number of the item sold and a price of the item (e.g., from user transaction data 340), and multiplying the number of item sold by the price of the item. In some examples, the revenue of each item is stored in database 116, and can be directly obtained from database 116. The revenue for the top number of items for the user may be determined by adding the revenue for each of the top number of items.

The weights of the advertising campaign node to user node edge may also be adjusted based on an overall capacity remaining for the advertising campaign. The user is then matched to one or more of the advertising campaigns based on the adjusted weights for the advertising campaigns for the user. As an example, user campaign assignment determination engine 902 may implement the following “revenue-based greedy” algorithm to match advertising campaigns to users:

Input: A weighted bipartite graph G ( custom-character

, E) where custom-character

is a set of campaigns, custom-character

is a set of users and

E is the set of edges ( custom-character

, c_j) representing the score of a campaign c_jfor a user custom-character

.

Assumptions:

1:
Let k be the number of campaigns that we can show to each user.

2:
Let capacity ( custom-character

) be the number of campaigns that can be shown to the user custom-character

.

3:
Let capacity (c_j) be the maximum number of users to which we can match the campaign c_j.

4:
Let score ( custom-character

, c_j) be the score of the campaign c_jwith respect to the user custom-character

Greedy Algorithm:

1:
Initialize capacity ( custom-character

) and capacity (c_j) to k and b_j, respectively for custom-character

∈

U and c_j∈ custom-character

.

2:
for each user custom-character

do

3:
for each campaign c_jdo

4:
Let custom-character

(c_j,

) be the top 25% of items in the campaign c_jscored based on custom-character

preference.

5:
Let score ( custom-character

, c_j) and revenue ( custom-character

, c_j) be the mean score and price of custom-character

(c_j,

) respectively.

6:

new - score (u_{i}, c_{j}) \leftarrow score (u_{i}, c_{j}) \cdot (1 - e^{- capacity (c_{j})}) \cdot (1 - e^{- revenue (u_{i}, c_{j})})

7:
Let campaign ( custom-character

) be the top-k campaigns for the user custom-character

based on the new-score ( custom-character

, c_j).

8:
for each campaign c_j∈ campaign ( custom-character

) do

9:
capacity (c_j) ← capacity (c_j) − 1.

Output: Report the assigned campaigns to each user.

User campaign assignment determination engine 902 generates user campaign assignment data 905 identifying the assignment of the one or more advertising campaigns to each of the set of candidate users 420, and provides user campaign assignment data 905 to user-based campaign zone assignment engine 904. User-based campaign zone assignment engine 904 can assign, for each of the set of candidate users 420, the corresponding one or more advertising campaigns to a plurality of advertising campaign zones of a webpage. For example, user-based campaign zone assignment engine 904 may assign a number of advertising campaigns for a user to a number of advertising campaign zones of a webpage in such a manner that enhances an overall diversity of the webpage.

To assign the advertising campaigns to the plurality of advertising campaign zones of the webpage, user-based campaign zone assignment engine 904 may determine a diversity value between the advertising campaigns, and a distance value between the plurality of advertising campaign zones of the webpage. For example, user-based campaign zone assignment engine 904 may compute an item embedding (e.g., p_i) for each of the items in each advertising campaign. User-based campaign zone assignment engine 904 may identify the items in each advertising campaign based on campaign data 310. The item embeddings may be computed based on catalog data 370 stored in database 116 for each item. For example, each item embedding may be represented by a vector, such as a 512 dimensional vector. For each advertising campaign, user-based campaign zone assignment engine 904 may generate a campaign embedding based on the values of the item embeddings corresponding to the items in each advertising campaign. For example, user-based campaign zone assignment engine 904 may determine a campaign embedding for an advertising campaign by determining an average (e.g., average value) of the item embeddings for items that belong to that advertising campaign. In the example where item embeddings are a 512 dimensional vector, the campaign embedding may also be a 512 dimensional vector. For example, the campaign embedding may be determined in accordance with the equation below.

$\begin{matrix} c_{i} = \frac{1}{n} \sum_{j = 1}^{n} p_{j} & (eq . 13) \end{matrix}$

- where c_idenotes the campaign embedding of campaign i which consists of n items with item embeddings denoted by p₁, p₂, . . . , p_n.

Based on the campaign embeddings, user-based campaign zone assignment engine 904 may determine a diversity value between advertising campaigns. For example, for a pair of advertising campaigns assigned to a user, user-based campaign zone assignment engine 904 may determine a similarity, such as a cosine similarity, between campaign embedding vectors for the pair of advertising campaigns. Based on the similarity, user-based campaign zone assignment engine 904 may determine a diversity between the pair of advertising campaigns. For example, user-based campaign zone assignment engine 904 may determine the similarity and diversity between two advertising campaigns in accordance with the equations below.

similarity(c_i,c_j)=c_j^Tc_i (eq. 14)

diversity(c_i,c_j)=1−similarity(c_i,c_j) (eq. 15)

- where:
- c_i=a first campaign embedding;
- c_j=a second campaign embedding; and
- T=a transpose operation.

User-based campaign zone assignment engine 904 may further determine a distance between advertising campaign zones. The distance may be a relative distance with respect to the advertising campaign zones. For example, a distance between two advertising campaign zones that are further apart (as displayed on the webpage) may be different (e.g., higher) than a distance between two advertising campaign zones that are relatively closer to each other. As an example, and with reference to FIG. 8A, user-based campaign zone assignment engine 904 may determine the distance between first advertising campaign zone 802 and second advertising campaign zone 804 to be 1, and a distance between first advertising campaign zone 802 and third advertising campaign zone 806 to be 2.

User-based campaign zone assignment engine 904 may assign the advertising campaigns to the advertising campaign zones based on the determined advertising campaign diversities and advertising campaign zone distances. For example, for each user (e.g., as identified by the set of candidate users 420), user-based campaign zone assignment engine 904 may assign the advertising campaign with the highest user-campaign value 903 to a first advertising campaign zone of the webpage. The first advertising campaign zone may be the first one appearing on the webpage from the top down, such as first advertising campaign zone 802 in FIG. 8A. The assigned advertising campaign is then removed from advertising campaigns available to be assigned (for this user). For each subsequent advertising campaign zone, user-based campaign zone assignment engine 904 may assign, from the remaining advertising campaigns, the advertising campaign that maximizes a function, such as the function below.

$\begin{matrix} F (u_{i}, c_{j}, z_{r}) = new - score (u_{i}, c_{j}) + η \cdot \sum_{ = 1}^{r - 1} \frac{diversity (c_{j}, c_{z_{}})}{distance (z_{r}, z_{})} & (eq . 16) \end{matrix}$

- where:
- u_i=a user;
- z_r=an advertising campaign zone;
- c_j=an advertising campaign (e.g., campaign embedding);
- η=a weighting value (e.g., predetermined coefficient);
- new-score(u_i, c_i)=relationship value between the user and the advertising campaign (e.g., user-campaign value 903);
- diversity(c_j, c_z_f)=diversity between the two advertising campaigns; and
- distance(z_r, z_l)=distance between the two advertising campaign zones

As an example, user-based campaign zone assignment engine 904 may assign the advertising campaigns to the advertising campaign zones based on the implementation of the “greedy for campaign-zone matching” algorithm below:

Input: For each user custom-character

we have a set custom-character

(

) of k selected campaigns. We have a set custom-character

= {z₁, . . . , z_k}

of k zones.

Assumptions:

1:
Let k be the number of campaigns that we can show to each user.

2:
Let score ( custom-character

, c_j) be the score of the campaign c_jwith respect to the user custom-character

3:
Let diversity (c_j, c_r) be a metric that determines the diversity between two campaigns c_jand c_r.

4:
Let distance (z_r, custom-character

) be a metric that determines the distance between two zones z_rand custom-character

.

5:
Let η ≥ 0 be the learning rate.

Greedy Algorithm:

1:
for each user custom-character

do

2:
Assign the campaign c_j∈ custom-character

(

) that has the highest score ( custom-character

, c_j) to the first zone z_l.

3:
custom-character

(

) =

(

)\{c_j}.

4:
for r = 2 to k do

5:
Select the campaign c_j∈ custom-character

(

) that maximizes

F (u_{i}, c_{j}, z_{r}) = new - score (u_{i}, c_{j}) + η \cdot \sum_{ = 1}^{r - 1} \frac{diversity (c_{j}, c_{z_{}})}{distance (z_{r}, z_{})},

where

is the zone custom-character

and

is the campaign assigned to the zone custom-character

.

6:
Assign the campaign c_jto the zone z_r.

7:
custom-character

(

) =

(

)\{c_j}.

Output: A list of k zones with the assigned campaigns for each user custom-character

FIG. 16 illustrates an example of the above algorithm in assigning an advertising campaign to a third zone 1606 of a webpage. In this example, advertising campaign 1608 has been assigned to a first zone 1602 of the webpage, and advertising campaign 1610 has been assigned to a second zone 1604 of the webpage. To determine an advertising campaign to be assigned to the third zone 1606, an advertising campaign that maximizes the function 1618 is determined, as illustrated by maximization function 1620.

Referring back to FIG. 9, in some examples, to assign a plurality of advertising campaigns to a user and to assign the plurality of advertising campaigns to a plurality of advertising campaign zones of a website, user campaign assignment determination engine 902 and user-based campaign zone assignment engine 904 can, alone or in combination, implement the following algorithm, which references the “Revenue-Based Greedy” and “Greedy for Campaign-Zone Matching” algorithms described above:

Input: A weighted bipartite graph G ( custom-character

, E) where custom-character

is a set of campaigns, custom-character

is a set of users and

E is the set of edges ( custom-character

, c_j) representing the score of a campaign c_j, for a user custom-character

.

Assumptions:

1:
Let k be the number of campaigns that we can show to each user.

2:
Let capacity ( custom-character

) be the number of campaigns that can be shown to the user custom-character

.

3:
Let capacity (c_j) be the maximum number of users to which we can match the campaign c_j.

4:
Let score ( custom-character

, c_j) be the score of the campaign c_jwith respect to the user custom-character

.

5:
Let custom-character

₁, . . . , custom-character

_xbe the m machines available for the MapReduce algorithm.

Greedy Algorithm:

1:
Partition custom-character

randomly into sets custom-character

₁,

₂, ...

_x.

2:
Send the subgraph G ( custom-character

_i, E[

_i]) to the machine custom-character

_iwhere E[ custom-character

_i] is the set of edges

between users _{i} and campaigns C and assign \frac{capacity (c_{j})}{x} to each campaign c_{j} .

3:
for each each machine custom-character

_ido

4:
Invoke Revenue-Based Greedy with the input subgraph G ( custom-character

_i, E[

_i]).

5:
for each user u_j∈ custom-character

_ido

6:
Let custom-character

(u_j) be the set of campaigns assigned to a user u_j∈ custom-character

_i.

7:
Invoke Greedy for Campaign-Zone Matching for custom-character

(u_j).

Output: A list of k zones with the assigned campaigns for each user u_j.

In some examples, the above algorithm represents a parallel implementation of the “Revenue-Based Greedy” and “Greedy for Campaign-Zone Matching” algorithms. For example, the “Revenue-Based Greedy” and “Greedy for Campaign-Zone Matching” algorithms may be implanted in parallel on a number of machines (e.g., processors), such as on one or more servers or multiple processors of digital advertisement computing device 102. In some examples, the input data is distributed to the machines and a computational task is executed on each machine. All sub-solutions computed on the machines may then be transmitted to a coordinator (e.g., a server), and the sub-solutions may be merged to output an overall solution.

User-based campaign zone assignment engine 904 generates user campaign zone assignment data 907 identifying and characterizing the assignments of the advertising campaigns to the advertising campaign zones for each user (e.g., the set of candidate users 420), and provides user campaign zone assignment data 907 to campaign/item recommendation determination engine 424.

Based on user campaign zone assignment data 907, user item affinity scores 426 for each advertising campaign, and candidate users 420, campaign/item recommendation determination engine 424 determines zone-based user item ad data 909 that identifies and characterizes the items to be promoted to each candidate user in each advertising campaign zone of a website. For example, zone-based user item ad data 909 may include a ranking of the items for each advertising campaign to be promoted for each candidate user, as well as an indication of which advertising campaign zone (e.g., first advertising campaign zone 802, second advertising campaign zone 804, third advertising campaign zone 806) of the website advertisements for the items are to be displayed in. Zone-based user item ad data 909 may be provided to, for example, web server 104, which may display advertisements and/or promotions for the identified items in the corresponding advertising campaign zones when the corresponding user is visiting the webpage. In some examples, web server 104 displays the advertisements and/or promotions of each advertising campaign to each candidate user according to the item rankings.

In some examples, digital advertisement computing device 102 assigns advertising campaigns to a user in real-time, such as when the user visits a webpage (e.g., is browsing the webpage). Digital advertisement computing device 102 may also assign the advertising campaigns to the advertising campaign zones of the webpage in real-time as well. In some examples, digital advertisement computing device 102 determines the advertising campaign assignments and advertising campaign zone assignments periodically (e.g., nightly or monthly), and stores them (e.g., via zone-based user item ad data 909) in a database, such as database 116. As such, when a user visits the webpage, digital advertisement computing device 102 obtains the advertising campaigns and their assignments to advertising campaign zones from database 116, and provides them to the web server 104 (e.g., via zone-based user item ad data 909).

FIG. 10 is a flowchart of an example method 1000 that can be carried out by the digital advertisement identification system 100 of FIG. 1. Beginning at step 1002, a computing device, such as digital advertisement computing device 102, obtains campaign data identifying a plurality of items to promote for each of a plurality of advertising campaigns. At step 1004, campaign user data is generated for each of the plurality of advertising campaigns. The campaign user data identifies a campaign user that has purchased the plurality of items to promote. At step 1006, user attributes for each of the plurality of users are determined (e.g., based on user attribute data 360).

Proceeding to step 1008, item attributes for items previously purchased by each of the plurality of users is determined. For example, digital advertisement computing device 102 may obtain user transaction data 340 identifying purchases for a user, and determine the item attributes for the purchased items based on catalog data 370. At step 1010, user embedding data is generated for each of the plurality of users. The user embedding data is generated based on the item attributes of the items purchased by the user and the user attributes.

At step 1012, a campaign score for each user and advertising campaign pair is generated. The campaign score is generated based on the user embedding data generated for the user and the campaign user data. For example, digital advertisement computing device 102 may generate a user-campaign score for the user and corresponding advertising campaign based on the similarity of the generated user embeddings to the campaign user data. The similarity of the generated user embeddings to the campaign user data may be determined based on execution of an ANN algorithm.

Proceeding to step 1014, the campaign score for each user and campaign pair is adjusted based on a capacity of each campaign and a revenue of the items to promote in each advertising campaign. At step 1016, the plurality of advertising campaigns are assigned to each of the plurality of users based on the corresponding adjusted campaign scores and the capacity of each advertising campaign. For example, digital advertisement computing device 102 may implement and execute the “revenue-based greedy” algorithm described above to adjust the campaign scores and assign the advertising campaigns to each user.

The method then proceeds to step 1018, where the plurality of items for each assigned advertising campaign are displayed to the plurality of users. For example, the plurality of items for each assigned advertising campaign are displayed to the corresponding user when the user browses a webpage. The method then ends.

FIG. 11 is a flowchart of an example method 1100 that can be carried out by the digital advertisement identification system 100 of FIG. 1. Beginning at step 1102, a computing device, such as digital advertisement computing device 102, receives a request to assign a plurality of advertising campaigns to a plurality of advertising campaign zones of a webpage for a user. For example, web server 104 may transmit a request to digital advertisement computing device 102 for a plurality of advertising campaigns that are to be displayed to the user in a plurality of advertising campaign zones of a website hosted by web server 104. At step 1104, assignments of the plurality of advertising campaigns to the user and corresponding advertising campaign scores are obtained, such as from database 116. For example, the assignments of the plurality of advertising campaigns to the user and the corresponding advertising campaign scores may have been predetermined and stored in database 116 by digital advertisement computing device 102.

Proceeding to step 1106, an advertising campaign corresponding to the highest advertising campaign score is determined and, at step 1108, the determined advertising campaign is assigned to a first advertising campaign zone (e.g., first advertising campaign zone 802) of the plurality of advertising campaign zones of the website.

At step 1110, a determination is made as to whether there are any remaining advertising campaign zones of the plurality of advertising campaign zones to be assigned an advertising campaign. If at least one of the plurality of advertising campaign zones is to be assigned an advertising campaign, the method proceeds to step 1112.

At step 1112, distance values are determined between the current advertising campaign zone and any already assigned advertising campaign zones. For example, digital advertisement computing device 102 may compute the distance values based on a relative distance between the current advertising campaign zone and any already assigned advertising campaign zones. At step 1114, a diversity value between each unassigned advertising campaign and each assigned advertising campaign. For example, digital advertisement computing device 102 may compute the diversity values based on a cosine similarity between campaign embedding vectors generated for the pair of advertising campaigns.

Proceeding to step 1116, an unassigned advertising campaign is assigned to the current advertising campaign zone based on the advertising campaign scores, the distance values, and the diversity values. For example, digital advertisement computing device 102 may implement and execute the “greedy for campaign-zone matching” algorithm described above to assign an unassigned advertising campaign to the current advertising campaign zone.

The method then proceeds back to step 1110, to determine if any additional advertising campaign zones remain to be assigned to advertising campaigns. If all of the plurality of advertising campaign zones have been assigned an advertising campaign, the method proceeds to step 1118. At step 118, the assigned advertising campaigns are displayed to the user in the assigned advertising campaign zones of the website. The method then ends.

FIG. 12 is a flowchart of another example method 1200 that can be carried out by the digital advertisement identification system 100 of FIG. 1. Beginning at step 1202, a computing device, such as digital advertisement computing device 102, obtains assignments of a plurality of advertising campaigns to a plurality of advertising campaign zones of a webpage for a user. The assignments may be obtained from a database, such as database 116. For example, the assignments may have been predetermined by digital advertisement computing device 102 (e.g., in accordance with the method of FIG. 10), and stored in database 116. At step 1204, user item affinity scores are generated for the user for each item of a plurality of items of each assigned advertising campaign. For example, digital advertisement computing device 102 may generate the user-item affinity scores based on execution of an SVD or SVD++ algorithm.

Proceeding to step 1206, for each assigned advertising campaign, a ranking of the plurality of items is determined based on the corresponding user item affinity scores. For example, for a given advertising campaign, digital advertisement computing device 102 may rank items with higher user item affinity scores above items with lower user item affinity scores. The method then proceeds to step 1208, where the plurality of items for each assigned advertising campaign are displayed to the user based on the rankings. Each assigned advertising campaign is displayed in the assigned advertising campaign zone (as identified by the obtained assignments in step 1202). For example, an advertising campaign zone may display the plurality of items of an assigned advertising campaign according to the ranked order of the plurality of items (e.g., higher ranked items appear before lower ranked items). The method then ends.

FIG. 13 is a flowchart of yet another example method 1300 that can be carried out by the digital advertisement identification system 100 of FIG. 1. Beginning at step 1302, a computing device, such as digital advertisement computing device 102, determines that a user is accessing a website. For example, digital advertisement computing device 102 may receive an indication from web server 104 that a particular user is browsing a webpage hosted by web server 104. The indication may include a request for items to advertise, for example. At step 1304, a campaign score is generated for each of a plurality of advertising campaigns that can be displayed to the user. For example, digital advertisement computing device 102 may generate the campaign scores for the user based on a determined similarity of generated user embeddings to campaign user data for each advertising campaign. The similarity of the generated user embeddings to each campaign user data may be determined based on execution of an ANN algorithm, for example.

Proceeding to step 1306, a number of advertising campaigns are determined for the user based on the campaign scores. The number of advertising campaigns determined may correspond to a number of advertising campaign zones the website displays. For example, assuming the website includes three advertising campaign zones, digital advertisement computing device 102 may determine the three advertising campaigns with the three highest campaign scores.

At step 1308, the number of advertising campaigns are assigned to a number of advertising campaign zones of the website. The assignments may be based on determined advertising campaign zone distance values and determined campaign diversity values. For example, digital advertisement computing device 102 may determine the advertising campaign zone distance values based on relative distances between the advertising campaign zones of the website, and may determine the campaign diversity values based on cosine similarities between the advertising campaigns. Digital advertisement computing device 102 may then determine the assignments based on maximizing a function that operates on the advertising campaign zone distance values and the campaign diversity values, such as the function defined by equation 8 described above.

Proceeding to step 1310, the plurality of items in each assigned advertisement campaign are ranked (e.g., based on user-item affinity scores). The method then proceeds to step 1312, where zone-based user item advertisement data is generated. The zone-based user item advertisement data identifies the ranking of the plurality of items for each assigned advertising campaign for each advertising campaign zone of the website. The zone-based user item advertisement data may be transmitted. For example, digital advertisement computing device 102 may transmit the zone-based user item advertisement data to web server 104. Web server 104 may display the plurality of items for each assigned advertising campaign in ranked order in the assigned advertising campaign zone of the website. The method then ends.

Although the methods described above are with reference to the illustrated flowcharts, it will be appreciated that many other ways of performing the acts associated with the methods can be used. For example, the order of some operations may be changed, and some of the operations described may be optional.

In addition, the methods and system described herein can be at least partially embodied in the form of computer-implemented processes and apparatus for practicing those processes. The disclosed methods may also be at least partially embodied in the form of tangible, non-transitory machine-readable storage media encoded with computer program code. For example, the steps of the methods can be embodied in hardware, in executable instructions executed by a processor (e.g., software), or a combination of the two. The media may include, for example, RAMs, ROMs, CD-ROMs, DVD-ROMs, BD-ROMs, hard disk drives, flash memories, or any other non-transitory machine-readable storage medium. When the computer program code is loaded into and executed by a computer, the computer becomes an apparatus for practicing the method. The methods may also be at least partially embodied in the form of a computer into which computer program code is loaded or executed, such that, the computer becomes a special purpose computer for practicing the methods. When implemented on a general-purpose processor, the computer program code segments configure the processor to create specific logic circuits. The methods may alternatively be at least partially embodied in application specific integrated circuits for performing the methods.

The foregoing is provided for purposes of illustrating, explaining, and describing embodiments of these disclosures. Modifications and adaptations to these embodiments will be apparent to those skilled in the art and may be made without departing from the scope or spirit of these disclosures.

	Number	Date	Country
Parent	16455274	Jun 2019	US
Child	16748753		US

METHODS AND APPARATUS FOR AUTOMATICALLY PROVIDING DIGITAL ADVERTISEMENTS

Information

Publication Number

Date Filed

Date Published

Inventors

Original Assignees

CPC

International Classifications

Abstract

Description

Claims

CROSS-REFERENCE TO RELATED APPLICATIONS

Continuation in Parts (1)