On-the-fly recommendation retrieval from linked open data repositories

Abstract

Some recommender systems (RS) utilize Linked Open Data (LOD) to enhance the item descriptions in the local database. However, these systems do not yet take full advantage of the potential of RDF data for personalized retrieval. The work describes the strengths of LOD repositories as well as the challenges of RDF processing for recommendation tasks. Against the background of these characteristics, a recommendation engine, called SKOSRecommender (SKOSRec), was developed. The system utilizes SKOS annotations to determine similar items and provides a graph-based query language for on-the-fly retrieval from SPARQL endpoints. This enables novel retrieval approaches. For instance, the SKOSRec language facilitates the representation of individual user preferences as query-based statements. Hence, it is possible to generate a user profile with the help of a SPARQL-like request (preference querying). Additionally, the language enables subquerying with recommendation results and the usage of graph-based query patterns to formulate powerful filter conditions for result lists (expressive constraint-based queries). Besides, the language allows flexible combinations of graph- and search-based query patterns (i.e., advanced recommendation requests). Examples of such requests are rollup retrieval patterns or cross-domain queries. The novel approaches were evaluated in a series of offline and online experiments in different domains (travel RS, multimedia RS and scientific publication retrieval). The results show that most of the developed methods improve the quality of existing recommendation methods. Effects predominantly occurred in the performance dimensions of recall, novelty, and diversity. The positive evaluation results demonstrate the effectiveness of the new methods. Thus, the work can contribute to the advancement of personalized search techniques, which can be applied for semantic retrieval in LOD repositories as well as for typical recommendation tasks.