The following publications are possibly variants of this publication:
- Fast and Memory Efficient Mining of High Utility Itemsets in Data StreamsHua-Fu Li, Hsin-Yun Huang, Yi-Cheng Chen, Yu-Jiun Liu, Suh-Yin Lee. icdm 2008: 881-886 [doi]
- An efficient algorithm for mining closed high utility itemsets over data streams with one dataset scanMeng Han, Haodong Cheng, Ni Zhang, Xiaojuan Li, Le Wang. kais, 65(1):207-240, January 2023. [doi]
- Improve Frequent Closed Itemsets Mining over Data Stream with BitmapHaifeng Li, Hong Chen. snpd 2008: 399-404 [doi]
- Moment+: Mining Closed Frequent Itemsets over Data StreamHaifeng Li, Hong Chen. adma 2008: 612-619 [doi]
- A fast algorithm for mining frequent closed itemsets over stream sliding windowShow-Jane Yen, Cheng-Wei Wu, Yue-Shi Lee, Vincent S. Tseng, Chaur-Heh Hsieh. fuzzIEEE 2011: 996-1002 [doi]
- ETKDS: An efficient algorithm of Top-K high utility itemsets mining over data streams under sliding window modelHaodong Cheng, Meng Han, Ni Zhang, Le Wang, Xiaojuan Li. jifs, 41(2):3317-3338, 2021. [doi]
- Fast and memory efficient mining of high-utility itemsets from data streams: with and without negative item profitsHua-Fu Li, Hsin-Yun Huang, Suh-Yin Lee. kais, 28(3):495-522, 2011. [doi]