CPC G06Q 30/0201 (2013.01) [G06F 16/9024 (2019.01); G06N 7/01 (2023.01); G06N 20/00 (2019.01)] | 20 Claims |
1. A method comprising:
accessing a mixed dataset that contains data related to multiple variables, the multiple variables including at least one continuous variable and at least one discrete variable;
producing, prior to discretization, an undirected graph that indicates dependency among the multiple variables of the mixed dataset;
discretizing the data related to each continuous variable in a decreasing ratio based on a number of discrete variables neighboring each continuous variable in the undirected graph; and
identifying a directed graph that reflects causal relationships among the multiple variables by performing a greedy search of multiple candidate directed graphs using a scoring function that evaluates how well each candidate directed graph fits the discretized data.
|