Patents by Inventor Cetin Savkli

Cetin Savkli 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: 10936965
    Abstract: A method executable via operation of configured processing circuitry may include constructing a mutual information graph for categorical data with respect to observed attributes of a plurality of entities described in terms of respective ones of the observed attributes by the categorical data, determining a clique tree correlating attributes having at least a threshold level of mutual dependence among the observed attributes, and determining a normality rating for an entity relative to the plurality of entities based on the clique tree.
    Type: Grant
    Filed: October 5, 2017
    Date of Patent: March 2, 2021
    Assignee: The John Hopkins University
    Inventor: Cetin Savkli
  • Patent number: 10839256
    Abstract: An apparatus includes processing circuitry configured to execute instructions that, when executed, cause the apparatus to initialize a mixture model having a number of clusters including categorical data, iteratively update cluster assignments, evaluate cluster quality based on categorical density of the clusters, and prune clusters that have low categorical density, and determine an optimal mixture model based on the pruned clusters.
    Type: Grant
    Filed: April 2, 2018
    Date of Patent: November 17, 2020
    Assignee: The Johns Hopkins University
    Inventors: Cetin Savkli, Jeffrey S. Lin, Philip B. Graff
  • Patent number: 10146801
    Abstract: A method for distributed graph processing is provided including receiving ingest data from at least one data source, generating, using processing circuitry, a data map comprising a graph of edges between a plurality of data vertices of the ingest data, determining at least two nodes of a cluster, and storing a portion of the ingest data and a portion of the data map at the at least two nodes.
    Type: Grant
    Filed: July 13, 2015
    Date of Patent: December 4, 2018
    Assignee: The Johns Hopkins University
    Inventor: Cetin Savkli
  • Publication number: 20180307943
    Abstract: An apparatus includes processing circuitry configured to execute instructions that, when executed, cause the apparatus to initialize a mixture model having a number of clusters including categorical data, iteratively update cluster assignments, evaluate cluster quality based on categorical density of the clusters, and prune clusters that have low categorical density, and determine an optimal mixture model based on the pruned clusters.
    Type: Application
    Filed: April 2, 2018
    Publication date: October 25, 2018
    Inventors: Cetin Savkli, Jeffrey S. Lin, Philip B. Graff
  • Publication number: 20180101783
    Abstract: A method executable via operation of configured processing circuitry may include constructing a mutual information graph for categorical data with respect to observed attributes of a plurality of entities described in terms of respective ones of the observed attributes by the categorical data, determining a clique tree correlating attributes having at least a threshold level of mutual dependence among the observed attributes, and determining a normality rating for an entity relative to the plurality of entities based on the clique tree.
    Type: Application
    Filed: October 5, 2017
    Publication date: April 12, 2018
    Inventor: Cetin Savkli
  • Publication number: 20160125005
    Abstract: A method and apparatus for generating a structured profile of activities and transitions is provided. The method includes receiving data related to a plurality of activities and a plurality of transitions, wherein each of the plurality of transitions is a path between a pair of activities among the plurality of activities, storing the data related to the plurality of activities and the plurality of transitions into the storage device, reducing a dimension of the data by indexing the data using state variables, generating a plurality of nodes, wherein each of the plurality of nodes corresponds to each of the plurality of activities, generating a plurality of links, wherein each of the plurality of links corresponds to each of the plurality of transitions, and storing the plurality of nodes and the plurality of links as the structured profile at the storage device.
    Type: Application
    Filed: October 27, 2015
    Publication date: May 5, 2016
    Inventors: Cetin A. Savkli, Michael D. Lieberman
  • Publication number: 20160063037
    Abstract: A method for distributed graph processing is provided including receiving ingest data from at least one data source, generating, using processing circuitry, a data map comprising a graph of edges between a plurality of data vertices of the ingest data, determining at least two nodes of a cluster, and storing a portion of the ingest data and a portion of the data map at the at least two nodes.
    Type: Application
    Filed: July 13, 2015
    Publication date: March 3, 2016
    Inventor: Cetin Savkli