Skip to main content

Comparative Analysis on Frequent Itemset Mining Algorithms in Vertically Partitioned Cloud Data

  • Conference paper
  • First Online:
Futuristic Communication and Network Technologies (VICFCNT 2020)

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 792))

  • 1336 Accesses

Abstract

Frequent itemset mining and Association Rule Mining are the extensively utilized data analysis techniques for a transactional database concerned with a trade-off. Data owners wish to acquire knowledge in these data analysis techniques to protect their sensitive data from additional data proprietor and third parties. This work emphasizes on privacy-preserving frequent itemset mining on a vertically partitioned database. An efficient homomorphic encryption scheme is designed to assure data privacy. Cryptography is a part of encryption that is used to guard information against third parties. In this work, frequent itemset mining algorithms such as Eclat, apriori, and FP-Growth are taken for analysis in terms of computation time and scalability of data. The analysis result shows that apriori algorithm is less time-consuming to generate rule in the cloud, irrespective of the number of transactions.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 349.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 449.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 449.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Vaidya J, Clifton C (2002) Privacy preserving association rule mining in vertically partitioned data. In: Proceedings of SIGKDD, pp 639–644

    Google Scholar 

  2. Kantarcioglu M, Clifton C (2004) Privacy-preserving distributed mining of association rules on horizontally partitioned data. IEEE Trans Knowl Data Eng 16(9):1026–1037

    Article  Google Scholar 

  3. Li L, Lu R (2016) Privacy-preserving outsourced association rule mining on vertically partitioned databases. In: 2016, IEEE transactions on information forensics and security, vol. 11(8), 1847–1861

    Google Scholar 

  4. Keshavamurthy BN, Khan AM (2013) Privacy preserving association rule mining over distributed databases using genetic algorithm. Springer. Neural computing & application, pp S351–S364

    Google Scholar 

  5. Muthu Lakshmi NV, Sandhya Rani K (2012) Privacy preserving association rule mining in vertically partitioned databases. Int J Comput Appl 39:29–35

    Google Scholar 

  6. Kaosar MG, Paulet R, Yi X (2011) Secure two-party association rule mining. In: 2011 in Australian information security conference, vol 116

    Google Scholar 

  7. Abaril ZK, Dehkordi MN (2015) Privacy preserving in association rule mining. ACSIJ Adv Comput Sci Int J 4(1):13. ISSN: 2322-5157

    Google Scholar 

  8. Giannotto F, Lakshman LVS, Monreale A, Pedreschi D, Wang H (2013) Privacy-preserving mining of association rules from outsourced transaction databases. IEEE Syst J 7

    Google Scholar 

  9. Grahne G, Zhu J (2005) Fast algorithms for frequent itemset mining using FP-trees. IEEE Trans Knowl Data Eng 17(10)

    Google Scholar 

  10. Tai C-H, Yu PS, Chen M-S (2010) K-support anonymity based on pseudo taxonomy for outsourcing of frequent itemset mining. In: Proceedings of international knowledge discovery data mining, pp 473–482

    Google Scholar 

  11. Modi CN, Rao UP (2010) Maintaining privacy and data quality in privacy preserving association rule mining. In: IEEE second international conference on computing, communication and networking technologies

    Google Scholar 

  12. Kenta, Yoshiaki, Masami (2020) Secure association rule mining on vertically partitioned data using private-set intersection. IEEE Access 8:144458–144467. Electronic ISSN 2169-3536

    Google Scholar 

  13. Devesh N (2015) A novel privacy-preserving scheme for collaborative frequent itemset mining across vertically partitioned data. In: 2015, security and communication networks, pp 4407–4420. https://doi.org/10.1002/sec.1377

  14. Paillier P (1999) Public-key cryptosystems based on composite degree residuosity classes. In: Eurocrypt

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Yogasini, M., Prathibha, B.N. (2022). Comparative Analysis on Frequent Itemset Mining Algorithms in Vertically Partitioned Cloud Data. In: Sivasubramanian, A., Shastry, P.N., Hong, P.C. (eds) Futuristic Communication and Network Technologies. VICFCNT 2020. Lecture Notes in Electrical Engineering, vol 792. Springer, Singapore. https://doi.org/10.1007/978-981-16-4625-6_38

Download citation

  • DOI: https://doi.org/10.1007/978-981-16-4625-6_38

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-16-4624-9

  • Online ISBN: 978-981-16-4625-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics