This paper presents an ant colony optimization methodology for optimally clustering N objects into K clusters. The algorithm employs distributed agents which. AbstractAnt-based clustering is a biologically inspired data. Multi-ant colonies approach for clustering data that consists of some parallel.based on ant colony to solve the unsupervised clustering. Index TermsAnt colony optimization, Clu...

Wireless sensor network is collection of sensor nodes. These nodes can communicate by transferring data to neighbor node. Nodes also have some resources those are limited. In this paper we discuss the different clustering algorithms for efficient utilization of resources. Also discuss the quality parameters of nodes. And gives the proposed solution method “Distributed Weighted Clustering Algori...

Objective: The main objective of this paper is to construct a distributed clustering algorithm based upon spatial data correlation among sensor nodes and perform data accuracy for each distributed cluster at their respective cluster head node. Design Procedure/Approach: We investigate that due to deployment of high density of sensor nodes in the sensor field, spatial data are highly correlated ...

Considerable Progress has been made in the last few years in improving the performance of the distributed database systems. The development of Fragment allocation models in Distributed database is becoming difficult due to the complexity of huge number of sites and their communication considerations. Under such conditions, simulation of clustering and data allocation is adequate tools for under...

These days web caching suffers from many problems like scalability, robustness, metadata management etc. These problems degrade the performance of the network and can also create frustrating situations for the clients. This paper discusses several web caching schemes such as Distributed Web Caching (DWC), Distributed Web Caching with Clustering (DWCC), Robust Distributed Web Caching (RDWC), Dis...

Text clustering is an established technique for improving quality in information retrieval, for both centralized and distributed environments. However, for highly distributed environments, such as peer-topeer networks, current clustering algorithms fail to scale. Our algorithm for peer-to-peer clustering achieves high scalability by using a probabilistic approach for assigning documents to clus...

Several privacy measures have been proposed in the privacypreserving data mining literature. However, privacy measures either assume centralized data source or that no insider is going to try to infer some information. This paper presents distributed privacy measures that take into account collusion attacks and point level breaches for distributed data clustering. An analysis of representative ...