Abstract
The challenging problems in recent years is the Distributed Data clustering over Peer-to-Peer network (P2P). In this paper, there is a presentation of peer-to-peer based K-prototype framework named MEKPFCM, by incorporating kernel fuzzy c-means and possibilistic fuzzy clustering algorithms. This work also considers the distributed clustering problem where the data and computing resources are spread over the large Peer-to-Peer network. It offers two algorithms which produce an approximate result produced by the MEKPFCM clustering algorithm. In the dynamic P2P network, the distributed fuzzy k-prototype clustering algorithm is played a major role. This can produce clustering's by local synchronization only. The second algorithm uses sampled peers that are reliable and present analytical guarantees regarding the accuracy of clustering on a P2P network. The performance of the proposed method evaluation is done through accuracy and computation time and the experimentation shows that the proposed method gives good performance compared to the existing method.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Asian Journal of Research in Social Sciences and Humanities
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
