Weighted PageRank Algorithm Search Engine Ranking Model for Web Pages  

作　　者：S.Samsudeen Shaffi I.Muthulakshmi 

机构地区：[1]Department of Computer Science and Engineering,PET Engineering College,Vallioor,Tamil Nadu,627117,India [2]Department of Computer Science and Engineering,V.V.College of Engineering,Tisaiyanvilai,Tamil Nadu,627657,India

出　　处：《Intelligent Automation & Soft Computing》2023年第4期183-192,共10页智能自动化与软计算（英文）

摘　　要：As data grows in size,search engines face new challenges in extracting more relevant content for users’searches.As a result,a number of retrieval and ranking algorithms have been employed to ensure that the results are relevant to the user’s requirements.Unfortunately,most existing indexes and ranking algo-rithms crawl documents and web pages based on a limited set of criteria designed to meet user expectations,making it impossible to deliver exceptionally accurate results.As a result,this study investigates and analyses how search engines work,as well as the elements that contribute to higher ranks.This paper addresses the issue of bias by proposing a new ranking algorithm based on the PageRank(PR)algorithm,which is one of the most widely used page ranking algorithms We pro-pose weighted PageRank(WPR)algorithms to test the relationship between these various measures.The Weighted Page Rank(WPR)model was used in three dis-tinct trials to compare the rankings of documents and pages based on one or more user preferences criteria.Thefindings of utilizing the Weighted Page Rank model showed that using multiple criteria to rankfinal pages is better than using only one,and that some criteria had a greater impact on ranking results than others.

关 键 词：Weighted pagerank algorithms search engines web pages web crawlers World Wide Web 

分 类 号：TP31[自动化与计算机技术—计算机软件与理论]