An Ensemble Click Model for Web Document Ranking
Author(s) -
Danial Bidekani Bakhtiarvand,
Saeed Farzi
Publication year - 2020
Publication title -
international journal of engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.225
H-Index - 17
ISSN - 1728-1431
DOI - 10.5829/ije.2020.33.07a.06
Subject(s) - computer science , information retrieval , perplexity , ranking (information retrieval) , search engine , classifier (uml) , similarity (geometry) , probabilistic logic , metasearch engine , data mining , artificial intelligence , machine learning , language model , web search query , image (mathematics)
Annually, web search engine providers spend a lot of money on re-ranking documents in search engine result pages (SERP). Click models provide advantageous information for re-ranking documents in SERPs through modeling interactions among users and search engines. Here, three modules are employed to predict users' clicks on SERPs simultaneously, the first module tries to predict users' click behaviors using Probabilistic Graphical Models, the second module is a Time-series Deep Neural Click Model which predicts users' clicks on documents and finally, the third module is a similarity-based measure which creates a graph of document-query relations and uses SimRank Algorithm to predict the similarity. After running these three simultaneous processes, three click probability values are fed to an MLP classifier as inputs. The MLP classifier learns to decide on top of the three preceding modules, then it predicts a probability value which shows how probable a document is to be clicked by a user. The proposed system is evaluated on the Yandex dataset as a standard click log dataset. The results demonstrate the superiority of our model over the well-known click models in terms of perplexity.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom