Personalized Ranking Mechanism Using Yandex Dataset on Machine Learning Approaches

Web service technology is extensively utilized as data source by every client. As the quantity of Web information develops quickly, search engines are capable to retrieve data based on the customer preferences. Users now rely on the Internet to meet their information needs, but current search engine...

Full description

Saved in:
Bibliographic Details
Published inProceedings of the International Conference on Cognitive and Intelligent Computing pp. 629 - 639
Main Authors Sangamithra, B., Manjunath Swamy, B. E., Sunil Kumar, M.
Format Book Chapter
LanguageEnglish
Published Singapore Springer 2022
Springer Nature Singapore
SeriesCognitive Science and Technology
Subjects
Online AccessGet full text
ISBN9811923493
9789811923494
ISSN2195-3988
2195-3996
DOI10.1007/978-981-19-2350-0_61

Cover

Loading…
More Information
Summary:Web service technology is extensively utilized as data source by every client. As the quantity of Web information develops quickly, search engines are capable to retrieve data based on the customer preferences. Users now rely on the Internet to meet their information needs, but current search engines often return a long list of results despite using sophisticated document indexing algorithms, many of which were not constantly applicable to the needs of the customer. Because a customer has a precise aim in mind when looking for data, personalized exploration will deliver outcomes that precisely match the user’s plan and purpose. Query-based investigate is commonly used by businesses to assist customers in finding information and products on their Websites. We look at how to rank a collection of outcomes returned in reply for a query in the most efficient way possible. Based on a customer search and click record, we propose a personalized ranking mechanism. We present our Yandex personalized Web search challenge solution. The goal of this challenge was to personalize top-N document rankings for a group of test users using historical search logs.
ISBN:9811923493
9789811923494
ISSN:2195-3988
2195-3996
DOI:10.1007/978-981-19-2350-0_61