Theme-Logo
  • Login
  • Home
  • Course
  • Publication
  • Theses
  • Reports
  • Published books
  • Workshops / Conferences
  • Supervised PhD
  • Supervised MSc
  • Supervised projects
  • Education
  • Language skills
  • Positions
  • Memberships and awards
  • Committees
  • Experience
  • Scientific activites
  • In links
  • Outgoinglinks
  • News
  • Gallery
publication name "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.
Authors Tarek F. Gharib, Hamed Nassar, Mohamed Taha, and Ajith Abraham.
year 2010
keywords
journal
volume Not Available
issue Not Available
pages Not Available
publisher Not Available
Local/International International
Paper Link http://www.sciencedirect.com/science/article/pii/S0169023X10000364
Full paper download
Supplementary materials Not Available
Abstract

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.

Benha University © 2023 Designed and developed by portal team - Benha University