Microsoft Technology Licensing, LLC

Airbnb, Inc.

Linkedin Corporation

Ganesh Venkataraman

Dhruv Arya

Shakti Dhirendraji Sinha

Aman Grover

Liang Zhang

Benjamin Hoan Le

Shike Mei

Shawn Chen

Teng Wang

Krishnaram Kenthapadi

Lin Guo

Yi Li

Saurabh Kataria

Kimberly Faith McManus

Victor Chen

Yongwoo Noh

Mario Sergio Rodriguez

Viet Thuc Ha

Abhimanyu Lad

Asif Mansoor Ali Makhani

Ramesh Dommeti

Senthil Sundaram

Viet-Ha Thuc

A cost-focused determination of whether to deliver an electronic advertisement or notice to a particular user can be made through a cumulative consideration of the predicted return on investment over each of a plurality of electronic channels. A plurality of channel-specific budget values are calculated for the user, one for each channel, each setting an upper spending limit for advertisement to the user over that channel based on the user's information and their activity on the channel. A global budget is calculated for the user using a weighted aggregation of the channel-specific values, information about the user and their activity with the advertiser, and consideration of 'overlap' effects of advertising to the same user on several channels. When managing whether to deliver an advertisement over a channel, if the channel-specific value is lower than the global budget, the advertisement is delivered, and the global budget is decreased by a complementary amount.

Cross-channel personalized marketing optimization

One of more unique products can be selected for advertisement over a digital marketing channel. The selection is based on the calculation of a base impression budget, calculated per product per day, which calculation considers information related to a product, including supply and demand at the market level, characteristics of the property, and popularity of the listing. A real-time, or current, impression budget is calculated to determine whether a particular product should be recommended to a user. Every time the product is advertised to a user, a user intent value is calculated, indicating the user's likelihood of purchasing the product within a given period of time, along with the user intent of every user to which the product has been advertised. The user intent calculation may consider information specific to the user, such as the user's activity history and profile. These user intent values are subtracted from the base impression budget to obtain a real-time impression budget. If the real-time budget is greater than zero, the product will be advertised to a user. By these means, a bound is set on the number of times a product may be advertised before it is assumed to be sold.

Recommending unique product inventory

Various embodiments described herein provide for systems and methods for using a machine-learning model to rank job search results based on the similarity of the job title of each job search result and a job search query that produces the job search results. According to some embodiments, the machine-learning model comprises a word-embedding machine-learning model that maps a word to a vector.

Search query and job title proximity computation via word embedding

In an example embodiment, one or more query terms are obtained. For each of the one or more query terms, a standardized entity taxonomy is searched to locate a standardized entity that most closely matches the query term. A confidence score is calculated for the query term-standardized entity pair for the standardized entity that most closely matches the query term. In response to a determination that the confidence score transgresses a threshold, the query term is associated with an entity identification corresponding to the standardized entity that most closely matches the query term. One or more query rewriting rules corresponding to an entity type of the standardized entity having the entity identification are obtained. The one or more query rewriting rules are executed to rewrite the first query such that the rewritten query, when performed on a data source, returns fewer search results than the first query would have.

Entity based query filtering

Methods, systems, and computer programs are presented for expanding a job search that includes an industry by adding other similar industries. A method identifies job titles of members in a social network and performs, utilizing a machine-learning program, semantic analysis of the job titles to identify similarity coefficients among the job titles. The machine-learning program utilizes social network data to identify the similarity coefficients. Further, the method includes an operation for receiving a job search query, from a first member, including a query job title, and for expanding the job search query with job titles that are similar to the query job title. The method further includes operations for executing the expanded job search query to generate a plurality of job results, and for causing presentation on a display of one or more of the top job results.

Determining similarities among job titles to enhance job searching

In an example embodiment, a machine learning algorithm is used to train a deep semantic similarity neural network to output a semantic similarity score between a candidate job search query and a candidate job search result. This semantic similarity score can then be used in a ranking phase to rank job search results in response to a first job search query.

Semantic similarity for machine learned job posting result ranking model

In an example embodiment, a machine learning algorithm is used to train a query-based deep semantic similarity neural network to output a query context vector in a vector space that includes both query context vectors and document context vectors. Both the query context vectors and document context vectors are clustered using a clustering algorithm. When an input search query is obtained, the input search query is also passed into the query-based deep semantic similarity neural network and its output document context vector assigned to a first cluster based on the clustering algorithm. Documents within the first cluster are then retrieved in response to the input search query.

Semantic clustering based retrieval for candidate set expansion

This disclosure relates to systems and methods for searching names using name clusters. A method includes receiving names, generating a plurality of phonetic cluster identifiers, forming a plurality of name clusters by grouping the names having an equivalent cluster id, removing names from the respective name clusters that differ from a root name by more than either a particular spelling of a phonetic sound or a specific member's reformulation according to a reformulation dictionary, and suggesting one or more names by generating a phonetic cluster id for the received name using the database of phonetic associations and returning names found in the name cluster that matches the phonetic cluster id.

Search engine using name clustering

A user submits a job search query in an online social networking system. The online social networking system calculates a score based on the similarity between the job search query and the profile of the user. When the score transgresses a threshold, the job search query is enhanced by adding data from the profile of the user to the job search query. The job search query is then used to search for, identify, and display jobs in the online social networking system.

Personalized job search and recommendations using job seeker behavioral features

Methods, systems, and computer programs are presented for expanding a job search that includes an industry by adding other similar industries. A method accesses, by a social networking server, a plurality of job applications, with each job application being submitted by a member for a job in a company, the member and the job having a respective industry from a plurality of industries. Semantic analysis of the job applications is performed by a machine-learning program to identify similarity coefficients among the plurality of industries. A job search query is received from a first member, the job search query including a query industry, and the job search query is expanded with industries that are similar to the query industry. The social networking server executes the expanded job search query to generate a plurality of job results. Presentation is provided on a display of one or more of the top job results.

Determining similarities among industries to enhance job searching

A trained search system can be configured to retrieve a candidate subset of results, where the trained search system uses data extracted from a machine learning scheme. The machine learning scheme can be trained to identify results that are ranked by a computationally expensive algorithm, such as a ranking algorithm. When a query is received, the trained search system can be used to retrieve results instead of applying the computationally expensive ranking algorithm.

Candidate search result generation

The disclosed subject matter involves identifying clusters and segments of a population of data for use in a recommendation service. Clusters of members or items are formed, where the clusters, or partitions are close to being equal in size. Items are distributed based on similarities identified with matrix factorization. The items are formed into clusters based on the similarities and the clusters are used in training of a generalized linear mixed model treating the clusters as random-level effects. The trained model may be used in the recommendation service. Other embodiments are described and claimed.

Member clustering with equi-sized partitions

The disclosed subject matter involves identifying clusters and segments of a population of data for use in a recommendation service. Clusters of members or items are formed, where the clusters, or partitions are close to being equal in size, items are distributed based on similarities identified with matrix factorization. A matrix used in the matrix factorization is customized based on the recommendation type. The items are formed into clusters based on the similarities and the clusters are used in training of a generalized linear mixed model treating the clusters as random-level effects. The trained model may be used in the recommendation service. Other embodiments are described and claimed.

Growing community of inventors

San Jose, CA, United States of America

Ganesh Venkataraman