LOD-RecSys 2015 - 2nd Linked Open Data-enabled Recommender Systems Challenge
Topics/Call fo Papers
People generally need more and more advanced tools that go beyond those implementing the canonical search paradigm for seeking relevant information. A new search paradigm is emerging, where the user perspective is completely reversed: from finding to being found.
Recommender systems may help to support this new perspective, since they have the effect of pushing relevant objects, selected from a large space of possible options, to potentially interested users. To achieve this result, recommendation techniques generally rely on data referring to three kinds of entities: users, items and their relations.
Recent developments in the Semantic Web community offer novel strategies to represent data about users, items and their relations that might improve the current state of the art of recommender systems, in order to move towards a new generation of recommender systems which fully understand the items they deal with.
More and more semantic data are published following the Linked Data principles, which enable to set up links between entities in different data sources, by connecting information in a single global data space: the Web of Data.
Today, the Web of Data includes different types of knowledge represented in a homogeneous form: a sedimentary one (encyclopedic, cultural, linguistic, and common-sense) and a real-time one (news, data streams, etc.). These data might be useful to interlink diverse information about users, items, and their relations, and implement reasoning mechanisms that can support and improve the recommendation process.
The primary goal of this challenge is twofold. On the one hand, we want to enforce the link between the Semantic Web and the Recommender Systems communities. On the other hand, we aim to showcase how Linked Open Data and semantic technologies can boost the creation of a new breed of knowledge-enabled and content-based recommender systems.
Target Audience
The target audience is the above communities, both academic and industrial, which are interested in personalized information access with a particular emphasis on Linked Open Data.
During the last ACM RecSys conference the vast majority of participants were from industry. This is for sure a witness of the actual interest of recommender systems for industrial applications ready to be released in the market.
Dataset
We collected data from Facebook profiles about personal preferences (“likes”) for items in three domains: movies, books and music. After a process of user anonymization, we reconciled the item data with DBpedia entities. This data will be made available to train proposed recommendation approaches. In order to emphasize the usefulness of content-based data, only “cold users” will be available in the dataset.
Tasks
Task 1: Top-N recommendations from unary user feedback
This task deals with the top-N recommendation problem, in which a system is requested to find and recommend a limited set of N items that best match a user profile, instead of correctly predict the ratings for all available items.
In order to favor the proposal of content-based, LOD-enabled recommendation approaches, and limit the use of collaborative filtering approaches, this task aims at generating ranked lists of items for which only unary feedback (LIKE) is provided.
For this task, we will concentrate only on the movie domain.
Task 2: Diversity within recommended item sets
A very interesting aspect of content-based recommender systems and then of LOD-enabled ones is giving the possibility to evaluate the diversity of recommended items in a straight way. This is a very popular topic in content-based recommender systems, which usually suffer from over-specialization.
In this task, the evaluation will be made by considering a combination of both accuracy of the recommendation list, and the diversity of items belonging to it.
Focusing on recommending musical artists, we will consider diversity with respect to the and properties.
Task 3: Cross-domain recommendation
This task aims to address a cross-domain recommendation scenario in which user preferences and/or domain knowledge of a source domain are used to recommend items in a different target domain.
This may correspond with the following use cases. The first refers to the well known cold-start problem, which hinders the recommendation generation due to the lack of sufficient information about users or items. In a cross-domain setting, a recommender may draw on information acquired from other domains to alleviate such problem, e.g., a user’s favorite movie genres may be derived from her favorite book genres. The second refers to the generation of personalized cross-selling or bundle recommendations for items from multiple domains, e.g., a movie accompanied by a music album similar to the soundtrack of the movie. These relations may not be extracted from rating correlations within a joined movie-music rating matrix.
In this task, we will request participants to exploit user preferences and domain knowledge about movies, in order to provide book recommendations.
Making this task highly challenging, we will provide the list of books available in the test set, but we will provide little information about the users’ book preferences. Thus, we encourage not (only) to use collaborative filtering strategies based on correlations between movie and book preferences, but to investigate approaches that exploit LOD relating both movies and books domains.
Recommender systems may help to support this new perspective, since they have the effect of pushing relevant objects, selected from a large space of possible options, to potentially interested users. To achieve this result, recommendation techniques generally rely on data referring to three kinds of entities: users, items and their relations.
Recent developments in the Semantic Web community offer novel strategies to represent data about users, items and their relations that might improve the current state of the art of recommender systems, in order to move towards a new generation of recommender systems which fully understand the items they deal with.
More and more semantic data are published following the Linked Data principles, which enable to set up links between entities in different data sources, by connecting information in a single global data space: the Web of Data.
Today, the Web of Data includes different types of knowledge represented in a homogeneous form: a sedimentary one (encyclopedic, cultural, linguistic, and common-sense) and a real-time one (news, data streams, etc.). These data might be useful to interlink diverse information about users, items, and their relations, and implement reasoning mechanisms that can support and improve the recommendation process.
The primary goal of this challenge is twofold. On the one hand, we want to enforce the link between the Semantic Web and the Recommender Systems communities. On the other hand, we aim to showcase how Linked Open Data and semantic technologies can boost the creation of a new breed of knowledge-enabled and content-based recommender systems.
Target Audience
The target audience is the above communities, both academic and industrial, which are interested in personalized information access with a particular emphasis on Linked Open Data.
During the last ACM RecSys conference the vast majority of participants were from industry. This is for sure a witness of the actual interest of recommender systems for industrial applications ready to be released in the market.
Dataset
We collected data from Facebook profiles about personal preferences (“likes”) for items in three domains: movies, books and music. After a process of user anonymization, we reconciled the item data with DBpedia entities. This data will be made available to train proposed recommendation approaches. In order to emphasize the usefulness of content-based data, only “cold users” will be available in the dataset.
Tasks
Task 1: Top-N recommendations from unary user feedback
This task deals with the top-N recommendation problem, in which a system is requested to find and recommend a limited set of N items that best match a user profile, instead of correctly predict the ratings for all available items.
In order to favor the proposal of content-based, LOD-enabled recommendation approaches, and limit the use of collaborative filtering approaches, this task aims at generating ranked lists of items for which only unary feedback (LIKE) is provided.
For this task, we will concentrate only on the movie domain.
Task 2: Diversity within recommended item sets
A very interesting aspect of content-based recommender systems and then of LOD-enabled ones is giving the possibility to evaluate the diversity of recommended items in a straight way. This is a very popular topic in content-based recommender systems, which usually suffer from over-specialization.
In this task, the evaluation will be made by considering a combination of both accuracy of the recommendation list, and the diversity of items belonging to it.
Focusing on recommending musical artists, we will consider diversity with respect to the and properties.
Task 3: Cross-domain recommendation
This task aims to address a cross-domain recommendation scenario in which user preferences and/or domain knowledge of a source domain are used to recommend items in a different target domain.
This may correspond with the following use cases. The first refers to the well known cold-start problem, which hinders the recommendation generation due to the lack of sufficient information about users or items. In a cross-domain setting, a recommender may draw on information acquired from other domains to alleviate such problem, e.g., a user’s favorite movie genres may be derived from her favorite book genres. The second refers to the generation of personalized cross-selling or bundle recommendations for items from multiple domains, e.g., a movie accompanied by a music album similar to the soundtrack of the movie. These relations may not be extracted from rating correlations within a joined movie-music rating matrix.
In this task, we will request participants to exploit user preferences and domain knowledge about movies, in order to provide book recommendations.
Making this task highly challenging, we will provide the list of books available in the test set, but we will provide little information about the users’ book preferences. Thus, we encourage not (only) to use collaborative filtering strategies based on correlations between movie and book preferences, but to investigate approaches that exploit LOD relating both movies and books domains.
Other CFPs
- 1st International Conference on e-Learning and e-Technologies in Music Education
- Eleventh International Conference on Intelligent Information Hiding and Multimedia Signal Processing
- 2nd International Digital Libraries for Musicology workshop
- 2015 Texas Desalination Association Annual Conference
- 16th Towards Autonomous Robotic Systems
Last modified: 2015-03-14 13:09:13