We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

K-Medoids Computation Model Framework for Security in Distributed Architecture Networks

by Lalitha Ariyapalli, Rajendra Kumar Ganiya, P Suresh Kumar
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 131 - Number 14
Year of Publication: 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 },
issue_date = { December 2015 },
volume = { 131 },
number = { 14 },
month = { December },
year = { 2015 },
issn = { 0975-8887 },
pages = { 1-3 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume131/number14/23514-2015907315/ },
doi = { 10.5120/ijca2015907315 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:27:18.894780+05:30
%A Lalitha Ariyapalli
%A Rajendra Kumar Ganiya
%A P Suresh Kumar
%T K-Medoids Computation Model Framework for Security in Distributed Architecture Networks
%J International Journal of Computer Applications
%@ 0975-8887
%V 131
%N 14
%P 1-3
%D 2015
%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
  1. Privacy Preserving Decision Tree Learning Using Unrealized Data Sets Pui K. Fong and Jens H. Weber-Jahnke, Senior Member, IEEE Computer Society.
  2. Privacy-Preserving Mining of Association Rules From Outsourced Transaction Databases Fosca Giannotti, Laks V. S. Lakshmanan, Anna Monreale, Dino Pedreschi, and Hui (Wendy) Wang.
  3. Anonymization of Centralized and Distributed Social Networks by Sequential Clustering Tamir Tassa and Dror J. Cohen.
  4. Privacy Preserving Clustering S.Jha, L. Kruger, and P. McDaniel.
  5. Tools for Privacy Preserving Distributed Data Mining , Chris Clifton, Murat Kantarcioglu, Xiaodong Lin, Michael Y. Zhu.
  6. 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.
  7. 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.
  8. M. Eisenhardt, W. Muller, and A. Henrich, “Classifying documents by distributed P2P clustering” in INFORMATIK, 2003.
  9. H.-C. Hsiao and C.-T.King, “Similarity discovery in structured P2P overlays,” in ICPP, 2003.
  10. Privacy Preserving Clustering By Data Transformation Stanley R. M. Oliveira, Osmar R. Za¨ıane.
Index Terms

Computer Science
Information Sciences

Keywords

TDEA DES

Powered by PhDFocusTM