Entity mapping
First Claim
1. A method for improving computing structures, comprising:
- generating trees based, at least in part, on data, wherein the data is associated with dimensions, and wherein generating a tree includes transforming data into a structure of nodes that are not defined by the dimensions of the data,wherein nodes are robust against type-handling;
performing statistical tree analysis to calculate results for the trees, wherein the statistical tree analysis is performed independent of the dimensions of the data, and is performed on a basis of a set of connection rules;
creating a table of a composite result set by unionizing the results for the trees,wherein the table of composite result set captures chain linkages for a plurality of designated dimensions;
parsing nodes of the trees based, at least in part, on the composite result set,wherein parsing nodes uses a delimiter to determine depth and breadth of associated trees connecting across multiple dimensions through the captured chain linkages; and
visually displaying a forest of the trees.
1 Assignment
0 Petitions
Accused Products
Abstract
Systems, methods, and other embodiments associated with entity mapping. According to one embodiment, a method comprises generating trees based, at least in part, on data. The data is associated with dimensions. A tree includes nodes that are not defined by the dimensions of the data. The method further includes performing statistical tree analysis to calculate results for the trees. The statistical tree analysis is performed independent of the dimensions of the data. A table of a composite result set is created by unionizing the results for the at least two trees. The nodes of the trees are parsed based, at least in part, on the composite result set. The at least two trees can then be visually displayed.
-
Citations
20 Claims
-
1. A method for improving computing structures, comprising:
-
generating trees based, at least in part, on data, wherein the data is associated with dimensions, and wherein generating a tree includes transforming data into a structure of nodes that are not defined by the dimensions of the data, wherein nodes are robust against type-handling; performing statistical tree analysis to calculate results for the trees, wherein the statistical tree analysis is performed independent of the dimensions of the data, and is performed on a basis of a set of connection rules; creating a table of a composite result set by unionizing the results for the trees, wherein the table of composite result set captures chain linkages for a plurality of designated dimensions; parsing nodes of the trees based, at least in part, on the composite result set, wherein parsing nodes uses a delimiter to determine depth and breadth of associated trees connecting across multiple dimensions through the captured chain linkages; and visually displaying a forest of the trees. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. A system, comprising:
-
a tree logic configured to; receive a data set from an analytics engine, generate at least one tree based, at least in part, on the data set, wherein data of the data set is associated with dimensions, and wherein a tree includes nodes that are not defined by the dimensions of the data, wherein nodes are robust against type-handling; and perform a statistical tree analysis that connects multiple dimensions of data, and that is performed on a basis of a set of connection rules; and a table logic configured to; unionize the data of the nodes of the trees in a composite result set, and create a table based, at least in part, on the composite result from the unionized data, wherein the table of composite result set captures chain linkages for a plurality of designated dimensions; and a graphing logic configured to visually render the trees. - View Dependent Claims (11, 12, 13, 14)
-
-
15. A non-transitory computer-readable medium storing computer-executable instructions that when executed by a computer cause the computer to perform a method, the method comprising:
-
generating at least two trees based, at least in part, on data, wherein the data is associated with dimensions, wherein generating a tree includes transforming data into nodes that are not defined by the dimensions of the data, and wherein nodes are robust against type-handling; performing statistical tree analysis to calculate results for the at least two trees, wherein the statistical tree analysis is performed independent of the dimensions of the data, and is performed on a basis of a set of connection rules; creating a table of a composite result set by unionizing the results for the at least two trees, wherein the table of composite result set captures chain linkages for a plurality of designated dimensions; parsing nodes of the at least two trees based, at least in part, on the composite result set, wherein parsing nodes uses a delimiter to determine depth and breadth of associated trees connecting across multiple dimensions through the captured chain linkages; and visually displaying a forest of the at least two trees. - View Dependent Claims (16, 17, 18, 19, 20)
-
Specification