Finding Relevant Documents in a Search Engine Using N-Grams Model and Reinforcement Learning

Finding Relevant Documents in a Search Engine Using N-Grams Model and Reinforcement Learning

Amine El Hadi, Youness Madani, Rachid El Ayachi, Mohamed Erritali
Copyright: © 2022 |Volume: 15 |Issue: 1 |Pages: 17
ISSN: 1938-7857|EISSN: 1938-7865|EISBN13: 9781683180340|DOI: 10.4018/JITR.299930
Cite Article Cite Article

MLA

El Hadi, Amine, et al. "Finding Relevant Documents in a Search Engine Using N-Grams Model and Reinforcement Learning." JITR vol.15, no.1 2022: pp.1-17. http://doi.org/10.4018/JITR.299930

APA

El Hadi, A., Madani, Y., El Ayachi, R., & Erritali, M. (2022). Finding Relevant Documents in a Search Engine Using N-Grams Model and Reinforcement Learning. Journal of Information Technology Research (JITR), 15(1), 1-17. http://doi.org/10.4018/JITR.299930

Chicago

El Hadi, Amine, et al. "Finding Relevant Documents in a Search Engine Using N-Grams Model and Reinforcement Learning," Journal of Information Technology Research (JITR) 15, no.1: 1-17. http://doi.org/10.4018/JITR.299930

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

The field of information retrieval (IR) is an important area in computer science, this domain helps us to find information that we are interested in from an important volume of information. A search engine is the best example of the application of information retrieval to get the most relevant results. In this paper, we propose a new recommendation approach for recommending relevant documents to a search engine’s users. In this work, we proposed a new approach for calculating the similarity between a user query and a list of documents in a search engine. The proposed method uses a new reinforcement learning algorithm based on n-grams model (i.e., a sub-sequence of n constructed elements from a given sequence) and a similarity measure. Results show that our method outperforms some methods from the literature with a high value of accuracy.