Abstract: Technology for predicting online user shopping behavior, such as whether a user will purchase a product, is described. An example method includes receiving current session data describing a current session for a current user, extracting a current clickstream from the current session data classifying the current clickstream as a purchase clickstream or a non-purchase clickstream by processing the current clickstream using one or more sets of Hidden Markov Model parameters produced by one or more Hidden Markov Models, and computing, using the one or more computing devices, a purchase probability that the current user will purchase a product during the current session based on the classifying.

Abstract: The disclosure relates in some cases to a technology for selecting one or more promotions to be presented to online customers using Bayesian bandits and affinity-based dynamic user clustering In some embodiments, a computer-implemented method determines a set of offers is determined, and computes affinity scores measuring affinities of users to items included in the offers. The method builds an affinity score distribution for the offers and identifies clusters of affinity scores for the offers using the corresponding affinity score distribution.

Abstract: A computer-implemented method and system are described for learning a vector representation for unique identification codes. An example method may include generating a unique identification code list using one or more virtual interaction contexts, the unique identification code list being a list of unique identification codes, selecting a target unique identification code in the unique identification code list, and determining, from the unique identification code list, an input set of unique identification codes using the target unique identification code, the input set including the target unique identification code and one or more context unique identification codes. Some implementations may further include inputting the input set of unique identification codes into a semantic neural network model, the semantic neural network model including one or more weight matrices, and modifying the one or more weight matrices using the input set of unique identification codes.

Abstract: Technology for selecting promotion(s) to display in a page of an application for display to a user is described. An example method includes determining a promotion for a product; calculating for the promotion a posterior distribution of a user-action probability reflecting estimates for a user response to a display of the promotion for the product on a computing device of the user; determining the posterior distribution as collapsing beyond a certain threshold; responsive thereto, calculating an uncollapsed posterior distribution of the user-action probability reflecting modified estimates for the user response to the display of the promotion for the product on a computing device of the user; storing the uncollapsed posterior distribution of the user-action probability in a response database; and determining whether to select the promotion from the promotion database for display on a computing device of the user based on the modified estimates.

Abstract: Technology for determining the order of the search results to maximize a financial goal is described. In an example embodiment, a method, implemented using the one or more computing devices, such as client and/or server devices, may receive a product search request from a user device associated with a user and retrieve a set of products from a product database based on the product search request. Based on a purchase probability and one or more of a margin and a price for that product, the method determines an expected financial gain for each of the products of the set and sorts the set of products into an ordered set of products having an order based on the expected financial gain associated with each of the products. The method may then provide the ordered set of products for display to the user on the user device.

Abstract: A computer-implemented method and system are described for learning a vector representation for unique identification codes. An example method may include generating a unique identification code list using one or more virtual interaction contexts, the unique identification code list being a list of unique identification codes, selecting a target unique identification code in the unique identification code list, and determining, from the unique identification code list, an input set of unique identification codes using the target unique identification code, the input set including the target unique identification code and one or more context unique identification codes. Some implementations may further include inputting the input set of unique identification codes into a semantic neural network model, the semantic neural network model including one or more weight matrices, and modifying the one or more weight matrices using the input set of unique identification codes.

Abstract: The disclosure relates in some cases to a technology for selecting one or more promotions to be presented to online customers using Bayesian bandits and affinity-based dynamic user clustering In some embodiments, a computer-implemented method determines a set of offers is determined, and computes affinity scores measuring affinities of users to items included in the offers. The method builds an affinity score distribution for the offers and identifies clusters of affinity scores for the offers using the corresponding affinity score distribution.

Abstract: Technology for selecting promotion(s) to display in a page of an application for display to a user is described. An example method includes determining a promotion for a product; calculating for the promotion a posterior distribution of a user-action probability reflecting estimates for a user response to a display of the promotion for the product on a computing device of the user; determining the posterior distribution as collapsing beyond a certain threshold; responsive thereto, calculating an uncollapsed posterior distribution of the user-action probability reflecting modified estimates for the user response to the display of the promotion for the product on a computing device of the user; storing the uncollapsed posterior distribution of the user-action probability in a response database; and determining whether to select the promotion from the promotion database for display on a computing device of the user based on the modified estimates.

Abstract: Technology for determining an optimal discounted price for a customer for a particular product is described. In an example embodiment, a method comprises determining a number of visits to a product page of a particular product by customers, calculating a purchase probability of a customer to purchase the particular product associated with the product page as a function of a price discount, determining a discount-corrected margin specific to the customer for the particular product based on the purchase probability of the customer, and calculating a predicted profit or a predicted revenue for the particular product resulting from the number of visits to the product page and based on the purchase probability and the discount-corrected margin of the particular product.

Abstract: Technology for predicting online user shopping behavior, such as whether a user will purchase a product, is described. An example method includes receiving current session data describing a current session for a current user, extracting a current clickstream from the current session data classifying the current clickstream as a purchase clickstream or a non-purchase clickstream by processing the current clickstream using one or more sets of Hidden Markov Model parameters produced by one or more Hidden Markov Models, and computing, using the one or more computing devices, a purchase probability that the current user will purchase a product during the current session based on the classifying.

Abstract: A process to form a FET using a replacement gate. An example feature is that the PMOS sacrificial gate is made narrower than the NMOS sacrificial gate. The PMOS gate is implanted preferably with Ge to increase the amount of poly sacrificial gate that is oxidized to form PMOS spacers. The spacers are used as masks for the LDD Implant. The space between the PLDD regions is preferably larger that the space between the NLDD regions because of the wider PMOS spacers. The PLDD tends to diffuse readily more than NLDD due to the dopant being small and light (i.e. Boron). The wider spacer between the PMOS regions improves device performance by improving the short channel effects for PMOS. In addition, the oxidization of the sacrificial gates allows trimming of sacrificial gates thus extending the limitation of lithography. Another feature of an embodiment is that a portion of the initial pad oxide is removed, thus reducing the amount of undercut created during the channel oxide strip for the dummy gate process.