An approach to discovering temporal association rules
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
ACM Transactions on Information Systems (TOIS)
Discovery of Frequent Episodes in Event Sequences
Data Mining and Knowledge Discovery
Efficient Mining of Intertransaction Association Rules
IEEE Transactions on Knowledge and Data Engineering
Building knowledge discovery into a geo-spatial decision support system
Proceedings of the 2003 ACM symposium on Applied computing
RuleGrowth: mining sequential rules common to several sequences by pattern-growth
Proceedings of the 2011 ACM Symposium on Applied Computing
CMRules: Mining sequential rules common to several sequences
Knowledge-Based Systems
Implementing an efficient causal learning mechanism in a cognitive tutoring agent
IEA/AIE'11 Proceedings of the 24th international conference on Industrial engineering and other applications of applied intelligent systems conference on Modern approaches in applied intelligence - Volume Part II
A cognitive tutoring agent with episodic and causal learning capabilities
AIED'11 Proceedings of the 15th international conference on Artificial intelligence in education
A computational model for causal learning in cognitive agents
Knowledge-Based Systems
ADMA'11 Proceedings of the 7th international conference on Advanced Data Mining and Applications - Volume Part II
Mining sequential rules common to several sequences with the window size constraint
Canadian AI'12 Proceedings of the 25th Canadian conference on Advances in Artificial Intelligence
Hi-index | 0.00 |
An interesting application of association mining in the context temporal databases is that of prediction. Prediction is to use the antecedent of a rule to predict the consequent of the rule. But not all of association rules may be suitable for prediction. In this paper, we investigate the properties of rules for prediction, and develop an approach called prediction mining — mining a set of association rules that are useful for prediction. Prediction mining discovers a set of prediction rules that have three properties. First, there must be a time lag between antecedent and consequent of the rule. Second, antecedent of a prediction rule is the minimum condition that implies the consequent. Third, a prediction rule must have relatively stable confidence with respect to the time frame determined by application domain. We develop a prediction mining algorithm for discovering the set of prediction rules. The efficiency and effectiveness of our approach is validated by experiments on both synthetic and real-life databases, we show that the prediction mining approach efficiently discovers a set of rules that are proper for prediction.