Mining general temporal association rules for items with different exhibition periods

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2002, Pages 59-66

  Chang, Cheng Yue ^a   Chen, Ming Syan ^a   Lee, Chang Hung ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77953886684     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. R. Agarwal, C. Aggarwal, and V. Prasad. A Tree Projection Algorithm for Generation of Frequent Itemsets. Jornal of Parallel and Distributed Computing (Special Issue on High Performance Data Mining), 2000.
2. R. Agrawal, T. Imielinski, and A. Swami. Mining Association Rules between Sets of Items in Large Databases. Proc. of ACM SIGMOD, pages 207-216, May 1993.
3. R. Agrawal and R. Srikant. Fast Algorithms for Mining Association Rules in Large Databases. Proc. of the 20th International Conference on Very Large Data Bases, pages 478-499, September 1994.
4. J. Ale and G. Rossi. An Approach to Discovering Temporal Association Rules. ACM Symposium on Applied Computing, 2000.
5. A. M. Ayad, N. M. El-Makky, and Y. Taha. Incremental Mining of Constrained Association Rules. Proc. of the First SIAM Conference on Data Mining, 2001.
6. X. Chen and I. Petr. Discovering Temporal Association Rules: Algorithms, Language and System. Proc. of 2000 Int. Conf. on Data Engineering, 2000.
7. E. C. et.al. Finding Interesting Associations without Support Pruning. IEEE Transactions on Knowledge and Data Engineering, pages 64-78, January/February 2001.
8. J. Han and Y. Fu. Discovery of Multiple-Level Association Rules from Large Databases. Proc. of the 21th International Conference on Very Large Data Bases, pages 420-431, September 1995.
9. J. Han, L. V. S. Lakshmanan, and R. T. Ng. Constraint-Based, Multidimensional Data Mining. COMPUTER (special issues on Data Mining), pages 46-50, 1999.
10. J. Han, J. Pei, and Y. Yin. Mining Frequent Patterns without Candidate Generation. Proc. of 2000 ACM-SIGMOD Int. Conf. on Management of Data, pages 486-493, May 2000.
11. C.-H. Lee, C.-R. Lin, and M.-S. Chen. Sliding-Window Filtering: An Efficient Algorithm for Incremental Mining. Proc. of the Tenth ACM International Conference on Information and Knowledge Management, November, 2001.
12. J.-L. Lin and M. Dunham. Mining Association Rules: Anti-Skew Algorithms. Proc. of 1998 Int'l Conf. on Data Engineering, pages 486-493, 1998.
13. B. Liu, W. Hsu, and Y. Ma. Mining Association Rules with Multiple Minimum Supports. Proc. of 1999 Int. Conf. on Knowledge Discovery and Data Mining, August 1999.
14. R.Ng and J.Han. Efficient and Effective Clustering Methods for Spatial Data Mining. Proc. of the 18th International Conference on Very Large Data Bases, pages 144-155, September 1994.
15. J.-S. Park, M.-S. Chen, and P. S. Yu. Using a Hash-Based Method with Transaction Trimming for Mining Association Rules. IEEE Transactions on Knowledge and Data Engineering, 9(5):813-825, October 1997.
16. R. Srikant and R. Agrawal. Mining Generalized Association Rules. Proc. of the 21th International Conference on Very Large Data Bases, pages 407-419, September 1995.
17. R. Srikant and R. Agrawal. Mining quantitative association rules in large relational tables. Proc. of 1996 ACM-SIGMOD Conf. on Management of Data, 1996.
18. K. Wang, Y. He, and J. Han. Mining Frequent Itemsets Using Support Constraints. Proc. of 2000 Int. Conf. on Very Large Data Bases, September 2000.