TY - GEN
T1 - Prediction mining - An approach to mining association rules for prediction
AU - Deogun, Jitender
AU - Jiang, Liying
PY - 2005
Y1 - 2005
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=33645980978&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33645980978&partnerID=8YFLogxK
U2 - 10.1007/11548706_11
DO - 10.1007/11548706_11
M3 - Conference contribution
AN - SCOPUS:33645980978
SN - 3540286608
SN - 9783540286608
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 98
EP - 108
BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
T2 - 10th International Conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, RSFDGrC 2005
Y2 - 31 August 2005 through 3 September 2005
ER -