Research Article
K-Medoids Computation Model Framework for Security in Distributed Architecture Networks
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 131 - Issue 14 |
| Published: December 2015 |
| Authors: Lalitha Ariyapalli, Rajendra Kumar Ganiya, P Suresh Kumar |
10.5120/ijca2015907315
|
Lalitha Ariyapalli, Rajendra Kumar Ganiya, P Suresh Kumar . K-Medoids Computation Model Framework for Security in Distributed Architecture Networks. International Journal of Computer Applications. 131, 14 (December 2015), 1-3. DOI=10.5120/ijca2015907315
@article{ 10.5120/ijca2015907315,
author = { Lalitha Ariyapalli,Rajendra Kumar Ganiya,P Suresh Kumar },
title = { K-Medoids Computation Model Framework for Security in Distributed Architecture Networks },
journal = { International Journal of Computer Applications },
year = { 2015 },
volume = { 131 },
number = { 14 },
pages = { 1-3 },
doi = { 10.5120/ijca2015907315 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2015
%A Lalitha Ariyapalli
%A Rajendra Kumar Ganiya
%A P Suresh Kumar
%T K-Medoids Computation Model Framework for Security in Distributed Architecture Networks%T
%J International Journal of Computer Applications
%V 131
%N 14
%P 1-3
%R 10.5120/ijca2015907315
%I Foundation of Computer Science (FCS), NY, USA
Abstract
In this paper, a method was proposed to maintain the networks with low cost for more processing of data. It contains simple framework to maintain the data in refine method and for secure data transfer. And also more data maintenance with clustering capability with secure mode.
References
- Privacy Preserving Decision Tree Learning Using Unrealized Data Sets Pui K. Fong and Jens H. Weber-Jahnke, Senior Member, IEEE Computer Society.
- Privacy-Preserving Mining of Association Rules From Outsourced Transaction Databases Fosca Giannotti, Laks V. S. Lakshmanan, Anna Monreale, Dino Pedreschi, and Hui (Wendy) Wang.
- Anonymization of Centralized and Distributed Social Networks by Sequential Clustering Tamir Tassa and Dror J. Cohen.
- Privacy Preserving Clustering S.Jha, L. Kruger, and P. McDaniel.
- Tools for Privacy Preserving Distributed Data Mining , Chris Clifton, Murat Kantarcioglu, Xiaodong Lin, Michael Y. Zhu.
- S.Datta, C. R. Giannella, and H. Kargupta, “Approximate distributed K-Means clustering over a peer-to-peer network,” IEEETKDE, vol. 21, no. 10, pp. 1372–1388, 2009.
- K. M. Hammouda and M. S. Kamel, “Hierarchically distributedpeer-to-peer document clustering and cluster summarization,”IEEE Trans. Knowl. Data Eng., vol. 21, no. 5, pp. 681–698, 2009.
- M. Eisenhardt, W. Muller, and A. Henrich, “Classifying documents by distributed P2P clustering” in INFORMATIK, 2003.
- H.-C. Hsiao and C.-T.King, “Similarity discovery in structured P2P overlays,” in ICPP, 2003.
- Privacy Preserving Clustering By Data Transformation Stanley R. M. Oliveira, Osmar R. Za¨ıane.
Index Terms
Keywords