0.25
0.5
0.75
1.25
1.5
1.75
2
Querying Factorized Probabilistic Triple Databases
Published on Dec 19, 20141954 Views
An increasing amount of data is becoming available in the form of large triple stores, with the Semantic Web's linked open data cloud (LOD) as one of the most prominent examples. Data quality and comp
Related categories
Chapter list
Querying Factorized Probabilistic Triple Databases00:00
Outline00:05
Knowledge Bases are Triple Stores00:45
Benefits of Exploiting Uncertainty in Knowledge Bases01:44
Challenges when Exploiting Uncertainty in Knowledge Bases02:49
Probabilistic KB Construction with RESCAL04:23
Complex Querying: Pure Extensional Query Evaluation on Factorized PKBs06:12
Querying DBpedia-Music07:12
Avoiding Independent-Project07:54
Querying DBpedia-Music09:15
Querying DBpedia-Music09:38
Summary10:08
Questions ?11:03