Trust

1
SEMDIS
On Homeland Security and the Semantic Weba
Provenance and Trust Aware Inference Framework
Semantic Association Discovery and Evaluation
Architecture
Motivation
1
2

• Semantic association between Mr. X and Bin Laden
• Provenance
• Multiple sources may contribute unique fragments
  of association
• Multiple sources may confirm a fragment in
  different belief states
• Rank
• Only a few of the discovered associations are
  interesting
• Trust
• Some information sources are not sufficiently
  trustworthy

• Collaborative implementation
• University of Georgia
• Extracting knowledge from the Web
• Discovering complex semantic association
• Ranking semantic association by content
• UMBC
• Tracking provenance of semantic association
• Trusting semantic association by context
• Enabling best-first search using trust heuristics

Trust
Provenance
3
4
Trustworthiness of an RDF graph The hypothesis
Mr X is associated with Bin Laden is proved by
a four-triple semantic association (SA), how to
evaluate SAs trustworthiness. S1 egMrX
egisPresidentOf egcompanyA S2
egorganizationB eginvests egcompanyA S3
egorganizationB egisOwnedBy egMrY S4 egMrY
egrelatesTo egBinLaden Trust relation between
agents helps propagate belief states case1
(belief concatenation) exact one source per
triple case2 belief aggregation multiple
sources for a triple case3 social
dependency sources are dependent through social
network We assume all triples are
semantically independent

• Provenance of an RDF graph or sub-graph
• Three sources of a RDF graph, G
• where-provenance the web documents that
  serialize G
• whom-provenance the person who
  created/published G
• why-provenance the RDF graphs which logically
  imply G

• RDF graph provenance service
• Observations
• provenance information is part of context
  information
• provenance is not required for most inference
  tasks
• provenance is useful for context based trust
  analysis
• provenance can be used to group knowledge
• Approach
• provide a stand alone service that queries
  provenance of a given RDF graph or sub-graph

Contact Li Ding, dingli1_at_cs.umbc.edu. Authors Li
Ding, Pranam Kolari, Tim Finin, Anupam Joshi, Yun
Peng, and Yelena Yesha. This work is partially
supported by DARPA contract F30602-00-0591 and
NSF awards ITR-IIS-0325464 and ITR-IIS-0325172
http//ebiquity.umbc.edu/