Open Access   Article Go Back

Effective Data Clustering and Efficient Security scheme in Cloud Computing

V. Prasathkumar1 , K. Senthil2 , S.Vignesh 3 , P. Ranjith Roshan4 , E. Prakash5

Section:Survey Paper, Product Type: Journal Paper
Volume-7 , Issue-3 , Page no. 955-960, Mar-2019

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v7i3.955960

Online published on Mar 31, 2019

Copyright © V. Prasathkumar, K. Senthil, S.Vignesh, P. Ranjith Roshan, E. Prakash . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

XML View
PDF Download

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: V. Prasathkumar, K. Senthil, S.Vignesh, P. Ranjith Roshan, E. Prakash, “Effective Data Clustering and Efficient Security scheme in Cloud Computing,” International Journal of Computer Sciences and Engineering, Vol.7, Issue.3, pp.955-960, 2019.

MLA Style Citation: V. Prasathkumar, K. Senthil, S.Vignesh, P. Ranjith Roshan, E. Prakash "Effective Data Clustering and Efficient Security scheme in Cloud Computing." International Journal of Computer Sciences and Engineering 7.3 (2019): 955-960.

APA Style Citation: V. Prasathkumar, K. Senthil, S.Vignesh, P. Ranjith Roshan, E. Prakash, (2019). Effective Data Clustering and Efficient Security scheme in Cloud Computing. International Journal of Computer Sciences and Engineering, 7(3), 955-960.

BibTex Style Citation:
@article{Prasathkumar_2019,
author = {V. Prasathkumar, K. Senthil, S.Vignesh, P. Ranjith Roshan, E. Prakash},
title = {Effective Data Clustering and Efficient Security scheme in Cloud Computing},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {3 2019},
volume = {7},
Issue = {3},
month = {3},
year = {2019},
issn = {2347-2693},
pages = {955-960},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=3946},
doi = {https://doi.org/10.26438/ijcse/v7i3.955960}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v7i3.955960}
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=3946
TI - Effective Data Clustering and Efficient Security scheme in Cloud Computing
T2 - International Journal of Computer Sciences and Engineering
AU - V. Prasathkumar, K. Senthil, S.Vignesh, P. Ranjith Roshan, E. Prakash
PY - 2019
DA - 2019/03/31
PB - IJCSE, Indore, INDIA
SP - 955-960
IS - 3
VL - 7
SN - 2347-2693
ER -

VIEWS PDF XML
285 195 downloads 147 downloads
  
  
           

Abstract

As one important technique of fuzzy clustering in data mining and pattern recognition, the possibility c-means algorithm (PCM) has been widely used in image analysis and knowledge discovery. However, it is difficult for PCM to produce a good result for clustering big data, especially for heterogeneous data, since it is initially designed for only small structured data set. To tackle this problem, the paper proposes a high-order PCM algorithm for big data clustering by optimizing the objective function in the tensor space. Further, we design a distributed HOPCM method based on Map Reduce for very large amount of heterogeneous data. Experimental results indicate that PPHOPCM can effectively cluster numerous heterogeneous data using cloud computing without disclosure of private data.

Key-Words / Index Term

Clustering Big data ,Cloud Computing, possibilistic -means algorithm, Privacy preserving , Tensor space

References

[1] X. Wu, X. Zhu, G.-Q. Wu, and W. Ding, ”Data Mining with Big Data,” IEEE Transactions on Knowledge and Data Engineering, vol. 26, no. 1, pp. 97-107, Jan. 2014.
[2] B. Ermis, E. Acar, and A. T. Cemgil, ”Link Prediction in Heterogeneous Data via Generalized Coupled Tensor Factorization,” Data Mining and Knowledge Discovery, vol. 29, no. 1, pp. 203-236, 2015.
[3] Q. Zhang, L. T. Yang, and Z. Chen, ”Deep Computation Model for Unsupervised Feature Learning on Big Data,” IEEE Transactions on Services Computing, vol. 9, no. 1, pp. 161-171, Jan. 2016.
[4] N.SoniandA.Ganatra,”MOiD (Multiple Objects Incremental DBSCAN) - A Paradigm Shift in Incremental DBSCAN,” International Journal of Computer Science and Information Security, vol. 14, no. 4, pp. 316-346, 2016.
[5] Z. Xie, S. Wang, and F. L. Chung, ”An Enhanced Possibilistic c-Means Clustering Algorithm EPCM,” Soft Computing, vol.12,no.6,pp.593-611, 2008.
[6] Q. Zhang, C. Zhu, L. T. Yang, Z. Chen, L. Zhao, and P. Li, ”An Incremental CFS Algorithm for Clustering Large Data in Industrial Internet of Things,” IEEE Transactions on Industrial Informatics, 2015. DOI: 10.1109/ TII.2017. 2684807
[7] X. Zhang, ”Convex Discriminative Multitask Clustering,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 37, no. 1, pp. 28-40, Jan. 2015
[8] B. Gao, T. Liu, T. Qin, X. Zheng, Q. Cheng, and W. Ma, ”Web Image Clustering by Consistent Utilization of Visual Features and Surrounding Texts,” in Proceedings of the 13th Annual ACM International Conference on Multimedia, 2005, 112-121.
[9] Y. Chen, L. Wang, and M. Dong, ”Non-Negative Matrix Factorization for Semi supervised Heterogeneous Data Co clustering,” IEEE Transactions on Knowledge and Data Engineering, vol. 22, no. 10, pp. 1459-1474, Oct. 2010.
[10] L. Meng, A. Tan, and D. Xu, ”Semi-Supervised Heterogeneous Fusion for Multimedia Data Co-Clustering,” IEEE Transactions on Knowledge and Data Engineering, vol. 26, no. 9, pp. 2293-2306, Aug. 2014