Efficient mining of temporal emerging itemsets from data streams

Expert Systems with Applications

Volumn 36, Issue 1, 2009, Pages 885-893

  Chu, Chun Jung ^a   Tseng, Vincent S ^b   Liang, Tyne ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^b NATIONAL CHENG KUNG UNIVERSITY   (Taiwan)

Author keywords

Association rules; Data streams; Temporal emerging frequent itemsets

Indexed keywords

ASSOCIATIVE PROCESSING; DATA MINING; MINES; RIVERS; VEHICLE ROUTING; WINDOWS;

ASSOCIATION RULES; DATA STREAMING; DATA STREAMS; EXECUTION TIME; EXPERIMENTAL CONDITIONS; FREQUENT ITEMSETS; HIGH POTENTIAL; HIGH-PRECISION; ITEMSETS; SPACE EFFICIENCIES; TEMPORAL EMERGING FREQUENT ITEMSETS; TIME WINDOWS;

MINING;

EID: 53849141859     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2007.10.040     Document Type: Article

References (30)

1. Agrawal, R., & Srikant, R. (1995). Mining sequential patterns. In Proceedings of the 11th international conference on data engineering (pp. 3-14), March.
2. Agrawal, R., Imielinski, T., & Swami, A. (1993). Mining association rules between sets of items in large databases. In Proceedings of 1993 ACM SIGMOD international conference on management of data (pp. 207-216). Washington, DC, May.
3. Agrawal R., Mannila H., Srikant R., Toivonen H., and Verkamo A.I. Fast discovery of association rules. In: Fayyad U., Piatetsky-Shapiro G., Smyth P., and Uthurusamy R. (Eds). Advances in knowledge discovery and data mining (1996), AAAI/MIT Press 307-328
4. Ayn, N. F., Tansel, A. U., & Arun, E. (1999a). An efficient algorithm to update large itemsets with early pruning. Technical Report BU-CEIS-9908 Dept. of CEIS Bilkent University, June.
5. Ayn, N. F., Tansel, A. U., & Arun, E. (1999b). An efficient algorithm to update large itemsets with early pruning. In Proceedings of the fifth ACM SIGKDD international conference on knowledge discovery and data mining, San Diego, August.
6. Bastide Y., Taouil R., Pasquier N., Stumme G., and Lakhal L. Mining frequent patterns with counting inference. SIGKDD Explorations 2 2 (2000)
7. Bettini C., Wang X.S., and Jajodia S. Testing complex temporal relationships involving multiple granularities and its application to data mining. Proceedings of the 15th ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems, June 3-5, 1996 (1996), ACM Press, Montreal, Canada 68-78
8. Brin, S., Motwani, R., Ullman, J., & Tsur, S. (1997). Dynamic itemset counting and implication rules for market basket data. In Proceedings ACM SIGMOD conference management of data, May.
9. Cheng, H., Yan, X., & Han, J. (2004). IncSpan: Incremental mining of sequential patterns in large database. In Proceedings 2004 international conference on knowledge discovery and data mining (KDD'04), Seattle, WA, August.
10. Cheung, D. W.-L., Han, J., Ng, V., & Wong, C. Y. (1996a). Maintenance of discovered association rules in large databases: An incremental updating technique. In Proceedings of 1996 international conference on data engineering (pp. 106-114), February.
11. Cheung, D. W.-L., Han, J., Ng, V. T., & Wong, C. Y. (1996b). Maintenance of discovered association rules in large databases: An incremental update technique. In Proceedings of international conference on data engineering (ICDE'96), New Orleans, Louisiana, February.
12. Cheung, D., Lee, S. D., & Kao, B. (1997a). A general incremental technique for updating discovered association rules. In Proceedings international conference on database systems for advanced applications, April.
13. Cheung, D. W.-L., Lee, S. D., & Kao, B. (1997b). A general incremental technique for maintaining discovered association rules. In Proceedings of the 5th international conference on database systems for advanced applications (DASFAA'97), Melbourne, Australia, April.
14. Chi, Y., Wang, H., Yu, P. S., & Muntz, R. R. (2004). Moment: Maintaining closed frequent itemsets over a stream sliding window. In Proceedings of the 2004 IEEE International Conference on Data Mining (ICDM'04).
15. Das, G., Lin, K.-I., Mannila, H., Renganathan, G., & Smyth, P. (1998). Rule discovery from time series. In Proceedings of the 4th ACM SIGKDD (pp. 16-22), August.
16. Dong, G., & Li, J. (1999). Efficient mining of emerging patterns: Discovering trends and differences. In Proceedings of the fifth ACM SIGKDD international conference on knowledge discovery and data mining, San Diego, August.
17. Imberman, S. P., Tansel, A. U., & Pacuit, E. (2004). An efficient method for finding emerging frequent itemsets. In third International workshop on mining temporal and sequential data (pp. 112-121), August.
18. Jin, C., Qian, W., Sha, C., Yu, J. X., & Zhou, A. (2003). Dynamically maintaining frequent items over a data stream. In Proceedings of the 2003 ACM CIKM international conference on information and knowledge management, November.
19. Lee, C.-H., Lin, C.-R., & Chen, M.-S. (2001). Sliding-window filtering: An efficient algorithm for incremental mining CIKM (pp. 263-270).
20. Li, H.-F., Lee, S.-Y., & Shan, M.-K. (2004). An efficient algorithm for mining frequent itemsets over the entire history of data streams. In Proceedings of first international workshop on knowledge discovery in data streams, Pisa, Italy.
21. Li, H.-F., Lee, S.-Y., & Shan, M.-K. (2005). Online mining (recently) maximal frequent itemsets over data streams. In Proceedings of the 15th IEEE international workshop on research issues on data engineering, Tokyo, Japan, April.
22. Lin, J.-L., & Dunham, M. H. (1998). Mining association rules: Anti-skew algorithms. In Proceedings of 1998 international conference on data engineering (pp. 486-493).
23. Lin, C. H., Chiu, D. Y., Wu, Y. H., & Chen, A. L. P. (2005). Mining frequent itemsets from data streams with a time-sensitive sliding window. In Proceedings of 2005 SIAM international conference on data mining, CA, April.
24. Park J.-S., Chen M.-S., and Yu P.S. Using a hash-based method with transaction trimming for mining association rules. IEEE Transactions on Knowledge and Data Engineering 9 5 (1997) 813-825
25. Parthasarathy, S., Zaki, M., Ogihara, M., & Dwarkadas, S. (1999). Incremental and interactive sequence mining. In Proceedings of the 8th international conference on information and knowledge management (CIKM'99), November.
26. Pasquier, N., Bastide, Y., Taouil, R., & Lakhal, L. (1999). Discovering frequent closed itemsets for association rules. In Proceedings seventh international conference database theory, January.
27. Pei, J., Han, J., & Mao, R. (2000). Closet: An efficient algorithm for mining frequent closed itemsets. In Proceedings SIGMOD international workshop data mining and knowledge discovery, May.
28. Savasere, A., Omiecinski, E., & Navathe, S. (1995). An efficient algorithm for mining association rules in large databases. In Proceedings of the 21th international conference on very large data bases (pp. 432-444), September.
29. Teng, W.-G., Chen, M.-S., & Yu, P. S. (2003). A regression-based temporal pattern mining scheme for data streams. In Proceedings of the 29th international conference on very large data bases (pp. 93-104), September.
30. Teng, W.-G., Chen, M.-S., & Yu, P. S. (2004). Resource-aware mining with variable granularities in data streams. In SDM 200.