Author:
Cai Saihua,Sun Ruizhi,Cheng Chunming,Wu Gang
Reference17 articles.
1. Calders, T., Dexters, N., Gillis, J.J.M., et al.: Mining frequent itemsets in a stream. Inf. Syst. 39, 233–255 (2014)
2. Nori, F., Deypir, M., Sadreddini, M.H.: A sliding window based algorithm for frequent closed itemset mining over data streams. J. Syst. Softw. 86(3), 615–623 (2013)
3. Deng, Z.H.: DiffNodesets: an efficient structure for fast mining frequent itemsets. Appl. Soft Comput. 41, 214–223 (2016)
4. Shin, S.J., Lee, D.S., Lee, W.S.: CP-tree: an adaptive synopsis structure for compressing frequent itemsets over online data streams. Inf. Sci. 278, 559–576 (2014)
5. Li, H.F., Lee, S.Y., Shan, M.K.: Online mining (recently) maximal frequent itemsets over data streams. In: 15th International Workshop on Research Issues in Data Engineering: Stream Data Mining and Applications (RIDE-SDMA 2005), pp. 11–18. IEEE (2005)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献