Advertisement

Hybrid Approach to Speed-Up the Privacy Preserving Kernel K-means Clustering and its Application in Social Distributed Environment

  • P. L. LekshmyEmail author
  • M. Abdul Rahiman
Article

Abstract

In this most revolutionized world, the social network plays a vital role in each and everyone’s life. Social networking is a pervasive communication platform where the users can search whole over the world via the Internet. Users have similar interest to connect and interact with one another and to share their private and personal interest. In this paper, we examine privacy concern for the social networking users by distributed clustering method. In the proposed scheme, to speed-up, the Kernel k-means algorithm, a prototype based hybrid kernel k-means algorithm is involved in distributing the users into the cluster. Since we are using a large data set, we use a hybrid approach to speed-up the kernel k-means clustering (HSKK). The clustering process used here is to partition a similar set of objects in a dataset. Additionally, in the clustering process, a cryptographic protocol such as homomorphic encryption is involved in every dataset to achieve the goal to protect the private data. To prove the efficiency of the proposed approach, the experiment is done on Movie lens dataset. The experimental study of HSKK shows that the proposed method can significantly reduce the computation time and the private data of users is hidden from the service provider.

Keywords

Service provider Social network Kernel k-means Distributed clustering Encryption Helper user Cryptographic protocol 

Notes

References

  1. 1.
    Erkin, Z., Veugen, T., Toft, T., Lagendijk, R.L.:. Privacy-preserving user clustering in a social network. In First IEEE International Workshop on Information Forensics and Security (WIFS), pp. 96–100. IEEE, New York (2009)Google Scholar
  2. 2.
    Qi, X., Zong, M.: An overview of privacy preserving data mining school of technology. In: International Conference on Environmental Science and Engineering (ICESE 2011). Harbin University, Harbin, 150086Google Scholar
  3. 3.
    Sachan, A., Roy, D., Arun, P. V.: An analysis of privacy preservation techniques in data mining. In: Advances in Computing and Information Technology. Springer Berlin Heidelberg, pp. 119–128, (2013)CrossRefGoogle Scholar
  4. 4.
    Vaidya, J., Clifton, C.W.: Privacy-preserving kth element score over vertically partitioned data. IEEE Trans. Knowl. Data Eng. 21(2), 253–258 (2009)CrossRefGoogle Scholar
  5. 5.
    Januzaj, E., Kriegel, H.P., Pfeifle, M.: Towards effective and efficient distributed clustering. In: Workshop on Clustering Large Data Sets (ICDM2003). (2003)Google Scholar
  6. 6.
    Dhote, C.A.: Homomorphic encryption for security of cloud data. Procedia Comput. Sci. 79, 175–181 (2016)CrossRefGoogle Scholar
  7. 7.
    Sarma, T.H., Viswanath, P., Reddy, B.E.: Speeding-up the kernel k-means clustering method: A prototype based hybrid approach. Pattern Recogn. Lett. 34(5), 564–573 (2013)CrossRefGoogle Scholar
  8. 8.
    Ying-hua, L., Bing-ru, Y., Dan-yang, C., Nan, M.: State-of-the-art in distributed privacy preserving data mining. In: 2011 IEEE 3rd International Conference on Communication Software and Networks (ICCSN), pp. 545–549. IEEE, New York, (2011)Google Scholar
  9. 9.
    Erkin, Z., Veugen, T., Toft, T., Lagendijk, R.L.: Privacy-preserving distributed clustering. EURASIP J. Inf. Secur. 2013(1), 1–15 (2013)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Vaidya, J., Clifton, C.: Privacy-preserving k-means clustering over vertically partitioned data. In Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 206–215. ACM, New York, (2003)Google Scholar
  11. 11.
    Javaid, N., Rasheed, M.B., Imran, M., Guizani, M., Khan, Z.A., Alghamdi, T.A., Ilahi, M.: An energy-efficient distributed clustering algorithm for heterogeneous WSNs. EURASIP J. Wirel. Commun. Netw. 2015(1), 1–11 (2015)CrossRefGoogle Scholar
  12. 12.
    Islam, M.M., Ahasanuzzaman, M., Razzaque, M.A., Hassan, M.M., Alelaiwi, A., Xiang, Y.: Target coverage through distributed clustering in directional sensor networks. EURASIP J. Wirel. Commun. Netw. 2015(1), 167 (2015)CrossRefGoogle Scholar
  13. 13.
    Chen, J., Li, Y., Sun, P., Sun, M., Mao, R., Dong, L.: An improved distributed clustering algorithm based on density. In 2015 8th International Conference on Intelligent Networks and Intelligent Systems (ICINIS), pp. 133–136, IEEE, New York (2015)Google Scholar
  14. 14.
    Massin, R., Le Martret, C. J., Ciblat, P.: Distributed clustering algorithm in dense group-based ad hoc networks. In 2016 Mediterranean Ad Hoc Networking Workshop (Med-Hoc-Net), pp. 1–7. IEEEGoogle Scholar
  15. 15.
    Zhang, Hao, Dai, GuangLong: Improvement of distributed clustering algorithm based on min-cluster. Optik Int. J. Light Electron Opt. 127(8), 3878–3881 (2016)CrossRefGoogle Scholar
  16. 16.
    Schölkopf, B., Smola, A., Müller, K.R.: Nonlinear component analysis as a kernel eigenvalue problem. Neur Comput. 10(5), 1299–1319 (1998)CrossRefGoogle Scholar
  17. 17.
    Cristianini, N., Shawe-Taylor, J.: Support Vector Machines and Other Kernel Based Learning Methods. Cambridge University Press, Cambridge (2000)CrossRefGoogle Scholar
  18. 18.
    Harper, F. M., & Konstan, J. A.: The movielens datasets: history and context. ACM trans. interact. intell. syst. 5(4), 1–19 (2015)CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2020

Authors and Affiliations

  1. 1.Computer Science and Engineering, L B S Institute of Technology for WomenUniversity of KeralaTrivandrumIndia
  2. 2.Kerala State Centre for Advanced Printing and TrainingTrivandrumIndia

Personalised recommendations