MODIFIED PAGERANK FOR CONCEPT BASED SEARCH

被引:0
作者
Pavai, G. [1 ]
Umamaheswari, E. [1 ]
Geetha, T., V [1 ]
机构
[1] Anna Univ, Madras 600025, Tamil Nadu, India
来源
JOURNAL OF WEB ENGINEERING | 2015年 / 14卷 / 5-6期
关键词
PageRank; Semantic web based search; Concept based search; Physical link; Concept link; UNL; PERSONALIZED PAGERANK; WEB SEARCH; RANKING;
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Traditional PageRank algorithm computes the weight for each hyper-linked document, which indicates the importance of a page, based on the in-links and out-links. This is an off-line and query independent process which suits a keyword based search strategy. However, owing to the problems like polynymy, synonymy etc.., existing in keyword based search, new methodologies for search like concept based search, semantic web based search etc., have been developed. Concept based search engines generally go in for content based ranking by imparting semantics to the web pages. While this approach is better than the keyword based ranking strategies, they do not consider the physical link structure between documents which is the basis of the successful PageRank algorithm. Hence, we made an attempt to combine the power of link structures with content information to suit the concept based search engines. Our main contribution includes, two modifications to the traditional PageRank Algorithm, both specifically to cater to the concept based search engines. Inspired by the topic sensitive PageRank algorithm, we have multiple PageRanks for a document, rather than just one for each document as given in the traditional implementation of the PageRank algorithm. We have compared our methodologies with an existing concept based search engine's ranking methodology, and found that our modifications considerably improve the ranking of the conceptual search results. Furthermore, we performed statistical significance test and found out that our Version-2 modification to the PageRank algorithm is statistically significant in its P@5 performance compared to the baseline.
引用
收藏
页码:503 / 524
页数:22
相关论文
共 50 条
[31]   HITS-PR-HHblits: protein remote homology detection by combining PageRank and Hyperlink-Induced Topic Search [J].
Liu, Bin ;
Jiang, Shuangyan ;
Zou, Quan .
BRIEFINGS IN BIOINFORMATICS, 2020, 21 (01) :298-308
[32]   Users' Click and Bookmark Based Personalization Using Modified Agglomerative Clustering for Web Search Engine [J].
Rajkumar, T. Dhiliphan ;
Raja, S. P. ;
Suruliandi, A. .
INTERNATIONAL JOURNAL ON ARTIFICIAL INTELLIGENCE TOOLS, 2017, 26 (06)
[33]   Research on Parallel Algorithm of PageRank based on GPU [J].
Jiang, Hao ;
Gao, Jian-Ming .
2016 INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND INFORMATION SECURITY (CSIS 2016), 2016, :391-397
[34]   PageRank centrality with non-local random walk-based teleportation [J].
Bowater, David ;
Stefanakis, Emmanuel .
JOURNAL OF COMPLEX NETWORKS, 2023, 11 (04)
[35]   Research on backend optimization of SLAM based on PageRank [J].
Zhang J. ;
Zhang H. ;
Liu X. .
Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition), 2019, 47 (04) :61-66
[36]   The Study of a Risk Assessment System based on PageRank [J].
Kuo, Cheng-Chung ;
Hou, Chia-Ling ;
Yang, Chu-Sing .
JOURNAL OF INTERNET TECHNOLOGY, 2019, 20 (07) :2255-2264
[37]   Study and analysis of category based PageRank method [J].
Jain, Utkarsh ;
Mishra, Ayush ;
Jaganathan, B. ;
Shukla, Pankaj .
WIRELESS NETWORKS, 2021, 27 (08) :5461-5476
[38]   Graph Mixed Random Network Based on PageRank [J].
Ma, Qianli ;
Fan, Zheng ;
Wang, Chenzhi ;
Tan, Hongye .
SYMMETRY-BASEL, 2022, 14 (08)
[39]   An improved PageRank algorithm based on web content [J].
Zhou Hao ;
Pu Qiumei ;
Zhang Hong ;
Sha Zhihao .
14TH INTERNATIONAL SYMPOSIUM ON DISTRIBUTED COMPUTING AND APPLICATIONS FOR BUSINESS, ENGINEERING AND SCIENCE (DCABES 2015), 2015, :284-287
[40]   An Improved BA Model Based on the PageRank Algorithm [J].
Guo, Chonghui ;
Zhang, Liang .
2008 4TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-31, 2008, :11500-+