Publication

Predictive random graph ranking on the web

Yang, Haixuan
Thumbnail Image
Files
Thumbnail Image
IJCNN06-HXYANG.pdf
Adobe PDF, 183.97 KB
Repository DOI
Publication Date
2006
Keywords
Web sites, Graph theory, Jaccard coefficient, PageRank, Web structure, Common neighbour, Predictive random graph ranking, Computer science, Crawlers, Web pages
Type
Conference Paper
Downloads
Show all metadata
Citation
Yang, Haixuan and King, Irwin and Lyu, Michael R (2006) Predictive random graph ranking on the web Neural Networks, 2006. IJCNN'06. International Joint Conference on
Abstract
The incomplete information about the Web structure causes inaccurate results of various ranking algorithms. In this paper, we propose a solution to this problem by formulating a new framework called, Predictive Random Graph Ranking, in which we generate a random graph based on the known information about the Web structure. The random graph can be considered as the predicted Web structure, on which ranking algorithm are expected to be improved in accuracy. For this purpose, we extend some current ranking algorithms from a static graph to a random graph. Experimental results show that the Predictive Random Graph Ranking framework can improve the accuracy of the ranking algorithms such as PageRank, Common Neighbor, and Jaccard's Coefficient.
Funder
|~|
Publisher
Publisher DOI
Rights
Attribution-NonCommercial-NoDerivs 3.0 Ireland
cbn
Collections
Mathematics (Conference Papers)