We are partnering with the LDAC workshop series to exchange knowledge regarding new technologies and innovations in the fields of Linked Data and Semantic Web. This workshop series provides a focused overview on technical and applied research on the usage of semantic web, linked data and web of data technologies for architecture and construction (design, engineering, construction, operation, etc.). The workshop aims at gathering researchers, industry stakeholders, and standardization bodies of the broader Linked Building Data (LBD) community. The aim of the workshop is to present current developments, coordinate efforts, gather stakeholders, and elaborate use cases. The DBpedia Community Meeting is part of the workshop and will be held on 19th of June.
Quick Facts
- Web URL: https://www.dbpedia.org/events/ldac-2020
- Hashtag: #DBpediaDay #DBpediaWorkshop
- When: June 19, 2020
- Where: The LDAC workshop will take place fully online this year, hosted from within TCDublin.
- Registration: register for the DBpedia session via this link.
- Slack channel: there is LDAC2020 Slack workspace and #dbpedia Slack channel (https://ldac2020.slack.com/archives/C0151701YJJ). If you need to be invited to the LDAC2020 workspace please write to Milan Dojchinovski (dojcinovski.milan@gmail.com)
- Video conference: via Zoom – register to recieve meeting id and password
Highlights
- Keynote {RDF} Data quality assessment – connecting the pieces by Dimitris Kontokostas, diffbot (US)
- Overview of the new DBpedia Architecture
- The New DBpedia Release Cycle
- Geospatial Data & DBpedia Session
- Data Quality & DBpedia Session
Registration / Tickets
Register here: https://us02web.zoom.us/meeting/register/tZwvcO2hrTguGdxsByifIgUaP7q77xcizjLI
Attending the DBpedia Session is free. Registration is required though.
Upon registration you will receive info on:
- how to connect via zoom (meeting ID and password)
- invitation to the LDAC2020 Slack workspace and the #dbpedia Slack channel
Program
- Did you consider this information as helpful?
- Yep!Not quite ...