1. A computer implemented method of simplifying a plurality of correlation rules of a graph, comprising: receiving said plurality of correlation rules; creating an undirected graph using said plurality of correlation rules; removing at least one edge from said undirected graph if (i) said at least one edge is an uncertain edge connecting a first node and second node and (ii) said first node and said second node are connected by a first certain edge; adding a fifth node to said undirected graph if (i) a third node is connected to a fourth node by a second certain edge and (ii) said third node is connected to at least one other node by a plurality of uncertain edges; replacing one of said plurality of uncertain edges which connects said third node to one of said at least one other node with a temporary uncertain edge which connects said fifth node to said one of said at least one other node; creating a temporary certain edge which connects said fifth node to said fourth node; for each certain edge or temporary certain edge, changing said certain edge or temporary certain edge to a modified certain edge by (i) replacing a probability that said certain edge or said temporary certain edge connects two nodes to a seed value, (ii) modifying said seed value by adding a first value to said seed value and (iii) adding a second value to said first value; determining a maximum modified seed value wherein said maximum modified seed value was assigned to said modified certain edge; changing each uncertain edge and temporary uncertain edge to a modified uncertain edge by adding said maximum modified seed value to a probability that said uncertain edge or said temporary uncertain edge connects two nodes; removing said modified temporary certain edge; and running a minimum spanning tree algorithm on said modified undirected graph; wherein at least one of the steps is carried out using a computer device.