Abstract

The rapid growth and the dynamic nature of the web have continued to bring challenge to Pagerank algorithm. Pagerank algorithm remains the best ranking criteria so far. Many researchers have worked to accelerate Pagerank computation, but this two challenges still remain an issue. We propose model architecture that optimized the dynamic nature of Ant Colony Optimization (ACO) to prune the cones of graph nodes and retrieve relevant node for users display. The potential benefit of our proposed design indicates an improvement over the traditional Pagerank in case of its computation cost and efficiency.

Key words: Pagerank, Ant Colony Optimization, Max-Min ant system, Improve max-min ant system, JGraph framework, Dynamic Pagerank model,