Abstract
High-utility pattern mining has emerged as an important research topic in data mining. It aims at discovering patterns having a high utility (e.g. profit or weight) in transaction or sequence databases. HUPM can be applied in various fields such as market basket analysis, website clickstream analysis, stock market analysis, retail and bioinformatics. In the era of information technology, it has become easy to locate and access information. A greater access to information has many benefits. However, it may also lead to privacy threats if datasets containing sensitive and important information are shared and made public. Therefore, privacy preservation has become a critical challenge for data mining. This chapter provides an up-to-date survey on privacy preserving utility mining (PPUM). The main purpose is to provide a general overview of recent techniques and algorithms for PPUM. The chapter focuses on research on both privacy preserving high-utility itemset mining and privacy preserving high-utility sequential pattern mining. Key concepts and terminology are introduced and discussed. Moreover, latest solutions for PPUM are compared. Finally, challenges and opportunities related to PPUM are discussed.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aggarwal, C.C., Philip, S.Y.: A general survey of privacy-preserving data mining models and algorithms. In: Aggarwal, C.C., Yu, P.S. (eds.) Privacy-Preserving Data Mining: Models and Algorithms, pp. 11–52. Springer, Berlin (2008)
Ahmed, C.F., Tanbeer, S.K., Jeong, B.S.: A novel approach for mining high-utility sequential patterns in sequence databases. ETRI J. 32(5), 676–686 (2010)
Dinh, D.T., Le, B., Fournier-Viger, P., Huynh, V.N.: An efficient algorithm for mining periodic high-utility sequential patterns. Appl. Intell. 1–21 (2018)
Dinh, T., Huynh, V.N., Le, B.: Mining periodic high utility sequential patterns. In: Asian Conference on Intelligent Information and Database Systems, pp. 545–555. Springer (2017)
Dinh, T., Quang, M.N., Le, B.: A novel approach for hiding high utility sequential patterns. In: Proceedings of the 6th International Symposium on Information and Communication Technology, pp. 121–128. ACM (2015)
Fournier-Viger, P., Lin, J.C.W., Dinh, T., Le, H.B.: Mining correlated high-utility itemsets using the bond measure. In: International Conference on Hybrid Artificial Intelligence Systems, pp. 53–65. Springer (2016)
Fournier-Viger, P., Lin, J.C.W., Kiran, R.U., Koh, Y.S., Thomas, R.: A survey of sequential pattern mining. Data Sci. Pattern Recognit. 1(1), 54–77 (2017)
Fournier-Viger, P., Lin, J.C.W., Vo, B., Chi, T.T., Zhang, J., Le, H.B.: A survey of itemset mining. Wiley Interdiscip. Rev. Data Min. Knowl. Discov. 7(4), e1207 (2017)
Fournier-Viger, P., Wu, C.W., Zida, S., Tseng, V.S.: Fhm: faster high-utility itemset mining using estimated utility co-occurrence pruning. In: International Symposium on Methodologies for Intelligent Systems, pp. 83–92. Springer (2014)
Fournier-Viger, P., Zhang, Y., Lin, J.C.W., Dinh, D.T., Le, H.B.: Mining correlated high-utility itemsets using various measures. Log. J. IGPL (2018)
Gkoulalas-Divanis, A., Loukides, G.: Revisiting sequential pattern hiding to enhance utility. In: Proceedings of the 17th ACM SIGKDD international conference on Knowledge Discovery and Data Mining, pp. 1316–1324. ACM (2011)
Hong, T.P., Wang, C.Y.: Maintenance of association rules using pre-large itemsets. In: Intelligent Databases: Technologies and Applications, pp. 44–60. IGI Global (2007)
Lan, G.C., Hong, T.P., Tseng, V.S.: Sequential utility mining with the maximum measure. In: Proceedings of the 29th Workshop on Combinatorial Mathematics and Computation Theory, pp. 115–119 (2012)
Lan, G.C., Hong, T.P., Tseng, V.S., Wang, S.L.: Applying the maximum utility measure in high utility sequential pattern mining. Expert Syst. Appl. 41(11), 5071–5081 (2014)
Le, B., Dinh, D.T., Huynh, V.N., Nguyen, Q.M., Fournier-Viger, P.: An efficient algorithm for hiding high utility sequential patterns. Int. J. Approx. Reason. 95, 77–92 (2018)
Le, B., Huynh, U., Dinh, D.T.: A pure array structure and parallel strategy for high-utility sequential pattern mining. Expert Syst. Appl. 104, 107–120 (2018)
Le, B., Nguyen, H., Vo, B.: An efficient strategy for mining high utility itemsets. Int. J. Intell. Inf. Database Syst. 5(2), 164–176 (2011)
Lin, C.W., Hong, T.P., Wong, J.W., Lan, G.C.: Privacy preserving high utility mining based on genetic algorithms. In: 2013 IEEE International Conference on Granular Computing (GrC), pp. 191–195. IEEE (2013)
Lin, C.W., Hong, T.P., Wong, J.W., Lan, G.C., Lin, W.Y.: A ga-based approach to hide sensitive high utility itemsets. Sci. World J. 2014, (2014)
Lin, J.C.W., Gan, W., Fournier-Viger, P., Yang, L., Liu, Q., Frnda, J., Sevcik, L., Voznak, M.: High utility-itemset mining and privacy-preserving utility mining. Perspect. Sci. 7, 74–80 (2016)
Lin, J.C.W., Hong, T.P., Fournier-Viger, P., Liu, Q., Wong, J.W., Zhan, J.: Efficient hiding of confidential high-utility itemsets with minimal side effects. J. Exp. Theor. Artif. Intell. 1–21 (2017)
Lin, J.C.W., Wu, T.Y., Fournier-Viger, P., Lin, G., Hong, T.P., Pan, J.S.: A sanitization approach of privacy preserving utility mining. In: ICGEC, vol. 2, pp. 47–57. Springer (2015)
Lin, J.C.W., Wu, T.Y., Fournier-Viger, P., Lin, G., Zhan, J., Voznak, M.: Fast algorithms for hiding sensitive high-utility itemsets in privacy-preserving utility mining. Eng. Appl. Artif. Intell. 55, 269–284 (2016)
Lin, J.C.W., Zhang, J., Fournier-Viger, P.: High-utility sequential pattern mining with multiple minimum utility thresholds. In: Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint Conference on Web and Big Data, pp. 215–229. Springer (2017)
Lin, J.C.W., Zhang, J., Fournier-Viger, P., Hong, T.P., Zhang, J.: A two-phase approach to mine short-period high-utility itemsets in transactional databases. Adv. Eng. Inform. 33, 29–43 (2017)
Liu, J., Wang, K., Fung, B.C.: Direct discovery of high utility itemsets without candidate generation. In: 2012 IEEE 12th International Conference on Data Mining (ICDM), pp. 984–989. IEEE (2012)
Liu, M., Qu, J.: Mining high utility itemsets without candidate generation. In: Proceedings of the 21st ACM International Conference on Information and Knowledge Management, pp. 55–64. ACM (2012)
Liu, Y., Liao, W.k., Choudhary, A.N.: A two-phase algorithm for fast discovery of high utility itemsets. In: PAKDD, vol. 3518, pp. 689–695. Springer, Berlin (2005)
Loukides, G., Gkoulalas-Divanis, A.: Utility-preserving transaction data anonymization with low information loss. Expert Syst. Appl. 39(10), 9764–9777 (2012)
Petkovic, M., Jonker, W.: Security, Privacy and Trust in Modern Data Management. Springer, Berlin (2007)
Quang, M.N., Dinh, T., Huynh, U., Le, B.: Mhhusp: An integrated algorithm for mining and hiding high utility sequential patterns. In: 2016 Eighth International Conference on Knowledge and Systems Engineering (KSE), pp. 13–18. IEEE (2016)
Quang, M.N., Huynh, U., Dinh, T., Le, N.H., Le, B.: An approach to decrease execution time and difference for hiding high utility sequential patterns. In: International Symposium on Integrated Uncertainty in Knowledge Modelling and Decision Making, pp. 435–446. Springer (2016)
Tseng, V.S., Shie, B.E., Wu, C.W., Philip, S.Y.: Efficient algorithms for mining high utility itemsets from transactional databases. IEEE Trans. Knowl. Data Eng. 25(8), 1772–1786 (2013)
Tseng, V.S., Wu, C.W., Shie, B.E., Yu, P.S.: Up-growth: an efficient algorithm for high utility itemset mining. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 253–262. ACM (2010)
Vo, B., Lin, C.W., Hong, T.P., Vu, V.V., Nguyen, M., Le, B.: An efficient method for hiding high utility itemsets. In: Proceedings of the 7th International KES Conference on Agents and Multi-agent Systems–Technologies and Applications, pp. 356–363 (2013)
Wang, J.Z., Huang, J.L., Chen, Y.C.: On efficiently mining high utility sequential patterns. Knowl. Inf. Syst. 49(2), 597–627 (2016)
Yao, H., Hamilton, H.J.: Mining itemset utilities from transaction databases. Data Knowl. Eng. 59(3), 603–626 (2006)
Yao, H., Hamilton, H.J., Butz, C.J.: A foundational approach to mining itemset utilities from databases. In: Proceedings of the 2004 SIAM International Conference on Data Mining, pp. 482–486. SIAM (2004)
Yeh, J.S., Hsu, P.C.: HHUIF and MSICF: novel algorithms for privacy preserving utility mining. Expert Syst. Appl. 37(7), 4779–4786 (2010)
Yeh, J.S., Hsu, P.C., Wen, M.H.: Novel algorithms for privacy preserving utility mining. In: Proceedings of the 8th International Conference on Intelligent Systems Design and Applications, vol. 1, pp. 291–296. IEEE (2008)
Yin, J.: Mining high utility sequential patterns. Ph.D. thesis, University of Technology, Sydney (2015)
Yin, J., Zheng, Z., Cao, L.: USpan: an efficient algorithm for mining high utility sequential patterns. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 660–668. ACM (2012)
Yin, J., Zheng, Z., Cao, L., Song, Y., Wei, W.: Efficiently mining top-k high utility sequential patterns. In: 2013 IEEE 13th International Conference on Data Mining (ICDM), pp. 1259–1264. IEEE (2013)
Yun, U., Kim, J.: A fast perturbation algorithm using tree structure for privacy preserving utility mining. Expert Syst. Appl. 42(3), 1149–1165 (2015)
Yun, U., Ryang, H., Ryu, K.H.: High utility itemset mining with techniques for reducing overestimated utilities and pruning candidates. Expert Syst. Appl. 41(8), 3861–3878 (2014)
Zida, S., Fournier-Viger, P., Lin, J.C.W., Wu, C.W., Tseng, V.S.: Efim: a highly efficient algorithm for high-utility itemset mining. In: Mexican International Conference on Artificial Intelligence, pp. 530–546. Springer (2015)
Acknowledgements
This research is funded by Vietnam National Foundation for Science and Technology Development (NAFOSTED) under grant number 102.05-2018.307.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Dinh, DT., Huynh, VN., Le, B., Fournier-Viger, P., Huynh, U., Nguyen, QM. (2019). A Survey of Privacy Preserving Utility Mining. In: Fournier-Viger, P., Lin, JW., Nkambou, R., Vo, B., Tseng, V. (eds) High-Utility Pattern Mining. Studies in Big Data, vol 51. Springer, Cham. https://doi.org/10.1007/978-3-030-04921-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-030-04921-8_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-04920-1
Online ISBN: 978-3-030-04921-8
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)