%0 Conference Proceedings
%T Adaptive Algorithm for Interactive Question-Based Search
%+ Gdańsk University of Technology (GUT)
%+ Department of Informatics [Bergen] (UiB)
%+ Faculty of Mathematics and Computer Science [Toruń]
%A Rzeniewicz, Jacek
%A Szymański, Julian
%A Duch, Włodzisław
%Z Part 6: Information Retrieval
%< avec comité de lecture
%( IFIP Advances in Information and Communication Technology
%B 7th International Conference on Intelligent Information Processing (IIP)
%C Guilin, China
%Y Zhongzhi Shi
%Y David Leake
%Y Sunil Vadera
%I Springer
%3 Intelligent Information Processing VI
%V AICT-385
%P 186-195
%8 2012-10-12
%D 2012
%R 10.1007/978-3-642-32891-6_24
%K information retrieval
%K semantic search
%K decision trees
%Z Computer Science [cs]Conference papers
%X Popular web search engines tend to improve the relevance of their result pages, but the search is still keyword–oriented and far from ”understanding” the queries’ meaning. In the article we propose an interactive question-based search algorithm that might come up helpful for identifying users’ intents. We describe the algorithm implemented in a form of a questions game. The stress is put mainly on the most critical aspect of this algorithm – the selection of questions. The solution is compared to broadly used decision trees learning algorithms in terms of knowledge inconsistencies tolerance, efficiency and complexity.
%G English
%Z TC 12
%2 https://inria.hal.science/hal-01524978/document
%2 https://inria.hal.science/hal-01524978/file/978-3-642-32891-6_24_Chapter.pdf
%L hal-01524978
%U https://inria.hal.science/hal-01524978
%~ IFIP
%~ IFIP-AICT
%~ IFIP-TC
%~ IFIP-TC12
%~ IFIP-IIP
%~ IFIP-AICT-385