Patents by Inventor Mihaela A. Bornea
Mihaela A. Bornea 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).
-
Patent number: 10769138Abstract: Provided herein are techniques for processing a context-situated inquiry to provide results satisfying the inquiry. An inquiry and its supporting context are processed using natural language processing to determine an interpretation for the inquiry and context, and the interpretation is presented to receive corrective information for the interpretation. The corrective information is applied to the interpretation and content is retrieved based on the interpretation of inquiry and context to produce candidate results for the inquiry. Supplemental information is iteratively received to generate updated candidate results.Type: GrantFiled: June 13, 2017Date of Patent: September 8, 2020Assignee: International Business Machines CorporationInventors: Sugato Bagchi, Kenneth J. Barker, Branimir K. Boguraev, Mihaela A. Bornea, Adam R. Faulkner, Yanpeng Li, Siddharth A. Patwardhan, Sara Rosenthal
-
Patent number: 10599993Abstract: Predefined relation items on paths traversing predefined entities of a knowledge base are collected and feature sets are assembled from the collected relation items. A classifier is computed for the feature sets and a relation score of a query pair of the entities is computed using the classifier.Type: GrantFiled: January 22, 2016Date of Patent: March 24, 2020Assignee: International Business Machines CorporationInventors: Kenneth J. Barker, Mihaela A. Bornea
-
Patent number: 10586176Abstract: Predefined relation items on paths traversing predefined entities of a knowledge base are collected and feature sets are assembled from the collected relation items. A classifier is computed for the feature sets and a relation score of a query pair of the entities is computed using the classifier.Type: GrantFiled: June 30, 2017Date of Patent: March 10, 2020Assignee: International Business Machines CorporationInventors: Kenneth J. Barker, Mihaela A. Bornea
-
Patent number: 10242310Abstract: A system and method for automatically mapping LATs and candidate answers to multiple taxonomies without a need to merge these taxonomies. The method includes using a syntactic analysis of a corpus to extract all type instances of the LAT. The extracted instances are then mapped to a given taxonomy and clustered in a set of supertypes. Each supertype receives a score based on the coverage of LAT instances in the corpus. The method includes mapping the candidate answer to the same taxonomy to determine if the candidate answer is an instance of a significant supertype. Then the score of a candidate answer is obtained by aggregating or taking a maximum of the score of the matched significant supertypes. This score evaluates the type match between the LAT and candidate answer for a taxonomy. Multiple taxonomies can be used to increase the chance of LAT and candidate answer mapping.Type: GrantFiled: January 11, 2017Date of Patent: March 26, 2019Assignee: International Business Machines CorporationInventors: Sugato Bagchi, Mihaela A. Bornea, James J. Fan, Aditya A. Kalyanpur, Christopher Welty
-
Publication number: 20180357272Abstract: Provided herein are techniques for processing a context-situated inquiry to provide results satisfying the inquiry. An inquiry and its supporting context are processed using natural language processing to determine an interpretation for the inquiry and context, and the interpretation is presented to receive corrective information for the interpretation. The corrective information is applied to the interpretation and content is retrieved based on the interpretation of inquiry and context to produce candidate results for the inquiry. Supplemental information is iteratively received to generate updated candidate results.Type: ApplicationFiled: June 13, 2017Publication date: December 13, 2018Inventors: Sugato Bagchi, Kenneth J. Barker, Branimir K. Boguraev, Mihaela A. Bornea, Adam R. Faulkner, Yanpeng Li, Siddharth A. Patwardhan, Sara Rosenthal
-
Publication number: 20170300833Abstract: Predefined relation items on paths traversing predefined entities of a knowledge base are collected and feature sets are assembled from the collected relation items. A classifier is computed for the feature sets and a relation score of a query pair of the entities is computed using the classifier.Type: ApplicationFiled: June 30, 2017Publication date: October 19, 2017Inventors: Kenneth J. Barker, Mihaela A. Bornea
-
Patent number: 9792549Abstract: According to an aspect, a pair of related entities that includes a first entity and a second entity is received. Distributional relations are detected between the first entity and the second entity. The detecting includes identifying two sets of entities in a corpus, the first set including the first entity and at least one other entity that is semantically similar to the first entity, and the second set including the second entity and at least one other entity that is semantically similar to the second entity. Semantic relations are detected between entities in the first set and entities in the second set. A relation classifier is trained using the pair of related entities and detected semantic relations. The relation classifier model is applied to a new pair of entities to determine a likelihood of a semantic relation between the entities in the new pair of entities.Type: GrantFiled: November 21, 2014Date of Patent: October 17, 2017Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Mihaela A. Bornea, James J. Fan, Alfio M. Gliozzo, Christopher A. Welty
-
Patent number: 9785887Abstract: According to an aspect, a pair of related entities that includes a first entity and a second entity is received. Distributional relations are detected between the first entity and the second entity. The detecting includes identifying two sets of entities in a corpus, the first set including the first entity and at least one other entity that is semantically similar to the first entity, and the second set including the second entity and at least one other entity that is semantically similar to the second entity. Semantic relations are detected between entities in the first set and entities in the second set. A relation classifier is trained using the pair of related entities and detected semantic relations. The relation classifier model is applied to a new pair of entities to determine a likelihood of a semantic relation between the entities in the new pair of entities.Type: GrantFiled: March 11, 2015Date of Patent: October 10, 2017Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Mihaela A. Bornea, James J. Fan, Alfio M. Gliozzo, Christopher A. Welty
-
Patent number: 9785673Abstract: Systems and methods for optimizing a query, and more particularly, systems and methods for finding optimal plans for graph queries by casting the task of finding the optimal plan as an integer programming (ILP) problem. A method for optimizing a query, comprises building a data structure for a query, the data structure including a plurality of components, wherein each of the plurality of components corresponds to at least one graph pattern, determining a plurality of flows of query variables between the plurality of components, and determining a combination of the plurality of flows between the plurality of components that results in a minimum cost to execute the query.Type: GrantFiled: June 29, 2016Date of Patent: October 10, 2017Assignee: International Business Machines CorporationInventors: Mihaela A. Bornea, Julian Dolby, Achille B. Fokoue-Nkoutche, Anastasios Kementsietsidis, Kavitha Srinivas
-
Publication number: 20170213136Abstract: Predefined relation items on paths traversing predefined entities of a knowledge base are collected and feature sets are assembled from the collected relation items. A classifier is computed for the feature sets and a relation score of a query pair of the entities is computed using the classifier.Type: ApplicationFiled: January 22, 2016Publication date: July 27, 2017Inventors: Kenneth J. Barker, Mihaela A. Bornea
-
Publication number: 20170154256Abstract: A system and method for automatically mapping LATs and candidate answers to multiple taxonomies without a need to merge these taxonomies. The method includes using a syntactic analysis of a corpus to extract all type instances of the LAT. The extracted instances are then mapped to a given taxonomy and clustered in a set of supertypes. Each supertype receives a score based on the coverage of LAT instances in the corpus. The method includes mapping the candidate answer to the same taxonomy to determine if the candidate answer is an instance of a significant supertype. Then the score of a candidate answer is obtained by aggregating or taking a maximum of the score of the matched significant supertypes. This score evaluates the type match between the LAT and candidate answer for a taxonomy. Multiple taxonomies can be used to increase the chance of LAT and candidate answer mapping.Type: ApplicationFiled: January 11, 2017Publication date: June 1, 2017Inventors: Sugato Bagchi, Mihaela A. Bornea, James J. Fan, Aditya A. Kalyanpur, Christopher Welty
-
Patent number: 9569503Abstract: A system and method for automatically mapping LATs and candidate answers to multiple taxonomies without a need to merge these taxonomies. The method includes using a syntactic analysis of a corpus to extract all type instances of the LAT. The extracted instances are then mapped to a given taxonomy and clustered in a set of supertypes. Each supertype receives a score based on the coverage of LAT instances in the corpus. The method includes mapping the candidate answer to the same taxonomy to determine if the candidate answer is an instance of a significant supertype. Then the score of a candidate answer is obtained by aggregating or taking a maximum of the score of the matched significant supertypes. This score evaluates the type match between the LAT and candidate answer for a taxonomy. Multiple taxonomies can be used to increase the chance of LAT and candidate answer mapping.Type: GrantFiled: May 23, 2014Date of Patent: February 14, 2017Assignee: International Business Machines CorporationInventors: Sugato Bagchi, Mihaela A. Bornea, James J. Fan, Aditya A. Kalyanpur, Christopher Welty
-
Publication number: 20160306850Abstract: Systems and methods for optimizing a query, and more particularly, systems and methods for finding optimal plans for graph queries by casting the task of finding the optimal plan as an integer programming (ILP) problem. A method for optimizing a query, comprises building a data structure for a query, the data structure including a plurality of components, wherein each of the plurality of components corresponds to at least one graph pattern, determining a plurality of flows of query variables between the plurality of components, and determining a combination of the plurality of flows between the plurality of components that results in a minimum cost to execute the query.Type: ApplicationFiled: June 29, 2016Publication date: October 20, 2016Inventors: Mihaela A. Bornea, Julian Dolby, Achille B. Fokoue-Nkoutche, Anastasios Kementsietsidis, Kavitha Srinivas
-
Patent number: 9471636Abstract: Systems and methods for optimizing a query, and more particularly, systems and methods for finding optimal plans for graph queries by casting the task of finding the optimal plan as an integer programming (ILP) problem. A method for optimizing a query, comprises building a data structure for a query, the data structure including a plurality of components, wherein each of the plurality of components corresponds to at least one graph pattern, determining a plurality of flows of query variables between the plurality of components, and determining a combination of the plurality of flows between the plurality of components that results in a minimum cost to execute the query.Type: GrantFiled: January 12, 2016Date of Patent: October 18, 2016Assignee: International Business Machines CorporationInventors: Mihaela A. Bornea, Julian Dolby, Achille B. Fokoue-Nkoutche, Anastasios Kementsietsidis, Kavitha Srinivas
-
Patent number: 9471635Abstract: Systems and methods for optimizing a query, and more particularly, systems and methods for finding optimal plans for graph queries by casting the task of finding the optimal plan as an integer programming (ILP) problem. A method for optimizing a query, comprises building a data structure for a query, the data structure including a plurality of components, wherein each of the plurality of components corresponds to at least one graph pattern, determining a plurality of flows of query variables between the plurality of components, and determining a combination of the plurality of flows between the plurality of components that results in a minimum cost to execute the query.Type: GrantFiled: January 12, 2016Date of Patent: October 18, 2016Assignee: International Business Machines CorporationInventors: Mihaela A. Bornea, Julian Dolby, Achille B. Fokoue-Nkoutche, Anastasios Kementsietsidis, Kavitha Srinivas
-
Publication number: 20160154850Abstract: Systems and methods for optimizing a query, and more particularly, systems and methods for finding optimal plans for graph queries by casting the task of finding the optimal plan as an integer programming (ILP) problem. A method for optimizing a query, comprises building a data structure for a query, the data structure including a plurality of components, wherein each of the plurality of components corresponds to at least one graph pattern, determining a plurality of flows of query variables between the plurality of components, and determining a combination of the plurality of flows between the plurality of components that results in a minimum cost to execute the query.Type: ApplicationFiled: January 12, 2016Publication date: June 2, 2016Inventors: Mihaela A. Bornea, Julian Dolby, Achille B. Fokoue-Nkoutche, Anastasios Kementsietsidis, Kavitha Srinivas
-
Publication number: 20160154849Abstract: Systems and methods for optimizing a query, and more particularly, systems and methods for finding optimal plans for graph queries by casting the task of finding the optimal plan as an integer programming (ILP) problem. A method for optimizing a query, comprises building a data structure for a query, the data structure including a plurality of components, wherein each of the plurality of components corresponds to at least one graph pattern, determining a plurality of flows of query variables between the plurality of components, and determining a combination of the plurality of flows between the plurality of components that results in a minimum cost to execute the query.Type: ApplicationFiled: January 12, 2016Publication date: June 2, 2016Inventors: Mihaela A. Bornea, Julian Dolby, Achille B. Fokoue-Nkoutche, Anastasios Kementsietsidis, Kavitha Srinivas
-
Publication number: 20160148096Abstract: According to an aspect, a pair of related entities that includes a first entity and a second entity is received. Distributional relations are detected between the first entity and the second entity. The detecting includes identifying two sets of entities in a corpus, the first set including the first entity and at least one other entity that is semantically similar to the first entity, and the second set including the second entity and at least one other entity that is semantically similar to the second entity. Semantic relations are detected between entities in the first set and entities in the second set. A relation classifier is trained using the pair of related entities and detected semantic relations. The relation classifier model is applied to a new pair of entities to determine a likelihood of a semantic relation between the entities in the new pair of entities.Type: ApplicationFiled: November 21, 2014Publication date: May 26, 2016Inventors: Mihaela A. Bornea, James J. Fan, Alfio M. Gliozzo, Christopher A. Welty
-
Publication number: 20160148116Abstract: According to an aspect, a pair of related entities that includes a first entity and a second entity is received. Distributional relations are detected between the first entity and the second entity. The detecting includes identifying two sets of entities in a corpus, the first set including the first entity and at least one other entity that is semantically similar to the first entity, and the second set including the second entity and at least one other entity that is semantically similar to the second entity. Semantic relations are detected between entities in the first set and entities in the second set. A relation classifier is trained using the pair of related entities and detected semantic relations. The relation classifier model is applied to a new pair of entities to determine a likelihood of a semantic relation between the entities in the new pair of entities.Type: ApplicationFiled: March 11, 2015Publication date: May 26, 2016Inventors: Mihaela A. Bornea, James J. Fan, Alfio M. Gliozzo, Christopher A. Welty
-
Patent number: 9280584Abstract: Systems and methods for optimizing a query, and more particularly, systems and methods for finding optimal plans for graph queries by casting the task of finding the optimal plan as an integer programming (ILP) problem. A method for optimizing a query, comprises building a data structure for a query, the data structure including a plurality of components, wherein each of the plurality of components corresponds to at least one graph pattern, determining a plurality of flows of query variables between the plurality of components, and determining a combination of the plurality of flows between the plurality of components that results in a minimum cost to execute the query.Type: GrantFiled: November 25, 2013Date of Patent: March 8, 2016Assignee: International Business Machines CorporationInventors: Mihaela A. Bornea, Julian Dolby, Achille B. Fokoue-Nkoutche, Anastasios Kementsietsidis, Kavitha Srinivas