Hybrid Acquisition of Temporal Scopes for RDF Data
|
|
- Camilla Carroll
- 5 years ago
- Views:
Transcription
1 Hybrid Acquisition of Temporal Scopes for RDF Data Anisa Rula 1, Matteo Palmonari 1, Axel-Cyrille Ngonga Ngomo 2, Daniel Gerber 2, Jens Lehmann 2, and Lorenz Bühmann 2 1. University of Milano-Bicocca, SITI Lab 2. Universität Leipzig, Institut für Informatik, AKSW
2 Anisa Rula 2 Outline 1. Introduction & Motivation 2. Approach Overview 3. Details of the Approach 4. Experimental Evaluation 5. Conclusions
3 Anisa Rula 3 Temporal Scoping of RDF triples
4 Temporal Scoping of RDF triples Some facts are always valid while other facts are valid for a certain time interval (volatile facts) Anisa Rula 3
5 Anisa Rula 3 Temporal Scoping of RDF triples Some facts are always valid while other facts are valid for a certain time interval (volatile facts) Volatile facts are represented by triples whose validity is defined by a time interval i.e. the temporal scope
6 Anisa Rula 3 Temporal Scoping of RDF triples Some facts are always valid while other facts are valid for a certain time interval (volatile facts) Volatile facts are represented by triples whose validity is defined by a time interval i.e. the temporal scope team A.C. Milan Alexandre Pato team S.C. Corinthians
7 Anisa Rula 3 Temporal Scoping of RDF triples Some facts are always valid while other facts are valid for a certain time interval (volatile facts) Volatile facts are represented by triples whose validity is defined by a time interval i.e. the temporal scope Temporal scopes, represented by time intervals team A.C. Milan Alexandre Pato team S.C. Corinthians
8 Anisa Rula 3 Temporal Scoping of RDF triples Some facts are always valid while other facts are valid for a certain time interval (volatile facts) Volatile facts are represented by triples whose validity is defined by a time interval i.e. the temporal scope Temporally annotated RDF triples Temporal scopes, represented by time intervals team A.C. Milan Alexandre Pato team S.C. Corinthians
9 Motivation & Challenges Motivation Anisa Rula 4
10 Motivation & Challenges Motivation World changes: relations represented in RDF triples may be valid only for a specific time interval [Gutierrez et al.,2005] o E.g. <Alexandre_Pato, team, A.C._Milan> [2007,2013] Anisa Rula 4
11 Motivation & Challenges Motivation World changes: relations represented in RDF triples may be valid only for a specific time interval [Gutierrez et al.,2005] o E.g. <Alexandre_Pato, team, A.C._Milan> [2007,2013] Many applications have to use temporally annotated RDF triples o E.g. Temporal Query Answering, Question Answering over KBs, Temporal Reasoning, Timelines Anisa Rula 4
12 Anisa Rula 4 Motivation & Challenges Motivation World changes: relations represented in RDF triples may be valid only for a specific time interval [Gutierrez et al.,2005] Temporally annotated RDF triples are largely unavailable or incomplete in the LOD o E.g. <Alexandre_Pato, team, A.C._Milan> [2007,2013] Many applications have to use temporally annotated RDF triples o E.g. Temporal Query Answering, Question Answering over KBs, Temporal (Rula et al., 2012) Reasoning, Timelines
13 Anisa Rula 4 Motivation & Challenges Motivation World changes: relations represented in RDF triples may be valid only for a specific time interval [Gutierrez et al.,2005] Temporally annotated RDF triples are largely unavailable or incomplete in the LOD o E.g. <Alexandre_Pato, team, A.C._Milan> [2007,2013] Many applications have to use temporally annotated RDF triples o E.g. Temporal Query Answering, Question Answering over KBs, Temporal (Rula et al., 2012) Reasoning, Timelines Challenges
14 Anisa Rula 4 Motivation & Challenges Motivation World changes: relations represented in RDF triples may be valid only for a specific time interval [Gutierrez et al.,2005] Temporally annotated RDF triples are largely unavailable or incomplete in the LOD o E.g. <Alexandre_Pato, team, A.C._Milan> [2007,2013] Many applications have to use temporally annotated RDF triples o E.g. Temporal Query Answering, Question Answering over KBs, Temporal (Rula et al., 2012) Reasoning, Timelines Challenges Low availability and quality of temporal information in RDF data
15 Anisa Rula 4 Motivation & Challenges Motivation World changes: relations represented in RDF triples may be valid only for a specific time interval [Gutierrez et al.,2005] Temporally annotated RDF triples are largely unavailable or incomplete in the LOD o E.g. <Alexandre_Pato, team, A.C._Milan> [2007,2013] Many applications have to use temporally annotated RDF triples o E.g. Temporal Query Answering, Question Answering over KBs, Temporal (Rula et al., 2012) Reasoning, Timelines Challenges Low availability and quality of temporal information in RDF data NLP challenges for web-scale temporal information extraction (scalability, availability of corpus, conflicting information) [Derczynsk et al., 2013, Ling et al., 2010]
16 Approach Overview: Use the Web as Source of Evidence Anisa Rula Anisa Rula 5 Use evidence from the Web for temporal scoping of RDF triples team A.C. Milan Alexandre Pato team S.C. Corinthians
17 Approach Overview: Use the Web as Source of Evidence Anisa Rula Anisa Rula 5 Use evidence from the Web for temporal scoping of RDF triples team A.C. Milan Alexandre Pato team S.C. Corinthians Source of evidence Web of Data - RDF (61.9 Billion) World Wide Web (1.8 Billion)
18 Approach Overview: Use the Web as Source of Evidence Anisa Rula Anisa Rula 5 Use evidence from the Web for temporal scoping of RDF triples team A.C. Milan Alexandre Pato team S.C. Corinthians Source of evidence Web of Data - RDF (61.9 Billion) World Wide Web (1.8 Billion)
19 Approach Overview: Use the Web as Source of Evidence Anisa Rula Anisa Rula 5 Use evidence from the Web for temporal scoping of RDF triples team A.C. Milan Alexandre Pato team S.C. Corinthians Source of evidence Web of Data - RDF (61.9 Billion) World Wide Web (1.8 Billion) Temporally annotated RDF triples Alexandre Pato team team A.C. Milan S.C. Corinthians
20 Approach Overview: Hybrid Acquisition of Time Scopes Anisa Rula 6 Temporal Information Extraction Mapping facts to time intervals Temporally annotated RDF triples t 1 occ 1 t 2 occ 2 Web of Documents t 3 occ 3 t 4 occ 4 Matching Selection <s,p,o> fact <s,p,o>[x 1,y 1 ],,[x n,y n ] Reasoning Set of disconnected time intervals Web of Data
21 Anisa Rula 7 Temporal Information Extraction - Web Documents DeFacto [Lehmann & al. 2012] Retrieves a set of webpages that confirm the given RDF triple The RDF triple issued to the search engine is verbalized by using natural language patterns Temporal Extension for DeFacto (TempDeFacto) Apply Named Entity Tagger to extract the entities of type Date class Observe the occurrences of the labels of the subject and object in less than 20 tokens Analyze the context window of n characters before and after subjectobject occurrences in order to retrieve the time points Return a distribution vector of date and their number of occurrences
22 Anisa Rula 8 Temporal Information Extraction - Web Documents <Alexandre_Pato,team, A.C._Milan>
23 Anisa Rula 8 Temporal Information Extraction - Web Documents <Alexandre_Pato,team, A.C._Milan>
24 Anisa Rula 8 Temporal Information Extraction - Web Documents <Alexandre_Pato,team, A.C._Milan> Occurrences of the labels of the subject and object Alexandre Pato played for A.C. Milan Pato s striker Milan CR7 Mi
25 Anisa Rula 8 Temporal Information Extraction - Web Documents <Alexandre_Pato,team, A.C._Milan> Occurrences of the labels of the subject and object Alexandre Pato played for A.C. Milan Pato s striker Milan CR7 Mi Context window of n characters before and after subject-object occurrences Pato played for A.C. Milan from 2007 to A.C. Milan s top striker Pato left in In 2013 Pato visited Milan for a short holiday.
26 Anisa Rula 8 Temporal Information Extraction - Web Documents <Alexandre_Pato,team, A.C._Milan> Occurrences of the labels of the subject and object Alexandre Pato played for A.C. Milan Pato s striker Milan CR7 Mi Context window of n characters before and after subject-object occurrences Pato played for A.C. Milan from 2007 to A.C. Milan s top striker Pato left in In 2013 Pato visited Milan for a short holiday. Named Entity Tagger
27 Anisa Rula 8 Temporal Information Extraction - Web Documents <Alexandre_Pato,team, A.C._Milan> Occurrences of the labels of the subject and object Alexandre Pato played for A.C. Milan Pato s striker Milan CR7 Mi Context window of n characters before and after subject-object occurrences Pato played for A.C. Milan from 2007 to A.C. Milan s top striker Pato left in In 2013 Pato visited Milan for a short holiday. Named Entity Tagger DeFacto Vector (dfv)
28 Anisa Rula 9 Temporal Information Extraction - Web of Data Content negotiation <Alexandre_Pato> RDF document d Alexandre_Pato The set of time intervals for a given triple with starting and ending time points defined with the set of relevant time points Regular expressions T Alexandre_Pato Relevant Time Points = {1989, 2000, 2006, 2007, 2008, 2013}
29 Anisa Rula 9 Temporal Information Extraction - Web of Data Content negotiation <Alexandre_Pato> RDF document d Alexandre_Pato The set of time intervals for a given triple with starting and ending time points defined with the set of relevant time points Relevant Interval Matrix (RIM) Regular expressions null null null null null null 0 null null null null null 0 0 null null null null null null null null null null T Alexandre_Pato Relevant Time Points = {1989, 2000, 2006, 2007, 2008, 2013} rrrrrr ttii tt jj RRRRRR ee wwwwwww ii, jj > 0 ffffff ii jj rrrrrr ttii tt jj = nnnnnnnn ffffff ii > jj rrrrrr ttii tt jj = 0
30 Anisa Rula 10 Mapping Facts to Time Intervals - Matching 1. Matching temporal distribution (dfv) against the relevant time interval matrix dfv RIM null null null null null null RDF data null null null null null null null null null null null null null null null Matching Selection Reasoning
31 Anisa Rula 10 Mapping Facts to Time Intervals - Matching 1. Matching temporal distribution (dfv) against the relevant time interval matrix dfv null null null null null null RDF data RIM null null null null null null null null null null null null null null null Matching Selection Reasoning Significance Matrix (SM)
32 Anisa Rula 10 Mapping Facts to Time Intervals - Matching 1. Matching temporal distribution (dfv) against the relevant time interval matrix dfv null null null null null null RDF data RIM null null null null null null null null null null null null null null null Matching Selection Reasoning Significance Matrix (SM) ssss 2007:2008 = = 6.5
33 Anisa Rula 11 Mapping Facts to Time Intervals - Selection 2. Mapping Selection: Matching top-k function: selects the k intervals that have highest scores in the SM neighbor-x: selects a set of intervals whose significance score is close to the maximum significance score in the SM matrix, up to a certain threshold x neighbor-k-x: selects the top-k intervals in the neighborhood of the interval with higher significance score Selection Reasoning SM
34 Anisa Rula 11 Mapping Facts to Time Intervals - Selection 2. Mapping Selection: Matching top-k function: selects the k intervals that have highest scores in the SM neighbor-x: selects a set of intervals whose significance score is close to the maximum significance score in the SM matrix, up to a certain threshold x neighbor-k-x: selects the top-k intervals in the neighborhood of the interval with higher significance score Selection Reasoning SM top-k, kk = 3 [2006,2013][2007, 2013][2008, 2013]
35 Anisa Rula 11 Mapping Facts to Time Intervals - Selection 2. Mapping Selection: Matching top-k function: selects the k intervals that have highest scores in the SM neighbor-x: selects a set of intervals whose significance score is close to the maximum significance score in the SM matrix, up to a certain threshold x neighbor-k-x: selects the top-k intervals in the neighborhood of the interval with higher significance score Selection Reasoning 1989 SM top-k, kk = 3 [2006,2013][2007, 2013][2008, 2013] neighbor, xx = 23 [2007,2008][2006,2013][2007, 2013][2008, 2013]
36 Anisa Rula 11 Mapping Facts to Time Intervals - Selection 2. Mapping Selection: Matching top-k function: selects the k intervals that have highest scores in the SM neighbor-x: selects a set of intervals whose significance score is close to the maximum significance score in the SM matrix, up to a certain threshold x neighbor-k-x: selects the top-k intervals in the neighborhood of the interval with higher significance score Selection Reasoning SM top-k, kk = 3 [2006,2013][2007, 2013][2008, 2013] neighbor, xx = 23 [2007,2008][2006,2013][2007, 2013][2008, 2013] neighbor-k-x, kk = 2, xx = 23 [2007, 2013][2008, 2013]
37 Anisa Rula 11 Mapping Facts to Time Intervals - Selection 2. Mapping Selection: Matching top-k function: selects the k intervals that have highest scores in the SM neighbor-x: selects a set of intervals whose significance score is close to the maximum significance score in the SM matrix, up to a certain threshold x neighbor-k-x: selects the top-k intervals in the neighborhood of the interval with higher significance score Selection Reasoning SM top-k, kk = 3 [2006,2013][2007, 2013][2008, 2013] neighbor, xx = 23 [2007,2008][2006,2013][2007, 2013][2008, 2013] neighbor-k-x, kk = 2, xx = 23 [2007, 2013][2008, 2013]
38 Anisa Rula 12 Mapping Facts to Time Intervals - Reasoning 3. Interval merging via reasoning based on Allen s algebra relation Matching Selection Reasoning
39 Anisa Rula 12 Mapping Facts to Time Intervals - Reasoning 3. Interval merging via reasoning based on Allen s algebra relation Matching Selection Reasoning [2007, 2013][2008, 2013] [ ] <Alexander_Pato,playsFor, A.C._Milan>
40 Anisa Rula 13 Experimental Setup - Dataset Dataset: 2500 DBpedia triples with semantic equivalent triples in Freebase and Yago2 Dataset # facts Domain Property Equivalent Property Freebase Yago2 DBpedia 1000 Sport team team playsfor DBpedia 1000 Politicians office government_positions_held holdspoliticalposition DBpedia 500 Celebrities spouse spouse ismarriedto Gold standard: triples annotated with temporal scopes in Yago2 manually curated to correct missing or wrong values
41 Experimental Setup - Evaluation Measures The evaluation measures capture the degree of overlap between the retrieved intervals and the intervals in the gold standard R Ref Precision (for a triple): number of time points in the temporal scope that fall into the time interval in the gold standard Recall (for a triple): number of time points in the gold standard that are covered by the temporal scope F1 measure (for a triple): the harmonic mean of precision and recall Anisa Rula 14
42 Anisa Rula 14 Experimental Setup - Evaluation Measures The evaluation measures capture the degree of overlap between the retrieved intervals and the intervals in the gold standard R Ref F1= F1= F1= Precision (for a triple): number of time points in the temporal scope that fall into the time interval in the gold standard Recall (for a triple): number of time points in the gold standard that are covered by the temporal scope F1 measure (for a triple): the harmonic mean of precision and recall
43 Anisa Rula 14 Experimental Setup - Evaluation Measures The evaluation measures capture the degree of overlap between the retrieved intervals and the intervals in the gold standard R Ref F1= F1= F1= Precision (for a triple): number of time points in the temporal scope that fall into the time interval in the gold standard Recall (for a triple): number of time points in the gold standard that are covered by the temporal scope F1 measure (for a triple): the harmonic mean of precision and recall Macro-averaged F1 (avgf-1): aggregated measure for a set of triples
44 Experimental Results - Accuracy of Best Configurations for all Properties Different sources for the creation of the RIM Setup different configurations in the selection and reasoning steps: o E.g. config top-3 refers to selection function top-3 and reasoning = yes Temp prop DBpedia Freebase TemporalDeFacto Config #facts avgf1 Config #facts avgf1 Config #facts avgf1 playsfor top-1 loc top-1 loc top holdspolitica lposition neigh neigh top ismarriedto neigh neigh top Good quality of the approach with an avgf1 of up to 70% Using evidence from RDF documents the performance can be significantly improved (significantly better results for two properties and negligibly worst results for one property) Anisa Rula 15
45 Anisa Rula 16 Experimental Results - Accuracy with vs. without Reasoning for all Properties The best configurations for the three properties Temp prop Source Configuration With reasoning Without reasoning #fact avgf1 #fact avgf1 playsfor TempDeFacto top holdspoliticalposition DBpedia neigh ismarriedto DBpedia neigh The best results are obtained when reasoning is enabled
46 Conclusions & Future Work Anisa Rula 17
47 Conclusions & Future Work Summary Temporal extension of the DeFacto framework Modeling a space of relevant time intervals given an RDF triple Mapping volatile facts to time intervals based on a three-phase algorithm Unsupervised method Anisa Rula 17
48 Conclusions & Future Work Summary Temporal extension of the DeFacto framework Modeling a space of relevant time intervals given an RDF triple Mapping volatile facts to time intervals based on a three-phase algorithm Unsupervised method Future work Anisa Rula 17
49 Conclusions & Future Work Summary Temporal extension of the DeFacto framework Modeling a space of relevant time intervals given an RDF triple Mapping volatile facts to time intervals based on a three-phase algorithm Unsupervised method Future work Determine when to add or not to add the temporal scope based on the confidence of the acquisition process Collect additional relevant time points to improve the overall results Show the effectiveness of acquired temporal scopes in temporal query answering Anisa Rula 17
50 Anisa Rula 18 Thank you for your attention Question? #eswc2014rula
51 References [Rula&2012] Anisa Rula, Matteo Palmonari, Andreas Harth, Steffen Stadtmüller, Andrea Maurino: On the Diversity and Availability of Temporal Information in Linked Open Data. International Semantic Web Conference (1) 2012: [Gutiérrez&2005] C. Gutierrez, C. A. Hurtado, and A. A. Vaisman. Temporal RDF. In The 2 nd ESWC, pages , 2005 [Lehmann&2012] Jens Lehmann, Daniel Gerber, Mohamed Morsey, Axel-Cyrille Ngonga Ngomo: DeFacto - Deep Fact Validation. International Semantic Web Conference (1) 2012: [Ling&2010] X. Ling and D. S. Weld. Temporal information extraction. In 25th AAAI, [Derczynsk&2013] L. Derczynski and R. Gaizauskas. Information retrieval for temporal bounding. In 4th ICTIR, pages 29:129 29:130. ACM, Anisa Rula 19
52 Approach Overview: Time Interval Representation and Relevant Interval Matrix When does <Alexander_Pato,playsFor, A.C._Milan>? All possible time intervals from all possible time points Triangular Matrix Vector of time points now now Relevant time intervals from a set of relevant time points Intuition: use evidence from the Web to reduce the set of considered time intervals and to identify the most significance time intervalanisa Rula 20
53 Experimental Results - Accuracy with Different Selection Functions Dataset: DBpedia and property:<holdspoliticalposition> 1 0,9 0,8 0,7 0,6 0,5 0,4 0,3 0,2 0,1 0 precision recall F1 top-k, k = 1 0,686 0,654 0,67 top-k, k = 2 0,515 0,865 0,645 top-k, k = 3 0,426 0,924 0,583 neighbor x = 10 0,689 0,709 0,699 For higher k in top-k selection, recall increases while precision decreases Best precision-recall trade-off with neighbor-x, x=10 Anisa Rula 21
Capturing the Currency of DBpedia Descriptions and Get Insight into their Validity
Capturing the Currency of DBpedia Descriptions and Get Insight into their Validity Anisa Rula 1, Luca Panziera 2, Matteo Palmonari 1, and Andrea Maurino 1 1 University of Milano-Bicocca {rula palmonari
More informationCapturing the Age of Linked Open Data: Towards a Dataset-independent Framework
Capturing the Age of Linked Open Data: Towards a Dataset-independent Framework Anisa Rula University of Milano Bicocca Milano, Italy rula@disco.unimib.it Matteo Palmonari University of Milano Bicocca Milano,
More informationRADON2: A buffered-intersection Matrix Computing Approach To Accelerate Link Discovery Over Geo-Spatial RDF Knowledge Bases
RADON2: A buffered-intersection Matrix Computing Approach To Accelerate Link Discovery Over Geo-Spatial RDF Knowledge Bases OAEI2018 Results Abdullah Fathi Ahmed 1 Mohamed Ahmed Sherif 1,2 and Axel-Cyrille
More informationPresented by: Dimitri Galmanovich. Petros Venetis, Alon Halevy, Jayant Madhavan, Marius Paşca, Warren Shen, Gengxin Miao, Chung Wu
Presented by: Dimitri Galmanovich Petros Venetis, Alon Halevy, Jayant Madhavan, Marius Paşca, Warren Shen, Gengxin Miao, Chung Wu 1 When looking for Unstructured data 2 Millions of such queries every day
More informationQAKiS: an Open Domain QA System based on Relational Patterns
QAKiS: an Open Domain QA System based on Relational Patterns Elena Cabrio, Julien Cojan, Alessio Palmero Aprosio, Bernardo Magnini, Alberto Lavelli, Fabien Gandon To cite this version: Elena Cabrio, Julien
More informationTowards Summarizing the Web of Entities
Towards Summarizing the Web of Entities contributors: August 15, 2012 Thomas Hofmann Director of Engineering Search Ads Quality Zurich, Google Switzerland thofmann@google.com Enrique Alfonseca Yasemin
More informationSchema-aware feature selection in Linked Data-based recommender systems (Extended Abstract)
Schema-aware feature selection in Linked Data-based recommender systems (Extended Abstract) Corrado Magarelli 1, Azzurra Ragone 1, Paolo Tomeo 2, Tommaso Di Noia 2, Matteo Palmonari 1, Andrea Maurino 1,
More informationHandling time in RDF
Time in RDF p. 1/15 Handling time in RDF Claudio Gutierrez (Joint work with C. Hurtado and A. Vaisman) Department of Computer Science Universidad de Chile UPM, Madrid, January 2009 Time in RDF p. 2/15
More informationGERBIL s New Stunts: Semantic Annotation Benchmarking Improved
GERBIL s New Stunts: Semantic Annotation Benchmarking Improved Michael Röder, Ricardo Usbeck, and Axel-Cyrille Ngonga Ngomo AKSW Group, University of Leipzig, Germany roeder usbeck ngonga@informatik.uni-leipzig.de
More informationEntity and Knowledge Base-oriented Information Retrieval
Entity and Knowledge Base-oriented Information Retrieval Presenter: Liuqing Li liuqing@vt.edu Digital Library Research Laboratory Virginia Polytechnic Institute and State University Blacksburg, VA 24061
More informationOn the Effect of Geometries Simplification on Geo-spatial Link Discovery
On the Effect of Geometries Simplification on Geo-spatial Link Discovery Abdullah Fathi Ahmed 1, Mohamed Ahmed Sherif 1,2, and Axel-Cyrille Ngonga Ngomo 1,2 1 Department of Computer Science, University
More informationRe-contextualization and contextual Entity exploration. Sebastian Holzki
Re-contextualization and contextual Entity exploration Sebastian Holzki Sebastian Holzki June 7, 2016 1 Authors: Joonseok Lee, Ariel Fuxman, Bo Zhao, and Yuanhua Lv - PAPER PRESENTATION - LEVERAGING KNOWLEDGE
More informationDeFacto - Deep Fact Validation
DeFacto - Deep Fact Validation Jens Lehmann, Daniel Gerber, Mohamed Morsey, and Axel-Cyrille Ngonga Ngomo Universität Leipzig, Institut für Informatik, AKSW, Postfach 100920, D-04009 Leipzig, Germany {lehmann,dgerber,morsey,ngonga}@informatik.uni-leipzig.de
More informationA Deductive System for Annotated RDFS
A Deductive System for Annotated RDFS DERI Institute Meeting Umberto Straccia Nuno Lopes Gergely Lukácsy Antoine Zimmermann Axel Polleres Presented by: Nuno Lopes May 28, 2010 Annotated RDFS Example Annotated
More informationEnriching an Academic Knowledge base using Linked Open Data
Enriching an Academic Knowledge base using Linked Open Data Chetana Gavankar 1,2 Ashish Kulkarni 1 Yuan Fang Li 3 Ganesh Ramakrishnan 1 (1) IIT Bombay, Mumbai, India (2) IITB-Monash Research Academy, Mumbai,
More informationAnswering Boolean Hybrid Questions with HAWK
Answering Boolean Hybrid Questions with HAWK Ricardo Usbeck 1, Erik Körner 1, and Axel-Cyrille Ngonga Ngomo 1 University of Leipzig, Germany {usbeck,ngonga}@informatik.uni-leipzig.de Abstract. The decentral
More informationChinese Event Extraction 杨依莹. 复旦大学大数据学院 School of Data Science, Fudan University
Chinese Event Extraction 杨依莹 2017.11.22 大纲 1 ACE program 2 Assignment 3: Chinese event extraction 3 CRF++: Yet Another CRF toolkit ACE program Automatic Content Extraction (ACE) program: The objective
More informationLearning Ontology-Based User Profiles: A Semantic Approach to Personalized Web Search
1 / 33 Learning Ontology-Based User Profiles: A Semantic Approach to Personalized Web Search Bernd Wittefeld Supervisor Markus Löckelt 20. July 2012 2 / 33 Teaser - Google Web History http://www.google.com/history
More informationLazy Big Data Integration
Lazy Big Integration Prof. Dr. Andreas Thor Hochschule für Telekommunikation Leipzig (HfTL) Martin-Luther-Universität Halle-Wittenberg 16.12.2016 Agenda Integration analytics for domain-specific questions
More informationAnnotating Spatio-Temporal Information in Documents
Annotating Spatio-Temporal Information in Documents Jannik Strötgen University of Heidelberg Institute of Computer Science Database Systems Research Group http://dbs.ifi.uni-heidelberg.de stroetgen@uni-hd.de
More informationKnowledge Verification for Long-Tail Verticals
Knowledge Verification for Long-Tail Verticals Furong Li Xin Luna Dong Anno Langen Yang Li National University of Singapore Amazon Google Inc. furongli@comp.nus.edu.sg lunadong@amazon.com {arl, ngli}@google.com
More informationCIRGDISCO at RepLab2012 Filtering Task: A Two-Pass Approach for Company Name Disambiguation in Tweets
CIRGDISCO at RepLab2012 Filtering Task: A Two-Pass Approach for Company Name Disambiguation in Tweets Arjumand Younus 1,2, Colm O Riordan 1, and Gabriella Pasi 2 1 Computational Intelligence Research Group,
More informationScalable Knowledge Harvesting with High Precision and High Recall. Ndapa Nakashole Martin Theobald Gerhard Weikum
Scalable Knowledge Harvesting with High Precision and High Recall Ndapa Nakashole Martin Theobald Gerhard Weikum Web Knowledge Harvesting Goal: To organise text into precise facts Alex Rodriguez A.Rodriguez
More informationAnalyzing the performance of top-k retrieval algorithms. Marcus Fontoura Google, Inc
Analyzing the performance of top-k retrieval algorithms Marcus Fontoura Google, Inc This talk Largely based on the paper Evaluation Strategies for Top-k Queries over Memory-Resident Inverted Indices, VLDB
More informationFederated Query Processing: Challenges and Opportunities
Federated Query Processing: Challenges and Opportunities Axel-Cyrille Ngonga Ngomo and Muhammad Saleem Universität Leipzig, IFI/AKSW, PO 100920, D-04009 Leipzig {lastname}@informatik.uni-leipzig.de Abstract.
More informationJianyong Wang Department of Computer Science and Technology Tsinghua University
Jianyong Wang Department of Computer Science and Technology Tsinghua University jianyong@tsinghua.edu.cn Joint work with Wei Shen (Tsinghua), Ping Luo (HP), and Min Wang (HP) Outline Introduction to entity
More informationA rule-based approach to address semantic accuracy problems on Linked Data
A rule-based approach to address semantic accuracy problems on Linked Data (ISWC 2014 - Doctoral Consortium) Leandro Mendoza 1 LIFIA, Facultad de Informática, Universidad Nacional de La Plata, Argentina
More informationAssisted Policy Management for SPARQL Endpoints Access Control
Assisted Policy Management for SPARQL Endpoints Access Control Luca Costabello, Serena Villata, Iacopo Vagliano, Fabien Gandon To cite this version: Luca Costabello, Serena Villata, Iacopo Vagliano, Fabien
More informationSemantic Web and Natural Language Processing
Semantic Web and Natural Language Processing Wiltrud Kessler Institut für Maschinelle Sprachverarbeitung Universität Stuttgart Semantic Web Winter 2014/2015 This work is licensed under a Creative Commons
More informationLinking Entities in Chinese Queries to Knowledge Graph
Linking Entities in Chinese Queries to Knowledge Graph Jun Li 1, Jinxian Pan 2, Chen Ye 1, Yong Huang 1, Danlu Wen 1, and Zhichun Wang 1(B) 1 Beijing Normal University, Beijing, China zcwang@bnu.edu.cn
More informationDomain Independent Knowledge Base Population From Structured and Unstructured Data Sources
Domain Independent Knowledge Base Population From Structured and Unstructured Data Sources Michelle Gregory, Liam McGrath, Eric Bell, Kelly O Hara, and Kelly Domico Pacific Northwest National Laboratory
More informationSemantic Integration of Indian Open Government Data using Linked Open Data. Vision of future technologies Abstract ID: PMIBC
Semantic Integration of Indian Open Government Data using Linked Open Data Vision of future technologies Abstract ID: PMIBC-7-2-009 CONTENTS ABSTRACT... 3 INTRODUCTION... 3 SEMANTIC WEB APPLICATIONS AN
More informationEvaluation Measures. Sebastian Pölsterl. April 28, Computer Aided Medical Procedures Technische Universität München
Evaluation Measures Sebastian Pölsterl Computer Aided Medical Procedures Technische Universität München April 28, 2015 Outline 1 Classification 1. Confusion Matrix 2. Receiver operating characteristics
More informationIterative Learning of Relation Patterns for Market Analysis with UIMA
UIMA Workshop, GLDV, Tübingen, 09.04.2007 Iterative Learning of Relation Patterns for Market Analysis with UIMA Sebastian Blohm, Jürgen Umbrich, Philipp Cimiano, York Sure Universität Karlsruhe (TH), Institut
More informationWhat you have learned so far. Interoperability. Ontology heterogeneity. Being serious about the semantic web
What you have learned so far Interoperability Introduction to the Semantic Web Tutorial at ISWC 2010 Jérôme Euzenat Data can be expressed in RDF Linked through URIs Modelled with OWL ontologies & Retrieved
More informationTechreport for GERBIL V1
Techreport for GERBIL 1.2.2 - V1 Michael Röder, Ricardo Usbeck, Axel-Cyrille Ngonga Ngomo February 21, 2016 Current Development of GERBIL Recently, we released the latest version 1.2.2 of GERBIL [16] 1.
More informationSemantic Web. Ontology Alignment. Morteza Amini. Sharif University of Technology Fall 95-96
ه عا ی Semantic Web Ontology Alignment Morteza Amini Sharif University of Technology Fall 95-96 Outline The Problem of Ontologies Ontology Heterogeneity Ontology Alignment Overall Process Similarity (Matching)
More informationDeliverable Development of First Prototype for Spatially Interlinking Data Sets
Collaborative Project GeoKnow - Making the Web an Exploratory place for Geospatial Knowledge Project Number: 318159 Start Date of Project: 2012/12/01 Duration: 36 months Deliverable 3.1.1 Development of
More informationEvaluating Class Assignment Semantic Redundancy on Linked Datasets
Evaluating Class Assignment Semantic Redundancy on Linked Datasets Leandro Mendoza CONICET, Argentina LIFIA, Facultad de Informática, UNLP, Argentina Alicia Díaz LIFIA, Facultad de Informática, UNLP, Argentina
More informationSQTime: Time-enhanced Social Search Querying
SQTime: Time-enhanced Social Search Querying Panagiotis Lionakis 1, Kostas Stefanidis 2, and Georgia Koloniari 3 1 Department of Computer Science, University of Crete, Heraklion, Greece lionakis@csd.uoc.gr
More informationA Korean Knowledge Extraction System for Enriching a KBox
A Korean Knowledge Extraction System for Enriching a KBox Sangha Nam, Eun-kyung Kim, Jiho Kim, Yoosung Jung, Kijong Han, Key-Sun Choi KAIST / The Republic of Korea {nam.sangha, kekeeo, hogajiho, wjd1004109,
More informationQuestion Answering over Linked Data (QALD-5)
Question Answering over Linked Data (QALD-5) Christina Unger 1, Corina Forascu 2, Vanessa Lopez 3, Axel-Cyrille Ngonga Ngomo 4, Elena Cabrio 5, Philipp Cimiano 1, and Sebastian Walter 1 1 CITEC, Bielefeld
More informationAccessing information about Linked Data vocabularies with vocab.cc
Accessing information about Linked Data vocabularies with vocab.cc Steffen Stadtmüller 1, Andreas Harth 1, and Marko Grobelnik 2 1 Institute AIFB, Karlsruhe Institute of Technology (KIT), Germany {steffen.stadtmueller,andreas.harth}@kit.edu
More informationSilk Server Adding missing Links while consuming Linked Data
Proceedings Of The First International Workshop On Consuming Linked Data Shanghai, China, November 8, 2010 Silk Server Adding missing Links while consuming Linked Data Robert Isele, Freie Universität Berlin
More informationExtending Functional Dependency to Detect Abnormal Data in RDF Graphs
Extending Functional Dependency to Detect Abnormal Data in RDF Graphs Yang Yu, Jeff Heflin SWAT Lab Department of Computer Science and Engineering Lehigh University PA, USA Outline Semantic Web data and
More informationDBpedia Spotlight at the MSM2013 Challenge
DBpedia Spotlight at the MSM2013 Challenge Pablo N. Mendes 1, Dirk Weissenborn 2, and Chris Hokamp 3 1 Kno.e.sis Center, CSE Dept., Wright State University 2 Dept. of Comp. Sci., Dresden Univ. of Tech.
More informationDeliverable D1.4 Report Describing Integration Strategies and Experiments
DEEPTHOUGHT Hybrid Deep and Shallow Methods for Knowledge-Intensive Information Extraction Deliverable D1.4 Report Describing Integration Strategies and Experiments The Consortium October 2004 Report Describing
More informationAugust 2012 Daejeon, South Korea
Building a Web of Linked Entities (Part I: Overview) Pablo N. Mendes Free University of Berlin August 2012 Daejeon, South Korea Outline Part I A Web of Linked Entities Challenges Progress towards solutions
More informationEfficient, Scalable, and Provenance-Aware Management of Linked Data
Efficient, Scalable, and Provenance-Aware Management of Linked Data Marcin Wylot 1 Motivation and objectives of the research The proliferation of heterogeneous Linked Data on the Web requires data management
More informationDBpedia Data Processing and Integration Tasks in UnifiedViews
1 DBpedia Data Processing and Integration Tasks in Tomas Knap Semantic Web Company Markus Freudenberg Leipzig University Kay Müller Leipzig University 2 Introduction Agenda, Team 3 Agenda Team & Goal An
More informationK N O W L E D G E E X T R A C T I O N F O R H Y B R I D Q U E S T I O N A N S W E R I N G
K N O W L E D G E E X T R A C T I O N F O R H Y B R I D Q U E S T I O N A N S W E R I N G Von der Fakultät für Mathematik und Informatik der Universität Leipzig angenommene DISSERTATION zur Erlangung des
More informationRevisiting Blank Nodes in RDF to Avoid the Semantic Mismatch with SPARQL
Revisiting Blank Nodes in RDF to Avoid the Semantic Mismatch with SPARQL Marcelo Arenas 1, Mariano Consens 2, and Alejandro Mallea 1,3 1 Pontificia Universidad Católica de Chile 2 University of Toronto
More informationBenchmarking Question Answering Systems
Benchmarking Question Answering Systems Ricardo Usbeck 1, Michael Röder 1, Christina Unger 2, Michael Hoffmann 1, Christian Demmler 1, Jonathan Huthmann 1, and Axel-Cyrille Ngonga Ngomo 1 1 AKSW Group,
More informationDeveloping Focused Crawlers for Genre Specific Search Engines
Developing Focused Crawlers for Genre Specific Search Engines Nikhil Priyatam Thesis Advisor: Prof. Vasudeva Varma IIIT Hyderabad July 7, 2014 Examples of Genre Specific Search Engines MedlinePlus Naukri.com
More informationSQCFramework: SPARQL Query Containment Benchmark Generation Framework
SQCFramework: SPARQL Query Containment Benchmark Generation Framework Muhammad Saleem AKSW, Uni Leipzig, Germany saleem@informatik.uni-leipzig.de Claus Stadler AKSW, Uni Leipzig, Germany stadler@informatik.uni-leipzig.de
More informationKnowledge Based Systems Text Analysis
Knowledge Based Systems Text Analysis Dr. Shubhangi D.C 1, Ravikiran Mitte 2 1 H.O.D, 2 P.G.Student 1,2 Department of Computer Science and Engineering, PG Center Regional Office VTU, Kalaburagi, Karnataka
More informationRDF-TX: A Fast, User-Friendly System for Querying the History of RDF Knowledge Bases
RDF-TX: A Fast, User-Friendly System for Querying the History of RDF Knowledge Bases Shi Gao Jiaqi Gu Carlo Zaniolo University of California, Los Angeles {gaoshi, gujiaqi, zaniolo}@cs.ucla.edu ABSTRACT
More informationOn Measuring the Lattice of Commonalities Among Several Linked Datasets
On Measuring the Lattice of Commonalities Among Several Linked Datasets Michalis Mountantonakis and Yannis Tzitzikas FORTH-ICS Information Systems Laboratory University of Crete Computer Science Department
More information4) DAVE CLARKE. OASIS: Constructing knowledgebases around high resolution images using ontologies and Linked Data
require a change in development culture and thus training. 5. Impact and Benefits The project was delivered on time and on budget unusual for a project of this scale and the project was hailed as a great
More informationFosca Giannotti et al,.
Trajectory Pattern Mining Fosca Giannotti et al,. - Presented by Shuo Miao Conference on Knowledge discovery and data mining, 2007 OUTLINE 1. Motivation 2. T-Patterns: definition 3. T-Patterns: the approach(es)
More informationLatent Variable Models for Structured Prediction and Content-Based Retrieval
Latent Variable Models for Structured Prediction and Content-Based Retrieval Ariadna Quattoni Universitat Politècnica de Catalunya Joint work with Borja Balle, Xavier Carreras, Adrià Recasens, Antonio
More informationDHTK: The Digital Humanities ToolKit
DHTK: The Digital Humanities ToolKit Davide Picca, Mattia Egloff University of Lausanne Abstract. Digital Humanities have the merit of connecting two very different disciplines such as humanities and computer
More informationEntity-centric Topic Extraction and Exploration: A Network-based Approach
Entity-centric Topic Extraction and Exploration: A Network-based Approach Andreas Spitz and Michael Gertz March 27, 2018 ECIR 2018, Grenoble Heidelberg University, Germany Database Systems Research Group
More informationUnsupervised Learning of Link Discovery Configuration
Unsupervised Learning of Link Discovery Configuration Andriy Nikolov, Mathieu d Aquin, and Enrico Motta Knowledge Media Institute, The Open University, UK {a.nikolov, m.daquin, e.motta}@open.ac.uk Link
More informationCollective Entity Resolution in Relational Data
Collective Entity Resolution in Relational Data I. Bhattacharya, L. Getoor University of Maryland Presented by: Srikar Pyda, Brett Walenz CS590.01 - Duke University Parts of this presentation from: http://www.norc.org/pdfs/may%202011%20personal%20validation%20and%20entity%20resolution%20conference/getoorcollectiveentityresolution
More informationScalewelis: a Scalable Query-based Faceted Search System on Top of SPARQL Endpoints
Scalewelis: a Scalable Query-based Faceted Search System on Top of SPARQL Endpoints Joris Guyonvarc H, Sébastien Ferré To cite this version: Joris Guyonvarc H, Sébastien Ferré. Scalewelis: a Scalable Query-based
More informationRobust Discovery of Positive and Negative Rules in Knowledge-Bases
Robust Discovery of Positive and Negative Rules in Knowledge-Bases Paolo Papotti joint work with S. Ortona (Meltwater) and V. Meduri (ASU) http://www.eurecom.fr/en/publication/5321/detail/robust-discovery-of-positive-and-negative-rules-in-knowledge-bases
More informationMulti-resolution image recognition. Jean-Baptiste Boin Roland Angst David Chen Bernd Girod
Jean-Baptiste Boin Roland Angst David Chen Bernd Girod 1 Scale distribution Outline Presentation of two different approaches and experiments Analysis of previous results 2 Motivation Typical image retrieval
More informationExtracting Rankings for Spatial Keyword Queries from GPS Data
Extracting Rankings for Spatial Keyword Queries from GPS Data Ilkcan Keles Christian S. Jensen Simonas Saltenis Aalborg University Outline Introduction Motivation Problem Definition Proposed Method Overview
More informationDIRA : A FRAMEWORK OF DATA INTEGRATION USING DATA QUALITY
DIRA : A FRAMEWORK OF DATA INTEGRATION USING DATA QUALITY Reham I. Abdel Monem 1, Ali H. El-Bastawissy 2 and Mohamed M. Elwakil 3 1 Information Systems Department, Faculty of computers and information,
More informationSemantic Web Information Management
Semantic Web Information Management Norberto Fernández ndez Telematics Engineering Department berto@ it.uc3m.es.es 1 Motivation n Module 1: An ontology models a domain of knowledge n Module 2: using the
More informationOpen Knowledge Extraction Challenge 2017
Open Knowledge Extraction Challenge 2017 René Speck 1, Michael Röder 1, Sergio Oramas 2, Luis Espinosa-Anke 2, and Axel-Cyrille Ngonga Ngomo 1,3 1 AKSW Group, University of Leipzig, Germany {speck,roeder}@informatik.uni-leipzig.de
More informationExtracting Wikipedia Historical Attributes Data
Extracting Wikipedia Historical Attributes Data Guillermo Garrido NLP & IR Group, UNED Madrid, Spain ggarrido@lsi.uned.es Jean-Yves Delort Google Research Zurich Switzerland jydelort@google.com Enrique
More informationTowards Improving the Quality of Knowledge Graphs with Data-driven Ontology Patterns and SHACL
Università degli Studi di Milano Bicocca Dipartimento di Informatica Sistemistica e Comunicazione Towards Improving the Quality of Knowledge Graphs with Data-driven Ontology Patterns and SHACL Blerina
More informationManagement of Complex Product Ontologies Using a Web-Based Natural Language Processing Interface
Management of Complex Product Ontologies Using a Web-Based Natural Language Processing Interface Master Thesis Final Presentation A B M Junaed, 11.07.2016 Software Engineering for Business Information
More informationReduce and Aggregate: Similarity Ranking in Multi-Categorical Bipartite Graphs
Reduce and Aggregate: Similarity Ranking in Multi-Categorical Bipartite Graphs Alessandro Epasto J. Feldman*, S. Lattanzi*, S. Leonardi, V. Mirrokni*. *Google Research Sapienza U. Rome Motivation Recommendation
More informationFoundations of SPARQL Query Optimization
Foundations of SPARQL Query Optimization Michael Schmidt, Michael Meier, Georg Lausen Albert-Ludwigs-Universität Freiburg Database and Information Systems Group 13 th International Conference on Database
More informationWeasel: a machine learning based approach to entity linking combining different features
Weasel: a machine learning based approach to entity linking combining different features Felix Tristram, Sebastian Walter, Philipp Cimiano, and Christina Unger Semantic Computing Group, CITEC, Bielefeld
More informationABSTAT: Ontology-driven Linked Data Summaries with Pattern Minimalization
ABSTAT: Ontology-driven Linked Data Summaries with Pattern Minimalization Blerina Spahiu, Riccardo Porrini, Matteo Palmonari, Anisa Rula, and Andrea Maurino University of Milano-Bicocca firstname.lastname@disco.unimib.it
More informationRishiraj Saha Roy and Niloy Ganguly IIT Kharagpur India. Monojit Choudhury and Srivatsan Laxman Microsoft Research India India
Rishiraj Saha Roy and Niloy Ganguly IIT Kharagpur India Monojit Choudhury and Srivatsan Laxman Microsoft Research India India ACM SIGIR 2012, Portland August 15, 2012 Dividing a query into individual semantic
More informationClassification. 1 o Semestre 2007/2008
Classification Departamento de Engenharia Informática Instituto Superior Técnico 1 o Semestre 2007/2008 Slides baseados nos slides oficiais do livro Mining the Web c Soumen Chakrabarti. Outline 1 2 3 Single-Class
More informationPopulating the Semantic Web with Historical Text
Populating the Semantic Web with Historical Text Kate Byrne, ICCS Supervisors: Prof Ewan Klein, Dr Claire Grover 9th December 2008 1 Outline Overview of My Research populating the Semantic Web the Tether
More informationCOMP9321 Web Application Engineering
COMP9321 Web Application Engineering Semester 2, 2015 Dr. Amin Beheshti Service Oriented Computing Group, CSE, UNSW Australia Week 12 (Wrap-up) http://webapps.cse.unsw.edu.au/webcms2/course/index.php?cid=2411
More informationTopic Profiling Benchmarks in the Linked Open Data Cloud: Issues and Lessons Learned
Semantic Web 1 (2016) 1 5 1 IOS Press Topic Profiling Benchmarks in the Linked Open Data Cloud: Issues and Lessons Learned Editor(s): Axel-Cyrille Ngonga Ngomo, Institute for Applied Informatics, Leipzig,
More informationCOMP9321 Web Application Engineering
COMP9321 Web Application Engineering Semester 1, 2017 Dr. Amin Beheshti Service Oriented Computing Group, CSE, UNSW Australia Week 12 (Wrap-up) http://webapps.cse.unsw.edu.au/webcms2/course/index.php?cid=2457
More informationTools and Infrastructure for Supporting Enterprise Knowledge Graphs
Tools and Infrastructure for Supporting Enterprise Knowledge Graphs Sumit Bhatia, Nidhi Rajshree, Anshu Jain, and Nitish Aggarwal IBM Research sumitbhatia@in.ibm.com, {nidhi.rajshree,anshu.n.jain}@us.ibm.com,nitish.aggarwal@ibm.com
More informationSLINT: A Schema-Independent Linked Data Interlinking System
SLINT: A Schema-Independent Linked Data Interlinking System Khai Nguyen 1, Ryutaro Ichise 2, and Bac Le 1 1 University of Science, Ho Chi Minh, Vietnam {nhkhai,lhbac}@fit.hcmus.edu.vn 2 National Institute
More informationFACE DETECTION AND LOCALIZATION USING DATASET OF TINY IMAGES
FACE DETECTION AND LOCALIZATION USING DATASET OF TINY IMAGES Swathi Polamraju and Sricharan Ramagiri Department of Electrical and Computer Engineering Clemson University ABSTRACT: Being motivated by the
More informationRandom Walk Inference and Learning. Carnegie Mellon University 7/28/2011 EMNLP 2011, Edinburgh, Scotland, UK
Random Walk Inference and Learning in A Large Scale Knowledge Base Ni Lao, Tom Mitchell, William W. Cohen Carnegie Mellon University 2011.7.28 1 Outline Motivation Inference in Knowledge Bases The NELL
More informationnode2vec: Scalable Feature Learning for Networks
node2vec: Scalable Feature Learning for Networks A paper by Aditya Grover and Jure Leskovec, presented at Knowledge Discovery and Data Mining 16. 11/27/2018 Presented by: Dharvi Verma CS 848: Graph Database
More informationText Categorization (I)
CS473 CS-473 Text Categorization (I) Luo Si Department of Computer Science Purdue University Text Categorization (I) Outline Introduction to the task of text categorization Manual v.s. automatic text categorization
More informationThe German DBpedia: A Sense Repository for Linking Entities
The German DBpedia: A Sense Repository for Linking Entities Sebastian Hellmann, Claus Stadler, and Jens Lehmann Abstract The modeling of lexico-semantic resources by means of ontologies is an established
More informationSemantic Web Company. PoolParty - Server. PoolParty - Technical White Paper.
Semantic Web Company PoolParty - Server PoolParty - Technical White Paper http://www.poolparty.biz Table of Contents Introduction... 3 PoolParty Technical Overview... 3 PoolParty Components Overview...
More informationFusionDB: Conflict Management System for Small-Science Databases
Project Number: MYE005 FusionDB: Conflict Management System for Small-Science Databases A Major Qualifying Project submitted to the faculty of Worcester Polytechnic Institute in partial fulfillment of
More informationDiscovering Names in Linked Data Datasets
Discovering Names in Linked Data Datasets Bianca Pereira 1, João C. P. da Silva 2, and Adriana S. Vivacqua 1,2 1 Programa de Pós-Graduação em Informática, 2 Departamento de Ciência da Computação Instituto
More informationAutomatic Summarization
Automatic Summarization CS 769 Guest Lecture Andrew B. Goldberg goldberg@cs.wisc.edu Department of Computer Sciences University of Wisconsin, Madison February 22, 2008 Andrew B. Goldberg (CS Dept) Summarization
More informationSemantic Web. Ontology Alignment. Morteza Amini. Sharif University of Technology Fall 94-95
ه عا ی Semantic Web Ontology Alignment Morteza Amini Sharif University of Technology Fall 94-95 Outline The Problem of Ontologies Ontology Heterogeneity Ontology Alignment Overall Process Similarity Methods
More informationCreating Large-scale Training and Test Corpora for Extracting Structured Data from the Web
Creating Large-scale Training and Test Corpora for Extracting Structured Data from the Web Robert Meusel and Heiko Paulheim University of Mannheim, Germany Data and Web Science Group {robert,heiko}@informatik.uni-mannheim.de
More informationarxiv: v1 [cs.db] 15 Aug 2016
A Experience: Type alignment on DBpedia and Freebase MAYANK KEJRIWAL, University of Texas at Austin DANIEL P. MIRANKER, University of Texas at Austin arxiv:1608.04442v1 [cs.db] 15 Aug 2016 Linked Open
More informationIntuitive and Interactive Query Formulation to Improve the Usability of Query Systems for Heterogeneous Graphs
Intuitive and Interactive Query Formulation to Improve the Usability of Query Systems for Heterogeneous Graphs Nandish Jayaram University of Texas at Arlington PhD Advisors: Dr. Chengkai Li, Dr. Ramez
More information