Optimized transitive association rule: mining significant stopover between events

ABSTRACT

We consider a problem of finding optimized transitive association rules. A transitive association rule is a transitive sequence of different events. Each of two consecutive events in a transitive association rule is a conventional association rule. Transitive confidence is the product of confidence values of all the association rules in the event sequence. The optimized transitive association rule from a cause event to an effect event is the optimal sequence of events whose transitive confidence is maximum among all possible sequences from the cause to the effect. In this paper, we present space efficient algorithms for computing all of the optimized transitive association rules between events, whose transitive confidence is not less than a user specified minimum confidence value.

REFERENCES

• 1: Rakesh Agrawal , Ramakrishnan Srikant, Mining Sequential Patterns, Proceedings of the Eleventh International Conference on Data Engineering, p.3-14, March 06-10, 1995
• 2: Thomas H. Cormen , Clifford Stein , Ronald L. Rivest , Charles E. Leiserson, Introduction to Algorithms, McGraw-Hill Higher Education, 2001