ROOT CAUSE ANALYSIS OPTIMIZATION
Root cause analysis is augmented by providing optimized inputs to root cause analysis systems or the like. Such optimized inputs can be generated from causality graphs by creating sub-graphs, finding and removing cycles, and reducing the complexity of the input. Optimization of inputs enables a root cause analysis system to reduce the number of iterative cycles that are required to execute probable cause analysis, among other things. In one instance, cycle removal eliminates perpetuation of errors throughout a system being analyzed.
1 . An optimized root cause analysis system, comprising:
a division component that divides a causality graph into sub-graphs; and
a reduction component that reduces at least one of the sub-graphs to a bipartite graph of causes and observations.
2 . The system of claim 1 , the division component identifies weakly connected sub-graphs from the causality graph.
3 . The system of claim 1 , the reduction component further reduces at least one of the sub-graphs as a function of expert information regarding root and/or transient causes.
4 . The system of claim 1 , the reduction component employs a Markovian processes to reduce the complexity of sub-graphs.
5 . The system of claim 1 , the reduction component employs a one or more probability calculus operations including catenation or combination.
6 . The system of claim 1 , further comprising a cycle resolution component that identifies and removes cycles from the sub-graphs.
7 . The system of claim 6 , the cycle resolution component applies probability calculus operations catenation and/or combination between starting and ending nodes.
8 . The system of claim 1 , further comprising an analysis component that reasons over the bipartite graphs to identify root causes.
9 . A method optimizing root cause analysis, comprising:
identifying a causality graph; and
reducing the graph to a bipartite graph of causes and symptoms.
10 . The method of claim 9 , further comprising employing probability calculus to reduce the graph.
11 . The method of claim 9 , further comprising executing a Markovian process to reduce the graph.
12 . The method of claim 9 , comprising reducing the graph further as function of expert identified root causes and/or transient causes.
13 . The method of claim 9 , further comprising partitioning the graph into sub-graphs to facilitate parallel processing.
14 . The method of claim 13 , further comprising identifying weakly connected sub-graphs and partitioning as a function thereof.
15 . The method of claim 9 , further comprising detecting and removing cycles.
16 . The method of claim 15 , removing cycles comprising applying catenation and combination operations between starting and ending nodes in a graph.
17 . A root cause analysis optimization method, comprising:
segmenting an inference graph into multiple sub-graphs;
removing cycles from the sub-graphs; and
reducing the complexity of at least one of the sub-graphs.
18 . The method of claim 17 , further comprising reducing at least one of the sub-graphs to a bipartite graph of causes and observations.
19 . The method of claim 18 , further comprising reducing bipartite graphs as a function of expert information about root and/or transient causes.
20 . The method of claim 17 , further comprising reasoning over at least one of sub-graphs to identify root causes given one or more observations.