| 摘要 |
The present invention relates to systems and methods for brute force traversal of a transaction data set. In some embodiments, the systems and methods for brute force traversal receive a data dictionary that describes dimensions of transactions and hierarchical relationships between the dimensions. The transactions are then segmented according to a key system of possible combinations of segments. Statistical metrics of decision variables are calculated within each segment. Further, the ancestor segments for each segment are identified. The statistical metrics of each segment are compared to each of its ancestor segment's statistical metrics in order to identify outliers. It also relates to systems and methods for comparing segments. In these systems and methods, an output from a segmentation process is received. This output is reduced to a pruned set of segments. Next, separate graphs of connected segments are generated. The graphs provide a first order classification of the segments into non-overlapping spaces. The process of generating separate graphs utilizes graph theory in which each segment is a node. A central node within each of the separate graphs is identified. Lastly, the most profitable segments connected to the identified central node for each graph are analyzed for. |
