QUERY CAPABILITIES OF TOPOLOGICAL DATA ANALYSIS GRAPHS

摘要

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.