Ranking Web Pages Using Machine Learning Approaches
- 1 December 2008
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3, 677-680
- https://doi.org/10.1109/wiiat.2008.235
Abstract
One of the key components which ensures the acceptance of web search service is the web page ranker - a component which is said to have been the main contributing factor to the early successes of Google. It is well established that a machine learning method such as the Graph Neural Network (GNN) is able to learn and estimate Google's page ranking algorithm. This paper shows that the GNN can successfully learn many other Web page ranking methods e.g. TrustRank, HITS and OPIC. Experimental results show that GNN may be suitable to learn any arbitrary web page ranking scheme, and hence, may be more flexible than any other existing web page ranking scheme. The significance of this observation lies in the fact that it is possible to learn ranking schemes for which no algorithmic solution exists or is known.Keywords
This publication has 10 references indexed in Scilit:
- IRLbotPublished by Association for Computing Machinery (ACM) ,2008
- Computing customized page ranksACM Transactions on Internet Technology, 2006
- XML Document Mining Using Contextual Self-organizing Maps for StructuresLecture Notes in Computer Science, 2005
- Clustering XML Documents Using Self-organizing Maps for StructuresPublished by Springer Science and Business Media LLC ,2005
- Recursive neural networks for processing graphs with labelled edges: theory and applicationsNeural Networks, 2005
- Adaptive page ranking with neural networksPublished by Association for Computing Machinery (ACM) ,2005
- Graph Neural Networks for Ranking Web PagesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Combating Web Spam with TrustRankPublished by Elsevier BV ,2004
- Adaptive on-line page importance computationPublished by Association for Computing Machinery (ACM) ,2003
- Authoritative sources in a hyperlinked environmentJournal of the ACM, 1999