Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Kunpeng Guo

dblp:304/1076 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
2since 2021 · last 2023
0000-0002-0692-0057ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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
Data integration and cleaning · 50% Knowledge graphs · 25% Data mining · 25%
Artificial intelligence
1 paper
Question answering and dialogue systems · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data integration and cleaning
data extraction
0.712023
Wikidata as a seed for Web Extraction · WWW 2023
Data mining › text mining
fact extraction
0.712023
Wikidata as a seed for Web Extraction · WWW 2023
Knowledge graphs
link prediction
0.712023
Wikidata as a seed for Web Extraction · WWW 2023
Data integration and cleaning › data extraction
web data extraction
0.712023
Wikidata as a seed for Web Extraction · WWW 2023

Methods — techniques the papers use, named apart from their topics

question answering · 1.3language model · 1.3
YearPublicationVenuePosition
2023 Fine-tuning Strategies for Domain Specific Question Answering under Low Annotation Budget Constraints
abstract
The progress introduced by pre-trained language models and their fine-tuning has resulted in significant improvements in most downstream NLP tasks. The unsupervised training of a language model combined with further target task finetuning has become the standard QA fine-tuning procedure. In this work, we demonstrate that this strategy is sub-optimal for fine-tuning QA models, especially under a low QA annotation budget, which is a usual setting in practice due to the extractive QA labeling cost. We draw our conclusions by conducting an exhaustive analysis of the performance of the alternatives of the sequential fine-tuning strategy on different QA datasets. Based on the experiments performed, we observed that the best strategy to fine-tune the QA model in low-budget settings is taking a pre-trained language model (PLM) and then fine-tuning PLM with a dataset composed of the target dataset and SQuAD dataset. With zero extra annotation effort, the best strategy outperforms the standard strategy by 2.28% to 6.48%. Our experiments provide one of the first investigations on how to best fine-tune a QA system under a low budget and are therefore of the utmost practical interest to the QA practitioners.
Kunpeng Guo, Dennis Diefenbach, Antoine Gourru, Christophe Gravier
ICTAI1
2023 Wikidata as a seed for Web Extraction
abstract
Wikidata has grown to a knowledge graph with an impressive size. To date, it contains more than 17 billion triples collecting information about people, places, films, stars, publications, proteins, and many more. On the other side, most of the information on the Web is not published in highly structured data repositories like Wikidata, but rather as unstructured and semi-structured content, more concretely in HTML pages containing text and tables. Finding, monitoring, and organizing this data in a knowledge graph is requiring considerable work from human editors. The volume and complexity of the data make this task difficult and time-consuming. In this work, we present a framework that is able to identify and extract new facts that are published under multiple Web domains so that they can be proposed for validation by Wikidata editors. The framework is relying on question-answering technologies. We take inspiration from ideas that are used to extract facts from textual collections and adapt them to extract facts from Web pages. For achieving this, we demonstrate that language models can be adapted to extract facts not only from textual collections but also from Web pages. By exploiting the information already contained in Wikidata the proposed framework can be trained without the need for any additional learning signals and can extract new facts for a wide range of properties and domains. Following this path, Wikidata can be used as a seed to extract facts on the Web. Our experiments show that we can achieve a mean performance of 84.07 at F1-score. Moreover, our estimations show that we can potentially extract millions of facts that can be proposed for human validation. The goal is to help editors in their daily tasks and contribute to the completion of the Wikidata knowledge graph.
Kunpeng Guo, Dennis Diefenbach, Antoine Gourru, Christophe Gravier
WWW1
2020 IntKB: A Verifiable Interactive Framework for Knowledge Base Completion
abstract
Knowledge bases (KBs) are essential for many downstream NLP tasks, yet their prime shortcoming is that they are often incomplete.State-of-the-art frameworks for KB completion often lack sufficient accuracy to work fully automated without human supervision.As a remedy, we propose IntKB: a novel interactive framework for KB completion from text based on a question answering pipeline.Our framework is tailored to the specific needs of a human-in-the-loop paradigm: (i) We generate facts that are aligned with text snippets and are thus immediately verifiable by humans.(ii) Our system is designed such that it continuously learns during the KB completion task and, therefore, significantly improves its performance upon initial zero-and few-shot relations over time.(iii) We only trigger human interactions when there is enough information for a correct prediction.Therefore, we train our system with negative examples and a fold-option if there is no answer.Our framework yields a favorable performance: it achieves a hit@1 ratio of 29.7% for initially unseen relations, upon which it gradually improves to 46.2%.
Bernhard Kratzwald, Kunpeng Guo, Stefan Feuerriegel, Dennis Diefenbach
COLING2