Mining and post-mining of time stamped association rules

We study the problem of discovering time stamped association rules and to post-mine it for reducing the number of rules to make it user interesting. Most works in mining association rules produces a large number of rules which are almost non-interesting to the user. In this paper, we propose an algorithm which uses the concept of lower bounding distance and ontology to mine and post-mine the rules respectively. This paper defines a matching operator for rule selection. The matching operator selects the time stamped association rule that matches with the user-specified constraint. The experimental results show that the execution time is reduced when compared with the traditional mining method. Also the number of rules is greatly reduced when the matching operator is used. Our approach will help the decision maker to analyze the results effectively.