Mining frequent itemsets from sparse data streams in limited memory environments

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7923 LNCS, Issue , 2013, Pages 51-57

  Cameron, Juan J ^a   Cuzzocrea, Alfredo ^b   Jiang, Fan ^a   Leung, Carson K ^a  

^a UNIVERSITY OF MANITOBA   (Canada)

^b UNIVERSITY OF CALABRIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; INFORMATION MANAGEMENT; WIRELESS SENSOR NETWORKS;

LIMITED MEMORY; MAIN MEMORY; MINING FREQUENT ITEMSETS; SPARSE DATA; STREAM MINING; STREAMING DATA; WEB-CLICK STREAMS;

DATA STREAMS;

EID: 84880001890     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-38562-9_5     Document Type: Conference Paper

References (21)

1. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: VLDB 1994, pp. 487-499 (1994)
2. Buehrer, G., Parthasarathy, S., Ghoting, A.: Out-of-core frequent pattern mining on a commodity. In: ACM KDD 2006, pp. 86-95 (2006)
3. Cameron, J.J., Cuzzocrea, A., Leung, C.K.-S.: Stream mining of frequent sets with limited memory. In: ACM SAC 2013, pp. 173-175 (2013)
4. Cao, K., Wang, G., Han, D., Ma, Y., Ma, X.: A framework for high-quality clustering uncertain data stream over sliding windows. In: Gao, H., Lim, L., Wang, W., Li, C., Chen, L. (eds.) WAIM 2012. LNCS, vol. 7418, pp. 308-313. Springer, Heidelberg (2012)
5. Chiu, D.Y., Wu, Y.H., Chen, A.: Efficient frequent sequence mining by a dynamic strategy switching algorithm. VLDB J. 18(1), 303-327 (2009)
6. Fariha, A., Ahmed, C.F., Leung, C.K.-S., Abdullah, S.M., Cao, L.: Mining frequent patterns from human interactions in meetings using directed acyclic graphs. In: Pei, J., Tseng, V.S., Cao, L., Motoda, H., Xu, G. (eds.) PAKDD 2013, Part I. LNCS (LNAI), vol. 7818, pp. 38-49. Springer, Heidelberg (2013)
7. Gao, C., Wang, J., Yang, Q.: Efficient mining of closed sequential patterns on stream sliding window. In: IEEE ICDM 2011, pp. 1044-1049 (2011)
8. Giannella, C., Han, J., Pei, J., Yan, X., Yu, P.S.: Mining frequent patterns in data streams at multiple time granularities. In: Data Mining: Next Generation Challenges and Future Directions, ch. 6 (2004)
9. Grahne, G., Zhu, J.: Mining frequent itemsets from secondary memory. In: IEEE ICDM 2004, pp. 91-98 (2004)
10. Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: ACM SIGMOD 2000, pp. 1-12 (2000)
11. Jiang, X., Xiong, H., Wang, C., Tan, A.-H.: Mining globally distributed frequent subgraphs in a single labeled graph. DKE 68(10), 1034-1058 (2009)
12. Jin, R., Agrawal, G.: An algorithm for in-core frequent itemset mining on streaming data. In: IEEE ICDM 2005, pp. 210-217 (2005)
13. Leung, C.K.-S., Brajczuk, D.A.: Efficient mining of frequent itemsets from data streams. In: Gray, A., Jeffery, K., Shao, J. (eds.) BNCOD 2008. LNCS, vol. 5071, pp. 2-14. Springer, Heidelberg (2008)
14. Leung, C.K.-S., Cuzzocrea, A., Jiang, F.: Discovering frequent patterns from uncertain data streams with time-fading and landmark models. In: Hameurlain, A., Kung, J., Wagner, R., Cuzzocrea, A., Dayal, U. (eds.) TLDKS VIII. LNCS, vol. 7790, pp. 174-196. Springer, Heidelberg (2013)
15. Leung, C.K.-S., Hayduk, Y.: Mining frequent patterns from uncertain data with mapReduce for big data analytics. In: Meng,W., Feng, L., Bressan, S.,Winiwarter, W., Song,W. (eds.) DASFAA 2013, Part I. LNCS, vol. 7825, pp. 440-455. Springer, Heidelberg (2013)
16. Leung, C.K.-S., Khan, Q.I.: DSTree: a tree structure for the mining of frequent sets from data streams. In: IEEE ICDM 2006, pp. 928-932 (2006)
17. Leung, C.K.-S., Tanbeer, S.K.: PUF-tree: a compact tree structure for frequent pattern mining of uncertain data. In: Pei, J., Tseng, V.S., Cao, L., Motoda, H., Xu, G. (eds.) PAKDD 2013, Part I. LNCS (LNAI), vol. 7818, pp. 13-25. Springer, Heidelberg (2013)
18. Qu, J.-F., Liu, M.: A high-performance algorithm for frequent itemset mining. In: Gao, H., Lim, L., Wang, W., Li, C., Chen, L. (eds.) WAIM 2012. LNCS, vol. 7418, pp. 71-82. Springer, Heidelberg (2012)
19. Papapetrou, O., Garofalakis, M., Deligiannakis, A.: Sketch-based querying of distributed sliding-window data streams. In: VLDB 2012, pp. 992-1003 (2012)
20. Tanbeer, S.K., Leung, C.K.-S.: Finding diverse friends in social networks. In: Ishikawa, Y., Li, J., Wang, W., Zhang, R., Zhang, W. (eds.) APWeb 2013. LNCS, vol. 7808, pp. 301-309. Springer, Heidelberg (2013)
21. Tirthapura, S., Woodruff, D.P.: A general method for estimating correlated aggregates over a data stream. In: IEEE ICDE 2012, pp. 162-173 (2012)