Patents by Inventor Sudhakar Govindasamy

Sudhakar Govindasamy 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).

  • Detecting clusters and relationships in large data sets
    Patent number: 10515095
    Abstract: From a directional acyclic graph (DAG) corresponding to a data volume, a matrix of relationships of a first node and a second node is computed. The DAG includes a set of nodes and a set of directional edges, the set of nodes including the first node and the second node. An inverted matrix is computed from the matrix, which retains values in only those column positions where a value in a first row corresponding to the first node is opposite of a value in a second row corresponding to the second node. From the first row, a first cluster of nodes related to the first node is constructed by selecting nodes corresponding to those columns where the first row has a value indicating an affirmative relationship. Information representing the first cluster of nodes a second cluster of nodes are output.
    Type: Grant
    Filed: October 5, 2016
    Date of Patent: December 24, 2019
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Shawnna M. Childress, Sudhakar Govindasamy, Ahmed M. Nassar, Craig M. Trim
  • DETECTING CLUSTERS AND RELATIONSHIPS IN LARGE DATA SETS
    Publication number: 20180096047
    Abstract: From a directional acyclic graph (DAG) corresponding to a data volume, a matrix of relationships of a first node and a second node is computed. The DAG includes a set of nodes and a set of directional edges, the set of nodes including the first node and the second node. An inverted matrix is computed from the matrix, which retains values in only those column positions where a value in a first row corresponding to the first node is opposite of a value in a second row corresponding to the second node. From the first row, a first cluster of nodes related to the first node is constructed by selecting nodes corresponding to those columns where the first row has a value indicating an affirmative relationship. Information representing the first cluster of nodes a second cluster of nodes are output.
    Type: Application
    Filed: October 5, 2016
    Publication date: April 5, 2018
    Applicant: International Business Machines Corporation
    Inventors: Shawnna M. Childress, Sudhakar Govindasamy, AHMED M. NASSAR, Craig M. Trim