Effective algorithms for mining frequent-utility itemsets

References

• Agrawal, R., & Srikant, R. (1994, June). Fast algorithms for mining association rules. Proceedings of the 20th International Conference on Very Large Data Bases (pp. 487–499). Santiago, Chile.
   Google Scholar
• Ahmed, C. F., Tanbeer, S. K., & Jeong, B. S. (2011). A framework for mining high utility web access sequences. Iete Technical Review, 28(1), 3–16 doi:https://doi.org/10.4103/0256-4602.74506.
   Web of Science ®Google Scholar
• Ahmed, C. F., Tanbeer, S. K., Jeong, B. S., & Lee, Y. K. (2009). Efficient tree structures for high utility pattern mining in incremental databases. IEEE Transactions on Knowledge and Data Engineering, 21(12), 1708–1721 doi:https://doi.org/10.1109/TKDE.2009.46.
   Web of Science ®Google Scholar
• Dawar, S., Goyal, V., & Bera, D. (2017). A hybrid framework for mining high-utility itemsets in a sparse transaction database. Applied Intelligence, 47(3), 809–827. https://doi.org/10.1007/s10489-017-0932-1
   Web of Science ®Google Scholar
• Duong, Q. H., Fournier-Viger, P., Ramampiaro, H., Nørvåg, K., & Dam, T. L. (2018). Efficient high utility itemset mining using buffered utility-lists. Applied Intelligence, 48(7), 1859–1877. https://doi.org/10.1007/s10489-017-1057-2
   Web of Science ®Google Scholar
• Fournier-Viger, P., Lin, J. C. W., Gomariz, A., Gueniche, T., Soltani, A., Deng, Z., & Lam, H. T. (2016). The SPMF open-source data mining library version 2. Proceedings of 19th European Conference on Principles of Data Mining and Knowledge Discovery (PKDD 2016) Part III (pp. 36–40).
   Google Scholar
• Fournier-Viger, P., Lin, J. C. W., Truong-Chi, T., & Nkambou, R. (2019). A survey of high utility itemset mining, high-utility pattern mining. Springer.
   Google Scholar
• Fournier-Viger, P., Lin, J. C. W., Vo, B., Chi, T. T., Zhang, J., & Le, H. B. (2017). A survey of itemset mining. Wiley Interdisciplinary Reviews-Data Mining and Knowledge Discovery, 7(4), e1207. https://doi.org/10.1002/Widm.1207
   Web of Science ®Google Scholar
• Fournier-Viger, P., Wu, C. W., Zida, S., & Tseng, V. S. (2014). FHM: Faster high-utility itemset mining using estimated utility co-occurrence pruning. International Symposium on Methodologies for Intelligent Systems Roskilde, Denmark (pp. 83–92).
   Google Scholar
• Gan, W. S., Lin, J. C. W., Fournier-Viger, P., Chao, H. C., & Fujita, H. (2018). Extracting non-redundant correlated purchase behaviors by utility measure. Knowledge-Based Systems, 143, 30–41 doi:https://doi.org/10.1016/j.knosys.2017.12.003.
   Web of Science ®Google Scholar
• Gan, W. S., Lin, J. C. W., Fournier-Viger, P., Chao, H. C., Tseng, V. S., & Philip, S. Y. (2021). A survey of utility-oriented pattern mining. IEEE Transactions on Knowledge and Data Engineering, 33(4), 1306–1327 doi:https://doi.org/10.1109/TKDE.2019.2942594.
   Web of Science ®Google Scholar
• Han, J. W., Pei, J., Yin, Y. W., & Mao, R. Y. (2004). Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Mining and Knowledge Discovery, 8(1), 53–87. https://doi.org/10.1023/B:DAMI.0000005258.31418.83
   Web of Science ®Google Scholar
• Kim, H., Yun, U., Baek, Y., Kim, J., Vo, B., Yoon, E., & Fujita, H. (2021). Efficient list based mining of high average utility patterns with maximum average pruning strategies. Information Sciences, 543, 85–105. https://doi.org/10.1016/j.ins.2020.07.043
   Web of Science ®Google Scholar
• Krishnamoorthy, S. (2015). Pruning strategies for mining high utility itemsets. Expert Systems with Applications, 42(5), 2371–2381. https://doi.org/10.1016/j.eswa.2014.11.001
   Web of Science ®Google Scholar
• Krishnamoorthy, S. (2017). Hminer: Efficiently mining high utility itemsets. Expert Systems with Applications, 90, 168–183. https://doi.org/10.1016/j.eswa.2017.08.028
   Web of Science ®Google Scholar
• Lan, G. C., Hong, T. P., & Tseng, V. S. (2014). An efficient projection-based indexing approach for mining high utility itemsets. Knowledge and Information Systems, 38(1), 85–107 doi:https://doi.org/10.1007/s10115-012-0492-y.
   Web of Science ®Google Scholar
• Lin, C. W., Hong, T. P., Fournierviger, P., Liu, Q., Wong, J. W., & Zhan, J. (2017). Efficient hiding of confidential high-utility itemsets with minimal side effects. Journal of Experimental and Theoretical Artificial Intelligence, 29(6), 1225–1245 doi:https://doi.org/10.1080/0952813X.2017.1328462.
   Web of Science ®Google Scholar
• Lin, J. C. W., Wu, T. Y., Fournier-Viger, P., Lin, G., Zhan, J., & Voznak, M. (2016). Fast algorithms for hiding sensitive high-utility itemsets in privacy-preserving utility mining. Engineering Applications of Artificial Intelligence, 55(C), 269–284 doi:https://doi.org/10.1016/j.engappai.2016.07.003.
   Google Scholar
• Lin, J. C. W., Yang, L., Fournier-Viger, P., & Hong, T. P. (2019). Mining of skyline patterns by considering both frequent and utility constraints. Engineering Applications of Artificial Intelligence, 77, 229–238. https://doi.org/10.1016/j.engappai.2018.10.010
   Web of Science ®Google Scholar
• Liu, J., Ke, W., & Fung, B. (2016). Mining high utility patterns in one phase without generating candidates. IEEE Transactions on Knowledge and Data Engineering, 28(5), 1245–1257 doi:https://doi.org/10.1109/TKDE.2015.2510012.
   Web of Science ®Google Scholar
• Liu, Y., Liao, W., & Choudhary, A. (2005, 18-20, May). A two-phase algorithm for fast discovery of high utility itemsets. Proceedings of the 9th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining (pp. 689–695). Hanoi, Vietnam.
   Google Scholar
• Liu, M. C., & Qu, J. F. (2012, October 29 - November 02). Mining high utility itemsets without candidate generation. Proceedings of the 21st ACM International Conference on Information and Knowledge Management (pp. 55–64). Maui, Hawaii, USA.
   Google Scholar
• Liu, X., Wen, S. T., & Zuo, W. L. (2020). Effective sanitization approaches to protect sensitive knowledge in high-utility itemset mining. Applied Intelligence, 50(1), 169–191. https://doi.org/10.1007/s10489-019-01524-2
   Web of Science ®Google Scholar
• Liu X, Xu F, & X, L. (2018). A novel approach for hiding sensitive utility and frequent itemsets. Intelligent Data Analysis, 22(6), 1259–1278 doi:https://doi.org/10.3233/IDA-173613.
   Web of Science ®Google Scholar
• Li, Y. C., Yeh, J. S., & Chang, C. C. (2005). Direct candidates generation: A novel algorithm for discovering complete share-frequent itemsets. International Conference on Fuzzy Systems and Knowledge Discovery Changsha, China (pp. 551–560).
   Google Scholar
• Li, Y. C., Yeh, J. S., & Chang, C. C. (2008). Isolated items discarding strategy for discovering high utility itemsets. Data & Knowledge Engineering, 64(1), 198–217 doi:https://doi.org/10.1016/j.datak.2007.06.009.
   Web of Science ®Google Scholar
• Nawaz, M. S., Fournier-Viger, P., Yun, U., Wu, Y., & Song, W. (2022). Mining high utility itemsets with hill climbing and simulated annealing. ACM Transactions on Management Information System, 13(1), 1–4 doi:https://doi.org/10.1145/3462636.
   Web of Science ®Google Scholar
• Pan, J. S., Lin, J. C. W., Yang, L., Fournier-Viger, P., & Hong, T. P. (2017). Efficiently mining of skyline frequent-utility patterns. Intelligent Data Analysis, 21(6), 1407–1423 doi:https://doi.org/10.3233/IDA-163180.
   Web of Science ®Google Scholar
• Peng, A. Y., Koh, Y. S., & Riddle, P. (2017). mHUIMiner: A fast high utility itemset mining algorithm for sparse datasets. Proceedings of the Pacific-Asia Conference on Knowledge Discovery and Data Mining Jeju Island, South (pp. 196–207).
   Google Scholar
• Qu, J. F., Fournier-Viger, P., Liu, M., Hang, B., & Wang, F. (2020). Mining high utility itemsets using extended chain structure and utility machine. Knowledge-Based Systems, 208, 106457. https://doi.org/10.1016/j.knosys.2020.106457
   Web of Science ®Google Scholar
• Rajalaxmi, R. R., & Natarajan, A. M. (2012). Effective sanitization approaches to hide sensitive utility and frequent itemsets. Intelligent Data Analysis, 16(6), 933–951. https://doi.org/10.3233/IDA-2012-00560
   Web of Science ®Google Scholar
• Shie, B. E., Hsiao, H. F., & Tseng, V. S. (2013). Efficient algorithms for discovering high utility user behavior patterns in mobile commerce environments. Knowledge and Information Systems, 37(2), 363–387 doi:https://doi.org/10.1007/s10115-012-0483-z.
   Web of Science ®Google Scholar
• Song, W., Liu, L., & Huang, C. (2021). Generalized maximal utility for mining high average-utility itemsets. Knowledge and Information Systems, 63(11), 2947–2967. https://doi.org/10.1007/s10115-021-01614-z
   Web of Science ®Google Scholar
• Truong, T., Duong, H., Le, B., & Fournier Viger, P. (2018). Efficient vertical mining of high average-utility itemsets based on novel upper-bounds. IEEE Transactions on Knowledge and Data Engineering, 31(2), 301–314 doi:https://doi.org/10.1109/TKDE.2018.2833478.
   Web of Science ®Google Scholar
• Truong, T., Duong, H., Le, B., Fournier Viger, P., & Yun, U. (2019). Efficient high average-utility itemset mining using novel vertical weak upper-bounds. Knowledge-Based Systems, 183, 104847. https://doi.org/10.1016/j.knosys.2019.07.018
   Web of Science ®Google Scholar
• Tseng, V. S., Shie, B. E., Wu, C. W., & Yu, P. S. (2013). Efficient algorithms for mining high utility itemsets from transactional databases. IEEE Transactions on Knowledge and Data Engineering, 25(8), 1772–1786 doi:https://doi.org/10.1109/TKDE.2012.59.
   Web of Science ®Google Scholar
• Tseng, V. S., Wu, C. W., Shie, B. E., & Yu, P. S. (2010, July 25-28). UP-growth: An efficient algorithm for high utility itemset mining. Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 253–262). Washington, DC, USA
   Google Scholar
• Vu, H. Q., Li, G., & Law, R. (2020). Discovering highly profitable travel patterns by high-utility pattern mining. Tourism Management, 77, 104008. https://doi.org/10.1016/j.tourman.2019.104008
   Web of Science ®Google Scholar
• Wu, Y., Geng, M., Li, Y., Guo, L., Li, Z., Fournier-Viger, P., Zhu, X., & Wu, X. (2021). HANP-miner: High average utility nonoverlapping sequential pattern mining. Knowledge-Based Systems, 229, 107361. https://doi.org/10.1016/j.knosys.2021.107361
   Web of Science ®Google Scholar
• Wu, Y., Lei, R., Li, Y., Guo, L., & Wu, X. (2021). HAOP-miner: Self-adaptive high-average utility one-off sequential pattern mining. Expert Systems with Applications, 184, 115449. https://doi.org/10.1016/j.eswa.2021.115449
   Web of Science ®Google Scholar
• Yao, H., & Hamilton, H. J. (2006). Mining itemset utilities from transaction databases. Data & Knowledge Engineering, 59(3), 603–626. https://doi.org/10.1016/j.datak.2005.10.004
   Web of Science ®Google Scholar
• Yao, H., Hamilton, H. J., & Butz, C. J. (2004). A foundational approach to mining itemset utilities from databases. Proceedings of the 4th SIAM International Conference on Data Mining Philadelphia (pp. 482–486).
   Google Scholar
• Yeh, J. S., Li, Y. C., & Chang, C. C. (2007). Two-phase algorithms for a novel utility-frequent mining model. In Emerging technologies in knowledge discovery and data mining (pp. 433–444 doi:https://doi.org/10.1007/978-3-540-77018-3_43).
   Google Scholar
• Zida, S., Fournier-Viger, P., Lin, J. C. W., Wu, C. W., & Tseng, V. S. (2017). EFIM: A fast and memory efficient algorithm for high-utility itemset mining. Knowledge and Information Systems, 51(2), 595–625. https://doi.org/10.1007/s10115-016-0986-0
   Web of Science ®Google Scholar
• Zihayat, M., Davoudi, H., & An, A. (2017). Mining significant high utility gene regulation sequential patterns. BMC systems biology, 11(6), 1–14 doi:https://doi.org/10.1186/s12918-017-0475-4.
   PubMedGoogle Scholar