An efficient algorithm for incremental mining of temporal association rules

@article{Gharib2010AnEA,
  title={An efficient algorithm for incremental mining of temporal association rules},
  author={Tarek F. Gharib and Hamed Nassar and Mohamed Taha and Ajith Abraham},
  journal={Data Knowl. Eng.},
  year={2010},
  volume={69},
  pages={800-815}
}
Article history: Received 14 September 2008 Received in revised form 5 March 2010 Accepted 8 March 2010 Available online 15 March 2010 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… CONTINUE READING
Highly Cited
This paper has 40 citations. REVIEW CITATIONS
27 Citations
22 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 27 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 22 references

Pardasani, PPCI algorithm for mining temporal association rules in large databases

  • K. R. Anjana Pandey
  • In International Journal of Information…
  • 2009
Highly Influential
14 Excerpts

HongChen,Miningnon-derivable frequent itemsets overdata stream

  • Haifeng Lia
  • In the International Journal ofData…
  • 2009
1 Excerpt

Similar Papers

Loading similar papers…