SlideShare a Scribd company logo
1 of 30
Download to read offline
Propagation of Policies in Rich Data Flows
1
Enrico Daga†	
  Mathieu d’Aquin†	
  Aldo Gangemi‡	
  Enrico Motta†	
  	
  
†	
  Knowledge	
  Media	
  Ins2tute,	
  The	
  Open	
  University	
  (UK)	
  
‡	
  Université	
  Paris13	
  (France)	
  and	
  ISTC-­‐CNR	
  (Italy)	
  
The	
  8th	
  Interna2onal	
  Conference	
  on	
  Knowledge	
  Capture	
  (K-­‐CAP	
  2015)	
  
October	
  10th,	
  2015	
  -­‐	
  Palisades,	
  NY	
  (USA)	
  
hRp://www.k-­‐cap2015.org/
Feedback	
  welcome:	
  @enridaga	
  #kmiou
Motivation
• Governing the life cycle of data on the web is a
challenging issue for organisations and users.
• Assessing what policies on input data propagate to
the output of a process is a crucial problem.
2
Policies
3
Foundations
Constraints and permissions set by the data owner regarding the reuse of
the data, ie. mostly licences.
We can describe licences/policies (RDF+ODRL).
RDF License Database
http://datahub.io/dataset/rdflicense
Describes ~140 licenses using RDF
and the Open Digital Rights Language
(ODRL).
Reports 113 policies.
lic:cc-by-nc4.0 a odrl:Policy ;
rdfs:label "CC-BY-NC" ;
odrl:permission [
odrl:action cc:Distribution,
ldr:extraction , ldr:reutilization ,
cc:DerivativeWorks , cc:Reproduction ;
odrl:duty [ odrl:action
cc:Attribution , cc:Notice ] ] ;
odrl:prohibition [ odrl:action
cc:CommercialUse ]
Objective
We need to understand how these policies propagate in
data flows!
4
Data flows
5
Foundations
What are the semantic relations
between input and output?
Data flows can be thought as graphs of data objects.
Datanode is an ontology for data centric description of applications.
Built as hierarchy of relations.
More then 100 relations so far.
http://purl.org/datanode/ns/
http://purl.org/datanode/docs/
Policy Propagation Rule (PPR)
6
Relying on Datanode for an enumeration of the possible relations and
on the RDF License Database for the possible policies, we can setup
rules like the following:
A Horn clauses of the form:
propagates(odrl:duty cc:Attribution, dn:isCopyOf)
For example:
It can be simplified as:
Foundations
Problem
A description of policies and data flows implies a huge number of
Policy Propagation Rules to be specified and computed (number
of possible policies times number of possible relations between data
objects).
How to abstract this KB to make the management and
reasoning on policy propagation rules easier?
7
Contributions
(1) A methodology to obtain an abstraction that allows to reduce the
number of rules significantly (using an Ontology).
(2) Evaluate how effective this methodology is when using the
Datanode ontology.
(3) Demonstrate how this ontology can evolve in order to better
represent the behaviour of Policy Propagation Rules.
8
(A)AAAA Methodology
9
1.Aquire rules
2.Analyse the rules: find clusters using Formal Concept Analysis
3.Abstract the rules: match clusters & ontology hierarchy
4.Assess the compression, and diagnose errors or refinements in the
rules or the ontology
5.Adjust the rules or the ontology
repeat from 2.
Preparing the Rules Base
• This phase required a manual supervision of all associations
between policies and relations in order to establish the initial set
of propagation rules.
• We used Contento, it was possible to prepare manually the rule
base with a reasonable effort.
• The initial knowledge base was then composed of 3363 Policy
Propagation Rules
10
Acquisition
Formal Concept Analysis (FCA)
• Input is a Formal Context (a binary matrix of objects/attributes)
• Basic unit is a Close Concept:
– (O,A) => (Extension,Intension)
– Closure operator ’ … (O,A) is a concept when O’=A and A’=O
• Classifies concepts hierarchically in a concept lattice
– Top: all objects, no attr, bottom: all attributes, no obj
11
Analysis
Applying FCA to the Rule Base
80 concepts
Clusters of rules
Relations that have a common behaviour: they
propagate the same policies.
But why do they do it?
12
Analysis
Detect matches with the ontology
13
Abstraction
Search for matches between concepts and branches taken
from the ontology hierarchy.
When found, subtract the rules from the KB accordingly.
Example/1
14
Abstraction
dn:hasPart and dn:isVocabularyOf are valid abstractions
dn:isPartOf is not, because dn:isSelectionOf apparently does
not propagate (all) the policies…
Example/2
15
Abstraction
dn:hasPart (49 rules)
propagates(dn:hasPart,duty	
  cc:ARribu2on)	
  
propagates(dn:hasPart,duty	
  cc:Copyle^)	
  
propagates(dn:hasPart,duty	
  cc:No2ce)	
  
propagates(dn:hasPart,duty	
  cc:SourceCode)	
  
propagates(dn:hasPart,duty	
  odrl:aRachPolicy)	
  
propagates(dn:hasPart,duty	
  odrl:aRachSource)	
  
propagates(dn:hasPart,duty	
  odrl:aRribute)
propagates(dn:hasSec2on,duty	
  cc:ARribu2on)	
  
propagates(dn:hasSec2on,duty	
  cc:Copyle^)	
  
propagates(dn:hasSec2on,duty	
  cc:No2ce)	
  
propagates(dn:hasSec2on,duty	
  cc:SourceCode)	
  
propagates(dn:hasSec2on,duty	
  odrl:aRachPolicy)	
  
propagates(dn:hasSec2on,duty	
  odrl:aRachSource)	
  
propagates(dn:hasSec2on,duty	
  odrl:aRribute)	
  
propagates(dn:hasSelec2on,duty	
  cc:ARribu2on)	
  
propagates(dn:hasSelec2on,duty	
  cc:Copyle^)	
  
propagates(dn:hasSelec2on,duty	
  cc:No2ce)	
  
propagates(dn:hasSelec2on,duty	
  cc:SourceCode)	
  
propagates(dn:hasSelec2on,duty	
  odrl:aRachPolicy)	
  
propagates(dn:hasSelec2on,duty	
  odrl:aRachSource)	
  
propagates(dn:hasSelec2on,duty	
  odrl:aRribute)	
  
propagates(dn:hasSample,duty	
  cc:ARribu2on)	
  
propagates(dn:hasSample,duty	
  cc:Copyle^)	
  
propagates(dn:hasSample,duty	
  cc:No2ce)	
  
propagates(dn:hasSample,duty	
  cc:SourceCode)	
  
propagates(dn:hasSample,duty	
  odrl:aRachPolicy)	
  
propagates(dn:hasSample,duty	
  odrl:aRachSource)	
  
propagates(dn:hasSample,duty	
  odrl:aRribute)	
  
propagates(dn:hasPor2on,duty	
  cc:ARribu2on)	
  
propagates(dn:hasPor2on,duty	
  cc:Copyle^)	
  
propagates(dn:hasPor2on,duty	
  cc:No2ce)	
  
propagates(dn:hasPor2on,duty	
  cc:SourceCode)	
  
propagates(dn:hasPor2on,duty	
  odrl:aRachPolicy)	
  
propagates(dn:hasPor2on,duty	
  odrl:aRachSource)	
  
propagates(dn:hasPor2on,duty	
  odrl:aRribute)	
  
propagates(dn:hasIden2fiers,duty	
  cc:ARribu2on)	
  
propagates(dn:hasIden2fiers,duty	
  cc:Copyle^)	
  
propagates(dn:hasIden2fiers,duty	
  cc:No2ce)	
  
propagates(dn:hasIden2fiers,duty	
  cc:SourceCode)	
  
propagates(dn:hasIden2fiers,duty	
  odrl:aRachPolicy)	
  
propagates(dn:hasIden2fiers,duty	
  odrl:aRachSource)	
  
propagates(dn:hasIden2fiers,duty	
  odrl:aRribute)	
  
propagates(dn:hasExample,duty	
  cc:ARribu2on)	
  
propagates(dn:hasExample,duty	
  cc:Copyle^)	
  
propagates(dn:hasExample,duty	
  cc:No2ce)	
  
propagates(dn:hasExample,duty	
  cc:SourceCode)	
  
propagates(dn:hasExample,duty	
  odrl:aRachPolicy)	
  
propagates(dn:hasExample,duty	
  odrl:aRachSource)	
  
propagates(dn:hasExample,duty	
  odrl:aRribute)
propagates(dn:isVocabularyOf,duty	
  cc:ARribu2on)	
  
propagates(dn:isVocabularyOf,duty	
  cc:Copyle^)	
  
propagates(dn:isVocabularyOf,duty	
  cc:No2ce)	
  
propagates(dn:isVocabularyOf,duty	
  cc:SourceCode)	
  
propagates(dn:isVocabularyOf,duty	
  odrl:aRachPolicy)	
  
propagates(dn:isVocabularyOf,duty	
  odrl:aRachSource)	
  
propagates(dn:isVocabularyOf,duty	
  odrl:aRribute)
propagates(dn:aRributesOf,duty	
  cc:ARribu2on)	
  
propagates(dn:aRributesOf,duty	
  cc:Copyle^)	
  
propagates(dn:aRributesOf,duty	
  cc:No2ce)	
  
propagates(dn:aRributesOf,duty	
  cc:SourceCode)	
  
propagates(dn:aRributesOf,duty	
  odrl:aRachPolicy)	
  
propagates(dn:aRributesOf,duty	
  odrl:aRachSource)	
  
propagates(dn:aRributesOf,duty	
  odrl:aRribute)	
  
propagates(dn:datatypesOf,duty	
  cc:ARribu2on)	
  
propagates(dn:datatypesOf,duty	
  cc:Copyle^)	
  
propagates(dn:datatypesOf,duty	
  cc:No2ce)	
  
propagates(dn:datatypesOf,duty	
  cc:SourceCode)	
  
propagates(dn:datatypesOf,duty	
  odrl:aRachPolicy)	
  
propagates(dn:datatypesOf,duty	
  odrl:aRachSource)	
  
propagates(dn:datatypesOf,duty	
  odrl:aRribute)	
  
propagates(dn:descriptorsOf,duty	
  cc:ARribu2on)	
  
propagates(dn:descriptorsOf,duty	
  cc:Copyle^)	
  
propagates(dn:descriptorsOf,duty	
  cc:No2ce)	
  
propagates(dn:descriptorsOf,duty	
  cc:SourceCode)	
  
propagates(dn:descriptorsOf,duty	
  odrl:aRachPolicy)	
  
propagates(dn:descriptorsOf,duty	
  odrl:aRachSource)	
  
propagates(dn:descriptorsOf,duty	
  odrl:aRribute)	
  
propagates(dn:typesOf,duty	
  cc:ARribu2on)	
  
propagates(dn:typesOf,duty	
  cc:Copyle^)	
  
propagates(dn:typesOf,duty	
  cc:No2ce)	
  
propagates(dn:typesOf,duty	
  cc:SourceCode)	
  
propagates(dn:typesOf,duty	
  odrl:aRachPolicy)	
  
propagates(dn:typesOf,duty	
  odrl:aRachSource)	
  
propagates(dn:typesOf,duty	
  odrl:aRribute)	
  
propagates(dn:rela2onsOf,duty	
  cc:ARribu2on)	
  
propagates(dn:rela2onsOf,duty	
  cc:Copyle^)	
  
propagates(dn:rela2onsOf,duty	
  cc:No2ce)	
  
propagates(dn:rela2onsOf,duty	
  cc:SourceCode)	
  
propagates(dn:rela2onsOf,duty	
  odrl:aRachPolicy)	
  
propagates(dn:rela2onsOf,duty	
  odrl:aRachSource)	
  
propagates(dn:rela2onsOf,duty	
  odrl:aRribute)
dn:isVocabularyOf (42 rules)
7 rules! 7 rules!
Compression Factor
16
Assessment
By applying the original Datanode ontology, 1925 rules could be
removed out of 3363, for a compression factor of 0.572.
We calculate the CF as the number of abstracted rules divided by the
total number of rules:
Considerations
17
Assessment
2. The Datanode ontology has not been designed for the purpose of
representing a common behaviour of relations in terms of propagation
of policies.
It is possible to refine the ontology in order to make it cover this use
case better (and possibly reduce the number of rules even more).
1. The size of the matrix that was manually supervised is large, and it
is possible that errors have been made at that stage of the process.
Observing the measures
18
Assessment
concepts * relations=~9040 (partial) matches. Hard to explore!
Inspecting a partial match with high precision and low recall highlights a
problem that might be easy to fix, as the number of relations and policies to
compare will be low.
Operations
19
Adjustment
We try to make adjustments in order to improve the compression
factor. We defined a set of operations, targeted to (a) fix errors in the
initial rule base and (b) refine the ontology.
• Fill: makes a branch be fully in a cluster of concept c, attempting to
push Pre up to 1.
• Group: some relations that share a concept, but belong to different
branches, are abstracted by a new relation.
• Merge: two distinct branches are abstracted by a new relation.
• Wedge: change the top relation of a branch to make it fully match
the concept.
(and we run our process again from the Analysis phase to the Assessment)
Example: Fill
20
Adjustment
… dn:isSelectionOf should indeed propagate all the policies listed
in this concept. Fill adds the following rules:
propagates(dn:isSelectionOf, duty cc:Attribution)
propagates(dn:isSelectionOf, duty cc:Copyleft)
propagates(dn:isSelectionOf, duty cc:Notice)
propagates(dn:isSelectionOf, duty cc:SourceCode)
propagates(dn:isSelectionOf, duty odrl:attachPolicy)
propagates(dn:isSelectionOf, duty odrl:attachSource)
propagates(dn:isSelectionOf, duty odrl:attribute)
Example: Wedge
21
Adjustment
… dn:sameCapabilityAs does *not* propagate all the policies
listed in this concept. We Wedge dn:sameIdentityAs
Evaluation
22
As a result we obtained: 3865 rules in total, 78
concepts, 2817 rules abstracted and 1048
rules remaining - for a compression factor of
0.729.
Thanks to this methodology we have been
able to fix many errors in the initial data, and to
refine Datanode by clarifying the semantics of
many properties and adding new ones.
Conclusions
23
• We presented a method to abstract Policy Propagation Rules
applying an ontology, the Datanode ontology, a hierarchical
organisation of the possible relations between data objects.
• Datanode allowed us to reduce the number of rules to a factor of 0.5.
• Applying the ontology and the method we were able to find and correct
errors in the rules.
• Moreover we have been able to analyse the ontology in relation to this
task and enhance it having as result not only a further reduction of rules
- 0.7, but also a better ontology.
Future work
• Apply the rule base to specific use cases (perform a practical
evaluation), and publish it for reuse.
• Extend the Assessment phase of the methodology to also include
consistency check between the hierarchy of the FCA lattice and the
ontology.
• Define additional operations to support the Adjustment phase.
• Study the rule base evolution via continuous integration of new
policies/actions/rules.
• Apply the methodology to other use cases. Should we integrate the
measures and operations of the methodology in the Contento tool?
24
Thank you
Enrico Daga
Twitter: @enridaga
enrico.daga@open.ac.uk
76Bottom-Up Ontology Construction with CONTENTO
http://bit.ly/contento-tool
Contento supports the user in the generation and curation of concept lattices to
produce Semantic Web Ontologies from data.
In the demo, we show how to use CONTENTO with Linked Data.
Formal
Context
Concept
Lattice
Modeling
(Naming &
Pruning)
SPARQL
Export as
OWL
Ontology
(adver2sement)
@ISWC	
  2015	
  Poster	
  and	
  Demo	
  session,	
  next	
  week…
Operations: Fill
27
Annex
Observation: the branch is close to be fully in the concept (high Pre)
Diagnosis: the branch must be fully in the concept…
Effect: The Fill operation makes a branch be fully in a cluster of concept
c, attempting to push Pre up to 1.
Operations: Merge
28
Annex
Observation: two distinct branches match the same concept
Diagnosis: the respective top relations can be abstracted by a new
common relation
Effect: a new relation is added to the ontology
Operations: Group
29
Annex
Observation: A set of relations are all together in the extent of a concept,
but belong to different branches.
Diagnosis: they are actually related, and a common parent is missing.
Effect: a new relation is added to the ontology.
Operations: Wedge
30
Annex
Observation: the top relation is missing, and it does not propagate (all)
the policies of the concept.
Diagnosis: the actual top relation is not a right abstraction.
Effect: a new relation is added to the ontology.

More Related Content

What's hot

A first look at tf idf-pdx data science meetup
A first look at tf idf-pdx data science meetupA first look at tf idf-pdx data science meetup
A first look at tf idf-pdx data science meetupDan Sullivan, Ph.D.
 
ParlBench: a SPARQL-benchmark for electronic publishing applications.
ParlBench: a SPARQL-benchmark for electronic publishing applications.ParlBench: a SPARQL-benchmark for electronic publishing applications.
ParlBench: a SPARQL-benchmark for electronic publishing applications.Tatiana Tarasova
 
DCU Search Runs at MediaEval 2014 Search and Hyperlinking
DCU Search Runs at MediaEval 2014 Search and HyperlinkingDCU Search Runs at MediaEval 2014 Search and Hyperlinking
DCU Search Runs at MediaEval 2014 Search and Hyperlinkingmultimediaeval
 
Accessing R from Python using RPy2
Accessing R from Python using RPy2Accessing R from Python using RPy2
Accessing R from Python using RPy2Ryan Rosario
 
Image Similarity Detection at Scale Using LSH and Tensorflow with Andrey Gusev
Image Similarity Detection at Scale Using LSH and Tensorflow with Andrey GusevImage Similarity Detection at Scale Using LSH and Tensorflow with Andrey Gusev
Image Similarity Detection at Scale Using LSH and Tensorflow with Andrey GusevDatabricks
 
DUG'20: 07 - Storing High-Energy Physics data in DAOS
DUG'20: 07 - Storing High-Energy Physics data in DAOSDUG'20: 07 - Storing High-Energy Physics data in DAOS
DUG'20: 07 - Storing High-Energy Physics data in DAOSAndrey Kudryavtsev
 
Flink Forward Berlin 2018: Suneel Marthi & Joey Frazee - "Streaming topic mod...
Flink Forward Berlin 2018: Suneel Marthi & Joey Frazee - "Streaming topic mod...Flink Forward Berlin 2018: Suneel Marthi & Joey Frazee - "Streaming topic mod...
Flink Forward Berlin 2018: Suneel Marthi & Joey Frazee - "Streaming topic mod...Flink Forward
 
Parallel Materialisation of Datalog Programs in Centralised, Main-Memory RDF ...
Parallel Materialisation of Datalog Programs in Centralised, Main-Memory RDF ...Parallel Materialisation of Datalog Programs in Centralised, Main-Memory RDF ...
Parallel Materialisation of Datalog Programs in Centralised, Main-Memory RDF ...DBOnto
 
TermPicker: Enabling the Reuse of Vocabulary Terms by Exploiting Data from th...
TermPicker: Enabling the Reuse of Vocabulary Terms by Exploiting Data from th...TermPicker: Enabling the Reuse of Vocabulary Terms by Exploiting Data from th...
TermPicker: Enabling the Reuse of Vocabulary Terms by Exploiting Data from th...JohannWanja
 
Slides
SlidesSlides
Slidesbutest
 
Matching PATSTAT to Crunchbase
Matching PATSTAT to CrunchbaseMatching PATSTAT to Crunchbase
Matching PATSTAT to CrunchbaseGianluca Tarasconi
 
Cross language information retrieval (clir)slide
Cross language information retrieval (clir)slideCross language information retrieval (clir)slide
Cross language information retrieval (clir)slideMohd Iqbal Al-farabi
 
Large-scale Reasoning with a Complex Cultural Heritage Ontology (CIDOC CRM) ...
 Large-scale Reasoning with a Complex Cultural Heritage Ontology (CIDOC CRM) ... Large-scale Reasoning with a Complex Cultural Heritage Ontology (CIDOC CRM) ...
Large-scale Reasoning with a Complex Cultural Heritage Ontology (CIDOC CRM) ...Vladimir Alexiev, PhD, PMP
 
Introduction to R for Data Science :: Session 8 [Intro to Text Mining in R, M...
Introduction to R for Data Science :: Session 8 [Intro to Text Mining in R, M...Introduction to R for Data Science :: Session 8 [Intro to Text Mining in R, M...
Introduction to R for Data Science :: Session 8 [Intro to Text Mining in R, M...Goran S. Milovanovic
 
Applications of Word Vectors in Text Retrieval and Classification
Applications of Word Vectors in Text Retrieval and ClassificationApplications of Word Vectors in Text Retrieval and Classification
Applications of Word Vectors in Text Retrieval and Classificationshakimov
 

What's hot (20)

Compact Representation of Large RDF Data Sets for Publishing and Exchange
Compact Representation of Large RDF Data Sets for Publishing and ExchangeCompact Representation of Large RDF Data Sets for Publishing and Exchange
Compact Representation of Large RDF Data Sets for Publishing and Exchange
 
A first look at tf idf-pdx data science meetup
A first look at tf idf-pdx data science meetupA first look at tf idf-pdx data science meetup
A first look at tf idf-pdx data science meetup
 
ParlBench: a SPARQL-benchmark for electronic publishing applications.
ParlBench: a SPARQL-benchmark for electronic publishing applications.ParlBench: a SPARQL-benchmark for electronic publishing applications.
ParlBench: a SPARQL-benchmark for electronic publishing applications.
 
DCU Search Runs at MediaEval 2014 Search and Hyperlinking
DCU Search Runs at MediaEval 2014 Search and HyperlinkingDCU Search Runs at MediaEval 2014 Search and Hyperlinking
DCU Search Runs at MediaEval 2014 Search and Hyperlinking
 
Accessing R from Python using RPy2
Accessing R from Python using RPy2Accessing R from Python using RPy2
Accessing R from Python using RPy2
 
Data mining techniques
Data mining techniquesData mining techniques
Data mining techniques
 
Image Similarity Detection at Scale Using LSH and Tensorflow with Andrey Gusev
Image Similarity Detection at Scale Using LSH and Tensorflow with Andrey GusevImage Similarity Detection at Scale Using LSH and Tensorflow with Andrey Gusev
Image Similarity Detection at Scale Using LSH and Tensorflow with Andrey Gusev
 
DUG'20: 07 - Storing High-Energy Physics data in DAOS
DUG'20: 07 - Storing High-Energy Physics data in DAOSDUG'20: 07 - Storing High-Energy Physics data in DAOS
DUG'20: 07 - Storing High-Energy Physics data in DAOS
 
Flink Forward Berlin 2018: Suneel Marthi & Joey Frazee - "Streaming topic mod...
Flink Forward Berlin 2018: Suneel Marthi & Joey Frazee - "Streaming topic mod...Flink Forward Berlin 2018: Suneel Marthi & Joey Frazee - "Streaming topic mod...
Flink Forward Berlin 2018: Suneel Marthi & Joey Frazee - "Streaming topic mod...
 
Parallel Materialisation of Datalog Programs in Centralised, Main-Memory RDF ...
Parallel Materialisation of Datalog Programs in Centralised, Main-Memory RDF ...Parallel Materialisation of Datalog Programs in Centralised, Main-Memory RDF ...
Parallel Materialisation of Datalog Programs in Centralised, Main-Memory RDF ...
 
07 04-06
07 04-0607 04-06
07 04-06
 
SAC 2019 ester giallonardo
SAC 2019 ester giallonardoSAC 2019 ester giallonardo
SAC 2019 ester giallonardo
 
TermPicker: Enabling the Reuse of Vocabulary Terms by Exploiting Data from th...
TermPicker: Enabling the Reuse of Vocabulary Terms by Exploiting Data from th...TermPicker: Enabling the Reuse of Vocabulary Terms by Exploiting Data from th...
TermPicker: Enabling the Reuse of Vocabulary Terms by Exploiting Data from th...
 
Slides
SlidesSlides
Slides
 
Matching PATSTAT to Crunchbase
Matching PATSTAT to CrunchbaseMatching PATSTAT to Crunchbase
Matching PATSTAT to Crunchbase
 
Cross language information retrieval (clir)slide
Cross language information retrieval (clir)slideCross language information retrieval (clir)slide
Cross language information retrieval (clir)slide
 
Large-scale Reasoning with a Complex Cultural Heritage Ontology (CIDOC CRM) ...
 Large-scale Reasoning with a Complex Cultural Heritage Ontology (CIDOC CRM) ... Large-scale Reasoning with a Complex Cultural Heritage Ontology (CIDOC CRM) ...
Large-scale Reasoning with a Complex Cultural Heritage Ontology (CIDOC CRM) ...
 
Profile of NPOESS HDF5 Files
Profile of NPOESS HDF5 FilesProfile of NPOESS HDF5 Files
Profile of NPOESS HDF5 Files
 
Introduction to R for Data Science :: Session 8 [Intro to Text Mining in R, M...
Introduction to R for Data Science :: Session 8 [Intro to Text Mining in R, M...Introduction to R for Data Science :: Session 8 [Intro to Text Mining in R, M...
Introduction to R for Data Science :: Session 8 [Intro to Text Mining in R, M...
 
Applications of Word Vectors in Text Retrieval and Classification
Applications of Word Vectors in Text Retrieval and ClassificationApplications of Word Vectors in Text Retrieval and Classification
Applications of Word Vectors in Text Retrieval and Classification
 

Viewers also liked

Como hacer una demanda_DOCTRINA ARGENTINA
Como hacer una demanda_DOCTRINA ARGENTINAComo hacer una demanda_DOCTRINA ARGENTINA
Como hacer una demanda_DOCTRINA ARGENTINAMauri Rojas
 
Certificate-César Ritz College
Certificate-César Ritz CollegeCertificate-César Ritz College
Certificate-César Ritz CollegeLaura Ya-Hsuan Liu
 
Factores de los aprendizajes_IAFJSR
Factores de los aprendizajes_IAFJSRFactores de los aprendizajes_IAFJSR
Factores de los aprendizajes_IAFJSRMauri Rojas
 
Galway
GalwayGalway
Galwaygeary
 
Squire Technologies: Short Message Service Centre
Squire Technologies: Short Message Service CentreSquire Technologies: Short Message Service Centre
Squire Technologies: Short Message Service CentreSquire Technologies
 
Growth performance of native endangered species c. tabularis and a. polystachya
Growth performance of native endangered species c. tabularis and a. polystachyaGrowth performance of native endangered species c. tabularis and a. polystachya
Growth performance of native endangered species c. tabularis and a. polystachyamnbashar
 
метод реком 2015 2016
метод реком 2015 2016метод реком 2015 2016
метод реком 2015 2016Vanya0508
 
Strategic Marketing Consulting
Strategic Marketing ConsultingStrategic Marketing Consulting
Strategic Marketing ConsultingSteve Tennant
 
Rapid compression machine_monthly meeting
Rapid compression machine_monthly meetingRapid compression machine_monthly meeting
Rapid compression machine_monthly meetingNathan Loveldi
 
Etkin Yetki Yönetimi - SAP GRC Access Control
Etkin Yetki Yönetimi - SAP GRC Access ControlEtkin Yetki Yönetimi - SAP GRC Access Control
Etkin Yetki Yönetimi - SAP GRC Access ControlArtius Consulting
 
Comp 107 unit 7 and 8 (networking, internet and intranet)
Comp 107 unit 7 and 8 (networking, internet and intranet)Comp 107 unit 7 and 8 (networking, internet and intranet)
Comp 107 unit 7 and 8 (networking, internet and intranet)Mijanur Rahman
 
Valoracion juridica del acta de inv penal2
Valoracion juridica del acta de inv penal2Valoracion juridica del acta de inv penal2
Valoracion juridica del acta de inv penal2Mauri Rojas
 
Intro to physical science and measurements
Intro to physical science and measurementsIntro to physical science and measurements
Intro to physical science and measurementssihellyay
 
The Internet and the World Wide Web
The Internet and the World Wide WebThe Internet and the World Wide Web
The Internet and the World Wide Webdpd
 

Viewers also liked (17)

Como hacer una demanda_DOCTRINA ARGENTINA
Como hacer una demanda_DOCTRINA ARGENTINAComo hacer una demanda_DOCTRINA ARGENTINA
Como hacer una demanda_DOCTRINA ARGENTINA
 
Moldovan Night Harrisburg OW
Moldovan Night Harrisburg OWMoldovan Night Harrisburg OW
Moldovan Night Harrisburg OW
 
Fase1 grupo69
Fase1 grupo69Fase1 grupo69
Fase1 grupo69
 
Certificate-César Ritz College
Certificate-César Ritz CollegeCertificate-César Ritz College
Certificate-César Ritz College
 
Factores de los aprendizajes_IAFJSR
Factores de los aprendizajes_IAFJSRFactores de los aprendizajes_IAFJSR
Factores de los aprendizajes_IAFJSR
 
SKSUKHIJA RESUME
SKSUKHIJA RESUMESKSUKHIJA RESUME
SKSUKHIJA RESUME
 
Galway
GalwayGalway
Galway
 
Squire Technologies: Short Message Service Centre
Squire Technologies: Short Message Service CentreSquire Technologies: Short Message Service Centre
Squire Technologies: Short Message Service Centre
 
Growth performance of native endangered species c. tabularis and a. polystachya
Growth performance of native endangered species c. tabularis and a. polystachyaGrowth performance of native endangered species c. tabularis and a. polystachya
Growth performance of native endangered species c. tabularis and a. polystachya
 
метод реком 2015 2016
метод реком 2015 2016метод реком 2015 2016
метод реком 2015 2016
 
Strategic Marketing Consulting
Strategic Marketing ConsultingStrategic Marketing Consulting
Strategic Marketing Consulting
 
Rapid compression machine_monthly meeting
Rapid compression machine_monthly meetingRapid compression machine_monthly meeting
Rapid compression machine_monthly meeting
 
Etkin Yetki Yönetimi - SAP GRC Access Control
Etkin Yetki Yönetimi - SAP GRC Access ControlEtkin Yetki Yönetimi - SAP GRC Access Control
Etkin Yetki Yönetimi - SAP GRC Access Control
 
Comp 107 unit 7 and 8 (networking, internet and intranet)
Comp 107 unit 7 and 8 (networking, internet and intranet)Comp 107 unit 7 and 8 (networking, internet and intranet)
Comp 107 unit 7 and 8 (networking, internet and intranet)
 
Valoracion juridica del acta de inv penal2
Valoracion juridica del acta de inv penal2Valoracion juridica del acta de inv penal2
Valoracion juridica del acta de inv penal2
 
Intro to physical science and measurements
Intro to physical science and measurementsIntro to physical science and measurements
Intro to physical science and measurements
 
The Internet and the World Wide Web
The Internet and the World Wide WebThe Internet and the World Wide Web
The Internet and the World Wide Web
 

Similar to Propagation of Policies in Rich Data Flows

Open Analytics Environment
Open Analytics EnvironmentOpen Analytics Environment
Open Analytics EnvironmentIan Foster
 
Computation and Knowledge
Computation and KnowledgeComputation and Knowledge
Computation and KnowledgeIan Foster
 
Reasoning with Big Knowledge Graphs: Choices, Pitfalls and Proven Recipes
Reasoning with Big Knowledge Graphs: Choices, Pitfalls and Proven RecipesReasoning with Big Knowledge Graphs: Choices, Pitfalls and Proven Recipes
Reasoning with Big Knowledge Graphs: Choices, Pitfalls and Proven RecipesOntotext
 
A Model of the Scholarly Community
A Model of the Scholarly CommunityA Model of the Scholarly Community
A Model of the Scholarly CommunityMarko Rodriguez
 
Ontologies Ontop Databases
Ontologies Ontop DatabasesOntologies Ontop Databases
Ontologies Ontop DatabasesMartín Rezk
 
Dataset Catalogs as a Foundation for FAIR* Data
Dataset Catalogs as a Foundation for FAIR* DataDataset Catalogs as a Foundation for FAIR* Data
Dataset Catalogs as a Foundation for FAIR* DataTom Plasterer
 
cprogramming questions for practice end term
cprogramming questions for practice end termcprogramming questions for practice end term
cprogramming questions for practice end termSheelendra3
 
Graphical Structure Learning accelerated with POWER9
Graphical Structure Learning accelerated with POWER9Graphical Structure Learning accelerated with POWER9
Graphical Structure Learning accelerated with POWER9Ganesan Narayanasamy
 
Alberto Ciaramella: "Linked patent data: opportunities and challenges for pat...
Alberto Ciaramella: "Linked patent data: opportunities and challenges for pat...Alberto Ciaramella: "Linked patent data: opportunities and challenges for pat...
Alberto Ciaramella: "Linked patent data: opportunities and challenges for pat...IntelliSemantic
 
ICWE2017 BigDataEurope
ICWE2017 BigDataEuropeICWE2017 BigDataEurope
ICWE2017 BigDataEuropeBigData_Europe
 
Nt1310 Unit 3 Assignment 1 Study Guide
Nt1310 Unit 3 Assignment 1 Study GuideNt1310 Unit 3 Assignment 1 Study Guide
Nt1310 Unit 3 Assignment 1 Study GuideAshley Davis
 
Engineering Data Science Objectives for Social Network Analysis
Engineering Data Science Objectives for Social Network AnalysisEngineering Data Science Objectives for Social Network Analysis
Engineering Data Science Objectives for Social Network AnalysisDavid Gleich
 
Phenoflow: An Architecture for Computable Phenotypes
Phenoflow: An Architecture for Computable PhenotypesPhenoflow: An Architecture for Computable Phenotypes
Phenoflow: An Architecture for Computable PhenotypesMartin Chapman
 
Propagating Data Policies - A User Study
Propagating Data Policies - A User StudyPropagating Data Policies - A User Study
Propagating Data Policies - A User StudyEnrico Daga
 
Mining and Untangling Change Genealogies (PhD Defense Talk)
Mining and Untangling Change Genealogies (PhD Defense Talk)Mining and Untangling Change Genealogies (PhD Defense Talk)
Mining and Untangling Change Genealogies (PhD Defense Talk)Kim Herzig
 
Visualize open data with Plone - eea.daviz PLOG 2013
Visualize open data with Plone - eea.daviz PLOG 2013Visualize open data with Plone - eea.daviz PLOG 2013
Visualize open data with Plone - eea.daviz PLOG 2013Antonio De Marinis
 
How to Analyze the Results of LinearPrograms—Part 1 Prelimi.docx
How to Analyze the Results of LinearPrograms—Part 1 Prelimi.docxHow to Analyze the Results of LinearPrograms—Part 1 Prelimi.docx
How to Analyze the Results of LinearPrograms—Part 1 Prelimi.docxpooleavelina
 
Port Clearance Rules in PSOA RuleML: From Controlled-English Regulation to Ob...
Port Clearance Rules in PSOA RuleML: From Controlled-English Regulation to Ob...Port Clearance Rules in PSOA RuleML: From Controlled-English Regulation to Ob...
Port Clearance Rules in PSOA RuleML: From Controlled-English Regulation to Ob...RuleML
 

Similar to Propagation of Policies in Rich Data Flows (20)

Open Analytics Environment
Open Analytics EnvironmentOpen Analytics Environment
Open Analytics Environment
 
Computation and Knowledge
Computation and KnowledgeComputation and Knowledge
Computation and Knowledge
 
Reasoning with Big Knowledge Graphs: Choices, Pitfalls and Proven Recipes
Reasoning with Big Knowledge Graphs: Choices, Pitfalls and Proven RecipesReasoning with Big Knowledge Graphs: Choices, Pitfalls and Proven Recipes
Reasoning with Big Knowledge Graphs: Choices, Pitfalls and Proven Recipes
 
A Model of the Scholarly Community
A Model of the Scholarly CommunityA Model of the Scholarly Community
A Model of the Scholarly Community
 
Ontologies Ontop Databases
Ontologies Ontop DatabasesOntologies Ontop Databases
Ontologies Ontop Databases
 
Dataset Catalogs as a Foundation for FAIR* Data
Dataset Catalogs as a Foundation for FAIR* DataDataset Catalogs as a Foundation for FAIR* Data
Dataset Catalogs as a Foundation for FAIR* Data
 
cprogramming questions for practice end term
cprogramming questions for practice end termcprogramming questions for practice end term
cprogramming questions for practice end term
 
Graphical Structure Learning accelerated with POWER9
Graphical Structure Learning accelerated with POWER9Graphical Structure Learning accelerated with POWER9
Graphical Structure Learning accelerated with POWER9
 
Alberto Ciaramella: "Linked patent data: opportunities and challenges for pat...
Alberto Ciaramella: "Linked patent data: opportunities and challenges for pat...Alberto Ciaramella: "Linked patent data: opportunities and challenges for pat...
Alberto Ciaramella: "Linked patent data: opportunities and challenges for pat...
 
ICWE2017 BigDataEurope
ICWE2017 BigDataEuropeICWE2017 BigDataEurope
ICWE2017 BigDataEurope
 
Nt1310 Unit 3 Assignment 1 Study Guide
Nt1310 Unit 3 Assignment 1 Study GuideNt1310 Unit 3 Assignment 1 Study Guide
Nt1310 Unit 3 Assignment 1 Study Guide
 
Engineering Data Science Objectives for Social Network Analysis
Engineering Data Science Objectives for Social Network AnalysisEngineering Data Science Objectives for Social Network Analysis
Engineering Data Science Objectives for Social Network Analysis
 
Phenoflow: An Architecture for Computable Phenotypes
Phenoflow: An Architecture for Computable PhenotypesPhenoflow: An Architecture for Computable Phenotypes
Phenoflow: An Architecture for Computable Phenotypes
 
VOLT - ESWC 2016
VOLT - ESWC 2016VOLT - ESWC 2016
VOLT - ESWC 2016
 
Propagating Data Policies - A User Study
Propagating Data Policies - A User StudyPropagating Data Policies - A User Study
Propagating Data Policies - A User Study
 
Mining and Untangling Change Genealogies (PhD Defense Talk)
Mining and Untangling Change Genealogies (PhD Defense Talk)Mining and Untangling Change Genealogies (PhD Defense Talk)
Mining and Untangling Change Genealogies (PhD Defense Talk)
 
Visualize open data with Plone - eea.daviz PLOG 2013
Visualize open data with Plone - eea.daviz PLOG 2013Visualize open data with Plone - eea.daviz PLOG 2013
Visualize open data with Plone - eea.daviz PLOG 2013
 
How to Analyze the Results of LinearPrograms—Part 1 Prelimi.docx
How to Analyze the Results of LinearPrograms—Part 1 Prelimi.docxHow to Analyze the Results of LinearPrograms—Part 1 Prelimi.docx
How to Analyze the Results of LinearPrograms—Part 1 Prelimi.docx
 
Kdd by Mr.Sameer Kumar Das
Kdd by Mr.Sameer Kumar DasKdd by Mr.Sameer Kumar Das
Kdd by Mr.Sameer Kumar Das
 
Port Clearance Rules in PSOA RuleML: From Controlled-English Regulation to Ob...
Port Clearance Rules in PSOA RuleML: From Controlled-English Regulation to Ob...Port Clearance Rules in PSOA RuleML: From Controlled-English Regulation to Ob...
Port Clearance Rules in PSOA RuleML: From Controlled-English Regulation to Ob...
 

More from Enrico Daga

Citizen Experiences in Cultural Heritage Archives: a Data Journey
Citizen Experiences in Cultural Heritage Archives: a Data JourneyCitizen Experiences in Cultural Heritage Archives: a Data Journey
Citizen Experiences in Cultural Heritage Archives: a Data JourneyEnrico Daga
 
Streamlining Knowledge Graph Construction with a façade: the SPARQL Anything...
Streamlining Knowledge Graph Construction with a façade:  the SPARQL Anything...Streamlining Knowledge Graph Construction with a façade:  the SPARQL Anything...
Streamlining Knowledge Graph Construction with a façade: the SPARQL Anything...Enrico Daga
 
Data integration with a façade. The case of knowledge graph construction.
Data integration with a façade. The case of knowledge graph construction.Data integration with a façade. The case of knowledge graph construction.
Data integration with a façade. The case of knowledge graph construction.Enrico Daga
 
Knowledge graph construction with a façade - The SPARQL Anything Project
Knowledge graph construction with a façade - The SPARQL Anything ProjectKnowledge graph construction with a façade - The SPARQL Anything Project
Knowledge graph construction with a façade - The SPARQL Anything ProjectEnrico Daga
 
Capturing the semantics of documentary evidence for humanities research
Capturing the semantics of documentary evidence for humanities researchCapturing the semantics of documentary evidence for humanities research
Capturing the semantics of documentary evidence for humanities researchEnrico Daga
 
Trying SPARQL Anything with MEI
Trying SPARQL Anything with MEITrying SPARQL Anything with MEI
Trying SPARQL Anything with MEIEnrico Daga
 
The SPARQL Anything project
The SPARQL Anything projectThe SPARQL Anything project
The SPARQL Anything projectEnrico Daga
 
Towards a Smart (City) Data Science. A case-based retrospective on policies, ...
Towards a Smart (City) Data Science. A case-based retrospective on policies, ...Towards a Smart (City) Data Science. A case-based retrospective on policies, ...
Towards a Smart (City) Data Science. A case-based retrospective on policies, ...Enrico Daga
 
Linked data for knowledge curation in humanities research
Linked data for knowledge curation in humanities researchLinked data for knowledge curation in humanities research
Linked data for knowledge curation in humanities researchEnrico Daga
 
Capturing Themed Evidence, a Hybrid Approach
Capturing Themed Evidence, a Hybrid ApproachCapturing Themed Evidence, a Hybrid Approach
Capturing Themed Evidence, a Hybrid ApproachEnrico Daga
 
Challenging knowledge extraction to support
the curation of documentary evide...
Challenging knowledge extraction to support
the curation of documentary evide...Challenging knowledge extraction to support
the curation of documentary evide...
Challenging knowledge extraction to support
the curation of documentary evide...Enrico Daga
 
OU RSE Tutorial Big Data Cluster
OU RSE Tutorial Big Data ClusterOU RSE Tutorial Big Data Cluster
OU RSE Tutorial Big Data ClusterEnrico Daga
 
CityLABS Workshop: Working with large tables
CityLABS Workshop: Working with large tablesCityLABS Workshop: Working with large tables
CityLABS Workshop: Working with large tablesEnrico Daga
 
Linked Data at the OU - the story so far
Linked Data at the OU - the story so farLinked Data at the OU - the story so far
Linked Data at the OU - the story so farEnrico Daga
 
A bottom up approach for licences classification and selection
A bottom up approach for licences classification and selectionA bottom up approach for licences classification and selection
A bottom up approach for licences classification and selectionEnrico Daga
 
A BASILar Approach for Building Web APIs on top of SPARQL Endpoints
A BASILar Approach for Building Web APIs on top of SPARQL EndpointsA BASILar Approach for Building Web APIs on top of SPARQL Endpoints
A BASILar Approach for Building Web APIs on top of SPARQL EndpointsEnrico Daga
 
Early Analysis and Debuggin of Linked Open Data Cubes
Early Analysis and Debuggin of Linked Open Data CubesEarly Analysis and Debuggin of Linked Open Data Cubes
Early Analysis and Debuggin of Linked Open Data CubesEnrico Daga
 

More from Enrico Daga (18)

Citizen Experiences in Cultural Heritage Archives: a Data Journey
Citizen Experiences in Cultural Heritage Archives: a Data JourneyCitizen Experiences in Cultural Heritage Archives: a Data Journey
Citizen Experiences in Cultural Heritage Archives: a Data Journey
 
Streamlining Knowledge Graph Construction with a façade: the SPARQL Anything...
Streamlining Knowledge Graph Construction with a façade:  the SPARQL Anything...Streamlining Knowledge Graph Construction with a façade:  the SPARQL Anything...
Streamlining Knowledge Graph Construction with a façade: the SPARQL Anything...
 
Data integration with a façade. The case of knowledge graph construction.
Data integration with a façade. The case of knowledge graph construction.Data integration with a façade. The case of knowledge graph construction.
Data integration with a façade. The case of knowledge graph construction.
 
Knowledge graph construction with a façade - The SPARQL Anything Project
Knowledge graph construction with a façade - The SPARQL Anything ProjectKnowledge graph construction with a façade - The SPARQL Anything Project
Knowledge graph construction with a façade - The SPARQL Anything Project
 
Capturing the semantics of documentary evidence for humanities research
Capturing the semantics of documentary evidence for humanities researchCapturing the semantics of documentary evidence for humanities research
Capturing the semantics of documentary evidence for humanities research
 
Trying SPARQL Anything with MEI
Trying SPARQL Anything with MEITrying SPARQL Anything with MEI
Trying SPARQL Anything with MEI
 
The SPARQL Anything project
The SPARQL Anything projectThe SPARQL Anything project
The SPARQL Anything project
 
Towards a Smart (City) Data Science. A case-based retrospective on policies, ...
Towards a Smart (City) Data Science. A case-based retrospective on policies, ...Towards a Smart (City) Data Science. A case-based retrospective on policies, ...
Towards a Smart (City) Data Science. A case-based retrospective on policies, ...
 
Linked data for knowledge curation in humanities research
Linked data for knowledge curation in humanities researchLinked data for knowledge curation in humanities research
Linked data for knowledge curation in humanities research
 
Capturing Themed Evidence, a Hybrid Approach
Capturing Themed Evidence, a Hybrid ApproachCapturing Themed Evidence, a Hybrid Approach
Capturing Themed Evidence, a Hybrid Approach
 
Challenging knowledge extraction to support
the curation of documentary evide...
Challenging knowledge extraction to support
the curation of documentary evide...Challenging knowledge extraction to support
the curation of documentary evide...
Challenging knowledge extraction to support
the curation of documentary evide...
 
Ld4 dh tutorial
Ld4 dh tutorialLd4 dh tutorial
Ld4 dh tutorial
 
OU RSE Tutorial Big Data Cluster
OU RSE Tutorial Big Data ClusterOU RSE Tutorial Big Data Cluster
OU RSE Tutorial Big Data Cluster
 
CityLABS Workshop: Working with large tables
CityLABS Workshop: Working with large tablesCityLABS Workshop: Working with large tables
CityLABS Workshop: Working with large tables
 
Linked Data at the OU - the story so far
Linked Data at the OU - the story so farLinked Data at the OU - the story so far
Linked Data at the OU - the story so far
 
A bottom up approach for licences classification and selection
A bottom up approach for licences classification and selectionA bottom up approach for licences classification and selection
A bottom up approach for licences classification and selection
 
A BASILar Approach for Building Web APIs on top of SPARQL Endpoints
A BASILar Approach for Building Web APIs on top of SPARQL EndpointsA BASILar Approach for Building Web APIs on top of SPARQL Endpoints
A BASILar Approach for Building Web APIs on top of SPARQL Endpoints
 
Early Analysis and Debuggin of Linked Open Data Cubes
Early Analysis and Debuggin of Linked Open Data CubesEarly Analysis and Debuggin of Linked Open Data Cubes
Early Analysis and Debuggin of Linked Open Data Cubes
 

Recently uploaded

Virtuosoft SmartSync Product Introduction
Virtuosoft SmartSync Product IntroductionVirtuosoft SmartSync Product Introduction
Virtuosoft SmartSync Product Introductionsanjaymuralee1
 
Strategic CX: A Deep Dive into Voice of the Customer Insights for Clarity
Strategic CX: A Deep Dive into Voice of the Customer Insights for ClarityStrategic CX: A Deep Dive into Voice of the Customer Insights for Clarity
Strategic CX: A Deep Dive into Voice of the Customer Insights for ClarityAggregage
 
CI, CD -Tools to integrate without manual intervention
CI, CD -Tools to integrate without manual interventionCI, CD -Tools to integrate without manual intervention
CI, CD -Tools to integrate without manual interventionajayrajaganeshkayala
 
YourView Panel Book.pptx YourView Panel Book.
YourView Panel Book.pptx YourView Panel Book.YourView Panel Book.pptx YourView Panel Book.
YourView Panel Book.pptx YourView Panel Book.JasonViviers2
 
MEASURES OF DISPERSION I BSc Botany .ppt
MEASURES OF DISPERSION I BSc Botany .pptMEASURES OF DISPERSION I BSc Botany .ppt
MEASURES OF DISPERSION I BSc Botany .pptaigil2
 
TINJUAN PEMROSESAN TRANSAKSI DAN ERP.pptx
TINJUAN PEMROSESAN TRANSAKSI DAN ERP.pptxTINJUAN PEMROSESAN TRANSAKSI DAN ERP.pptx
TINJUAN PEMROSESAN TRANSAKSI DAN ERP.pptxDwiAyuSitiHartinah
 
5 Ds to Define Data Archiving Best Practices
5 Ds to Define Data Archiving Best Practices5 Ds to Define Data Archiving Best Practices
5 Ds to Define Data Archiving Best PracticesDataArchiva
 
The Universal GTM - how we design GTM and dataLayer
The Universal GTM - how we design GTM and dataLayerThe Universal GTM - how we design GTM and dataLayer
The Universal GTM - how we design GTM and dataLayerPavel Šabatka
 
How is Real-Time Analytics Different from Traditional OLAP?
How is Real-Time Analytics Different from Traditional OLAP?How is Real-Time Analytics Different from Traditional OLAP?
How is Real-Time Analytics Different from Traditional OLAP?sonikadigital1
 
ChistaDATA Real-Time DATA Analytics Infrastructure
ChistaDATA Real-Time DATA Analytics InfrastructureChistaDATA Real-Time DATA Analytics Infrastructure
ChistaDATA Real-Time DATA Analytics Infrastructuresonikadigital1
 
Cash Is Still King: ATM market research '2023
Cash Is Still King: ATM market research '2023Cash Is Still King: ATM market research '2023
Cash Is Still King: ATM market research '2023Vladislav Solodkiy
 
AI for Sustainable Development Goals (SDGs)
AI for Sustainable Development Goals (SDGs)AI for Sustainable Development Goals (SDGs)
AI for Sustainable Development Goals (SDGs)Data & Analytics Magazin
 
Persuasive E-commerce, Our Biased Brain @ Bikkeldag 2024
Persuasive E-commerce, Our Biased Brain @ Bikkeldag 2024Persuasive E-commerce, Our Biased Brain @ Bikkeldag 2024
Persuasive E-commerce, Our Biased Brain @ Bikkeldag 2024Guido X Jansen
 
SFBA Splunk Usergroup meeting March 13, 2024
SFBA Splunk Usergroup meeting March 13, 2024SFBA Splunk Usergroup meeting March 13, 2024
SFBA Splunk Usergroup meeting March 13, 2024Becky Burwell
 
Elements of language learning - an analysis of how different elements of lang...
Elements of language learning - an analysis of how different elements of lang...Elements of language learning - an analysis of how different elements of lang...
Elements of language learning - an analysis of how different elements of lang...PrithaVashisht1
 
Mapping the pubmed data under different suptopics using NLP.pptx
Mapping the pubmed data under different suptopics using NLP.pptxMapping the pubmed data under different suptopics using NLP.pptx
Mapping the pubmed data under different suptopics using NLP.pptxVenkatasubramani13
 
Master's Thesis - Data Science - Presentation
Master's Thesis - Data Science - PresentationMaster's Thesis - Data Science - Presentation
Master's Thesis - Data Science - PresentationGiorgio Carbone
 

Recently uploaded (17)

Virtuosoft SmartSync Product Introduction
Virtuosoft SmartSync Product IntroductionVirtuosoft SmartSync Product Introduction
Virtuosoft SmartSync Product Introduction
 
Strategic CX: A Deep Dive into Voice of the Customer Insights for Clarity
Strategic CX: A Deep Dive into Voice of the Customer Insights for ClarityStrategic CX: A Deep Dive into Voice of the Customer Insights for Clarity
Strategic CX: A Deep Dive into Voice of the Customer Insights for Clarity
 
CI, CD -Tools to integrate without manual intervention
CI, CD -Tools to integrate without manual interventionCI, CD -Tools to integrate without manual intervention
CI, CD -Tools to integrate without manual intervention
 
YourView Panel Book.pptx YourView Panel Book.
YourView Panel Book.pptx YourView Panel Book.YourView Panel Book.pptx YourView Panel Book.
YourView Panel Book.pptx YourView Panel Book.
 
MEASURES OF DISPERSION I BSc Botany .ppt
MEASURES OF DISPERSION I BSc Botany .pptMEASURES OF DISPERSION I BSc Botany .ppt
MEASURES OF DISPERSION I BSc Botany .ppt
 
TINJUAN PEMROSESAN TRANSAKSI DAN ERP.pptx
TINJUAN PEMROSESAN TRANSAKSI DAN ERP.pptxTINJUAN PEMROSESAN TRANSAKSI DAN ERP.pptx
TINJUAN PEMROSESAN TRANSAKSI DAN ERP.pptx
 
5 Ds to Define Data Archiving Best Practices
5 Ds to Define Data Archiving Best Practices5 Ds to Define Data Archiving Best Practices
5 Ds to Define Data Archiving Best Practices
 
The Universal GTM - how we design GTM and dataLayer
The Universal GTM - how we design GTM and dataLayerThe Universal GTM - how we design GTM and dataLayer
The Universal GTM - how we design GTM and dataLayer
 
How is Real-Time Analytics Different from Traditional OLAP?
How is Real-Time Analytics Different from Traditional OLAP?How is Real-Time Analytics Different from Traditional OLAP?
How is Real-Time Analytics Different from Traditional OLAP?
 
ChistaDATA Real-Time DATA Analytics Infrastructure
ChistaDATA Real-Time DATA Analytics InfrastructureChistaDATA Real-Time DATA Analytics Infrastructure
ChistaDATA Real-Time DATA Analytics Infrastructure
 
Cash Is Still King: ATM market research '2023
Cash Is Still King: ATM market research '2023Cash Is Still King: ATM market research '2023
Cash Is Still King: ATM market research '2023
 
AI for Sustainable Development Goals (SDGs)
AI for Sustainable Development Goals (SDGs)AI for Sustainable Development Goals (SDGs)
AI for Sustainable Development Goals (SDGs)
 
Persuasive E-commerce, Our Biased Brain @ Bikkeldag 2024
Persuasive E-commerce, Our Biased Brain @ Bikkeldag 2024Persuasive E-commerce, Our Biased Brain @ Bikkeldag 2024
Persuasive E-commerce, Our Biased Brain @ Bikkeldag 2024
 
SFBA Splunk Usergroup meeting March 13, 2024
SFBA Splunk Usergroup meeting March 13, 2024SFBA Splunk Usergroup meeting March 13, 2024
SFBA Splunk Usergroup meeting March 13, 2024
 
Elements of language learning - an analysis of how different elements of lang...
Elements of language learning - an analysis of how different elements of lang...Elements of language learning - an analysis of how different elements of lang...
Elements of language learning - an analysis of how different elements of lang...
 
Mapping the pubmed data under different suptopics using NLP.pptx
Mapping the pubmed data under different suptopics using NLP.pptxMapping the pubmed data under different suptopics using NLP.pptx
Mapping the pubmed data under different suptopics using NLP.pptx
 
Master's Thesis - Data Science - Presentation
Master's Thesis - Data Science - PresentationMaster's Thesis - Data Science - Presentation
Master's Thesis - Data Science - Presentation
 

Propagation of Policies in Rich Data Flows

  • 1. Propagation of Policies in Rich Data Flows 1 Enrico Daga†  Mathieu d’Aquin†  Aldo Gangemi‡  Enrico Motta†     †  Knowledge  Media  Ins2tute,  The  Open  University  (UK)   ‡  Université  Paris13  (France)  and  ISTC-­‐CNR  (Italy)   The  8th  Interna2onal  Conference  on  Knowledge  Capture  (K-­‐CAP  2015)   October  10th,  2015  -­‐  Palisades,  NY  (USA)   hRp://www.k-­‐cap2015.org/ Feedback  welcome:  @enridaga  #kmiou
  • 2. Motivation • Governing the life cycle of data on the web is a challenging issue for organisations and users. • Assessing what policies on input data propagate to the output of a process is a crucial problem. 2
  • 3. Policies 3 Foundations Constraints and permissions set by the data owner regarding the reuse of the data, ie. mostly licences. We can describe licences/policies (RDF+ODRL). RDF License Database http://datahub.io/dataset/rdflicense Describes ~140 licenses using RDF and the Open Digital Rights Language (ODRL). Reports 113 policies. lic:cc-by-nc4.0 a odrl:Policy ; rdfs:label "CC-BY-NC" ; odrl:permission [ odrl:action cc:Distribution, ldr:extraction , ldr:reutilization , cc:DerivativeWorks , cc:Reproduction ; odrl:duty [ odrl:action cc:Attribution , cc:Notice ] ] ; odrl:prohibition [ odrl:action cc:CommercialUse ]
  • 4. Objective We need to understand how these policies propagate in data flows! 4
  • 5. Data flows 5 Foundations What are the semantic relations between input and output? Data flows can be thought as graphs of data objects. Datanode is an ontology for data centric description of applications. Built as hierarchy of relations. More then 100 relations so far. http://purl.org/datanode/ns/ http://purl.org/datanode/docs/
  • 6. Policy Propagation Rule (PPR) 6 Relying on Datanode for an enumeration of the possible relations and on the RDF License Database for the possible policies, we can setup rules like the following: A Horn clauses of the form: propagates(odrl:duty cc:Attribution, dn:isCopyOf) For example: It can be simplified as: Foundations
  • 7. Problem A description of policies and data flows implies a huge number of Policy Propagation Rules to be specified and computed (number of possible policies times number of possible relations between data objects). How to abstract this KB to make the management and reasoning on policy propagation rules easier? 7
  • 8. Contributions (1) A methodology to obtain an abstraction that allows to reduce the number of rules significantly (using an Ontology). (2) Evaluate how effective this methodology is when using the Datanode ontology. (3) Demonstrate how this ontology can evolve in order to better represent the behaviour of Policy Propagation Rules. 8
  • 9. (A)AAAA Methodology 9 1.Aquire rules 2.Analyse the rules: find clusters using Formal Concept Analysis 3.Abstract the rules: match clusters & ontology hierarchy 4.Assess the compression, and diagnose errors or refinements in the rules or the ontology 5.Adjust the rules or the ontology repeat from 2.
  • 10. Preparing the Rules Base • This phase required a manual supervision of all associations between policies and relations in order to establish the initial set of propagation rules. • We used Contento, it was possible to prepare manually the rule base with a reasonable effort. • The initial knowledge base was then composed of 3363 Policy Propagation Rules 10 Acquisition
  • 11. Formal Concept Analysis (FCA) • Input is a Formal Context (a binary matrix of objects/attributes) • Basic unit is a Close Concept: – (O,A) => (Extension,Intension) – Closure operator ’ … (O,A) is a concept when O’=A and A’=O • Classifies concepts hierarchically in a concept lattice – Top: all objects, no attr, bottom: all attributes, no obj 11 Analysis
  • 12. Applying FCA to the Rule Base 80 concepts Clusters of rules Relations that have a common behaviour: they propagate the same policies. But why do they do it? 12 Analysis
  • 13. Detect matches with the ontology 13 Abstraction Search for matches between concepts and branches taken from the ontology hierarchy. When found, subtract the rules from the KB accordingly.
  • 14. Example/1 14 Abstraction dn:hasPart and dn:isVocabularyOf are valid abstractions dn:isPartOf is not, because dn:isSelectionOf apparently does not propagate (all) the policies…
  • 15. Example/2 15 Abstraction dn:hasPart (49 rules) propagates(dn:hasPart,duty  cc:ARribu2on)   propagates(dn:hasPart,duty  cc:Copyle^)   propagates(dn:hasPart,duty  cc:No2ce)   propagates(dn:hasPart,duty  cc:SourceCode)   propagates(dn:hasPart,duty  odrl:aRachPolicy)   propagates(dn:hasPart,duty  odrl:aRachSource)   propagates(dn:hasPart,duty  odrl:aRribute) propagates(dn:hasSec2on,duty  cc:ARribu2on)   propagates(dn:hasSec2on,duty  cc:Copyle^)   propagates(dn:hasSec2on,duty  cc:No2ce)   propagates(dn:hasSec2on,duty  cc:SourceCode)   propagates(dn:hasSec2on,duty  odrl:aRachPolicy)   propagates(dn:hasSec2on,duty  odrl:aRachSource)   propagates(dn:hasSec2on,duty  odrl:aRribute)   propagates(dn:hasSelec2on,duty  cc:ARribu2on)   propagates(dn:hasSelec2on,duty  cc:Copyle^)   propagates(dn:hasSelec2on,duty  cc:No2ce)   propagates(dn:hasSelec2on,duty  cc:SourceCode)   propagates(dn:hasSelec2on,duty  odrl:aRachPolicy)   propagates(dn:hasSelec2on,duty  odrl:aRachSource)   propagates(dn:hasSelec2on,duty  odrl:aRribute)   propagates(dn:hasSample,duty  cc:ARribu2on)   propagates(dn:hasSample,duty  cc:Copyle^)   propagates(dn:hasSample,duty  cc:No2ce)   propagates(dn:hasSample,duty  cc:SourceCode)   propagates(dn:hasSample,duty  odrl:aRachPolicy)   propagates(dn:hasSample,duty  odrl:aRachSource)   propagates(dn:hasSample,duty  odrl:aRribute)   propagates(dn:hasPor2on,duty  cc:ARribu2on)   propagates(dn:hasPor2on,duty  cc:Copyle^)   propagates(dn:hasPor2on,duty  cc:No2ce)   propagates(dn:hasPor2on,duty  cc:SourceCode)   propagates(dn:hasPor2on,duty  odrl:aRachPolicy)   propagates(dn:hasPor2on,duty  odrl:aRachSource)   propagates(dn:hasPor2on,duty  odrl:aRribute)   propagates(dn:hasIden2fiers,duty  cc:ARribu2on)   propagates(dn:hasIden2fiers,duty  cc:Copyle^)   propagates(dn:hasIden2fiers,duty  cc:No2ce)   propagates(dn:hasIden2fiers,duty  cc:SourceCode)   propagates(dn:hasIden2fiers,duty  odrl:aRachPolicy)   propagates(dn:hasIden2fiers,duty  odrl:aRachSource)   propagates(dn:hasIden2fiers,duty  odrl:aRribute)   propagates(dn:hasExample,duty  cc:ARribu2on)   propagates(dn:hasExample,duty  cc:Copyle^)   propagates(dn:hasExample,duty  cc:No2ce)   propagates(dn:hasExample,duty  cc:SourceCode)   propagates(dn:hasExample,duty  odrl:aRachPolicy)   propagates(dn:hasExample,duty  odrl:aRachSource)   propagates(dn:hasExample,duty  odrl:aRribute) propagates(dn:isVocabularyOf,duty  cc:ARribu2on)   propagates(dn:isVocabularyOf,duty  cc:Copyle^)   propagates(dn:isVocabularyOf,duty  cc:No2ce)   propagates(dn:isVocabularyOf,duty  cc:SourceCode)   propagates(dn:isVocabularyOf,duty  odrl:aRachPolicy)   propagates(dn:isVocabularyOf,duty  odrl:aRachSource)   propagates(dn:isVocabularyOf,duty  odrl:aRribute) propagates(dn:aRributesOf,duty  cc:ARribu2on)   propagates(dn:aRributesOf,duty  cc:Copyle^)   propagates(dn:aRributesOf,duty  cc:No2ce)   propagates(dn:aRributesOf,duty  cc:SourceCode)   propagates(dn:aRributesOf,duty  odrl:aRachPolicy)   propagates(dn:aRributesOf,duty  odrl:aRachSource)   propagates(dn:aRributesOf,duty  odrl:aRribute)   propagates(dn:datatypesOf,duty  cc:ARribu2on)   propagates(dn:datatypesOf,duty  cc:Copyle^)   propagates(dn:datatypesOf,duty  cc:No2ce)   propagates(dn:datatypesOf,duty  cc:SourceCode)   propagates(dn:datatypesOf,duty  odrl:aRachPolicy)   propagates(dn:datatypesOf,duty  odrl:aRachSource)   propagates(dn:datatypesOf,duty  odrl:aRribute)   propagates(dn:descriptorsOf,duty  cc:ARribu2on)   propagates(dn:descriptorsOf,duty  cc:Copyle^)   propagates(dn:descriptorsOf,duty  cc:No2ce)   propagates(dn:descriptorsOf,duty  cc:SourceCode)   propagates(dn:descriptorsOf,duty  odrl:aRachPolicy)   propagates(dn:descriptorsOf,duty  odrl:aRachSource)   propagates(dn:descriptorsOf,duty  odrl:aRribute)   propagates(dn:typesOf,duty  cc:ARribu2on)   propagates(dn:typesOf,duty  cc:Copyle^)   propagates(dn:typesOf,duty  cc:No2ce)   propagates(dn:typesOf,duty  cc:SourceCode)   propagates(dn:typesOf,duty  odrl:aRachPolicy)   propagates(dn:typesOf,duty  odrl:aRachSource)   propagates(dn:typesOf,duty  odrl:aRribute)   propagates(dn:rela2onsOf,duty  cc:ARribu2on)   propagates(dn:rela2onsOf,duty  cc:Copyle^)   propagates(dn:rela2onsOf,duty  cc:No2ce)   propagates(dn:rela2onsOf,duty  cc:SourceCode)   propagates(dn:rela2onsOf,duty  odrl:aRachPolicy)   propagates(dn:rela2onsOf,duty  odrl:aRachSource)   propagates(dn:rela2onsOf,duty  odrl:aRribute) dn:isVocabularyOf (42 rules) 7 rules! 7 rules!
  • 16. Compression Factor 16 Assessment By applying the original Datanode ontology, 1925 rules could be removed out of 3363, for a compression factor of 0.572. We calculate the CF as the number of abstracted rules divided by the total number of rules:
  • 17. Considerations 17 Assessment 2. The Datanode ontology has not been designed for the purpose of representing a common behaviour of relations in terms of propagation of policies. It is possible to refine the ontology in order to make it cover this use case better (and possibly reduce the number of rules even more). 1. The size of the matrix that was manually supervised is large, and it is possible that errors have been made at that stage of the process.
  • 18. Observing the measures 18 Assessment concepts * relations=~9040 (partial) matches. Hard to explore! Inspecting a partial match with high precision and low recall highlights a problem that might be easy to fix, as the number of relations and policies to compare will be low.
  • 19. Operations 19 Adjustment We try to make adjustments in order to improve the compression factor. We defined a set of operations, targeted to (a) fix errors in the initial rule base and (b) refine the ontology. • Fill: makes a branch be fully in a cluster of concept c, attempting to push Pre up to 1. • Group: some relations that share a concept, but belong to different branches, are abstracted by a new relation. • Merge: two distinct branches are abstracted by a new relation. • Wedge: change the top relation of a branch to make it fully match the concept. (and we run our process again from the Analysis phase to the Assessment)
  • 20. Example: Fill 20 Adjustment … dn:isSelectionOf should indeed propagate all the policies listed in this concept. Fill adds the following rules: propagates(dn:isSelectionOf, duty cc:Attribution) propagates(dn:isSelectionOf, duty cc:Copyleft) propagates(dn:isSelectionOf, duty cc:Notice) propagates(dn:isSelectionOf, duty cc:SourceCode) propagates(dn:isSelectionOf, duty odrl:attachPolicy) propagates(dn:isSelectionOf, duty odrl:attachSource) propagates(dn:isSelectionOf, duty odrl:attribute)
  • 21. Example: Wedge 21 Adjustment … dn:sameCapabilityAs does *not* propagate all the policies listed in this concept. We Wedge dn:sameIdentityAs
  • 22. Evaluation 22 As a result we obtained: 3865 rules in total, 78 concepts, 2817 rules abstracted and 1048 rules remaining - for a compression factor of 0.729. Thanks to this methodology we have been able to fix many errors in the initial data, and to refine Datanode by clarifying the semantics of many properties and adding new ones.
  • 23. Conclusions 23 • We presented a method to abstract Policy Propagation Rules applying an ontology, the Datanode ontology, a hierarchical organisation of the possible relations between data objects. • Datanode allowed us to reduce the number of rules to a factor of 0.5. • Applying the ontology and the method we were able to find and correct errors in the rules. • Moreover we have been able to analyse the ontology in relation to this task and enhance it having as result not only a further reduction of rules - 0.7, but also a better ontology.
  • 24. Future work • Apply the rule base to specific use cases (perform a practical evaluation), and publish it for reuse. • Extend the Assessment phase of the methodology to also include consistency check between the hierarchy of the FCA lattice and the ontology. • Define additional operations to support the Adjustment phase. • Study the rule base evolution via continuous integration of new policies/actions/rules. • Apply the methodology to other use cases. Should we integrate the measures and operations of the methodology in the Contento tool? 24
  • 25. Thank you Enrico Daga Twitter: @enridaga enrico.daga@open.ac.uk
  • 26. 76Bottom-Up Ontology Construction with CONTENTO http://bit.ly/contento-tool Contento supports the user in the generation and curation of concept lattices to produce Semantic Web Ontologies from data. In the demo, we show how to use CONTENTO with Linked Data. Formal Context Concept Lattice Modeling (Naming & Pruning) SPARQL Export as OWL Ontology (adver2sement) @ISWC  2015  Poster  and  Demo  session,  next  week…
  • 27. Operations: Fill 27 Annex Observation: the branch is close to be fully in the concept (high Pre) Diagnosis: the branch must be fully in the concept… Effect: The Fill operation makes a branch be fully in a cluster of concept c, attempting to push Pre up to 1.
  • 28. Operations: Merge 28 Annex Observation: two distinct branches match the same concept Diagnosis: the respective top relations can be abstracted by a new common relation Effect: a new relation is added to the ontology
  • 29. Operations: Group 29 Annex Observation: A set of relations are all together in the extent of a concept, but belong to different branches. Diagnosis: they are actually related, and a common parent is missing. Effect: a new relation is added to the ontology.
  • 30. Operations: Wedge 30 Annex Observation: the top relation is missing, and it does not propagate (all) the policies of the concept. Diagnosis: the actual top relation is not a right abstraction. Effect: a new relation is added to the ontology.