Maintenance of frequent patterns: A survey

Post-Mining of Association Rules: Techniques for Effective Knowledge Extraction

Volumn , Issue , 2009, Pages 273-293

  Feng, Mengling ^a,c   Li, Jinyan ^a   Dong, Guozhu ^b   Wong, Limsoon ^c  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b WRIGHT STATE UNIVERSITY   (United States)

^c NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84892217424     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.4018/978-1-60566-404-0.ch014     Document Type: Chapter

References (31)

1. Agrawal, R., Imielinski, T., & Swami, A. (1993). Mining association rules between sets of items in large databases. Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data (pp. 207-216).
2. Agrawal, R., & Srikant, R. (1995). Mining sequential patterns. Proceedings of the Eleventh International Conference on Data Engineering (pp. 3-14).
3. Aumann, Y., Feldman, R., Lipshtat, O. & Manilla, H. (1999). Borders: An efficient algorithm for association generation in dynamic databases. Intelligent Information Systems, 12(1), 61-73.
4. Bayardo, R. J. (1998). Efficiently mining long patterns from databases. Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data (pp. 85-93).
5. Brin, S., Motwani, R., & Silverstein, C. (1997). Beyond market basket: Generalizing association rules to dependence rules. Data Mining and Knowledge Discovery, 2(1), 39-68.
6. Cai, Y. D., Clutter, D., Pape, G., Han, J., Welge, M., & Auvil L. (2004). MAIDS: mining alarming incidents from data streams. Proceedings of the 2004 ACM SIGMOD international conference on Management of data (pp. 919-920).
7. Cheung, D., Han, J., Ng, V. T., & Wong, C. Y. (1996). Maintenance of discovered association rules in large databases: an incremental update technique. Proceedings of the 1996 International Conference on Data Engineering (pp. 106-114).
8. Cheung, D., Lee, S. D., & Kao, B. (1997). A general incremental technique for maintaining discovered association rules. Database Systems for Advanced Applications (pp. 185-194).
9. Cheung, W., & Zaïane, O. R. (2003). Incremental mining of frequent patterns without candidate generation or support constraint. Proceedings of the 2003 International Database Engineering and Applications Symposium (pp. 111-116).
10. Demaine, E. D., López-Ortiz, A., & Munro, J. I. (2002). Frequency estimation of internet packet streams with limited space. Proceedings of the 10th Annual European Symposium on Algorithms (pp. 348-360).
11. Dong, G., & Li, J. (1999). Efficient Mining of Emerging Patterns: Discovering Trends and Differences. Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 15-18).
12. Feng, M., Dong, G., Li, J., Tan, Y-P., & Wong, L. (2007). Evolution and maintenance of frequent pattern space when transactions are removed. Proceedings of the 2007 Pacific-Asia Conference on Knowledge Discovery and Data Mining (pp. 489-497).
13. Grahne, G., & Zhu, J. (2003). Efficiently using prefix-trees in mining frequent itemsets. Proceedings 1st IEEE ICDM Workshop on Frequent Itemset Mining Implementations, 2003.
14. Guoda, K., & Zaki, M. J. (2001). Efficiently mining maximal frequent itemsets. Proceedings of the 2001 IEEE International Conference on Data Mining (pp. 163-170).
15. Han, J., Dong, G., & Yin, Y. (1999). Efficient mining of partial periodic patterns in time series database. International Conference on Data Engineering, (pp. 106-115).
16. Han, J., Pei, J., & Yin, Y. (2000). Mining frequent patterns without candidate generation. 2000 ACM SIGMOD International. Conference on Management of Data (pp. 1-12).
17. Halatchev, M., & Gruenwald, L. (2005). Estimating missing values in related sensor data streams. International Conference on Management of Data (pp. 83-94).
18. Jiang, N., & Gruenwald, L. (2006). Research issues in data stream association rule mining. ACM SIGMOD Record, 35(1), 14-19.
19. Koh, J-L., & Shieh, S-F. (2004). An efficient approach for maintaining association rules based on adjusting FP-tree structures. Proceedings of the 2004 Database Systems for Advanced Applications (pp. 417-424).
20. Lee, C-H., Lin, C-R., & Chen, M-S. (2005). Sliding window filtering: an efficient method for incremental mining on a time-variant database. Information Systems, 30(3), 227-244.
21. Leung, C. K.-S., & Khan, Q. I. (2006). DSTree: A Tree Structure for the Mining of Frequent Sets from Data Streams. Proceedings of the Sixth International Conference on Data Mining (pp. 928-932).
22. Leung, C. K-S., Khan, Q. I., Li Z., & Hoque, T. (2007). CanTree: a canonical-order tree for incremental frequent-pattern mining. Knowledge and Information Systems, 11(3), 287-311.
23. Li, H., Li, J., Wong, L., Feng, M., & Tan, Y-P. (2005). Relative risk and odds ratio: A data mining perspective. Symposium on Principles of Database Systems (pp. 368-377).
24. Manku, G. S., & Motwani, Q. (2002). Approximate frequency counts over data streams. VLDB (pp. 346-357).
25. Mannila, H. & Toivonen, H. (1997). Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery, 1(2), 241-258.
26. Metwally, A., Agrawal, D., & Abbadi, A. E. (2005) Efficient computation of frequent and top-k elements in data streams. International Conference on Data Theory (pp. 398-412).
27. Pasquier N., Bastide Y., Taouil R., & Lakhal, L. (1999). Efficient mining of association rules using closed itemset lattices. Information Systems, 24(1), 25-46.
28. Pei, J., Han, J. & Mao, R. (2000). CLOSET: An efficient algorithm for mining frequent closed itemsets. SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery 2000 (pp 21-30).
29. Silverstein, C., Brin, S., & Motwani, R. (1998). Scalable techniques for mining causal structures. Data Mining and Knowledge Discovery, 4(2), 163-192.
30. Veloso, A. A., Meira, W. Jr., Carvalho, M. B., Possas, B., Parthasarathy, S., & Zaki, M. J. (2002). Mining frequent itemsets in evolving databases. SIAM International Conference on Data Mining, 2002.
31. Wang, J., Han, J., & Pei, J. (2003). CLOSET+: Searching for the best strategies for mining frequent closed itemsets. Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 236-245).