Abstract
Privacy preservation is a serious concern of today’s scenario. Anonymity is a way to preserve privacy of different types of data publications like structural and descriptive. In this paper, we discuss the preservation of both types of data. We use anatomy for descriptive data and sequential clustering for structural data anonymization. The proposed approach is based on assortativity called Anatomy Based Modified Sequential Clustering (ABMSC). We propose a new total info. loss measure for cluster optimization. The performance of the proposed approach is measured by information loss and number of node movements takes place to meet the optimization. The experimental results show that our proposed algorithm outperforms the two state-of-the-art algorithms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Sweeney, L.: Achieving k-anonymity privacy protection using generalization and suppression. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 10(5), 71–588 (2002)
Xiao, X., Tao, Y.: Anatomy: simple and effective privacy preservation, pp. 139–150. VLDB (2006)
Machanavajjhala, A., Gehrke, J., Kifer, D., Venkitasubramaniam, M.: ℓ-Diversity: privacy beyond k-anonymity. ICDE (2006)
Li, N., Li, T., Venkatasubramanian, S.: t-Closeness: privacy beyond k-anonymity and l-diversity. In: IEEE International Conference on Data Engineering (ICDE), pp. 106–115 (2007)
Mohapatra, D., Patra M.R.: k-degree closeness anonymity: a centrality measure based approach for network anonymization, pp. 299–310. ICDCIT (2015)
Zheleva, E., Getoor, L.: Preserving the privacy of sensitive relationships in graph data. In: Proceeding of International Workshop on Privacy, Security and Trust in KDD (PinKDD), pp. 153–171 (2007)
Liu, K., Das, K., Grandison, T., Kargupta, H.: Privacy-preserving data analysis on graphs and social networks. In: Kargupta, H., Han, J., Yu, P., Motwani, R., Kumar, V. (eds.) Next Generation of Data Mining, chapter 21, pp. 419–437. Chapman & Hall/CRC (2008)
Babu, K.S., Jena, S.K., Hota, J., Moharana, B.: Anonymizing social networks: a generalization approach. Comput. Electr. Eng. 39, 1947–1961 (2013)
Campan, A., Truta, T.M.: Data and structural k-anonymity in social networks. In: Proceedings of the Second ACM SIGKDD International Workshop on Privacy, Security and Trust in KDD (PinKDD), pp. 33–54 (2008)
Tassa, T., Cohen, D.J.: Anonymization of centralized and distributed social networks by sequential clustering. IEEE Trans. Knowl. Data Eng. 25(2), 311–324 (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Mohapatra, D., Patra, M.R. (2020). Cluster-Based Anonymization of Assortative Networks. In: Behera, H., Nayak, J., Naik, B., Pelusi, D. (eds) Computational Intelligence in Data Mining. Advances in Intelligent Systems and Computing, vol 990. Springer, Singapore. https://doi.org/10.1007/978-981-13-8676-3_60
Download citation
DOI: https://doi.org/10.1007/978-981-13-8676-3_60
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-8675-6
Online ISBN: 978-981-13-8676-3
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)