An Approach to Decrease Execution Time and Difference for Hiding High Utility Sequential Patterns

详细信息    查看全文

• 关键词：Data mining ; Privacy preserving ; Sensitive sequential pattern ; High utility sequential patterns ; High utility sequential patterns hiding
• 刊名：Lecture Notes in Computer Science
• 出版年：2016
• 出版时间：2016
• 年：2016
• 卷：9978
• 期：1
• 页码：435-446
• 全文大小：351 KB
• 参考文献：1.Ahmed, C.F., et al.: A novel approach for mining high-utility sequential patterns in sequence databases. Electron. Telecommun. Res. Inst. J. 32(5), 676–686 (2010)
  2.Aris, G.D., et al.: Revisiting sequential pattern hiding to enhance utility. In: KDD 2011 Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1316–1324 (2011)
  3.Vo, B., et al.: An efficient method for hiding high utility itemsets. In: KES-AMSTA 2013, Hue, Vietnam, pp. 356–363. IOS-Press (2013)
  4.Dinh, T., Nguyen, Q.M., Le, B.: A novel approach for hiding high utility sequential patterns. In: Proceedings of The Sixth International Symposium on Information and Communication Technology, Vietnam, pp. 121–128 (2015)
  5.Jain, Y.K.: An efficient association rule hiding algorithm for privacy preserving data mining. Int. J. Comput. Sci. Eng. 3(7), 2792–2798 (2011)
  6.Lan, G.C., et al.: Applying the maximum utility measure in high utility sequential pattern mining. Expert Syst. Appl. 41(11), 5071–5081 (2014)CrossRef
  7.Yeh, S., Hsu, P.C.: HHUIF and MSICF: novel algorithms for privacy preserving utility mining. Expert Syst. Appl. 37(7), 4779–4786 (2010)CrossRef
  8.Yin, J., et al.: USpan: an efficient algorithm for mining high utility sequential patterns. In: The 18th ACM SIGKDD, pp. 660–668 (2012)
  9.An Open-Source Data Mining Library. http://​www.​philippe-fournier-viger.​com/​spmf/​index.​php . Accessed July 1 2016
  
• 作者单位：Minh Nguyen Quang (18)
  Ut Huynh (19)
  Tai Dinh (20)
  Nghia Hoai Le (21)
  Bac Le (19)
  
  18. Academy of Cryptography, Techniques, Ho Chi Minh City, Vietnam
  19. Department of Computer Science, Ho Chi Minh City Industry and Trade College, Ho Chi Minh City, Vietnam
  20. Department of Computer Science, University of Science, VNU-HCMC, Ho Chi Minh City, Vietnam
  21. University of Information Technology, VNU HCMC, Ho Chi Minh City, Vietnam
  
• 丛书名：Integrated Uncertainty in Knowledge Modelling and Decision Making
• ISBN：978-3-319-49046-5
• 刊物类别：Computer Science
• 刊物主题：Artificial Intelligence and Robotics
  Computer Communication Networks
  Software Engineering
  Data Encryption
  Database Management
  Computation by Abstract Devices
  Algorithm Analysis and Problem Complexity
  
• 出版者：Springer Berlin / Heidelberg
• ISSN：1611-3349
• 卷排序：9978

文摘

Nowadays, databases are shared commonly in various types between companies and organizations. The essential requirement is to release aggregate information about the data, without leaking individual information about participants. So the Privacy Preserving Data Mining (PPDM) has become an important research topic in recent years. PPDM models are applied commonly on hiding association rule, hiding high utility itemsets mining and also on hiding High Utility Sequential Patterns (HUSPs) mining. The goal of hiding utility sequential patterns is to find the way to hide all HUSPs so that the adversaries cannot mine them from the sanitized database. The exiting researches hasn’t considered in details about the difference ratio between the original database and the sanitized database after hiding all HUSPs. To address this issue, this paper presents two algorithms, which are HHUSP-D and HHUSP-A (Hiding High Utility Sequential Pattern by Descending and Ascending order of utility) to decrease the difference and also decrease execution time. In the proposed algorithms, a additional step is added to the exiting algorithm, HHUSP, to rearrange the hiding order of the HUSPs. Experimental results show that HHUSP-D is better performance than HHUSP [4] not only on the difference but also on the execution time.