"An Efficient Algorithm for Incremental Mining of Temporal Association Rules," In the Journal of Data & Knowledge Engineering (DKE), Elsevier, Volume 69, Issue 8, ISSN 0169-023X, pp. 800 – 815, August 2010.
• 2010
معلومات البحث
المؤلفون
Tarek F. Gharib, Hamed Nassar, Mohamed Taha, and Ajith Abraham.
الكلمات المفتاحية
Not Available
المجلة العلمية
Not Available
الناشر
Not Available
المجلد
Not Available
العدد
Not Available
الصفحات
Not Available
publication.type
International
رابط البحث
Open Link
المواد المرفقة
Not Available
الملخص
This paper presents the concept of temporal association rules in order to solve the problem of handling time series by including time expressions into association rules. Actually, temporal databases are continually appended or updated so that the discovered rules need to be updated. Re-running the temporal mining algorithm every time is ineffective since it neglects the previously discovered rules, and repeats the work done previously. Furthermore, existing incremental mining techniques cannot deal with temporal association rules. In this paper, an incremental algorithm to maintain the temporal association rules in a transaction database is proposed. The algorithm benefits from the results of earlier mining to derive the final mining output. The experimental results on both the synthetic and the real dataset illustrate a significant improvement over the conventional approach of mining the entire updated database.
أعضاء هيئة التدريس - جامعة بنها