Using Rules to find Serendipitous Connections            Diana Bental, Rob Stewart & Jamie Forth                           ...
The Semantic WebTerminology         Using Rules to find Serendipitous Connections   Diana Bental, Rob Stewart & Jamie Forth...
SerenARule-based systems    Rules:          Used to store and manipulate knowledge.          Interpret information in usef...
Reasoning with RDF      Using Rules to find Serendipitous Connections   Diana Bental, Rob Stewart & Jamie Forth   4 / 11
Example of simple connectionData from the user model    @prefix : <http://www.serena.ac.uk/ontologies/serena#> .    @prefi...
Example of simple connectionRule 1    If someone intends to attend an event that is held in a place, then    that person i...
Example of simple connectionRule 2    People are (usually) based where the institution they work for is    based          ...
Example of simple connectionRule 3    Identify a potentially interesting person to meet           Person(?x) ∧ hasGoalToVi...
Model with inferred RDF   @prefix   : <http://www.serena.ac.uk/ontologies/serena#> .   @prefix   dblp: <http://dblp.l3s.de...
How would we like to connect?      Which data?      What kinds of rules?      How to discover the valuable information?   ...
SerenA ProjectThanks for coming!         Stuff we didn’t have time for                 Embedding RDFa                 http:...
Upcoming SlideShare
Loading in …5
×

Using rules To Find Serendipitous Connections in Linked Open Data

600 views

Published on

Introducing SWRL rules in the semantic web as a way to make serendipitous inference on linked open data.

Published in: Technology, Education
0 Comments
2 Likes
Statistics
Notes
  • Be the first to comment

No Downloads
Views
Total views
600
On SlideShare
0
From Embeds
0
Number of Embeds
1
Actions
Shares
0
Downloads
5
Comments
0
Likes
2
Embeds 0
No embeds

No notes for slide

Using rules To Find Serendipitous Connections in Linked Open Data

  1. 1. Using Rules to find Serendipitous Connections Diana Bental, Rob Stewart & Jamie Forth SerenA team 27th June, 2012Using Rules to find Serendipitous Connections Diana Bental, Rob Stewart & Jamie Forth 1 / 11
  2. 2. The Semantic WebTerminology Using Rules to find Serendipitous Connections Diana Bental, Rob Stewart & Jamie Forth 2 / 11
  3. 3. SerenARule-based systems Rules: Used to store and manipulate knowledge. Interpret information in useful ways. Have a history of use in artificial intelligence applications and research. We can use rules to identify or create new connections between different things Using Rules to find Serendipitous Connections Diana Bental, Rob Stewart & Jamie Forth 3 / 11
  4. 4. Reasoning with RDF Using Rules to find Serendipitous Connections Diana Bental, Rob Stewart & Jamie Forth 4 / 11
  5. 5. Example of simple connectionData from the user model @prefix : <http://www.serena.ac.uk/ontologies/serena#> . @prefix dblp: <http://dblp.l3s.de/d2r/page/authors/> . @prefix dblpconf: <http://dblp.l3s.de/d2r/page/conferences/> . :Diana a :SerenAUser ; :hasBDLPIdentifier dblp:Diana_Bental ; :hasInstitution :HeriotWatt ; :hasInterest :UserModeling , :SemanticWeb , :Explanation , :Prolog . :hasGoalToAttend dblpconf:SemanticWebConference , dblpconf:sipi2012 ; :hasGoalToFIndOut :MedicalInformatics ; Using Rules to find Serendipitous Connections Diana Bental, Rob Stewart & Jamie Forth 5 / 11
  6. 6. Example of simple connectionRule 1 If someone intends to attend an event that is held in a place, then that person intends to visit the place. Person(?x) ∧ hasGoalToAttend(?x ?event) ∧ hasLocation(?event ?place) (1) → hasGoalToVist(?x ?place) . . . so Diana intends to visit Aberdeen Using Rules to find Serendipitous Connections Diana Bental, Rob Stewart & Jamie Forth 6 / 11
  7. 7. Example of simple connectionRule 2 People are (usually) based where the institution they work for is based Person(?x) ∧ hasInsitution(?x ?inst) ∧ hasLocation(?inst ?place) (2) → hasBaseLocation(?x ?place) . . . so Diana is based in Edinburgh; Derek, Graeme and Judith are based in Aberdeen Using Rules to find Serendipitous Connections Diana Bental, Rob Stewart & Jamie Forth 7 / 11
  8. 8. Example of simple connectionRule 3 Identify a potentially interesting person to meet Person(?x) ∧ hasGoalToVisit(?x ?place) ∧ hasGoalToFindOut(?x ?topic) ∧ Person(?y ) ∧ hasExpertise(?x ?topic) (3) ∧ hasBaseLocation(?y ?place) → hasGoalToMeet(?x ?y ) . . . so Diana now has a (potential) goal to meet Derek. Using Rules to find Serendipitous Connections Diana Bental, Rob Stewart & Jamie Forth 8 / 11
  9. 9. Model with inferred RDF @prefix : <http://www.serena.ac.uk/ontologies/serena#> . @prefix dblp: <http://dblp.l3s.de/d2r/page/authors/> . @prefix dblpconf: <http://dblp.l3s.de/d2r/page/conferences/> . @prefix dbpedia: <http:debedia.org/resource> . :Diana a :SerenAUser ; :hasBDLPIdentifier dblp:Diana_Bental ; :hasInstitution dbpedia:HeriotWatt ; :hasBaseLocation dbpedia:Edinburgh ; :hasInterest :UserModeling , :SemanticWeb , :Explanation , :Prolog . :hasGoalToAttend dbplconf:SemanticWebConference , dblpconf:SIPI2012 ; :hasGoalToFIndOut :MedicalInformatics ; :hasGoalToVisit dbpedia:Boston , dbpedia:Aberdeen ; :hasGoalToMeet :Derek ; Using Rules to find Serendipitous Connections Diana Bental, Rob Stewart & Jamie Forth 9 / 11
  10. 10. How would we like to connect? Which data? What kinds of rules? How to discover the valuable information? Using Rules to find Serendipitous Connections Diana Bental, Rob Stewart & Jamie Forth 10 / 11
  11. 11. SerenA ProjectThanks for coming! Stuff we didn’t have time for Embedding RDFa http://goo.gl/Wor8I http://chasingserendipity-estw.eventbrite.com Semantic annotation of plain text http://dbpedia-spotlight.github.com/demo/ Our website and newsletter http://www.serena.ac.uk Twitter @i_serena @robstewartUK Using Rules to find Serendipitous Connections Diana Bental, Rob Stewart & Jamie Forth 11 / 11

×