004 Datenverarbeitung; Informatik
Refine
Year of publication
Document Type
- Article (172)
- Monograph/Edited Volume (160)
- Doctoral Thesis (151)
- Postprint (49)
- Conference Proceeding (38)
- Other (9)
- Master's Thesis (8)
- Part of a Book (2)
- Bachelor Thesis (1)
- Habilitation Thesis (1)
Language
- English (486)
- German (105)
- Multiple languages (2)
Is part of the Bibliography
- yes (593) (remove)
Keywords
- machine learning (19)
- answer set programming (13)
- cloud computing (12)
- Cloud Computing (11)
- Hasso-Plattner-Institut (10)
- maschinelles Lernen (10)
- Forschungsprojekte (9)
- Future SOC Lab (9)
- Hasso Plattner Institute (9)
- In-Memory Technologie (9)
Institute
- Hasso-Plattner-Institut für Digital Engineering gGmbH (193)
- Institut für Informatik und Computational Science (160)
- Hasso-Plattner-Institut für Digital Engineering GmbH (111)
- Fachgruppe Betriebswirtschaftslehre (40)
- Mathematisch-Naturwissenschaftliche Fakultät (23)
- Wirtschaftswissenschaften (18)
- Extern (17)
- Bürgerliches Recht (12)
- Digital Engineering Fakultät (8)
- Institut für Physik und Astronomie (8)
With recent advances in the area of information extraction, automatically extracting structured information from a vast amount of unstructured textual data becomes an important task, which is infeasible for humans to capture all information manually. Named entities (e.g., persons, organizations, and locations), which are crucial components in texts, are usually the subjects of structured information from textual documents. Therefore, the task of named entity mining receives much attention. It consists of three major subtasks, which are named entity recognition, named entity linking, and relation extraction.
These three tasks build up an entire pipeline of a named entity mining system, where each of them has its challenges and can be employed for further applications. As a fundamental task in the natural language processing domain, studies on named entity recognition have a long history, and many existing approaches produce reliable results. The task is aiming to extract mentions of named entities in text and identify their types. Named entity linking recently received much attention with the development of knowledge bases that contain rich information about entities. The goal is to disambiguate mentions of named entities and to link them to the corresponding entries in a knowledge base. Relation extraction, as the final step of named entity mining, is a highly challenging task, which is to extract semantic relations between named entities, e.g., the ownership relation between two companies.
In this thesis, we review the state-of-the-art of named entity mining domain in detail, including valuable features, techniques, evaluation methodologies, and so on. Furthermore, we present two of our approaches that focus on the named entity linking and relation extraction tasks separately.
To solve the named entity linking task, we propose the entity linking technique, BEL, which operates on a textual range of relevant terms and aggregates decisions from an ensemble of simple classifiers. Each of the classifiers operates on a randomly sampled subset of the above range. In extensive experiments on hand-labeled and benchmark datasets, our approach outperformed state-of-the-art entity linking techniques, both in terms of quality and efficiency.
For the task of relation extraction, we focus on extracting a specific group of difficult relation types, business relations between companies. These relations can be used to gain valuable insight into the interactions between companies and perform complex analytics, such as predicting risk or valuating companies. Our semi-supervised strategy can extract business relations between companies based on only a few user-provided seed company pairs. By doing so, we also provide a solution for the problem of determining the direction of asymmetric relations, such as the ownership_of relation. We improve the reliability of the extraction process by using a holistic pattern identification method, which classifies the generated extraction patterns. Our experiments show that we can accurately and reliably extract new entity pairs occurring in the target relation by using as few as five labeled seed pairs.