Predicting Failures in Event Sequences

In this paper we develop new techniques for predicting failures and monitoring in categorical event sequences. New techniques are needed because failures are rare and previous data mining algorithms were overwhelmed by the staggering number of very frequent, but entirely unpredictive patterns that exist in such databases. This paper combines several techniques for pruning out unpredictive and redundant patterns, which reduce the size of the returned rule set by more than three orders of magnitude. As a concrete application, we present PlanMine, an algorithm to extract patterns of events that predict failures in databases of plan executions. PlanMine has also been fully integrated into two real-world planning systems. We experimentally evaluate the rules discovered by PlanMine, and show that they are extremely useful for understanding and improving plans, as well as for building monitors that raise alarms before failures happen.

[1]  Steven Minton,et al.  Quantitative Results Concerning the Utility of Explanation-based Learning , 1988, Artif. Intell..

[2]  Paul R. Cohen,et al.  Searching for Planning Operators with Context-Dependent and Probabilistic Effects , 1996, AAAI/IAAI, Vol. 1.

[3]  Austin Tate,et al.  Synthesizing Protection Monitors from Causal Structure , 1994, AIPS.

[4]  Heikki Mannila,et al.  Finding interesting rules from large sets of discovered association rules , 1994, CIKM '94.

[5]  James F. Allen,et al.  Improving Big Plans , 1998, AAAI/IAAI.

[6]  Nicholas Kushmerick,et al.  An Algorithm for Probabilistic Planning , 1995, Artif. Intell..

[7]  James F. Allen,et al.  TRIPS: An Integrated Intelligent Problem-Solving Assistant , 1998, AAAI/IAAI.

[8]  Ramakrishnan Srikant,et al.  Mining Sequential Patterns: Generalizations and Performance Improvements , 1996, EDBT.

[9]  Kamal Ali,et al.  Partial Classification Using Association Rules , 1997, KDD.

[10]  Karen Zita Haigh,et al.  Learning situation-dependent costs: improving planning from probabilistic robot execution , 1998, AGENTS '98.

[11]  Kristian J. Hammond,et al.  Explaining and Repairing Plans that Fail , 1987, IJCAI.

[12]  Paul R. Cohen,et al.  Understanding Planner Behavior , 1995, Artif. Intell..

[13]  Roberto J. Bayardo Brute-Force Mining of High-Confidence Classification Rules , 1997, KDD.

[14]  Heikki Mannila,et al.  Knowledge discovery from telecommunication network alarm databases , 1996, Proceedings of the Twelfth International Conference on Data Engineering.

[15]  Ramakrishnan Srikant,et al.  Mining sequential patterns , 1995, Proceedings of the Eleventh International Conference on Data Engineering.

[16]  Oren Etzioni,et al.  Representation design and brute-force induction in a Boeing manufacturing domain , 1994, Appl. Artif. Intell..

[17]  Alfred Mele,et al.  Autonomous agents , 1995 .

[18]  Mohammed J. Zaki Efficient enumeration of frequent sequences , 1998, CIKM '98.

[19]  Daniel A. Keim,et al.  On Knowledge Discovery and Data Mining , 1997 .

[20]  Mohammed J. Zaki Sequence mining in categorical domains: incorporating constraints , 2000, CIKM '00.