Patents by Inventor Luis A. Lastras-Montano

Luis A. Lastras-Montano 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).

  • Analyzing Concepts Over Time
    Publication number: 20170286831
    Abstract: A method and apparatus are provided for automatically generating and processing first and second concept vector sets extracted, respectively, from a first set of concept sequences and from a second, temporally separated, concept sequences by performing a natural language processing (NLP) analysis of the first concept vector set and second concept vector set to detect changes in the corpus over time by identifying changes for one or more concepts included in the first and/or second set of concept sequences.
    Type: Application
    Filed: June 23, 2017
    Publication date: October 5, 2017
    Inventors: Tin Kam Ho, Luis A. Lastras-Montano, Oded Shmueli
  • Concept Hierarchies
    Publication number: 20170286835
    Abstract: A method and apparatus are provided for generating concept hierarchies in response to a user request to produce a hierarchy of concepts from a first concept set by performing a natural language processing (NLP) analysis comparison of the vector representations of the concepts in the first concept set to determine a similarity measure for each pair of distinct concepts Ci and Cj in the first concept set, and to construct therefrom a concept hierarchy based on one or more specified hierarchy parameters and the similarity measure for each pair of distinct concepts Ci and Cj in the first concept set.
    Type: Application
    Filed: March 31, 2016
    Publication date: October 5, 2017
    Inventors: Tin Kam Ho, Luis A. Lastras-Montano, Oded Shmueli, Livio Soares
  • Inverted table for storing and querying conceptual indices
    Patent number: 9773054
    Abstract: According to an aspect, storing and querying conceptual indices (CIs) includes creating a conceptual inverted index (CII) from the CIs. The CII includes CII entries, each of which corresponds to a concept in a concept graph. Creating the CII includes populating each entry with pointers to documents selected from the CIs having likelihoods of being related to the concept that are greater than a threshold value, and the corresponding likelihoods. An aspect also includes receiving a query that includes a concept in the concept graph, and generating query results from a search that include the row at least a subset of the pointers to documents. Each of the CIs is associated with a corresponding document and includes a CI entry for each concept in the concept graph, and each of the CI entries specifies a value indicating a likelihood that the document is related to the concept in the concept graph.
    Type: Grant
    Filed: March 11, 2015
    Date of Patent: September 26, 2017
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Michele M. Franceschini, Luis A. Lastras-Montano, Livio B. Soares, Mark N. Wegman
  • Team Formation
    Publication number: 20170262783
    Abstract: A method and apparatus are provided for grouping individuals into one or more teams by generating vector representations of individual concept sets (containing individual concepts associated with a corresponding individual) and a project concept set (containing project concepts corresponding to a specified project), and then performing comparison analysis (e.g., a natural language processing (NLP) analysis comparison) of the vector representation of each individual concept set to a vector representation of each project concept set to determine a similarity measure between each individual concept set and each project concept set so that one or more of the plurality of individuals may be selected for grouping into a first team by using the similarity measure to determine which individual concepts associated with a corresponding individual are similar to the project concept set.
    Type: Application
    Filed: March 8, 2016
    Publication date: September 14, 2017
    Inventors: Michele M. Franceschini, Tin Kam Ho, Luis A. Lastras-Montano, Oded Shmueli, Livio Soares
  • User interface for summarizing the relevance of a document to a query
    Patent number: 9734196
    Abstract: According to an aspect, summarizing relevance of a document to a conceptual query includes receiving the conceptual query, accessing concepts extracted from the document, and computing a degree to which the conceptual query is related to each of the extracted concepts. The computing is responsive to a metric that measures a relevance between the concepts in the conceptual query and the extracted concepts. The method also includes creating a summary by selecting a threshold number of the concepts having a greatest degree of relation to the conceptual query, and outputting the summary including the selected threshold number of concepts.
    Type: Grant
    Filed: March 11, 2015
    Date of Patent: August 15, 2017
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Michele M. Franceschini, Luis A. Lastras-Montano, Livio B. Soares, Mark N. Wegman
  • Computing the relevance of a document to concepts not specified in the document
    Patent number: 9710570
    Abstract: According to an aspect, conceptual analysis of a document includes accessing a concept graph that includes a plurality of nodes and edges. Each node represents a concept and each edge represents a known relation between two concepts. Conceptual analysis of the document further includes computing a relevance of the document to concepts in the concept graph. The computing includes receiving a priori information about the document including concepts extracted from the document. The concepts extracted from the document include a subset of the concepts in the concept graph. The computing also includes combining the a priori information and the concept graph to generate a posteriori information that indicates a likelihood that the document is related to each of the concepts in the concept graph.
    Type: Grant
    Filed: July 14, 2014
    Date of Patent: July 18, 2017
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Michele M. Franceschini, Luis A. Lastras-Montano, Livio B. Soares, Mark N. Wegman
  • Inverted table for storing and querying conceptual indices
    Patent number: 9703858
    Abstract: According to an aspect, storing and querying conceptual indices (CIs) includes creating a conceptual inverted index (CII) from the CIs. The CII includes CII entries, each of which corresponds to a concept in a concept graph. Creating the CII includes populating each entry with pointers to documents selected from the CIs having likelihoods of being related to the concept that are greater than a threshold value, and the corresponding likelihoods. An aspect also includes receiving a query that includes a concept in the concept graph, and generating query results from a search that include at least a subset of the pointers to documents. Each of the CIs is associated with a corresponding document and includes a CI entry for each concept in the concept graph, and each of the CI entries specifies a value indicating a likelihood that the document is related to the concept in the concept graph.
    Type: Grant
    Filed: July 14, 2014
    Date of Patent: July 11, 2017
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Michele M. Franceschini, Luis A. Lastras-Montano, Livio B. Soares, Mark N. Wegman
  • AUTOMATIC NEW CONCEPT DEFINITION
    Publication number: 20170177714
    Abstract: According to an aspect, automatically adding new concepts to a concept graph includes receiving a string of text, searching a corpus of data to locate additional text related to the string of text, and extracting concepts from the additional text. The extracted concepts include a subset of concepts in the concept graph. The adding new concepts also includes determining whether the string of text should be linked to an existing concept in the concept graph, performing the linking based on determining that the string of text should be linked to the existing concept in the concept graph and, based on determining that the string of text should not be linked to an existing concept in the concept graph, adding a new concept to the concept graph. The new concept is associated with the string of text.
    Type: Application
    Filed: March 6, 2017
    Publication date: June 22, 2017
    Inventors: Michele M. Franceschini, Luis A. Lastras-Montano, Livio B. Soares, Mark N. Wegman
  • Content Authoring
    Publication number: 20170161279
    Abstract: A method and apparatus are provided for recommending concepts from a first concept set in response to user selection of a first concept Ci by performing a natural language processing (NLP) analysis comparison of vector representations of user concepts contained in written content authored by the user and candidate concepts in a first concept set to determine a similarity measure for each candidate concept, and to select therefrom one or more of the candidate concepts for display as recommended concepts which are related to the user concepts contained in written content authored by the user based on the similarity measure between each candidate concept and each user concept.
    Type: Application
    Filed: December 8, 2015
    Publication date: June 8, 2017
    Inventors: Michele M. Franceschini, Tin Kam Ho, Luis A. Lastras-Montano, Oded Shmueli, Livio Soares
  • Concept-Based Navigation
    Publication number: 20170161619
    Abstract: A method and apparatus are provided for recommending concepts from a first concept set in response to user selection of a first concept Ci by performing a natural language processing (NLP) analysis comparison of the vector representations of a first concept set of candidate concepts and a second concept set of user-explored concepts to determine a similarity measure corresponding to each candidate concept, and to select therefrom one or more of the candidate concepts for display as recommended concepts which are related to the one or more user-explored concepts from the navigation history for the user based on the similarity measure for each candidate concept.
    Type: Application
    Filed: December 8, 2015
    Publication date: June 8, 2017
    Inventors: Michele M. Franceschini, Tin Kam Ho, Luis A. Lastras-Montano, Oded Shmueli, Livio Soares
  • Switching Leader-Endorser for Classifier Decision Combination
    Publication number: 20170154281
    Abstract: An approach is provided in which an information handling system trains multiple classifiers using a set of training samples. The information handling system selects a leader classifier from the multiple classifiers that generates the most amount of correct decisions corresponding to the set of training samples. Next, the information handling system identifies an endorser classifier from the multiple classifiers that generates the highest proportion of correct decisions among the endorser classifier's decisions matching the leader classifier's decisions, and combines the leader classifier and the endorser classifier into a combined classifier stage. In turn, the information handling system utilizes the combined classifier stage to process inquiries and generate results.
    Type: Application
    Filed: December 1, 2015
    Publication date: June 1, 2017
    Inventors: Tin Kam Ho, Luis A. Lastras-Montano, Vinith Misra
  • Matrix Ordering for Cache Efficiency in Performing Large Sparse Matrix Operations
    Publication number: 20170147287
    Abstract: Mechanisms are provided for performing a matrix operation. A processor of a data processing system is configured to perform cluster-based matrix reordering of an input matrix. An input matrix, which comprises nodes associated with elements of the matrix, is received. The nodes are clustered into clusters based on numbers of connections with other nodes within and between the clusters, and the clusters are ordered by minimizing a total length of cross cluster connections between nodes of the clusters, to thereby generate a reordered matrix. A lookup table is generated identifying new locations of nodes of the input matrix, in the reordered matrix. A matrix operation is then performed based on the reordered matrix and the lookup table.
    Type: Application
    Filed: February 6, 2017
    Publication date: May 25, 2017
    Inventors: Emrah Acar, Rajesh R. Bordawekar, Michele M. Franceschini, Luis A. Lastras-Montano, Ruchir Puri, Haifeng Qian, Livio B. Soares
  • Extracting and Denoising Concept Mentions Using Distributed Representations of Concepts
    Publication number: 20170132288
    Abstract: A method and apparatus are provided for automatically analyzing candidate concepts extracted from a first source text against a reference concept set comprising a plurality of concepts by obtaining a vector representation for each of the concepts in the first concept set and the reference concept set and performing a natural language processing (NLP) analysis comparison of the candidate concepts to the reference concept set to determine a similarity measure corresponding to each candidate concept and validating one or more of the candidate concepts based on the similarity measure for each candidate concept meeting a minimum similarity threshold requirement.
    Type: Application
    Filed: November 6, 2015
    Publication date: May 11, 2017
    Inventors: Tin Kam Ho, Luis A. Lastras-Montano
  • Matrix ordering for cache efficiency in performing large sparse matrix operations
    Patent number: 9606934
    Abstract: Mechanisms are provided for performing a matrix operation. A processor of a data processing system is configured to perform cluster-based matrix reordering of an input matrix. An input matrix, which comprises nodes associated with elements of the matrix, is received. The nodes are clustered into clusters based on numbers of connections with other nodes within and between the clusters, and the clusters are ordered by minimizing a total length of cross cluster connections between nodes of the clusters, to thereby generate a reordered matrix. A lookup table is generated identifying new locations of nodes of the input matrix, in the reordered matrix. A matrix operation is then performed based on the reordered matrix and the lookup table.
    Type: Grant
    Filed: February 2, 2015
    Date of Patent: March 28, 2017
    Assignee: International Business Machines Corporation
    Inventors: Emrah Acar, Rajesh R. Bordawekar, Michele M. Franceschini, Luis A. Lastras-Montano, Ruchir Puri, Haifeng Qian, Livio B. Soares
  • Analyzing Concepts Over Time
    Publication number: 20170083507
    Abstract: A method and apparatus are provided for automatically generating and processing first and second concept vector sets extracted, respectively, from a first set of concept sequences and from a second, temporally separated, concept sequences by performing a natural language processing (NLP) analysis of the first concept vector set and second concept vector set to detect changes in the corpus over time by identifying changes for one or more concepts included in the first and/or second set of concept sequences.
    Type: Application
    Filed: September 22, 2015
    Publication date: March 23, 2017
    Inventors: Tin Kam Ho, Luis A. Lastras-Montano, Oded Shmueli
  • Cognitive Operations Based on Empirically Constructed Knowledge Graphs
    Publication number: 20170076206
    Abstract: Mechanisms are provided for performing a cognitive operation. The mechanisms receive an original graph data structure comprising nodes and edges between nodes and activity log information for nodes of the original graph data structure. The mechanisms identify a set of nodes in the original graph data structure having a predetermined pattern of activity in the activity log information, and a set of edges between these nodes. The mechanisms calculate an importance weight for each edge in the set of edges and modify the original graph data structure based on the calculated importance weights for the edges in the set of edges, to thereby generate a modified graph data structure. The mechanisms then perform a cognitive operation based on the modified graph data structure. The set of edges may comprise actual edges between the nodes and/or potential edges between the nodes.
    Type: Application
    Filed: September 16, 2015
    Publication date: March 16, 2017
    Inventors: Luis A. Lastras-Montano, Vinith Misra, Livio B. Soares
  • Search Engine Domain Transfer
    Publication number: 20170068737
    Abstract: A mechanism is provided for search engine domain transfer. The mechanism receives an input query to search a specialized domain from a user and performs a general-domain search based on the input query to generate a set of general-domain results. The mechanism generates a feature vector based on the general-domain results and generates a score for each document within the specialized domain based on the feature vector. The mechanism generates a ranked result set of documents based on the scores of the documents in the specialized domain and presents the ranked result set to the user.
    Type: Application
    Filed: September 24, 2015
    Publication date: March 9, 2017
    Inventors: Tin K. Ho, Luis A. Lastras-Montano, Vinith Misra
  • Search Engine Domain Transfer
    Publication number: 20170068734
    Abstract: A mechanism is provided for search engine domain transfer. The mechanism receives an input query to search a specialized domain from a user and performs a general-domain search based on the input query to generate a set of general-domain results. The mechanism generates a feature vector based on the general-domain results and generates a score for each document within the specialized domain based on the feature vector. The mechanism generates a ranked result set of documents based on the scores of the documents in the specialized domain and presents the ranked result set to the user.
    Type: Application
    Filed: September 9, 2015
    Publication date: March 9, 2017
    Inventors: Tin K. Ho, Luis A. Lastras-Montano, Vinith Misra
  • User interface for summarizing the relevance of a document to a query
    Patent number: 9576023
    Abstract: According to an aspect, summarizing relevance of a document to a conceptual query includes receiving the conceptual query, accessing concepts extracted from the document, and computing a degree to which the conceptual query is related to each of the extracted concepts. The computing is responsive to a metric that measures a relevance between the concepts in the conceptual query and the extracted concepts. An aspect also includes creating a summary by selecting a threshold number of the concepts having a greatest degree of relation to the conceptual query, and outputting the summary including the selected threshold number of concepts.
    Type: Grant
    Filed: July 14, 2014
    Date of Patent: February 21, 2017
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Michele M. Franceschini, Luis A. Lastras-Montano, Livio B. Soares, Mark N. Wegman
  • Obtaining and Using a Distributed Representation of Concepts as Vectors
    Publication number: 20170032273
    Abstract: An approach is provided for automatically generating and processing concept vectors by extracting concept sequences from one or more content sources and generating a first concept vector for a first concept by supplying the concept sequences as inputs to a vector learning component, such that the first concept vector comprises information interrelating the first concept to other concepts in the concept sequences which is inferred from the concept sequences.
    Type: Application
    Filed: July 27, 2015
    Publication date: February 2, 2017
    Inventors: Tin Kam Ho, Luis A. Lastras-Montano, Oded Shmueli