Amine El Hadi, Youness Madani, R. Ayachi, M. Erritali
{"title":"利用N-Grams模型和强化学习在搜索引擎中查找相关文档","authors":"Amine El Hadi, Youness Madani, R. Ayachi, M. Erritali","doi":"10.4018/jitr.299930","DOIUrl":null,"url":null,"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.","PeriodicalId":296080,"journal":{"name":"J. Inf. Technol. Res.","volume":"14 2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Finding Relevant Documents in a Search Engine Using N-Grams Model and Reinforcement Learning\",\"authors\":\"Amine El Hadi, Youness Madani, R. Ayachi, M. Erritali\",\"doi\":\"10.4018/jitr.299930\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":296080,\"journal\":{\"name\":\"J. Inf. Technol. Res.\",\"volume\":\"14 2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"J. Inf. Technol. Res.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4018/jitr.299930\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"J. Inf. Technol. Res.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4018/jitr.299930","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Finding Relevant Documents in a Search Engine Using N-Grams Model and Reinforcement Learning
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.