Patents by Inventor Ambuj Kumar Singh

Ambuj Kumar Singh 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).

  • Graph querying, graph motif mining and the discovery of clusters
    Patent number: 8396884
    Abstract: A method for analyzing, querying, and mining graph databases using subgraph and similarity querying. An index structure, known as a closure tree, is defined for topological summarization of a set of graphs. In addition, a significance model is created in which the graphs are transformed into histograms of primitive components. Finally, connected substructures or clusters, comprising paths or trees, are detected in networks found in the graph databases using a random walk technique and a repeated random walk technique.
    Type: Grant
    Filed: March 28, 2011
    Date of Patent: March 12, 2013
    Assignee: The Regents of the University of California
    Inventors: Ambuj Kumar Singh, Huahai He, Sayan Ranu
  • GRAPH QUERYING, GRAPH MOTIF MINING AND THE DISCOVERY OF CLUSTERS
    Publication number: 20110173189
    Abstract: A method for analyzing, querying, and mining graph databases using subgraph and similarity querying. An index structure, known as a closure tree, is defined for topological summarization of a set of graphs. In addition, a significance model is created in which the graphs are transformed into histograms of primitive components. Finally, connected substructures or clusters, comprising paths or trees, are detected in networks found in the graph databases using a random walk technique and a repeated random walk technique.
    Type: Application
    Filed: March 28, 2011
    Publication date: July 14, 2011
    Applicant: THE REGENTS OF THE UNIVERSITY OF CALIFORNIA
    Inventors: Ambuj Kumar Singh, Huahai He, Sayan Ranu
  • Graph querying, graph motif mining and the discovery of clusters
    Patent number: 7933915
    Abstract: A method for analyzing, querying, and mining graph databases using subgraph and similarity querying. An index structure, known as a closure tree, is defined for topological summarization of a set of graphs. In addition, a significance model is created in which the graphs are transformed into histograms of primitive components. Finally, connected substructures or clusters, comprising paths or trees, are detected in networks found in the graph databases using a random walk technique and a repeated random walk technique.
    Type: Grant
    Filed: February 27, 2007
    Date of Patent: April 26, 2011
    Assignee: The Regents of the University of California
    Inventors: Ambuj Kumar Singh, Huahai He