Entity mapping

1. A method for improved interpolation of data, the method, comprising:

executing, on a processor, instructions that cause the processor to perform operations comprising:

generating trees from a set of data by transforming the data into a structure of nodes, wherein the data is associated with dimensions and the structure of the nodes is dimension independent;

performing statistical tree analysis that calculates results based on connection rules that define relationships between nodes in each tree;

unionizing, using a tree-traversing algorithm, the results of the statistical tree analysis to create a composite result set identifying chains of relationships between the nodes in each tree;

parsing nodes of the trees based, at least in part, on the composite result set to determine depth and breadth of the trees based on a data delimiter; and

generating a graphical representation of depth and breadth of the nodes in the trees based on the composite result set, wherein the graphical representation displays the chains of the relationships between the nodes in each tree, thereby enabling relationships between the nodes in each tree to be interpolated without reference to any intermediate node.

2. The method of claim 1 , wherein transforming the data into the structure of the nodes further comprises connecting the dimensions, each dimension being a characteristic to identify connections between two or more of the nodes.

3. The method of claim 1 , wherein performing the statistical tree analysis further comprises connecting the dimensions of the data using relational information stored as metadata of a node.

4. The method of claim 1 , further comprising transforming the data into nodes that represent a dimension of the data, and a path from node to node is based on the connection rules.

5. The method of claim 1 , wherein performing the statistical tree analysis further comprises connecting dimensions of data using relational information.

6. The method of claim 1 , wherein performing the statistical tree analysis further comprises identifying chains of related data between the nodes.

7. The method of claim 1 , further comprising masking at least a subset of values in the nodes.

8. The method of claim 1 , further comprising encoding metadata associated with the nodes.

9. A system for improved interpolation of data, the system, comprising:

a processor coupled to a memory that stores instructions that when executed by the processor cause the processor to:

generate trees from a set of data by transforming data into a structure of nodes, wherein the data is associated with dimensions and the structure of the nodes is data dimension independent;

perform statistical tree analysis that calculates results based on connection rules that define relationships between nodes in each tree;

unionize, using a tree-traversing algorithm, the results of the statistical tree analysis to create a composite result set identifying chains of relationships between the nodes in each tree;

parse nodes of the trees based, at least in part, on the composite result set to determine depth and breadth of the trees based on a data delimiter; and

generate a graphical representation of depth and breadth of the nodes in the trees based on the composite result set, wherein the graphical representation displays the chains of the relationships between the nodes in each tree, thereby enabling relationships between the nodes in each tree to be interpolated without reference to any intermediate node.

10. The system of claim 9 , wherein a dimension is a characteristic of a node.

11. The system of claim 10 , wherein a characteristic comprises one of customer information, account information, or a demographic feature.

12. The system of claim 9 , wherein the statistical tree analysis identifies chains of related data between the data.

13. The system of claim 9 , wherein the statistical tree analysis connects the dimensions of the data using relational information stored as metadata of a node.

14. A non-transitory computer-readable medium storing executable instructions that, in response to execution, cause a system comprising a processor to perform operations, comprising:

generating trees from a set of data by transforming the data into a structure of nodes, wherein the data is associated with dimensions and the structure of the nodes is dimension independent;

performing statistical tree analysis that calculates results based on connection rules that define relationships between nodes in each tree;

unionizing, using a tree-traversing algorithm, the results of the statistical tree analysis to create a composite result set identifying chains of relationships between the nodes in each tree;

parsing nodes of the trees based, at least in part, on the composite result set to determine depth and breadth of the trees based on a data delimiter; and

generating a graphical representation of depth and breadth of the nodes in the trees based on the composite result set, wherein the graphical representation displays the chains of the relationships between the nodes in each tree, thereby enabling relationships between the nodes in each tree to be interpolated without reference to any intermediate node.

15. The non-transitory computer-readable medium of claim 14 , wherein a dimension is a characteristic of a node.

16. The non-transitory computer-readable medium of claim 14 , wherein performing the statistical tree analysis further comprises con connecting dimensions of the data using relational information.

17. The non-transitory computer-readable medium of claim 14 , wherein performing the statistical tree analysis further comprises identifying chains of related data.

18. The non-transitory computer-readable medium of claim 14 , further comprising masking the data associated with a node.

19. The non-transitory computer-readable medium of claim 14 , further comprising encoding metadata associated with the nodes.