vidi webinar for developers
DESCRIPTION
Slides for Vidi webinar held on 12th December at 2pm GMT. Introduce developers to the LinkedUp Vidi competition.TRANSCRIPT
LinkedUp – Linking Web Data for Educa7on Project
Marieke Guy Open Knowledge
Founda7on
Mathieu D’Aquin Alessandro Adamou Stefan Dietze Eelco Herder L3S Research Center
Leibniz Universität Hannover
Open University, UK
Adobe Connect
§ Today we are using Adobe Connect § Use the Audio Setup Wizard if you have sound problems
§ Note that the introductory talk will be recorded and shared later
Adobe Connect
§ If you have a problem use the chat facility
§ You can also pass on feedback using the status op7ons
Adobe Connect
§ If you have a ques7on then you can add it to the chat and we will note it
§ Or you can wait 7ll the end when we will address ques7ons in the Q&A
§ At this point you can raise your hand and will be asked to ask your ques7on
LinkedUp Project Website
h6p://linkedup-‐project.eu
LinkedUp Challenge
• Three consecu7ve compe77ons
• Develop interes@ng and innova@ve tools and applica@ons that analyse and/or integrate open web data for educa@onal purposes
• You can enter just one compe@@on or enter them all
• Par7cipants of the earlier compe77ons will benefit from support and feedback from the LinkedUp team
LinkedUp Challenge Dates
• First compe77on: Veni (March 2013 -‐ September 2013 -‐ has now taken place): Demo prototypes and applica7ons
• Second compe77on: Vidi (November 2013 -‐ May 2014): Innova7ve tools and applica7ons
• Third compe77on: Vici (May 2014 -‐ November 2014): Mature data-‐driven applica7ons
10 December 2013 8
Veni
Veni Compe@@on
Final ceremony at OKCon, Geneva, 17 September 2013
Stefan Dietze
§ 22 submissions, shortlist of 8, from which:
§ 3 winners § People's Choice Award
Vidi
Vidi Compe@@on
• Submission deadline: 14 February 2014 • No7fica7ons and nomina7ons: 28 March 2014 • Presenta7ons and award ceremony at ESWC 2014 (25-‐29
May 2014)
The Vidi compe77on comprises of three tracks: • One open track for development of any prototype for
educa7onal purposes; similar to the Veni compe77on.
• Two focused tracks for development of prototypes that answer specific 'problems’.
Vidi Compe@@on: Prizes
• Open track: €3000 (1st), €2000 (2nd), €1000 (3rd) • Each focused track: €3000 (1st prize) • People's Choice: €1000 Prizes will be awarded at the European Seman@c Web Conference in Crete, Greece, 25th -‐ 29th May 2014.
Focused track 1: Simplificator
The tool should:
§ make complex, domain-‐specific texts easier to understand to novice/non-‐expert people by elabora7ng a simple summary
§ analyse and summarise complex abstracts and research in simpler terms -‐ eventually a ‘hierarchy of simplicity’ to create ‘versions’ for different ages and abili7es (via a simple and intui7ve textual/graphical representa7on, i.e. knowledge map)
§ link difficult words to wik7onary or wikipedia
Focused track 2: Pathfinder
The tool should:
§ ease access to recommenda7ons and guidance when chosing appropriate curriculum of courses and related resources
§ use mul7ple sources to suggest classes or resources (for example, recommend one course from Coursera, one from another MOOC, and readings from reading list)
§ match learning needs and contexts to opportuni7es from mul7ple, heterogeneous sources
Data! http://data.linkededucation.org/linkedup/catalog/
What data do you need? How to connect to data?
How to connect data?
General resources – and guides http://data.linkededucation.org/linkedup/devtalk/
Simple code snippets, how-tos and example, on linked data, sparql, visualisation, techniques, etc. What would you want to see there?
Need pointers? Have ques@ons?
http://data.linkededucation.org/linkedup/catalog/support/
Want to know more about what to do in the focused tracks? Want to know more about available data or how to make some data available? Need some pointers to specific techniques, or just some discussions about the way you could develop your application? Have a broken SPARQL query, RDF that does not seem right, code that goes wrong? Ask now, or get in touch! We don’t have all the answers, but we will take the time to help you find them!
…and time for questions!