Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

IJCAI
2007

favoriteEmaildiscussreport

164views Artificial Intelligence» more IJCAI 2007»

An Improved Probabilistic Ant based Clustering for Distributed Databases

13 years 5 months ago

An Improved Probabilistic Ant based Clustering for Distributed Databases

Download www.ijcai.org

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

Chandrasekar Ramachandran, Thanukrishnan Srinivasa

Real-time Traffic

Ant Based Clustering | Artificial Intelligence | Distributed Database | IJCAI 2007 | Improved Version |

claim paper

Related Content

» Semisupervised Learning with Penalized Probabilistic Clustering

» 3D Model Retrieval Based on Adaptive Views Clustering

» Probabilistic home video structuring feature selection and performance evaluation

» Deriving probabilistic databases with inference ensembles

» Discovering User Access Pattern Based on Probabilistic Latent Factor Model

» Materialized Views in Probabilistic Databases for Information Exchange and Query Optimizat...

» Improving cooperative GP ensemble with clustering and pruning for pattern classification

» A distributed learning framework for heterogeneous data sources

» Implementation of a Virtual Time Synchronizer for Distributed Databases

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2007
Where	IJCAI
Authors	Chandrasekar Ramachandran, Thanukrishnan Srinivasan

Comments (0)