Discovery of association rules in temporal databases

Proceedings - International Conference on Information Technology-New Generations, ITNG 2007

Volumn , Issue , 2007, Pages 371-376

  Tansel, Abdullah Uz ^a   Imberman, Susan P ^b  

^a CITY UNIVERSITY OF NEW YORK   (United States)

^b CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

Association rules; Enumeration operation; Incremental data mining; Negative border; Temporal databases

Indexed keywords

ALGORITHMS; ASSOCIATION RULES; DATA MINING; INFORMATION MANAGEMENT; KNOWLEDGE ENGINEERING;

DATASETS; INCREMENTAL ASSOCIATION RULE MINING;

DATABASE SYSTEMS;

EID: 34548118398     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITNG.2007.78     Document Type: Conference Paper

References (26)

1. N.F. Ayn, A.U. Tansel, and E. Arun. An efficient algorithm to update large itemsets with early pruning. Technical Report BU-CEIS-9908 Dept of CEIS Bilkent University
2. N. F. Ayan, A. U. Tansel, and E. Arkun, 'An efficient algorithm to update large itemsets with early pruning', Proc. of KDD-99, San Diego, August 1999.
3. R. Agraval, T. Imielinski, and A. Swami, 'Mining Association Rules between Sets of Items in Large Databases', In Proc.of ACM SIGMOD'93, Washington, DC, 1993, 207-216.
4. th VLDB'94, Santiago, Chile, 1994, pp. 487-499
5. R. Agrawal, and R. Srikant, 'Mining Sequential Patterns', In Proc. of ICDE'95, Taipei, Taiwan, 1985.
6. C. Betini, X. S. Wang, and S. Jajodia, 'Testing Complex Temporal Relationships Involving Multiple Granularities and Its Application to Data Mining', In Proc. Of PODS'96, Montreal, Canada, 1996, pp. 68-78.
7. S. Brin, R. Motwani, J. D. Ullman, and S. Tsur, 'Dynamic Itemset Counting and Implication Rules for Market Basket Data', In Proc. ofACM SIGMOD'97, 1997, pp. 255-264.
8. M. S Chen, J. S. Park, and P. S. Yu, 'An Effective Hash Based Algorithm for Mining Association Rules' In Proc. of ACM SIGMOD'95, San Jose, California, 1995, pp. 175-186.
9. David Wai-Lok Cheung, Jiawei Han, Vincent T. Ng, and C. Y. Wong. Maintenance of discovered association rules in large databases: An incremental update technique. In Proceedings of Intl. Conf. on Data Engineering (ICDE'96), New Orleans, Louisiana, February 1996.
10. David Wai-Lok Cheung, Sau Dan Lee, and Benjamin Kao. A general incremental technique for maintaining discovered association rules. In Proceedings of the 5 th Intl. Conf. on Database Systems for Advanced Applications (DASFAA'97), Melbourne, Australia. April 1997.
11. U. M. Fayyad, G. Piatetsky-Shapiro, and P. Smyth, 'From Data Mining to Knowledge Discovery: An Overview' In Advances in Knowledge Discovery and Data Mining, Fayyad, U. M et al, editors. AAAI/MIT Press, 1996, pp. 1-31.
12. S. K. Gadia, 'A Homogenous Relational Model and Query Languages for Temporal Databases', ACM TODS, Vol. 13, No. 4, 1988, pp. 418-448.
13. H. Mannila, H. Toivonen, and A. I. Verkamo, 'Efficient Algorithms for Discovering Association Rules', In Proc. of AAAI'94 Workshop on Knowledge Discovery in Databases, Seattle, Washington, 1994, pp. 181-192.
14. N. L. Sarda and N. V. Srinivas. An adaptive algorithm for incremental mining of association rules. In Proceedings of DEXA Workshop'98, pages 240-245, 1998
15. st VLDB'95, Zurich, Switzerland, 1995.
16. rd Intl. Conf. on Knowledge Discovery and Data Mining (KDD'97), New Port Beach, California, 1997.
17. R. Snodgrass, R. 'The Temporal Query Language Tquel', ACM TODS, Vol. 12, No.2, 1987, pp. 247-298.
18. A. U. Tansel, A. U 'Adding Time Dimension to Relational Model and Extending Relational Algebra', Information Systems Vol. 11,No. 4, 1986, pp. 343-355.
19. rd ICDE'87, 1987, pp. 536-546.
20. Tansel, A .U. et al eds, Temporal Databases: Theory, Design and Implementation. Redwood City, California: Benjamin Cummings, 1003.
21. A. U. Tansel, A, 'Temporal Relational Data Model', IEEE TKDE, Vol. 9, No. 3, 1997, pp. 464-479.
22. A. U. Tansel, 'Discovery of Association Rules in Temporal Databases', Technical report, Baruch College, May 2003.
23. S. Thomas, S. Bodagala, K. Alsabti, and S. Ranks, 'An efficient algorithm for the incremental update of association rules in large databases' In Proc. of the KDD'97, New Port Beach, California, 1997.
24. nd VLDB'96, Mumbai, India, 1996.
25. X. S. Wang, C. Betini, A. Brodsky, and S. Jajodia, 'Logical Design for Temporal Databases with Multiple Granularities', ACM TODS, Vol. 22,No. 2, 1997, pp. 115-170.
26. J. Wijsen, and R. Meersman, R. 'On the Complexity of Mining Temporal Trends' In Proc. of SIGMOD'97 Workshop on Research Issues on Data Mining and Knowledge Discovery, San Jose, California, 1997.