A search ranking algorithm for web information retrieval Online publication date: Wed, 01-Mar-2023
by Shan Shan Zhi; Huan Huan Wang
International Journal of Communication Networks and Distributed Systems (IJCNDS), Vol. 29, No. 2, 2023
Abstract: The development of the internet has seen an explosion in the amount of information, which has increased the scope of queries for users but greatly increased the difficulty of searching for valid information. In order to retrieve effective information faster, search ranking algorithms are needed to rank the retrieved information and return it to the user. This paper briefly introduced the RankNet algorithm among web information search ranking algorithms and optimised the loss function to improve its retrieval ranking performance. Simulation tests were carried out with Microsoft public data set MSLR-WEB30K. The improved RankNet algorithm was compared with the ranking support vector machine (SVM) algorithm and the traditional RankNet algorithm. The results showed that as the number of returned retrievals increased, the retrieval ranking performance of all three search ranking algorithms tended to decrease; under the same number of returned retrievals, the improved RankNet algorithm had the best performance.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Communication Networks and Distributed Systems (IJCNDS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook