Patents by Inventor Achille Fokoue-Nkoutche
Achille Fokoue-Nkoutche 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: 11500841Abstract: Systems, computer-implemented methods, and computer program products that can facilitate encoding a tree data structure into a vector based on a set of constraints are provided. According to an embodiment, a system can comprise a memory that stores computer executable components and a processor that executes the computer executable components stored in the memory. The computer executable components can comprise a constraint former that can form a set of constraints based on a first tree data structure and a vector encoder that can encode the first tree data structure into a vector based on the set of constraints.Type: GrantFiled: January 4, 2019Date of Patent: November 15, 2022Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Achille Fokoue-Nkoutche, Maxwell Crouse, Michael Witbrock, Ryan A. Musa, Maria Chang
-
Publication number: 20200218706Abstract: Systems, computer-implemented methods, and computer program products that can facilitate encoding a tree data structure into a vector based on a set of constraints are provided. According to an embodiment, a system can comprise a memory that stores computer executable components and a processor that executes the computer executable components stored in the memory. The computer executable components can comprise a constraint former that can form a set of constraints based on a first tree data structure and a vector encoder that can encode the first tree data structure into a vector based on the set of constraints.Type: ApplicationFiled: January 4, 2019Publication date: July 9, 2020Inventors: Achille Fokoue-Nkoutche, Maxwell Crouse, Michael John Witbrock, Ryan A. Musa, Maria Chang
-
Patent number: 10643135Abstract: Methods, systems, and computer program products for linkage prediction through similarity analysis are provided herein. A computer-implemented method includes extracting multiple features from (i) one or more attributes of a set of source nodes within a knowledge graph and (ii) one or more attributes of a set of target nodes within the knowledge graph, wherein at least one extracted feature satisfies a designated complexity level; performing a similarity analysis across the at least one extracted feature by applying one or more similarity measures to the at least one extracted feature; predicting one or more sets of links between the source nodes and the target nodes based on the similarity analysis, wherein one or more sets of predicted links satisfy a pre-determined accuracy threshold; and outputting the one or more sets of predicted links to a user.Type: GrantFiled: August 22, 2016Date of Patent: May 5, 2020Assignee: International Business Machines CorporationInventors: Robert G. Farrell, Achille Fokoue-Nkoutche, Oktie Hassanzadeh, Mohammad Sadoghi Hamedani, Meinolf Sellmann, Ping Zhang
-
Publication number: 20180053096Abstract: Methods, systems, and computer program products for linkage prediction through similarity analysis are provided herein. A computer-implemented method includes extracting multiple features from (i) one or more attributes of a set of source nodes within a knowledge graph and (ii) one or more attributes of a set of target nodes within the knowledge graph, wherein at least one extracted feature satisfies a designated complexity level; performing a similarity analysis across the at least one extracted feature by applying one or more similarity measures to the at least one extracted feature; predicting one or more sets of links between the source nodes and the target nodes based on the similarity analysis, wherein one or more sets of predicted links satisfy a pre-determined accuracy threshold; and outputting the one or more sets of predicted links to a user.Type: ApplicationFiled: August 22, 2016Publication date: February 22, 2018Inventors: Robert G. Farrell, Achille Fokoue-Nkoutche, Oktie Hassanzadeh, Mohammad Sadoghi Hamedani, Meinolf Sellmann, Ping Zhang
-
Patent number: 9037615Abstract: A computer-implemented method, system, and article of manufacture for querying and integrating structured and unstructured data. The method includes: receiving entity information that is extracted from a first set of unstructured data using an open domain information extraction system, wherein the entity in-formation comprises relationship information between a first entity and a second entity of the first set of unstructured data; recognizing a pattern based on the relationship information and creating a schema for the first set of unstructured data based on the pattern; and associating an element of the created schema with (i) an entity of a second set of unstructured data or (ii) a schema element of an existing set of structured data if there is sufficient overall similarity between the created schema element and either the second unstructured data entity or the schema element of the existing structured data.Type: GrantFiled: June 11, 2012Date of Patent: May 19, 2015Assignee: International Business Machines CorporationInventors: Mihaela Ancuta Bornea, Songyun Duan, James J. Fan, Achille Fokoue-Nkoutche, Alfio M. Gliozzo, Aditya Kalyanpur, Anastasios Kementsietsidis, Kavitha Srinivas, Michael J. Ward
-
Publication number: 20130332478Abstract: A computer-implemented method, system, and article of manufacture for querying and integrating structured and unstructured data. The method includes: receiving entity information that is extracted from a first set of unstructured data using an open domain information extraction system, wherein the entity information comprises relationship information between a first entity and a second entity of the first set of unstructured data; recognizing a pattern based on the relationship information and creating a schema for the first set of unstructured data based on the pattern; and associating an element of the created schema with (i) an entity of a second set of unstructured data or (ii) a schema element of an existing set of structured data if there is sufficient overall similarity between the created schema element and either the second unstructured data entity or the schema element of the existing structured data.Type: ApplicationFiled: June 11, 2012Publication date: December 12, 2013Applicant: International Business Machines CorporationInventors: Mihaela Ancuta Bornea, Songyun Duan, James J. Fan, Achille Fokoue-Nkoutche, Alfio M. Gliozzo, Aditya Kalyanpur, Anastasios Kementsietsidis, Kavitha Srinivas, Michael J. Ward
-
Patent number: 8370359Abstract: Computer-implemented methods for mapping an element of a source information model to an element of a target information model, forming a cluster of elements for mapping across information models, and evaluating a mapping of elements across information models, and a system and computer program product thereof. The method of mapping an element of a source information model to an element of a target information model includes: receiving information for mapping a first element in a source cluster to an element in the target information model; mapping the first element to the target element using the received information for mapping the first element to the target element; and mapping all other elements in the source cluster to the target element.Type: GrantFiled: October 21, 2010Date of Patent: February 5, 2013Assignee: International Business Machines CorporationInventors: Brian Patrick Byrne, Songyun Duan, Achille Fokoue-Nkoutche, Brendan O'Sullivan, Kavitha Srinivas
-
Publication number: 20120102032Abstract: Computer-implemented methods for mapping an element of a source information model to an element of a target information model, forming a cluster of elements for mapping across information models, and evaluating a mapping of elements across information models, and a system and computer program product thereof. The method of mapping an element of a source information model to an element of a target information model includes: receiving information for mapping a first element in a source cluster to an element in the target information model; mapping the first element to the target element using the received information for mapping the first element to the target element; and mapping all other elements in the source cluster to the target element.Type: ApplicationFiled: October 21, 2010Publication date: April 26, 2012Applicant: International Business Machines CorporationInventors: Brian Byrne, Songyun Duan, Achille Fokoue-Nkoutche, Brendan O'Sullivan, Kavitha Srinivas
-
Patent number: 7860816Abstract: The present invention is a method and apparatus for safe ontology reasoning. In one embodiment, a method for building safe sub-ontology that includes one or more elements of a given ontology includes designating at least one the elements as a sensitive element, where a sensitive element is an element not to be revealed. The method then designates a safe sub-ontology such that the safe sub-ontology does not include any elements that, alone or in combination, allow inference of a sensitive element, in accordance with one or more given inference rules. In another embodiment, a method for building a potential sub-ontology includes designating at least one of the elements as a sensitive element and including a maximal number of the elements in the potential sub-ontology, wherein the maximal number includes the greatest number of elements that can be revealed, cumulatively, without allowing inference of a sensitive element, in accordance with one or more given inference rules.Type: GrantFiled: October 31, 2007Date of Patent: December 28, 2010Assignee: International Business Machines CorporationInventors: Achille Fokoue-Nkoutche, Genady Grabarnik, Nagui Halim, Aaron Kershenbaum, Edith Schonberg, Larisa Shwartz, Kavitha Srinivas
-
Publication number: 20080065578Abstract: The present invention is a method and apparatus for safe ontology reasoning. In one embodiment, a method for building safe sub-ontology that includes one or more elements of a given ontology includes designating at least one the elements as a sensitive element, where a sensitive element is an element not to be revealed. The method then designates a safe sub-ontology such that the safe sub-ontology does not include any elements that, alone or in combination, allow inference of a sensitive element, in accordance with one or more given inference rules. In another embodiment, a method for building a potential sub-ontology includes designating at least one of the elements as a sensitive element and including a maximal number of the elements in the potential sub-ontology, wherein the maximal number includes the greatest number of elements that can be revealed, cumulatively, without allowing inference of a sensitive element, in accordance with one or more given inference rules.Type: ApplicationFiled: October 31, 2007Publication date: March 13, 2008Inventors: Achille Fokoue-Nkoutche, Genady Grabarnik, Nagui Halim, Aaron Kershenbaum, Edith Schonberg, Larisa Shwartz, Kavitha Srinivas
-
Publication number: 20070233627Abstract: Methods and apparatus, including computer program products, for scalable ontology reasoning. A method of generating a summarized ontology includes loading an ontology from a store, eliminating relationships in the ontology, the eliminating relationships including an insertion of new relationships that simplify the ontology, eliminating individuals in the ontology, the eliminating individuals including insertion of new individuals to simplify the ontology, eliminating concepts in the ontology including insertion of new concepts to simplify the ontology, and generating the summarized ontology from the eliminating relationships, eliminating individuals and eliminating concepts.Type: ApplicationFiled: February 21, 2007Publication date: October 4, 2007Inventors: Julian Dolby, Aditya Kalyanpur, Aaron Jay Kershenbaum, Achille Fokoue-Nkoutche, Li Ma, Edith Schonberg, Kavitha Srinivas
-
Publication number: 20070198448Abstract: Methods and apparatus, including computer program products, for scalable ontology reasoning. A method of generating a summarized ontology includes loading an ontology from a store, eliminating relationships in the ontology, the eliminating relationships including an insertion of new relationships that simplify the ontology, eliminating individuals in the ontology, the eliminating individuals including insertion of new individuals to simplify the ontology, eliminating concepts in the ontology including insertion of new concepts to simplify the ontology, and generating the summarized ontology from the eliminating relationships, eliminating individuals and eliminating concepts.Type: ApplicationFiled: February 21, 2006Publication date: August 23, 2007Inventors: Achille Fokoue-Nkoutche, Aaron Kershenbaum, Kavitha Srinivas
-
Publication number: 20070198449Abstract: The present invention is a method and apparatus for safe ontology reasoning. In one embodiment, a method for building safe sub-ontology that includes one or more elements of a given ontology includes designating at least one the elements as a sensitive element, where a sensitive element is an element not to be revealed. The method then designates a safe sub-ontology such that the safe sub-ontology does not include any elements that, alone or in combination, allow inference of a sensitive element, in accordance with one or more given inference rules. In another embodiment, a method for building a potential sub-ontology includes designating at least one of the elements as a sensitive element and including a maximal number of the elements in the potential sub-ontology, wherein the maximal number includes the greatest number of elements that can be revealed, cumulatively, without allowing inference of a sensitive element, in accordance with one or more given inference rules.Type: ApplicationFiled: February 23, 2006Publication date: August 23, 2007Inventors: Achille Fokoue-Nkoutche, Genady Grabarnik, Nagui Halim, Aaron Kershenbaum, Edith Schonberg, Larisa Shwartz, Kavitha Srinivas
-
Publication number: 20060101422Abstract: Electronic devices and methods of processing and preparing processing application data are disclosed. Application data are operated on a first electronic device (2a) and a copy of said application data is operated on at least another electronic device (2b). A method call for modifying application data on the first device (2a) is translated into a more general description. The description is passed to the other device (2b). The application data on the first device (2a) is processed according to the method call. On the second device (2b), the received description of the method call is translated into a locally executable method call which is processed on the copy of application data.Type: ApplicationFiled: August 14, 2003Publication date: May 11, 2006Inventors: Daniela Bourges-Waldegg, Yann Duponchel, Achille Fokoue-Nkoutche, Marcel Graf, Michael Moser
-
Publication number: 20060059454Abstract: A system and method for dynamically selecting logical operations using external criteria, includes providing tools for defining a selection criteria set having parameters including dimensions and valid values, wherein the selection criteria set includes a plurality of different arrangements and values of the parameters. The selection criteria set and collections of instances thereof are persistently maintained. A trigger is provided at runtime to query the persistently maintained instances to automatically select a logic operation to employ based upon a context of the query.Type: ApplicationFiled: September 15, 2004Publication date: March 16, 2006Inventors: Louis Degenaro, Achille Fokoue-Nkoutche, Isabelle Rouvellou
-
Methods and apparatus for business rules authoring and operation employing a customizable vocabulary
Publication number: 20050119984Abstract: Methods and apparatus for authoring and executing an individualized language business rule. In one embodiment, a method comprises creating at least one individualized language resource, creating at least one individualized language rule referencing at least one of said individualized language resource, and transforming said at least one individualized language rule into computer executable format.Type: ApplicationFiled: December 1, 2003Publication date: June 2, 2005Inventors: Isabelle Rouvellou, Hoi Chan, Louis Degenaro, Judah Diament, Achille Fokoue-Nkoutche, Charles Kerr, Mark Linehan, Arvind Rajpurohit, Samuel Weber