An Improved Probabilistic Ant based Clustering for Distributed Databases

In this paper we present an improved version of the Probabilistic Ant based Clustering Algorithm for Distributed Databases (PACE). The most important feature of this algorithm is the formation of numerous zones in different sites based on corresponding user queries to the distributed database. Keywords, extracted out of the queries, are used to assign a range of values according to their corresponding probability of occurrence or hit ratio at each site. We

• Type: Conference
• Year: 2007
• Where: IJCAI
• Authors: Chandrasekar Ramachandran, Thanukrishnan Srinivasan
• Keywords: Ant Based Clustering, Artificial Intelligence, Distributed Database, IJCAI 2007, Improved Version