We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 December 2024
Reseach Article

A Framework for Incremental Mining of Interesting Temporal Association Rules

by Ahmed Sultan Al-Hegami
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 131 - Number 8
Year of Publication: 2015
Authors: Ahmed Sultan Al-Hegami
10.5120/ijca2015907433

Ahmed Sultan Al-Hegami . A Framework for Incremental Mining of Interesting Temporal Association Rules. International Journal of Computer Applications. 131, 8 ( December 2015), 28-33. DOI=10.5120/ijca2015907433

@article{ 10.5120/ijca2015907433,
author = { Ahmed Sultan Al-Hegami },
title = { A Framework for Incremental Mining of Interesting Temporal Association Rules },
journal = { International Journal of Computer Applications },
issue_date = { December 2015 },
volume = { 131 },
number = { 8 },
month = { December },
year = { 2015 },
issn = { 0975-8887 },
pages = { 28-33 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume131/number8/23471-2015907433/ },
doi = { 10.5120/ijca2015907433 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:26:44.368663+05:30
%A Ahmed Sultan Al-Hegami
%T A Framework for Incremental Mining of Interesting Temporal Association Rules
%J International Journal of Computer Applications
%@ 0975-8887
%V 131
%N 8
%P 28-33
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Association rules are an important problem in data mining. Massively increasing volume of data with temporal dependencies in real life databases has motivated researchers to design novel and incremental algorithms for temporal association rules mining. In this paper, an incremental association rules mining algorithm is proposed that integrates interestingness criterion during the process of building the model called SUMA. One of the main features of the proposed framework is to capture the user background knowledge, which is monotonically augmented. The incremental model that reflects the changing data over the time and the user beliefs is attractive in order to make the over all KDD process more effective and efficient. The proposed framework is implemented and experiment it with some public datasets and found the results quite promising.

References
  1. Han, J. and Kamber, M.: Data Mining: Concepts and Techniques. San Francisco, Morgan Kauffmann Publishers, (2001).
  2. Dunham M. H.: Data Mining: Introductory and Advanced Topics. 1st Edition Pearson Education (Singapore) Pte. Ltd. (2003).
  3. Hand, D., Mannila, H. and Smyth, P.: Principles of Data Mining, Prentice-Hall of India Private Limited, India, (2001).
  4. Liu, B. and Hsu, W. : Post Analysis of Learned Rules. In Proceedings of the 13th National Conference on AI (AAAI’96), (1996).
  5. Liu, B. and Hsu, W., Lee, H-Y. And Mun, L-F.: Tuple-Level Analysis for Identification of Interesting Rules. Technical Report TRA5/95, SoC. National University of Singapore, Singapore, (1996).
  6. Liu, B. and Hsu, W., Mun, L-F, and Lee, H-Y.: Finding Interesting Patterns Using User Expectations:. Technical Report:TRA7/96, Department of Information Systems and Computer Science, National University of Singapore, (1996).
  7. Kaur H., Wasan. S. K, Al-Hegami A. S., Bhatnagar, V.: A Unified Approach for Discovery of Interesting Association Rules. In Proceedings of Industrial Conference on Data Mining (ICDM), (2006).
  8. Al-Hegami, A. S.: Pushing Novelty Criterion into Incremental Mining Algorithm, International Journal of Computer Science and Network Security,Korea, VOL.7 No.12, December (2007).
  9. Yafi, E., Al-Hegami, A. S, Alam, M. A., and Biswas, R.: Incremental Mining of Shocking Association Patterns. In Proceedings of World Academy of Science, Engineering and Technology, Volume 37, Dubai, UAE, (2009).
  10. Bhatnagar, V., Al-Hegami A. S., and N. Kumar: A hybrid approach for Quantification of Novelty in Rule Discovery. In Proceedings of International Conference on Artificial Learning and Data Mining (ALDM’05), Turkey, Feb. 25-27, pp 39-42 (2005).
  11. Ale, J. M. and Rossi, G. H. : An approach to discovering temporal association rules. In Proc. of the 2000 ACM Symposium on Applied Computing, pages 294–300, (2000).
  12. Lianga, Z. , Xinming, T., Lin, L. and Wenliang, J.: Temporal Asocation Rule Mining Based On T-Aprior Algorthim And Its Typical Application. ,Chine, (2008).
  13. Dafas, P. A and d'Avila Garcez, A. S.: Applied temporal rule mining to time series, (2005).
  14. Hang, J. and Wei, W.: Efficient Algorithm for Mining Temporal Association Rule. International Journal of Computer Science and Network Security, VOL.7 No.4, (2007).
  15. Ganti, V., Gehrke, J. and Ramakrishnan, R.: DEMON: Mining and Monitoring evolving data. In Proceeding of the 16th International Conference on Data Engineering, San Diego, USA. (2000).
  16. Lee, S., and Cheung, D.: Maintenance of discovered association rules. When to update? In Research Issues on Data Mining and Knowledge Discovery. (1997).
  17. Zaki, M. and Hsiao, C.: Charm: An efficient algorithm for closed itemset mining. In Proceeding of the 2nd SIAM International Conference on Data Mining, Arlington, USA. (2002).
  18. Cheung, D. W., Han, J., Ng, V.T., Wong, C.Y.: Maintenance of discovered Association Rules in Large Databases: An Incremental Updating Technique, Proc. the International Conference On Data Engineering, (1996) 106-114.
  19. Cheung, D. W., Ng, V.T., Tam, B.W.: Maintenance of Discovered Knowledge: A case in Multi-level Association Rules, Proc. 2nd International Conference on Knowledge Discovery and Data Mining, (1996) 307-310.
  20. Cheung, D. W., Lee, S.D., Kao, B.: A general Incremental Technique for Mining Discovered Association Rules, Proc. International Conference on Database System for Advanced Applications, (1997) 185-194.
  21. Bhatnagar, V., Al-Hegami A. S., and N. Kumar: Novelty as a Measure of Interestingness in Knowledge Discovery. In International Journal of Information Technology, Volume 2, Number 1, (2005).
  22. Al-Hegami, A. S.: Pushing Novelty Criterion into Incremental Mining Algorithm. International Journal of Computer Science and Network Security, Korea, VOL.7 No.12, (2007).
  23. Al-Hegami, A. S. : Subjective Measures and their Role in Data Mining Process. In Proceedings of the 6th International Conference on Cognitive Systems, New Delhi, India, (2004).
  24. Yafi, E., Al-Hegami, A. S, Alam, M. A., and Biswas, R.: YAMI: Incremental Mining of Interesting Association Patterns. In International Arab Journal of Information T, Vol. 9, No. 6, (2012).
  25. Al-Hegami, A. S.: On Quantification of Novelty in Knowledge Discovery Systems. Ph.D. Dissertation. Department of Computer Science, University of Delhi, India, (2006).
  26. Al-Hegami, A. S and Al-Ariki, S.: Constraint Based Mining of Interesting Temporal Association Rules. Submitted for publication in international conference of machine learning and applications (ICMLA), 2010, USA.
Index Terms

Computer Science
Information Sciences

Keywords

Knowledge discovery in databases (KDD) Data mining Incremental Association rules Temporal association rule Domain knowledge Interestingness Novelty measure.