Established information retrieval approaches address the relevance of search results to an information need, whereas the actual learning scope of a user is usually disregarded. Recent research in the search as learning area has recognized the importance of learning scopes and focused on observing and detecting learning needs. However, it has often been restricted to limited and isolated feature sets or specific learning tasks. High-dimensional feature spaces, (audio)visual information, or the generalizability of previous work to support various learning needs by retrieval, ranking, and recommendations have not been investigated yet.
The interdisciplinary project SALIENT – joining expertise from computer science and psychology – aims at closing this gap by researching methods to improve retrieval performance and individuals’ learning through (a) an accurate detection and prediction of learning needs and knowledge gains during search by means of query logs, behavioral traces, navigation logs, eye-tracking and thinking-aloud data, which serve as a basis for (b) supporting users in their learning tasks through an enhanced retrieval and ranking process and recommendations, as well as for (c) suggesting appropriate and personalized recommendations including multimodal information (diagrams, slides, videos, etc.). Next to providing contributions to information retrieval and Web search, the project goes beyond previous work by also addressing semi-informal learning scenarios that involve search for scholarly and scientific (multimodal) information, literature, and videos in digital library portals, e.g., as offered by TIB’s main web portal and the TIB AV-Portal for scientific videos. Since different kinds of learning tasks are associated with significantly different user behaviors and preferences, a thorough understanding of learning needs and cognitive and behavioral learning patterns from a psychological perspective is required. Results will be evaluated in a variety of scenarios and will lead to generalizable models and methods.