CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Cyclic Association Rules Mining under Constraints

by Wafa Tebourski, Wahiba Ben Abdesslem Karaa
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 49 - Number 20
Year of Publication: 2012
Authors: Wafa Tebourski, Wahiba Ben Abdesslem Karaa
10.5120/7889-1253

Wafa Tebourski, Wahiba Ben Abdesslem Karaa . Cyclic Association Rules Mining under Constraints. International Journal of Computer Applications. 49, 20 ( July 2012), 30-37. DOI=10.5120/7889-1253

@article{ 10.5120/7889-1253,
author = { Wafa Tebourski, Wahiba Ben Abdesslem Karaa },
title = { Cyclic Association Rules Mining under Constraints },
journal = { International Journal of Computer Applications },
issue_date = { July 2012 },
volume = { 49 },
number = { 20 },
month = { July },
year = { 2012 },
issn = { 0975-8887 },
pages = { 30-37 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume49/number20/7889-1253/ },
doi = { 10.5120/7889-1253 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:46:45.344032+05:30
%A Wafa Tebourski
%A Wahiba Ben Abdesslem Karaa
%T Cyclic Association Rules Mining under Constraints
%J International Journal of Computer Applications
%@ 0975-8887
%V 49
%N 20
%P 30-37
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Several researchers have explored the temporal aspect of association rules mining. In this paper, we focus on the cyclic association rules, in order to discover correlations among items characterized by regular cyclic variation overtime. The overview of the state of the art has revealed the drawbacks of proposed algorithm literatures, namely the excessive number of generated rules which are not meeting the expert's expectations. To overcome these restrictions, we have introduced our approach dedicated to generate the cyclic association rules under constraints through a new method called Constraint-Based Cyclic Association Rules CBCAR. The carried out experiments underline the usefulness and the performance of our new approach.

References
  1. Han, J. H. and Kamber, M. 2005. Data Mining: Concepts and Techniques,San Francisco, CA, USA.
  2. Byon, L. N. and Han, J. H. 2007. Fast algorithms for temporal association rules in a large database, Key engineering materials. Morgan Kaufmann Publishers Inc.
  3. Srikan, R. and Agrawal, 1996. R. Mining sequential patterns: Generalization and performance improvements. Proceedings of the 15th International Conference on Extending Database Technology.
  4. Li, Y. P, Ning, X. , Wang,S. and Jajodia, S. 2001. Discovering calendar-based temporal association rules, Journal of of Data & Knowledge Engineering, special issue: Temporal representation and reasoning
  5. Ozden, B. , Ramaswamy, S. and Silberschatz, A. 1998. Cyclic Association Rules, 14th International Conference on Data Engineering.
  6. Thuan, N. D. 2004. Mining cyclic association rules in temporal database, The Journal Science and technology development, Vietnam National University 7(8).
  7. Thuan, N. D. 2008. Mining time pattern association rules in temporal databases, Innovations and advances in computer sciences and engineering, In SCSS(1).
  8. Thuan, N. D. 2010. Mining time pattern association rules in temporal databases, Journal of Communication and Computer,V(7).
  9. Ben Ahmed, E. and Gouider, M. S. 2010. Towards a new mechanism of extracting cyclic association rules based on partition aspect, Research Challenges in Information Science.
  10. Lee, C. H. , Lin, C. R. and Chen, MS. 2001. On Mining General Temporal Association Rules in a Publication Database, International Conference on Data Mining.
  11. Ozden, B. , Ramaswamy, S. and Silberschatz, A. 1998. Cyclic Association Rules, 14th International Conference on Data Engineering.
  12. Ben Ahmed, E. and Gouider, M. S. 2010. PCAR : nouvelle approche de génération de règles d'association cycliques, Extraction et Gestion de Connaissances.
  13. Srikant, R. , Vu, Q. and Agrawal, R. 1997. Mining Association Rules with Item Constraints, in Proceedings of the 3rd International Conference on Knowledge Discovery and Data Mining, AAAI Press.
  14. Agrawal, R. and Skirant, R. 1994. Fast algorithms for mining association rules, Proceedings of the 20th International Conference on Very Large Databases.
  15. Wang, W. , Yang, J. and Muntz, R. 2001. TAR: temporal association rules on evolving numerical attributes, Proceedings of 17th International Conference on Data Engineering.
Index Terms

Computer Science
Information Sciences

Keywords

Temporal association rule cyclic association rule cycle length of cycle constraint-based association rule constraint

Powered by PhDFocusTM