The following publications are possibly variants of this publication:
- Efficient Mining of High Average-Utility Itemsets with Multiple Minimum ThresholdsJerry Chun-Wei Lin, Ting Li, Philippe Fournier-Viger, Tzung-Pei Hong, Ja-Hwung Su. incdm 2016: 14-28 [doi]
- Mining High-Utility Itemsets with Multiple Minimum Utility ThresholdsJerry Chun-Wei Lin, Wensheng Gan, Philippe Fournier-Viger, Tzung-Pei Hong. c3s2e 2015: 9-17 [doi]
- More Efficient Algorithms for Mining High-Utility Itemsets with Multiple Minimum Utility ThresholdsWensheng Gan, Jerry Chun-Wei Lin, Philippe Fournier-Viger, Han-Chieh Chao. DEXA 2016: 71-87 [doi]
- Mining High Utility Itemset with Multiple Minimum Utility Thresholds Based on Utility DeviationNaji Alhusaini, Jing Li 0047, Philippe Fournier-Viger, Ammar Hawbani, Guilin Chen. icdm 2022: 490-496 [doi]
- Efficient Mining of High Average-Utility Itemsets with Multiple ThresholdsTsu-Yang Wu, Jerry Chun-Wei Lin, Shifeng Ren. iih-msp 2018: 198-205 [doi]
- High-Utility Sequential Pattern Mining with Multiple Minimum Utility ThresholdsJerry Chun-Wei Lin, Jiexiong Zhang, Philippe Fournier-Viger. apweb 2017: 215-229 [doi]
- Efficient high utility itemset mining using buffered utility-listsQuang Huy Duong, Philippe Fournier-Viger, Heri Ramampiaro, Kjetil Nørvåg, Thu-Lan Dam. apin, 48(7):1859-1877, 2018. [doi]
- An efficient algorithm for mining the top-k high utility itemsets, using novel threshold raising and pruning strategiesQuang Huy Duong, Bo Liao, Philippe Fournier-Viger, Thu-Lan Dam. kbs, 104:106-122, 2016. [doi]