JiscMail Logo
Email discussion lists for the UK Education and Research communities

Help for AI-SGES Archives


AI-SGES Archives

AI-SGES Archives


AI-SGES@JISCMAIL.AC.UK


View:

Message:

[

First

|

Previous

|

Next

|

Last

]

By Topic:

[

First

|

Previous

|

Next

|

Last

]

By Author:

[

First

|

Previous

|

Next

|

Last

]

Font:

Proportional Font

LISTSERV Archives

LISTSERV Archives

AI-SGES Home

AI-SGES Home

AI-SGES  December 2013

AI-SGES December 2013

Options

Subscribe or Unsubscribe

Subscribe or Unsubscribe

Log In

Log In

Get Password

Get Password

Subject:

ESWC 2014 Call for Challenge: Linked Open Data-enabled Recommender Systems

From:

Silvio Peroni <[log in to unmask]>

Reply-To:

[log in to unmask]

Date:

Tue, 3 Dec 2013 08:20:17 +0000

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (108 lines)

** apologies for cross-posting **

==== Call for Challenge: Linked Open Data-enabled Recommender Systems ====

Challenge Website: http://challenges.2014.eswc-conferences.org/RecSys
Call Web page: http://2014.eswc-conferences.org/important-dates/call-RecSys

MOTIVATION AND OBJECTIVES
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, because 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 objects: 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, that enable to set up links between objects 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: sedimentary one (encyclopedic, cultural, linguistic, common-sense) and real-time one (news, data streams, ...). 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 create a link between the Semantic Web and the Recommender Systems communities. On the other hand, we aim to show 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 all of those 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 more than 60% 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.

TASKS
Task 1: Rating prediction in cold-start situations
This task deals with the rating prediction problem, in which a system is requested to estimate the value of unknown numeric scores (a.k.a. ratings) that a target user would assign to available items, indicating whether she likes or dislikes them.
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 predicting ratings in cold-start situations, that is, predicting ratings for users who have a few past ratings, and predicting ratings of items that have been rated by a few users.
The dataset to use in the task - DBbook - relates to the book domain. It contains explicit numeric ratings assigned by users to books. For each book we provide the corresponding DBpedia URI.
Participants will have to exploit the provided ratings as training sets, and will have to estimate unknown ratings in a non-provided evaluation set.
Recommendation approaches will be evaluated on the evaluation set by means of metrics that measure the differences between real and estimated ratings, namely the Root Mean Square Error (RMSE).

Task 2: Top-N recommendation from binary 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.
Similarly to Task 1, 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 no graded ratings are available, but only binary ones.
Also in this case, the DBbook dataset will be provided.
In this task, the accuracy of recommendation approaches will be evaluated on an evaluation set using the F-measure.

Task 3: Diversity
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. Also for this task, DBbook dataset will be used.
Given the domain of books, diversity with respect to the two properties dbpedia-owl:author and skos:subject will be considered.

EVALUATION DATASET AND EVALUATION METRICS
DBbook dataset
This dataset relies on user data and preferences retrieved from the Web. The books available in the dataset have been mapped to their corresponding DBpedia URIs. The mapping contains 8170 DBpedia URIs.
These mappings can be used to extract semantic features from DBpedia or other LOD repositories to be exploited by the recommendation approaches proposed in the challenge.
The dataset is split in a training set and an evaluation set. In the former, user ratings are provided to train a system while in the latter, ratings have been removed, and they will be used in the eventual evaluation step.

Participants will generate the ratings (Task 1) or the ranking (Task 2 and Task 3) for the test set, and their results will be compared and evaluated with respect to actual users ratings (hidden evaluation data).

The two sets will be provided at the challenge's website, in the following plain text files:
* lodrecsys2014-DBbook-training-ratings.txt: Contains tuples <user, book, rating> that may be used to build the recommendation approaches.
* lodrecsys2014-DBbook-test-ratings.txt: Contains tuples <user, book> that will be used to evaluate the recommendation approaches.

Together with the two previous files, a further one will be provided containing the mapping to DBpedia.
* lodrecsys2014-DBbook-mappings.txt: Contains tuples <book, bookURI> associated with the books in DBbook that will be used to extract and exploit semantic features from DBpedia and other LOD repositories.

Recommendation approaches will be evaluated with the metrics requested in each task. We provide a number of Java classes that compute the different metrics and a Web Service to test intermediate results. A description of the metrics to compute and further details regarding the evaluation will be available at the challenge website.


JUDGING AND PRIZES
After a first round of reviews, the Program Committee and the chairs will select a number of submissions that will have to satisfy the challenge's requirements, and will have to be presented at the conference. Submissions accepted for presentation will receive constructive reviews from the Program Committee, and will be included in post-proceedings. All accepted submissions will have a slot in a poster session dedicated to the challenge. In addition, the winners will present their work in a special slot of the main program of ESWC'14, and will be invited to submit a paper to a dedicated Semantic Web Journal special issue.

For each task we will select:
* the best performing tool, given to the paper which will get the highest score in the evaluation
* the most original approach, selected by the Challenge Program Committee with the reviewing process

HOW TO PARTICIPATE
The following information has to be provided:
* Abstract: no more than 200 words.
* Description: It should contain the details of the system, including why the system is innovative, how it uses Semantic Web, which features or functions the system provides, what design choices were made, and what lessons were learned. The description should also summarize how participants have addressed the evaluation tasks. Papers must be submitted in PDF format, following the style of the Springer's Lecture Notes in Computer Science (LNCS) series (http://www.springer.com/computer/lncs/lncs+authors), and not exceeding 5 pages in length.
* Result evaluation: For the three tasks previously described, a Web-accessible service will be provided in order to evaluate the produced results. All the details about the format and the service URL will be provided on the website.

All submissions should be provided via EasyChair https://www.easychair.org/conferences/?conf=eswc2014-challenges

MAILING LIST

We invite the potential participants to subscribe to our mailing list in order to be kept up to date with the latest news related to the challenge.

https://lists.sti2.org/mailman/listinfo/eswc2014-recsys-challenge


IMPORTANT DATES
* March 7, 2014, 23:59 (Hawaii time): Abstract Submission
* March 14, 2014, 23:59 (Hawaii time): Submission
* April 9, 2014, 23:59 (Hawaii time): Notification of acceptance
* May 27-29, 2014: Challenge days


CHALLENGE CHAIRS
* Tommaso Di Noia (Polytechnic University of Bari, IT)
* Ivan Cantador (Universidad Autonoma de Madrid, ES)

EVALUATION COORDINATOR
* Vito Claudio Ostuni (Polytechnic University of Bari, IT)

PROGRAM COMMITTEE (to be completed)
* Oscar Corcho (Universidad Politecnica de Madrid, ES)
* Marco de Gemmis (University of Bari Aldo Moro, IT)
* Frank Hopfgartner (Technische Universitat Berlin, DE)
* Andreas Hotho (Universitat Wurzburg, DE)
* Dietmar Jannach (TU Dortmund University, DE)
* Pasquale Lops (University of Bari Aldo Moro, IT)
* Valentina Maccatrozzo (Delft University of Technology, NL)
* Francesco Ricci (Free University of Bozen-Bolzano, IT)
* Giovanni Semeraro (University of Bari Aldo Moro, IT)
* David Vallet (NICTA, AU)
* Manolis Wallace (University of Peloponnese, GR)
* Markus Zanker (Alpen-Adria-Universitaet Klagenfurt, AT)


ESWC CHALLENGE COORDINATOR
* Milan Stankovic (Sepage & Universite Paris-Sorbonne, FR)

Top of Message | Previous Page | Permalink

JiscMail Tools


RSS Feeds and Sharing


Advanced Options


Archives

March 2024
February 2024
January 2024
December 2023
November 2023
October 2023
September 2023
August 2023
July 2023
June 2023
May 2023
April 2023
March 2023
February 2023
January 2023
December 2022
November 2022
October 2022
September 2022
August 2022
July 2022
June 2022
May 2022
April 2022
March 2022
February 2022
January 2022
December 2021
November 2021
October 2021
September 2021
August 2021
July 2021
June 2021
May 2021
April 2021
March 2021
February 2021
January 2021
December 2020
November 2020
October 2020
September 2020
August 2020
July 2020
June 2020
May 2020
April 2020
March 2020
February 2020
January 2020
December 2019
November 2019
October 2019
September 2019
August 2019
July 2019
June 2019
May 2019
April 2019
March 2019
February 2019
January 2019
December 2018
November 2018
October 2018
September 2018
August 2018
July 2018
June 2018
May 2018
April 2018
March 2018
February 2018
January 2018
December 2017
November 2017
October 2017
September 2017
August 2017
July 2017
June 2017
May 2017
April 2017
March 2017
February 2017
January 2017
December 2016
November 2016
October 2016
September 2016
August 2016
July 2016
June 2016
May 2016
April 2016
March 2016
February 2016
January 2016
December 2015
November 2015
October 2015
September 2015
August 2015
July 2015
June 2015
May 2015
April 2015
March 2015
February 2015
January 2015
December 2014
November 2014
October 2014
September 2014
August 2014
July 2014
June 2014
May 2014
April 2014
March 2014
February 2014
January 2014
December 2013
November 2013
October 2013
September 2013
August 2013
July 2013
June 2013
May 2013
April 2013
March 2013
February 2013
January 2013
December 2012
November 2012
October 2012
September 2012
August 2012
July 2012
June 2012
May 2012
April 2012
March 2012
February 2012
January 2012
December 2011
November 2011
October 2011
September 2011
August 2011
July 2011
June 2011
May 2011
April 2011
March 2011
February 2011
January 2011
December 2010
November 2010
October 2010
September 2010
August 2010
July 2010
June 2010
May 2010
April 2010
March 2010
February 2010
January 2010
December 2009
November 2009
October 2009
September 2009
August 2009
July 2009
June 2009
May 2009
April 2009
March 2009
February 2009
January 2009
December 2008
November 2008
October 2008
September 2008
August 2008
July 2008
June 2008
May 2008
April 2008
March 2008
February 2008
January 2008
December 2007
November 2007
October 2007
September 2007
August 2007
July 2007
June 2007
May 2007
April 2007
March 2007
February 2007
January 2007
December 2006
November 2006
October 2006
September 2006
August 2006
July 2006
June 2006
May 2006
April 2006
March 2006
February 2006
January 2006
December 2005
November 2005
October 2005
September 2005
August 2005
July 2005
June 2005
May 2005
April 2005
March 2005
February 2005
January 2005
December 2004
November 2004
October 2004
September 2004
August 2004
July 2004
June 2004
May 2004
April 2004
March 2004
February 2004
January 2004
December 2003
November 2003
October 2003
September 2003
August 2003
July 2003
June 2003
May 2003
April 2003
March 2003
February 2003
January 2003
December 2002
November 2002
October 2002
September 2002
August 2002
July 2002
June 2002
May 2002
April 2002
March 2002
February 2002
January 2002
December 2001
November 2001
October 2001
September 2001
August 2001
July 2001
June 2001
May 2001
April 2001
March 2001
February 2001
January 2001
December 2000
November 2000
October 2000
September 2000
August 2000
July 2000
June 2000
May 2000
April 2000
March 2000
February 2000
January 2000
December 1999
November 1999
October 1999
September 1999
August 1999
July 1999
June 1999
May 1999
April 1999
March 1999
February 1999
January 1999
December 1998
November 1998
October 1998
September 1998


JiscMail is a Jisc service.

View our service policies at https://www.jiscmail.ac.uk/policyandsecurity/ and Jisc's privacy policy at https://www.jisc.ac.uk/website/privacy-notice

For help and support help@jisc.ac.uk

Secured by F-Secure Anti-Virus CataList Email List Search Powered by the LISTSERV Email List Manager