[open-government] Linked Data Cup - Deadline Extension until April 25th, 2012

Tue Apr 17 13:53:20 UTC 2012

**Apologies for cross-posting**

Please find information on the Linked Data Cup below, which may be of
interest to some of you. The deadline has been extended to the 25th April.

---------- Forwarded message ----------
From: Sebastian Hellmann <hellmann at informatik.uni-leipzig.de>
Date: Fri, Apr 13, 2012 at 6:25 PM
Subject: [open-linguistics] Linked Data Cup - Deadline Extension until
April 25th, 2012
To: IC2012 <i-challenge2012 at easychair.org>

(apologies for multiple posts; please forward; please email
i-challenge2012_a_t_easychair.**org<http://i-challenge2012_a_t_easychair.org>for
questions)
********************
NEWS:
- Deadline extension until April 25th, 2012
- The total amount of 2,000 EUR (sponsored by Wolters Kluwer) will be
awarded in prizes and split among the most promising applications.
- Linked Data Cup Board updated: http://i-challenge.blogs.aksw.**
org/chairs-committee <http://i-challenge.blogs.aksw.org/chairs-committee>
********************
Linked Data Cup 2012
http://i-challenge.blogs.aksw.**org/ <http://i-challenge.blogs.aksw.org/>
co-located with the I-Semantics 2012
Graz, Austria, 5 - 7 September 2012
http://www.i-semantics.at
********************
The yearly organised Linked Data Cup (formerly Triplification Challenge)
awards prizes to the most promising innovation involving linked data. Four
different technological topics are addressed: triplification, interlinking,
cleansing, and application mash-ups. The Linked Data Cup invites scientists
and practitioners to submit novel and innovative (5 star) linked data sets
and applications built on linked data technology.
Although more and more data is triplified and published as RDF and linked
data, the question arises how to evaluate the usefulness of such
approaches. The Linked Data Cup therefore requires all submissions to
include a concrete use case and problem statement alongside a solution
(triplified data set, interlinking/cleansing approach, linked data
application) that showcases the usefulness of linked data. Submissions that
can provide measurable benefits of employing linked data over traditional
methods are preferred.
Note that the call is not limited to any domain or target group. We accept
submissions ranging from value-added business intelligence use cases to
scientific networks to the longest tail [1] of information domains. The
only strict requirement is that the employment of linked data is very well
motivated and also justified (i.e. we rank approaches higher that provide
solutions, which could not have been realised without linked data, even if
they lack technical or scientific brilliance). The total amount of 2,000
EUR (sponsored by Wolters Kluwer) will be awarded in prizes and split among
the most promising applications.

Evaluation Criteria
===================
The submissions will be initially evaluated with a well-known five star
ranking system [2]. Furthermore, entries will be assessed according to the
extent to which they
1. motivate the relevancy of their use case for their respective domain;
2. justify the adequacy of linked data technologies for their solution;
3. demonstrate that all alternatives to linked data would have resulted in
an inferior solution;
4. provide an evaluation that can measure the benefits of linked data

Topics
======
Ideas for topics include (but are not limited to):
* Improving traditional approaches with help of linked data
* Linked data use in science and education
* Linked data supported multimedia applications
* Linked data in the open source context
* Web annotation
* Generic applications
* Internationalization of linked data
* Visualization of linked data
* Linked government data
* Business models based on linked data
* Recommender systems supported by linked data
* Integrating microposts with linked data
* Distributed social web based on linked data
* Linked data sensor networks

Submission and Reviewing
========================
Submissions to the Linked Data Cup will be reviewed by members of the
Linked Data Cup Board and invited experts from the Linked Data community.
Submissions should consist of 4 pages and must be original and must not
have been submitted for publication elsewhere. Papers should follow the ACM
ICPS guidelines for formatting as accepted submissions will be published in
the I-SEMANTICS 2012 proceedings in the digital library of the ACM ICP
series. Please read the submission page[a] for detailed information on how
to submit.
Important Dates (Linked Data Cup)
1. Paper Submission Deadline: April 25, 2012
2. Notification of Acceptance: May 21, 2012
3. Camera-Ready Paper: June 11, 2012

Links
=====
[1] http://static.slidesharecdn.**com/swf/ssplayer2.swf?doc=**
uleiauersemmedmainz20110714-**110715042111-phpapp01&rel=0&**
startSlide=5&stripped_title=**the-semantic-data-web-sren-**
auer-university-of-leipzig&**userName=lod2project<http://static.slidesharecdn.com/swf/ssplayer2.swf?doc=uleiauersemmedmainz20110714-110715042111-phpapp01&rel=0&startSlide=5&stripped_title=the-semantic-data-web-sren-auer-university-of-leipzig&userName=lod2project>
[2] http://www.w3.org/**DesignIssues/LinkedData.html<http://www.w3.org/DesignIssues/LinkedData.html>

-- 
Dipl. Inf. Sebastian Hellmann
Department of Computer Science, University of Leipzig
Projects: http://nlp2rdf.org , http://dbpedia.org
Homepage: http://bis.informatik.uni-**leipzig.de/SebastianHellmann<http://bis.informatik.uni-leipzig.de/SebastianHellmann>
Research Group: http://aksw.org

______________________________**_________________
open-linguistics mailing list
open-linguistics at lists.okfn.**org <open-linguistics at lists.okfn.org>
http://lists.okfn.org/mailman/**listinfo/open-linguistics<http://lists.okfn.org/mailman/listinfo/open-linguistics>

-- 
Laura Newman
Community Coordinator
Open Knowledge Foundation
http://okfn.org/
Skype: lauranewmanonskype
Twitter: @Newmanlk
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.okfn.org/pipermail/open-government/attachments/20120417/d090a577/attachment.html>