Intuit, Inc.

Oren Sar Shalom

Alexander Zhicharevich

Yehezkel Shraga Resheff

Yair Horesh

Adi Shalev

Rami Cohen

Elik Sror

Shlomi Medalion

Noa Haas

Shimon Shahar

Sigalit Bechler

Yonatan Ben-Simhon

Daniel Ben David

Yehezkal Shraga Resheff

Guy Maman

Alexander Zicharevich

Yanai Elazar

Aspects of the present disclosure provide techniques for predicting content relevant to questions based on reference links. Embodiments include receiving a set of question and answer (Q/A) pairs and identifying a set of references in the set of Q/A pairs that link pairs of Q/A pairs of the set of Q/A pairs. Embodiments include identifying popular Q/A pairs of the set of Q/A pairs based on the set of references. The popular Q/A pairs may be referenced by a subset of the set of Q/A pairs and each respective Q/A pair of the subset of the set of Q/A pairs may comprise a respective question of a plurality of questions. Embodiments include training a model based on the plurality of questions, the popular Q/A pairs, and the set of references, to predict Q/A pairs of the set of Q/A pairs that are relevant to a given question.

Document similarity through reference links

A method including receiving, in a machine learning model (MLM), a corpus including words. The MLM includes layers configured to extract keywords from the corpus, plus a retrospective layer. A first keyword and a second keyword from the corpus are identified in the layers. The first and second keywords are assigned first and second probabilities. Each probability is a likelihood that a keyword is to be included in a key phrase. A determination is made, in the retrospective layer, of a first probability modifier that modifies the first probability based on a first dependence relationship between the second keyword being placed after the first keyword. The first probability is modified using the first probability modifier. The first modified probability is used to determine whether the first keyword and the second keyword together form the key phrase. The key phrase is stored in a non-transitory computer readable storage medium.

Modified machine learning model and method for coherent key phrase extraction

A method may be used to predict a business' category by analyzing the business' vendors. A neural network architecture may be trained via supervised learning to predict categories for businesses based on listed vendors. The neural network may be used to classify uncategorized businesses within an accounting software database. A list of factors associated with a business' success may be generated by analyzing, aggregating and ranking factors determined to be relevant to a business based on its categorization. The factors associated with the business' success may be related to the products and/or services offered by the business and the format of which those products and/or services are offered by the business. The factors may also be related to the products and/or services purchased by the business from a vendor and the format of which those products and/or services are purchased from the vendor.

System and method providing business insights based on cluster success analytics for products based businesses

A method including inputting, into a phrase recognition model comprising a neural network, a vector comprising a plurality of ngrams of text. The method also includes applying, using the phrase recognition model, a filter to the plurality of ngrams during execution. The filter has a skip word setting of at least one. The method also includes determining, based on the skip word setting, at least one ngram in the vector to be skipped to form at least one skip word. The method also includes outputting an intermediate score for a set of ngrams that match the filter. The method also includes calculating a scalar number representing a semantic meaning of the at least one skip word. The method also includes generating based on the scalar number and the intermediate score, a final score for the set of ngrams. A computer action is performed using the final score.

Machine learning models with improved semantic awareness

Automatic keyphrase labeling and machine learning training may include a processor extracting a plurality of keywords from at least one search query that resulted in a selection of a document appearing in a search result. For each of the plurality of keywords, the processor may determine a probability that the keyword describes the document. The processor may generate one or more keyphrases by performing processing including selecting each of the plurality of keywords having a probability greater than a predetermined threshold value for insertion into at least one of the one or more keyphrases and assembling the one or more keyphrases from the selected plurality of keywords. The processor may label the document with the keyphrase.

Automatic keyphrase labeling using search queries

A computing system identifies an incoming voice call from a user device to an agent device associated with the computing system. The computing system generates a transcription of the incoming voice call using one or more natural language processing techniques. The computing system extracts a problem description from the transcription. The problem description indicates a topic for the incoming voice call. A first machine learning model estimates a situation vector from the problem description. A second machine learning model identifies a pre-existing situation vector that closely matches the estimated situation vector. The computing system retrieves a situation description that corresponds to the identified pre-existing situation vector.

Methods and systems for generating problem description

A method involves receiving search queries, having search terms, submitted to at least one computerized search engine. For each query, a corresponding pairwise relation in the search queries is calculated. The corresponding pairwise relation is a corresponding probability of a potential edge relationship between at least two terms. Thus, potential edges are formed. A general graph of the terms is constructed by selecting edges from the potential edges. The general graph is nodes representing the terms used in the search queries. The general graph also is edges representing semantic relationships among the nodes. A hierarchical graph is constructed from the general graph by altering at least one of the edges among the nodes in the general graph to form the hierarchical graph.

Unsupervised automatic taxonomy graph construction using search queries

A method for mitigating cold starts in recommendations includes receiving a request that identifies a requested page and identifying a content vector of the requested page. The content vector is generated based on providing text of the requested page to a neural network text encoder. The method further includes selecting, based on the content vector, a link to a cold start page that does not satisfy a threshold level of interaction data. The selected link is ranked above a second link to a warm page that does satisfy the threshold level of the interaction data. The method further includes presenting the requested page with the selected link.

Deep learning approach to mitigate the cold-start problem in textual items recommendations

A method including embedding, by a trained issue MLM (machine learning model), a new natural language issue statement into an issue vector. An inner product of the issue vector with an actions matrix is calculated. The actions matrix includes centroid-vectors calculated using a clustering method from a second output of a trained action MLM which embedded prior actions expressed in natural language action statements taken as a result of prior natural issue statements. Calculating the inner product results in probabilities associated with the prior actions. Each of the probabilities represents a corresponding estimate that a corresponding prior action is relevant to the issue vector. A list of proposed actions relevant to the issue vector is generated by comparing the probabilities to a threshold value and selecting a subset of the prior actions with corresponding probabilities above the threshold. The list of proposed actions is transmitted to a user device.

Machine learning to propose actions in response to natural language questions

This disclosure provides systems, methods and apparatuses for recommending items to users of a recommendation system. In some implementations, the recommendation system determines a plurality of contribution values based on interactions between a plurality of users and a plurality of items. Each of the plurality of contribution values represents a confidence level that a respective user prefers a respective item. The recommendation system further determines a capacity of each of the plurality of items. The capacity of each item represents a maximum number of users to which the item can be recommended. The recommendation system recommends one or more items of the plurality of items to each of the plurality of users based at least in part on the plurality of contribution values and the capacities of the plurality of items.

System, method, and computer-readable medium for capacity-constrained recommendation

A method includes generating recommendations and user structures by applying a recommender machine learning model to training user information and item information, and generating, from the user structures and by applying a demographic machine learning model, demographic predictions of users represented by the user structures. The method further includes generating a first accuracy measure of the demographic machine learning model based on a first comparison of the demographic predictions with demographics of the users. A recommender loss function is generated based on the first accuracy measure and a second comparison of the recommendations with selections of users, where the recommender loss function uses the first accuracy measure to suppress detectability by the demographic machine learning model. The method further includes updating the recommender machine learning model according to the recommender loss function.

Adversarial user representations in recommender machine learning models

Systems and methods for automatically identifying problem-relevant sentences in a transcript are disclosed. In an example method, a transcript may be received of a first support call. A region of the first support call transcript may be identified, and first customer utterances may be detected in the region using a trained classification model. A trained regression model may estimate a relevancy to the problem statement of each of the first customer utterances, and one or more most problem-relevant statements may be selected from the first customer utterances, based on the estimated relevancies.

Extracting customer problem description from call transcripts

Certain aspects of the present disclosure provide techniques for privacy-preserving execution of a workflow in a software application. Embodiments include generally includes receiving homomorphically encrypted inputs from a client device corresponding to user-provided data needed to calculate a result for a step of a workflow in the software application. A result is calculated for the step of the workflow using the received homomorphically encrypted inputs. The calculated result is returned to the client device. The calculated result is homomorphically encrypted as a result of calculating the result using the received homomorphically encrypted inputs.

Growing community of inventors

Nes Ziona, Israel

Oren Sar Shalom