Demo Data from EDBT 2026 / reviewers in the wild / expert
Jhomara Luzuriaga
dblp:338/0867
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2023
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Databases, data mining, and information retrieval
1 paper |
Knowledge graphs · 100% | |
| Artificial intelligence
1 paper |
Information extraction and text analysis · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Information extraction and text analysis › relation extraction
distant supervision |
0.7 | 1 | 2023 | Merging Web Tables for Relation Extraction With Knowledge Graphs · IEEE Trans. Knowl. Data Eng. 2023 |
Knowledge graphs
knowledge graph construction |
0.7 | 1 | 2023 | Merging Web Tables for Relation Extraction With Knowledge Graphs · IEEE Trans. Knowl. Data Eng. 2023 |
Knowledge graphs
relation extraction |
0.7 | 1 | 2023 | Merging Web Tables for Relation Extraction With Knowledge Graphs · IEEE Trans. Knowl. Data Eng. 2023 |
Knowledge graphs
link prediction |
0.2 | 1 | 2023 | Merging Web Tables for Relation Extraction With Knowledge Graphs · IEEE Trans. Knowl. Data Eng. 2023 |
Methods — techniques the papers use, named apart from their topics
table merging · 1.3distant supervision · 1.3binary classification · 1.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Merging Web Tables for Relation Extraction With Knowledge GraphsabstractWe propose methods for extracting triples from Wikipedia’s HTML tables using a reference knowledge graph. Our methods use a distant-supervision approach to find existing triples in the knowledge graph for pairs of entities on the same row of a table, postulating the corresponding relation for pairs of entities from other rows in the corresponding columns, thus extracting novel candidate triples. Binary classifiers are applied on these candidates to detect correct triples and thus increase the precision of the output triples. We extend this approach with a preliminary step where we first group and merge similar tables, thereafter applying extraction on the larger merged tables. More specifically, we propose anobserved schemafor individual tables, which is used to group and merge tables. We compare the precision and number of triples extracted with and without table merging, where we show that with merging, we can extract a larger number of triples at a similar precision. Ultimately, from the tables of English Wikipedia, we extract 5.9 million novel and unique triples for Wikidata at an estimated precision of 0.718. Jhomara Luzuriaga, Emir Muñoz, Henry Rosales-Méndez, Aidan Hogan |
IEEE Trans. Knowl. Data Eng. | 1 |