Publisher
Springer Nature Singapore
Reference12 articles.
1. R. Agrawal, R. Srikant et al., Fast algorithms for mining association rules, in Proceedings of the 20th International Conference on Very Large Data Bases, VLDB, vol. 1215 (Citeseer, 1994), pp. 487–499
2. Y. Baek, U. Yun, H. Kim, J. Kim, B. Vo, T. Truong, Z.-H. Deng, Approximate high utility itemset mining in noisy environments. Knowl.-Based Syst. 212, 106596 (2021)
3. C.-J. Chu, V.S. Tseng, T. Liang, An efficient algorithm for mining high utility itemsets with negative item values in large databases. Appl. Math. Comput. 215(2), 767–778 (2009)
4. P. Fournier-Viger, SPMF: A Java Open-Source Data Mining Library. Philippe-fournier-viger.com. (2021)
5. P. Fournier-Viger, C.-W. Wu, S. Zida, V.S. Tseng, FHM: faster high-utility itemset mining using estimated utility co-occurrence pruning, in International Symposium on Methodologies for Intelligent Systems (Springer, 2014), pp. 83–92