Patents by Inventor Julien Clancy

Julien Clancy 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).

  • Systems and methods for recommending relationships within a graph database
    Patent number: 10318583
    Abstract: Systems and methods for relationship recommendations systems in accordance with embodiments of the invention are illustrated. In one embodiment, a relationship recommendation server system includes a processor wherein a relationship recommendation program configures the processor to obtain a graph database including a set of nodes including node attribute data and a set of edges including edge attribute data and describing relationships between nodes in the set of nodes, determine a set of motif data, where the motif data describes at least one subgraph including a subset of the nodes and a subset of the edges within the graph database, obtain a search node, generate additional edges between the search node and a subset of the nodes within the graph database, where the additional edges form subgraphs including the search node that are isomorphic to a subset of the motif data, and recommend relationships based on the generated additional edges.
    Type: Grant
    Filed: March 14, 2014
    Date of Patent: June 11, 2019
    Assignee: The Board of Trustees of the Leland Stanford Junior University
    Inventors: Evan Feinberg, Julien Clancy
  • Systems and Methods for Recommending Relationships within a Graph Database
    Publication number: 20140280224
    Abstract: Systems and methods for relationship recommendations systems in accordance with embodiments of the invention are illustrated. In one embodiment, a relationship recommendation server system includes a processor wherein a relationship recommendation program configures the processor to obtain a graph database including a set of nodes including node attribute data and a set of edges including edge attribute data and describing relationships between nodes in the set of nodes, determine a set of motif data, where the motif data describes at least one subgraph including a subset of the nodes and a subset of the edges within the graph database, obtain a search node, generate additional edges between the search node and a subset of the nodes within the graph database, where the additional edges form subgraphs including the search node that are isomorphic to a subset of the motif data, and recommend relationships based on the generated additional edges.
    Type: Application
    Filed: March 14, 2014
    Publication date: September 18, 2014
    Applicant: STANFORD UNIVERSITY
    Inventors: Evan Feinberg, Julien Clancy