University of Cambridge > > Computer Laboratory Systems Research Group Seminar > Linked Data infrastructures for HE

Linked Data infrastructures for HE

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Eiko Yoneki.

Linked Data provide a pragmatic approach to an evolution towards Semantic Web vision; the first priority here is the publication of open linked data, which, in turn, can lead to the development of more intelligent applications based on the use of meta-data and ontologies. This seminar will start by discussing the value of linked data in the UK Higher Education (HE) sector and by presenting a roadmap of semantic technology adoption, which was developed as part of recent project activities. It will subsequently discuss the motivation and the challenges to deploying a HE Linked Data Infrastructure and present relevant work on linked data repository deployment in HE institutions and on supporting distributed queries across such repositories. The Web Science perspective on studying the impact of such infrastructures in HE will also be discussed.

Short Bio

Dr Thanassis Tiropanis is a lecturer with the Web and Internet Science Group at the University of Southampton, Electronics and Computer Science. His work focuses on linked data and semantic technologies for higher education, virtual communities and social networks. His interests also include technologies and infrastructures for communication, collaboration, and learning and he is involved in a number of Web Science and Internet Science research activities. Thanassis has a PhD in computer science from the University of London (UCL). He is a senior member of the IEEE , a member of the British Computer Society, and a fellow of the Higher Education Academy.

This talk is part of the Computer Laboratory Systems Research Group Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity