Skip to main content

Advanced Cluster-Based Attribute Slicing: A New Approach for Privacy Preservation

  • Conference paper
  • First Online:
Proceedings of the International Conference on Soft Computing Systems

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 398))

Abstract

Privacy preservation data is an emerging field of research in the data security. Numerous anonymization approaches have been proposed for privacy preservation such as generalization and bucketization. Recent works show that both the techniques are not suitable for high-dimensional data publishing. Several other challenges for data publishing are speed and computational complexity. Slicing is a novel anonymization technique which partitions the data both horizontally and vertically and solves the problem of high-dimensional complexity. To overcome the other challenges of speed and computational complexity, a new advanced clustering algorithm is used with slicing. This advanced clustering technique is used to partition the attributes into vertical columns and tuple grouping algorithm for horizontal partitioning. The experimental results confirm that the advanced clustering algorithm improves the speed of clustering accuracy, reduces the computational complexity, and the outcome of this work is resilient to membership, identity, and attributes disclosure.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Machanavajjhala A, Kifer D, Gehrke J, Venkitasubramaniam ML (2007) Diversity: privacy beyond k-anonymity. ACM Trans Knowl Discov Data 1(1)

    Google Scholar 

  2. Sweeney L (2002) Achieving k-anonymity privacy protection using generalization and suppression. Int J Uncertain Fuzziness Knowl Based Syst 10(6):571–588

    Article  MathSciNet  MATH  Google Scholar 

  3. Li T, Li N, Zhang J,(2012) Slicing: a new approach for privacy preserving data publishing. In: Proceedings of IEEE transaction on knowledge and data mining engineering, vol 24(3), pp 561–574

    Google Scholar 

  4. Cramt’er H (1948) Mathematical methods of statistics. Princeton

    Google Scholar 

  5. MacQueen JB (1987) Some methods for classification and analysis of multivariate observation. In: Proceedings of 5th Berkeley symposium on mathematical statistics and probability, vol 1. University of California Press, Berkeley, pp 281–297

    Google Scholar 

  6. Kaufman L, Rousseeuw PJ (1990) Finding groups in data: an introduction to cluster analysis. Wiley, New York

    Book  MATH  Google Scholar 

  7. Han J, Kamber M (2000) Data mining concepts and techniques. The Morgan Kaufmann Series in Data Management Systems, Morgan Kaufmann

    MATH  Google Scholar 

  8. Toor A (2014). An advanced clustering algorithm (ACA) for clustering large data set to achieve high dimensionality. Glob J Comput Sci Technol Softw Data Eng 14(2) (Version 1.0)

    Google Scholar 

  9. Asuncion A, Newman D (2007) UCI machine learning repository

    Google Scholar 

  10. Samarati P (2007) Protecting respondents’ identities in microdata release. IEEE Trans Knowl Data Eng 13(6):1010–1027

    Google Scholar 

  11. Xiao X, Tao Y (2006) Anatomy: simple and effective privacy preservation. In: Proceedings of the 32nd international conference on very large data bases, ser. VLDB, pp 139–150

    Google Scholar 

  12. Kifer D, Gehrke J (2006) Injecting utility into anonymized datasets. In: SIGMOD, pp 217–228

    Google Scholar 

  13. Nergiz ME, Atzori M, Clifton C (2007) Hiding the presence of individuals from shared databases. In SIGMOD, pp 665–676

    Google Scholar 

  14. Susan VS, Dr. Christopher T (2014) Slicing based privacy preserving of the micro data using fuzzy based clustering. Int J Appl Eng Res 9.

    Google Scholar 

  15. ROCK (2000) A robust clustering algorithm for categorical attributes. Inf Syst 255:345–366

    Google Scholar 

  16. Guha S, Rastogi R, Shim K (1988) CURE: an efficient clustering algorithm for large databases. In: Proceedings of ACM SIGMOD international conference management of data, pp 73–84

    Google Scholar 

  17. Karypis G, Han E, Kumar V (1999) Chameleon: hierarchical clustering using dynamic modeling. IEEE Comput 32(8):68–75

    Article  Google Scholar 

  18. Zhang T, Ramakrishnan R, Livny M (1996) BIRCH: an efficient data clustering method for very large databases. In: Proceedings of ACM SIGMOD conference management of data, pp 103–114

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to V. Shyamala Susan .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer India

About this paper

Cite this paper

Shyamala Susan, V., Christopher, T. (2016). Advanced Cluster-Based Attribute Slicing: A New Approach for Privacy Preservation. In: Suresh, L., Panigrahi, B. (eds) Proceedings of the International Conference on Soft Computing Systems. Advances in Intelligent Systems and Computing, vol 398. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2674-1_21

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-2674-1_21

  • Published:

  • Publisher Name: Springer, New Delhi

  • Print ISBN: 978-81-322-2672-7

  • Online ISBN: 978-81-322-2674-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics