On mining general temporal association rules in a publication database

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2001, Pages 337-344

  Lee, Chang Hung ^a   Lin, Cheng Ru ^a   Chen, Ming Syan ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (18)

1. 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.
2. 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.
3. J.M. Ale and G. Rossi. An Approach to Discovering Temporal Association Rules. ACM Symposium on Applied Computing, 2000.
4. M.-S. Chen, J. Han, and P. S.Yu. Data Mining: An Overview from Database Perspective. IEEE Transactions on Knowledge and Data Engineering, 8(6):866-883, December 1996.
5. X. Chen and I. Petr. Discovering Temporal Association Rules: Algorithms, Language and System. Proc. of 2000 Int. Conf. on Data Engineering, 2000.
6. D. Cheung, J. Han, V. Ng, and C.Y. Wong. Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Technique. Proc. of 1996 Int'l Conf. on Data Engineering, pages 106-114, February 1996.
7. 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.
8. 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.
9. J. Hipp, U. Güntzer, and G. Nakhaeizadeh. Algorithms for association rule mining - a general survey and comparison. SIGKDD Explorations, 2( 1):5844, July 2000.
10. C.-H. Lee, C.-R. Lin, and M.-S. Chen. Sliding-Window Filtering: An Efficient Algorithm for Incremental Mining. Proc. of the ACM 10th Intern'l Conf. on Information and Knowledge Management, November 2001.
11. J.-L. Lin and M.H. Dunham. Mining Association Rules: Anti-Skew Algorithms. Proc. of 1998 Int'l Conf. on Data Engineering, pages 486-493, 1998.
12. 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.
13. 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):8 13-825, October 1997.
14. 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.
15. R. Srikant and R. Agrawal. Mining quantitative association rules in large relational tables. Proc. of 1996 ACM-SIGMOD Conf. on Management of Data, 1996.
16. A. K. H. Tung, J. Han, L. V. S. Lakshmanan, and R. T. Ng. Constraint-Based Clustering in Large Databases. Proc. of 2001 Int. Conf. on Database Theory, January 2001.
17. 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.
18. C. Yang, U. Fayyad, and P. Bradley. Efficient discovery of error-tolerant frequent itemsets in high dimensions. The Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2001.