Open AccessIterative Procedural Internet Search
Author(s) -
А. Н. Трусов,
Aleksandr Gashkov
Publication year - 2019
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1415/1/012019
Subject(s) - iterative deepening depth first search , the internet , relevance (law) , computer science , sorting , search algorithm , sorting algorithm , iterative method , information retrieval , algorithm , mathematical optimization , best first search , beam search , mathematics , world wide web , political science , law
The present study investigates the problem of sorting search result by relevance. The new algorithm based on iterative procedural Internet search is developed. The aim of the study was to improve the existing algorithm. Results show that applying the improved algorithm approximately doubles Normalized Discounted Cumulative Gain at k and therefore greatly decrease average time to find relevant documents in search results list.