ConSTR: A Contextual Search Term Recommender
In this demo paper, we present ConSTR, a novel Contextual Search Term Recommender that utilises the user's interaction context for search term recommendation and literature retrieval. ConSTR integrates a two-layered recommendation interface: the first layer suggests terms with respect to a user's current search term, and the second layer suggests terms based on the users' previous search activities (interaction context). For the demonstration, ConSTR is built on the arXiv, an academic repository consisting of 1.8 million documents.
Code (0)
등록된 구현이 없습니다.
Tasks
RetrievalSimilar Papers 제목 키워드 기반
Combining Privileged Information to Improve Context-Aware Recommender Systems
A recommender system is an information filtering technology which can be used to predict preference ratings of items (products, services, movies, etc) and/or to output a ranking of items that are likely to be of interest…
ClusteringRecommendation SystemsContextual Document Similarity for Content-based Literature Recommender Systems
To cope with the ever-growing information overload, an increasing number of digital libraries employ content-based recommender systems. These systems traditionally recommend related documents with the help of similarity …
Recommendation SystemsInterpreting Contextual Effects By Contextual Modeling In Recommender Systems
Recommender systems have been widely applied to assist user's decision making by providing a list of personalized item recommendations. Context-aware recommender systems (CARS) additionally take context information into …
Decision MakingRecommendation SystemsTight Regret Bounds for Infinite-armed Linear Contextual Bandits
Linear contextual bandit is an important class of sequential decision making problems with a wide range of applications to recommender systems, online advertising, healthcare, and many other machine learning related task…
Decision MakingMulti-Armed BanditsRecommendation SystemsSequential Decision MakingConversational Contextual Bandit: Algorithm and Application
Contextual bandit algorithms provide principled online learning solutions to balance the exploitation-exploration trade-off in various applications such as recommender systems. However, the learning speed of the traditio…
ArticlesNews RecommendationRecommendation Systems