Patents by Inventor Huang Xia

Huang Xia 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).

  • Publication number: 20210149858
    Abstract: A method comprises receiving a selection of data from a fact table and one or more dimension tables stored in a data warehouse, mapping data points from the selection of the data from the fact table and the one or more dimension tables to a reference space utilizing a lens function, generating a cover of the reference space using a resolution function, clustering the data points mapped to the reference space using the cover and a metric function to determine each node of a plurality of nodes of a graph, each node including at least one data point, determining a plurality of segments of the graph, each segment including at least one node, and generating a segment data structure identifying each segment as well as membership of each segment, the membership of each segment including at least one node from the plurality of nodes in the graph.
    Type: Application
    Filed: November 3, 2020
    Publication date: May 20, 2021
    Inventors: Huang Xia, Ronaldo Ama
  • Patent number: 10824607
    Abstract: A method comprises receiving a selection of data from a fact table and one or more dimension tables stored in a data warehouse, mapping data points from the selection of the data from the fact table and the one or more dimension tables to a reference space utilizing a lens function, generating a cover of the reference space using a resolution function, clustering the data points mapped to the reference space using the cover and a metric function to determine each node of a plurality of nodes of a graph, each node including at least one data point, determining a plurality of segments of the graph, each segment including at least one node, and generating a segment data structure identifying each segment as well as membership of each segment, the membership of each segment including at least one node from the plurality of nodes in the graph.
    Type: Grant
    Filed: July 21, 2017
    Date of Patent: November 3, 2020
    Assignee: Ayasdi AI LLC
    Inventors: Huang Xia, Ronaldo Ama
  • Patent number: 10509859
    Abstract: A method comprises receiving data points from a spreadsheet, mapping the data points to a reference space, generating a cover of the reference space, clustering the data points mapped to the reference space to determine each node of a graph, each node including at least one data point, generating a visualization depicting the nodes, the visualization including an edge between every two nodes that share at least one data point, generating a translation data structure indicating location of the data points in the spreadsheet as well as membership of each node, detecting a selection of at least one node, determining the location of data points in the spreadsheet corresponding to data points that are members of the selected node(s) using the translation data structure, and providing a first command to a spreadsheet application to provide a first visual identification of the first set of data points in the spreadsheet.
    Type: Grant
    Filed: July 20, 2017
    Date of Patent: December 17, 2019
    Assignee: Ayasdi AI LLC
    Inventors: Huang Xia, Sanket Patel
  • Publication number: 20180025035
    Abstract: A method comprises receiving a selection of data from a fact table and one or more dimension tables stored in a data warehouse, mapping data points from the selection of the data from the fact table and the one or more dimension tables to a reference space utilizing a lens function, generating a cover of the reference space using a resolution function, clustering the data points mapped to the reference space using the cover and a metric function to determine each node of a plurality of nodes of a graph, each node including at least one data point, determining a plurality of segments of the graph, each segment including at least one node, and generating a segment data structure identifying each segment as well as membership of each segment, the membership of each segment including at least one node from the plurality of nodes in the graph.
    Type: Application
    Filed: July 21, 2017
    Publication date: January 25, 2018
    Applicant: Ayasdi, Inc.
    Inventors: Huang Xia, Ronaldo Ama
  • Publication number: 20180024981
    Abstract: A method comprises receiving data points from a spreadsheet, mapping the data points to a reference space, generating a cover of the reference space, clustering the data points mapped to the reference space to determine each node of a graph, each node including at least one data point, generating a visualization depicting the nodes, the visualization including an edge between every two nodes that share at least one data point, generating a translation data structure indicating location of the data points in the spreadsheet as well as membership of each node, detecting a selection of at least one node, determining the location of data points in the spreadsheet corresponding to data points that are members of the selected node(s) using the translation data structure, and providing a first command to a spreadsheet application to provide a first visual identification of the first set of data points in the spreadsheet.
    Type: Application
    Filed: July 20, 2017
    Publication date: January 25, 2018
    Applicant: Ayasdi, Inc.
    Inventors: Huang Xia, Sanket Patel
  • Publication number: 20180025093
    Abstract: A method comprises receiving a data set, mapping data points from the data set to a reference space utilizing a lens function, generating a cover of the reference space using a resolution function, clustering the data points mapped to the reference space using the cover and a metric function to determine each node of a plurality of nodes of a graph, generating a graph including the plurality of nodes, the graph including an edge between every two nodes that share at least one data point as a member, and generating first and second data structures, the first data structure identifying membership of each node, the second data structure identifying each edge between each of the two nodes, the second data structure further identifying the nodes that are connected by each edge, the first and second data structure being capable of being queryable using a query language.
    Type: Application
    Filed: July 21, 2017
    Publication date: January 25, 2018
    Applicant: Ayasdi, Inc.
    Inventors: Huang Xia, Ronaldo Ama