Patents by Inventor Oren Sar-Shalom

Oren Sar-Shalom has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Publication number: 20210192136
    Abstract: 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.
    Type: Application
    Filed: December 20, 2019
    Publication date: June 24, 2021
    Applicant: Intuit Inc.
    Inventors: Oren Sar Shalom, Alexander Zhicharevich, Adi Shalev, Yehezkel Shraga Resheff
  • Publication number: 20210182877
    Abstract: The business segment associated with a merchant is automatically and accurately determined by applying machine learning techniques to actual financial documents associated with a merchant. In some examples, once the business segment associated with a merchant user of a data management system is identified, this information is used to identify potentially fraudulent and/or other criminal activity such as fraudulent merchants, criminal financial transactions, and fraudulent invoices.
    Type: Application
    Filed: December 11, 2019
    Publication date: June 17, 2021
    Applicant: Intuit Inc.
    Inventors: Yair Horesh, Onn Bar, Oren Sar Shalom, Daniel Ben David, Alexander Zicharevich, Talia Tron
  • Publication number: 20210165848
    Abstract: 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 a rank engine and the content vector, a link to a cold start page that does not satisfy a threshold level of interaction data. The rank engine ranks the selected link 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.
    Type: Application
    Filed: November 29, 2019
    Publication date: June 3, 2021
    Applicant: Intuit Inc.
    Inventors: Elik Sror, Oren Sar Shalom, Rami Cohen
  • Publication number: 20210165812
    Abstract: A computer-implemented method, computerized apparatus and computer program product for minimum coordination passage scoring. Given a candidate passage in a document collection potentially matching a query received, a set of overlapping terms between the candidate passage and the query is determined. For each overlapping term in the set, a first measure of a weight of the term in the query, a second measure of a weight of the term in the candidate passage, and a third measure of a specificity of the term in the document collection are calculated. a function of the first and second measure is evaluated to obtain a value reflecting a condition on the relation therebetween. A minimum coordination score representing a relative similarity between the candidate passage and the query is determined based on the value and the first, second and third measures obtained for each of the overlapping terms.
    Type: Application
    Filed: December 2, 2019
    Publication date: June 3, 2021
    Inventors: Doron Cohen, Haggai Roitman, Oren Sar-Shalom
  • Publication number: 20210149671
    Abstract: A machine learning method. A source domain data structure and a target domain data structure are combined into a unified data structure. First data in the source domain data structure are latent with respect to second data in the target domain data structure. The unified data structure includes user vectors that combine the first data and the second data. The user vectors are transformed into a transformed data structure by applying a mapping function to the user vectors. The mapping function relates, using at least one parameter, first relationships in the source domain data structure to second relationships in the target domain data structure. The at least one parameter is based on a combination of affinity scores relating items with which the user interacted and did not interact. The transformed data structure is input into a machine learning model, from which is obtained a recommendation relating to the target domain.
    Type: Application
    Filed: November 19, 2019
    Publication date: May 20, 2021
    Applicant: Intuit Inc.
    Inventors: Oren Sar Shalom, Meng Chen, Linxia Liao, Yehezkel Shraga Resheff
  • Publication number: 20210124783
    Abstract: 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.
    Type: Application
    Filed: October 29, 2019
    Publication date: April 29, 2021
    Inventors: Yonatan BEN-SIMHON, Rami COHEN, Oren SAR SHALOM, Alexander ZHICHAREVICH
  • Patent number: 10984193
    Abstract: A processor may generate a plurality of vectors from an original text by processing the original text with at least one unsupervised learning algorithm. Each of the plurality of vectors may correspond to a separate portion of a plurality of portions of the original text. The processor may determine respective segments to which respective vectors belong. The processor may minimize a distance between at least one vector belonging to the segment and a known vector from among one or more known vectors and applying a label of the known vector to the segment.
    Type: Grant
    Filed: January 8, 2020
    Date of Patent: April 20, 2021
    Assignee: Intuit Inc.
    Inventors: Adi Shalev, Yair Horesh, Yehezkel Shraga Resheff, Oren Sar Shalom, Alexander Zhicharevich
  • Patent number: 10956816
    Abstract: A method, computer system, and a computer program product for enhanced rating predictions is provided. The present invention may include receiving a user input. The present invention may then include translating the received user input into an embedding matrix and inputting the embedding matrix into a deep neural network. The present invention may further include generating, by the deep neural network, an output vector, a user bias term and an item bias term based on the embedding matrix. The present invention may then include calculating a predicted rating based on the generated output vector, the generated user bias term and the generated item bias term. The present invention may then include determining an accuracy of the predicted rating.
    Type: Grant
    Filed: June 28, 2017
    Date of Patent: March 23, 2021
    Assignee: International Business Machines Corporation
    Inventors: Amir Kantor, Oren Sar-Shalom, Guy Uziel
  • Publication number: 20210081454
    Abstract: 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.
    Type: Application
    Filed: September 17, 2019
    Publication date: March 18, 2021
    Applicant: Intuit Inc.
    Inventors: Oren Sar Shalom, Alexander Zhicharevich, Rami Cohen, Yonatan Ben-Simhon
  • Patent number: 10831770
    Abstract: A computer implemented method for estimating quality of document retrieval comprising: retrieving from a corpus of documents stored on at least one storage a plurality of digital documents which comply with a document retrieval query according to a retrieval model; computing a plurality of retrieval scores each calculated for one of the plurality of digital documents using a relevance function scoring a relevance of one of the retrieved plurality of digital documents to the query; computing a calibrated weighted product model (WPM) estimator by calculating a combination of the plurality of retrieval scores weighted according to a plurality of retrieval features of the corpus and/or the query and/or a document, wherein the plurality of retrieval features are weighted according to a relative importance; and using the calibrated WPM estimator to score the plurality of digital documents' relevance to the query.
    Type: Grant
    Filed: December 12, 2017
    Date of Patent: November 10, 2020
    Assignee: International Business Machines Corporation
    Inventors: Shai Erera, Haggai Roitman, Oren Sar-Shalom, Bar Weiner
  • Publication number: 20200344193
    Abstract: An approach is provided that receives a message and applies a deep analytic analysis to the message. The deep analytic analysis results in a set of enriched message embedding (EME) data that is passed to a trained neural network. Based on a set of scores received from the trained neural network, a conversation is identified from a number of available conversations to which the received message belongs. The received first message is then associated with the identified conversation.
    Type: Application
    Filed: June 24, 2019
    Publication date: October 29, 2020
    Inventors: Devin A. Conley, Priscilla S. Moraes, Lakshminarayanan Krishnamurthy, Oren Sar-Shalom
  • Publication number: 20200344192
    Abstract: An approach is provided that receives a message and applies a deep analytic analysis to the message. The deep analytic analysis results in a set of enriched message embedding (EME) data that is passed to a trained neural network. Based on a set of scores received from the trained neural network, a conversation is identified from a number of available conversations to which the received message belongs. The received first message is then associated with the identified conversation.
    Type: Application
    Filed: April 23, 2019
    Publication date: October 29, 2020
    Inventors: Devin A. Conley, Priscilla S. Moraes, Lakshminarayanan Krishnamurthy, Oren Sar-Shalom
  • Patent number: 10558692
    Abstract: A computer-implemented method, computerized apparatus and computer program product for minimum coordination passage scoring. Given a candidate passage in a document collection potentially matching a query received, a set of overlapping terms between the candidate passage and the query is determined. For each overlapping term in the set, a first measure of a weight of the term in the query, a second measure of a weight of the term in the candidate passage, and a third measure of a specificity of the term in the document collection are calculated. A function of the first and second measure is evaluated to obtain a value reflecting a condition on the relation therebetween. A minimum coordination score representing a relative similarity between the candidate passage and the query is determined based on the value and the first, second and third measures obtained for each of the overlapping terms.
    Type: Grant
    Filed: September 26, 2016
    Date of Patent: February 11, 2020
    Assignee: International Business Machines Corporation
    Inventors: Doron Cohen, Haggai Roitman, Oren Sar-Shalom
  • Publication number: 20190385060
    Abstract: During end-to-end training of a Deep Neural Network (DNN), a differentiable estimator subnetwork is operated to estimate a functionality of an external software application. Then, during inference by the trained DNN, the differentiable estimator subnetwork is replaced with the functionality of the external software application, by enabling API communication between the DNN and the external software application.
    Type: Application
    Filed: June 14, 2018
    Publication date: December 19, 2019
    Inventors: BOAZ CARMELI, Guy Hadash, Einat Kermany, Ofer Lavi, Guy Lev, Oren Sar-Shalom
  • Publication number: 20190179914
    Abstract: A computer implemented method for estimating quality of document retrieval comprising: retrieving from a corpus of documents stored on at least one storage a plurality of digital documents which comply with a document retrieval query according to a retrieval model; computing a plurality of retrieval scores each calculated for one of the plurality of digital documents using a relevance function scoring a relevance of one of the retrieved plurality of digital documents to the query; computing a calibrated weighted product model (WPM) estimator by calculating a combination of the plurality of retrieval scores weighted according to a plurality of retrieval features of the corpus and/or the query and/or a document, wherein the plurality of retrieval features are weighted according to a relative importance; and using the calibrated WPM estimator to score the plurality of digital documents' relevance to the query.
    Type: Application
    Filed: December 12, 2017
    Publication date: June 13, 2019
    Inventors: Shai Erera, Haggai Roitman, Oren Sar-Shalom, Bar Weiner
  • Publication number: 20190146636
    Abstract: The present invention provides a method, computer program product, and system of generating prioritized list. In an embodiment, the method, computer program product, and system include receiving, by a computer system, target user identification data identifying a target user, target action data, social network content for the one or more users, and social network activity data for the one or more users, analyzing, by a computer system, social network links between the source user and the target user and the social network activity data for the one or more users, determining, by a computer system, a prioritized list of probabilistic action paths that could result in the target user performing the target action on the content based on the analyzing, and outputting the prioritized list to the source user.
    Type: Application
    Filed: November 14, 2017
    Publication date: May 16, 2019
    Inventors: Shiri Kremer-Davidson, Anat Hashavit, Esther Goldbraich, Maya Barnea, Oren Sar-Shalom
  • Publication number: 20190147343
    Abstract: A method, system and computer program product, the method comprising: mutually training, using feedback, a generator and a discriminator of a conditional adversarial generative adversarial networks using training item groups, each item group representing events in a time window, the generator comprises a generator Recurrent Neural Network (RNN), the discriminator comprises a discriminator RNN; receiving by the discriminator, discrete sequential data comprising a sequence of item groups comprising an item group representing events in a time window, and item groups representing events in preceding time windows; altering the sequence of item groups into collections of real numbers and providing them to the discriminator RNN; processing the collections by the discriminator RNN to obtain a probability for the item group to comprise an anomaly, in an unsupervised manner; and providing output to a user, the output based on the probability and indicative of a label for the discrete sequential data.
    Type: Application
    Filed: November 15, 2017
    Publication date: May 16, 2019
    Inventors: GUY LEV, Matan Ninio, Oren Sar Shalom
  • Publication number: 20190005383
    Abstract: A method, computer system, and a computer program product for enhanced rating predictions is provided. The present invention may include receiving a user input. The present invention may then include translating the received user input into an embedding matrix and inputting the embedding matrix into a deep neural network. The present invention may further include generating, by the deep neural network, an output vector, a user bias term and an item bias term based on the embedding matrix. The present invention may then include calculating a predicted rating based on the generated output vector, the generated user bias term and the generated item bias term. The present invention may then include determining an accuracy of the predicted rating.
    Type: Application
    Filed: June 28, 2017
    Publication date: January 3, 2019
    Inventors: Amir Kantor, Oren Sar-Shalom, Guy Uziel
  • Publication number: 20180089307
    Abstract: A computer-implemented method, computerized apparatus and computer program product for minimum coordination passage scoring. Given a candidate passage in a document collection potentially matching a query received, a set of overlapping terms between the candidate passage and the query is determined. For each overlapping term in the set, a first measure of a weight of the term in the query, a second measure of a weight of the term in the candidate passage, and a third measure of a specificity of the term in the document collection are calculated. A function of the first and second measure is evaluated to obtain a value reflecting a condition on the relation therebetween. A minimum coordination score representing a relative similarity between the candidate passage and the query is determined based on the value and the first, second and third measures obtained for each of the overlapping terms.
    Type: Application
    Filed: September 26, 2016
    Publication date: March 29, 2018
    Inventors: Doron Cohen, Haggai Roitman, Oren Sar-Shalom
  • Publication number: 20180018569
    Abstract: Methods, computing systems and computer program products implement embodiments of the present invention that include identifying a set of the items in the transactions, and executing, using input including the transactions, an implicit feedback collaborative filtering model to compute, for each of the users, a predicted rating for each of the items. Using input including the transactions and the predicted ratings as labels, a sentiment analysis model is executed to compute, for each given user, an opinion for each of the given items in the transactions for the given user, and using input including the transactions and the opinions as factors for the predicted ratings, an explicit feedback collaborative analysis model is executed to update, for each of the users, the predicted ratings for each of the items.
    Type: Application
    Filed: July 12, 2016
    Publication date: January 18, 2018
    Inventors: Haggai Roitman, Oren Sar-Shalom