Weighted PageRank Algorithm Search Engine Ranking Model for Web Pages

被引:3
作者
Shaffi, S. Samsudeen [1 ]
Muthulakshmi, I. [2 ]
机构
[1] PET Engn Coll, Dept Comp Sci & Engn, Vallioor 627117, Tamil Nadu, India
[2] VV Coll Engn, Dept Comp Sci & Engn, Tisaiyanvilai 627657, Tamil Nadu, India
关键词
Weighted pagerank algorithms; search engines; web pages; web; crawlers; World Wide Web;
D O I
10.32604/iasc.2023.031494
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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 algorithms 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 propose weighted PageRank (WPR) algorithms to test the relationship between these various measures. The Weighted Page Rank (WPR) model was used in three distinct trials to compare the rankings of documents and pages based on one or more user preferences criteria. The findings of utilizing the Weighted Page Rank model showed that using multiple criteria to rank final pages is better than using only one, and that some criteria had a greater impact on ranking results than others.
引用
收藏
页码:183 / 192
页数:10
相关论文
共 19 条
  • [1] Alghamdi H., 2021, 2021 NATL COMPUTING, P1
  • [2] Analysis and comparison of centrality measures applied to urban networks with data
    Curado, Manuel
    Tortosa, Leandro
    Vicent, Jose F.
    Yeghikyan, Gevorg
    [J]. JOURNAL OF COMPUTATIONAL SCIENCE, 2020, 43 (43)
  • [3] Efficient Computing of PageRank Scores on Exact Expected Transition Matrix of Large Uncertain Graph
    Fushimi, Takayasu
    Saito, Kazumi
    Ohara, Kouzou
    Kimura, Masahiro
    Motoda, Hiroshi
    [J]. 2020 IEEE INTERNATIONAL CONFERENCE ON BIG DATA (BIG DATA), 2020, : 916 - 923
  • [4] Effects of central tendency measures on term weighting in textual information retrieval
    Ghahramani, Farzad
    Tahayori, Hooman
    Visconti, Andrea
    [J]. SOFT COMPUTING, 2021, 25 (11) : 7341 - 7378
  • [5] Kumar N., 2013, INT J COMPUTER IJC, V10, P1
  • [6] A survey on network node ranking algorithms: Representative methods, extensions, and applications
    Liu, JiaQi
    Li, XueRong
    Dong, JiChang
    [J]. SCIENCE CHINA-TECHNOLOGICAL SCIENCES, 2021, 64 (03) : 451 - 461
  • [7] Manohar E., 2022, J AMB INTEL HUM COMP, V13, P2585
  • [8] Using Machine Learning for Web Page Classification in Search Engine Optimization
    Matosevic, Goran
    Dobsa, Jasminka
    Mladenic, Dunja
    [J]. FUTURE INTERNET, 2021, 13 (01): : 1 - 20
  • [9] Mor J., 2018, COMPUSOFT INT J ADV, V7
  • [10] Neighborhood and PageRank methods for pairwise link prediction
    Nassar, Huda
    Benson, Austin R.
    Gleich, David F.
    [J]. SOCIAL NETWORK ANALYSIS AND MINING, 2020, 10 (01)