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

被引:0
|
作者
El Hadi, Amine [1 ]
Madani, Youness [1 ]
El Ayachi, Rachid [2 ]
Erritali, Mohamed [2 ]
机构
[1] Sultan Moulay Slimane Univ, Fac Sci & Tech, Beni Mellal, Morocco
[2] Sultan Moulay Slimane Univ, Fac Sci & Tech, Lab TIAD, Beni Mellal, Morocco
关键词
N-Grams Model; Query Reformulation; Reinforcement Learning; Search Engine; Semantic Similarity; SEMANTIC SIMILARITY;
D O I
10.4018/JITR.299930
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
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, the authors propose a new recommendation approach for recommending relevant documents to a search engine's users. In this work, they 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 the method outperforms some methods from the literature with a high value of accuracy.
引用
收藏
页数:17
相关论文
共 50 条
  • [21] Using N-grams for arabic text searching
    Mustafa, SH
    Al-Radaideh, QA
    JOURNAL OF THE AMERICAN SOCIETY FOR INFORMATION SCIENCE AND TECHNOLOGY, 2004, 55 (11): : 1002 - 1007
  • [22] Protein classification using modified n-grams and skip-grams
    Islam, S. M. Ashiqul
    Heil, Benjamin J.
    Kearney, Christopher Michel
    Baker, Erich J.
    BIOINFORMATICS, 2018, 34 (09) : 1481 - 1487
  • [23] An improved N-grams based Model for Authorship Attribution
    Boughaci, Dalila
    Benmesbah, Mounir
    Zebiri, Aniss
    2019 INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION SCIENCES (ICCIS), 2019, : 70 - 75
  • [24] N-grams: A well-structured knowledge representation for recognition of graphical documents
    Lank, E
    Blostein, D
    PROCEEDINGS OF THE FOURTH INTERNATIONAL CONFERENCE ON DOCUMENT ANALYSIS AND RECOGNITION, VOLS 1 AND 2, 1997, : 801 - 804
  • [25] Identifying Similar Sentences by Using N-Grams of Characters
    Sultana, Saima
    Biskri, Ismail
    RECENT TRENDS AND FUTURE TECHNOLOGY IN APPLIED INTELLIGENCE, IEA/AIE 2018, 2018, 10868 : 833 - 843
  • [26] Clone Detection for Ecore Metamodels using N-grams
    Babur, Onder
    PROCEEDINGS OF THE 6TH INTERNATIONAL CONFERENCE ON MODEL-DRIVEN ENGINEERING AND SOFTWARE DEVELOPMENT, 2018, : 411 - 419
  • [27] Document Verification Using n-grams and Histograms of Words
    Almarimi, Abdulwahed
    Andrejkova, Gabriela
    Sedmak, Peter
    2015 IEEE 13TH INTERNATIONAL SCIENTIFIC CONFERENCE ON INFORMATICS, 2015, : 15 - 20
  • [28] USING N-GRAMS TO IDENTIFY EDIT WARS ON WIKIPEDIA
    Ghosh, Arjun
    2019 IEEE FIFTH INTERNATIONAL CONFERENCE ON MULTIMEDIA BIG DATA (BIGMM 2019), 2019, : 398 - 403
  • [29] Using n-grams of spatial densities to construct maps
    Maffei, Renan
    Jorge, Vitor A. M.
    Rey, Vitor E.
    Franco, Guilherme S.
    Giambastiani, Mariane
    Barbosa, Jessica
    Kolberg, Mariana
    Prestes, Edson
    2015 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS), 2015, : 3850 - 3855
  • [30] Source code authorship attribution using n-grams
    Burrows, Steven
    Tahaghoghi, S.M.M.
    ADCS 2007 - Proceedings of the Twelfth Australasian Document Computing Symposium, 2007, : 32 - 39