Alexander Löser
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Alexander Löser has a total of 72 co-authors. Here are the top co-authors by number of shared publications:
Wolfgang Nejdl
University of Hannover
5 shared publicationsChristoph Tempich
4 shared publications- Sebastian Arnold
Beuth University of Applied Sciences Berlin, Germany
4 shared publications Torsten Kilias
Beuth University of Applied Sciences, Luxemburger Straße 10, Berlin, 13353, Germany
4 shared publicationsWolf Siberski
4 shared publicationsFalk Brauer
SAP AG, SAP Research, Dresden, Germany
3 shared publications
Latest Publications
- Open Access
- 12 April 2023
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 136, 157-170
From symmetry to asymmetry: Generalizing TSP approximations by parametrization
- 12 April 2023
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 136, 157-170
Open AccessFrom symmetry to asymmetry: Generalizing TSP approximations by parametrization
- 17 July 2021
- Published by Springer Nature
- p. 3-13
Learned What-If Cost Models for Autonomous Clustering
- 17 July 2021
- Published by Springer Nature
- p. 3-13
Learned What-If Cost Models for Autonomous Clustering
- Open Access
- 18 January 2021
- Published by Walter de Gruyter GmbH
- p. 147-164
2.1 Kommerzielle Datenmärkte
Der kommerzielle Handel mit Daten hat sich im Rahmen von Digitalisierung und digitaler Transformation als immer wichtigerer Wirtschaftsbereich etabliert, in dem Datenmarktplätzen als Handelsplattformen eine Schlüsselrolle zukommt. Es werden mittlerweile neue Geschäftsmodelle identifiziert, die von unterschiedlichen Playern entwickelt und betrieben werden und die ausschließlich auf einer Aggregation und anschließenden Nutzung von Daten basieren. Dieses Kapitel gibt einen Überblick über die Funktionalität von Datenmarktplätzen mit und ohne Feedback-Loop und zeigt deren Entwicklung auf. Dabei betrachten wir einerseits den „klassischen“ Ansatz, bei dem große Datensammlungen angelegt, eventuell aufbereitet und sodann ganz oder teilweise zum Kauf angeboten werden; in diesem Bereich kommen zahlreiche Techniken der Daten-Vorverarbeitung oder des Data Cleansing zur Anwendung; ferner hat sich aktuelle Forschung z. B. mit der Frage der Preisbildung beschäftigt. Später betrachten wir den an die Plattformökonomie angelehnten Ansatz, bei dem sich die gesammelten oder anfallenden Daten durch Einsatz von Feedback-Loops selbst aufwerten. Auch wird die Frage betrachtet, inwieweit die einzelne Person vom Handel mit ihren Daten Kenntnis erlangen kann, wie sie ihn unterbinden bzw. wie sie selbst Nutzen daraus ziehen kann.
- 18 January 2021
- Published by Walter de Gruyter GmbH
- p. 147-164
Open Access2.1 Kommerzielle Datenmärkte
Der kommerzielle Handel mit Daten hat sich im Rahmen von Digitalisierung und digitaler Transformation als immer wichtigerer Wirtschaftsbereich etabliert, in dem Datenmarktplätzen als Handelsplattformen eine Schlüsselrolle zukommt. Es werden mittlerweile neue Geschäftsmodelle identifiziert, die von unterschiedlichen Playern entwickelt und betrieben werden und die ausschließlich auf einer Aggregation und anschließenden Nutzung von Daten basieren. Dieses Kapitel gibt einen Überblick über die Funktionalität von Datenmarktplätzen mit und ohne Feedback-Loop und zeigt deren Entwicklung auf. Dabei betrachten wir einerseits den „klassischen“ Ansatz, bei dem große Datensammlungen angelegt, eventuell aufbereitet und sodann ganz oder teilweise zum Kauf angeboten werden; in diesem Bereich kommen zahlreiche Techniken der Daten-Vorverarbeitung oder des Data Cleansing zur Anwendung; ferner hat sich aktuelle Forschung z. B. mit der Frage der Preisbildung beschäftigt. Später betrachten wir den an die Plattformökonomie angelehnten Ansatz, bei dem sich die gesammelten oder anfallenden Daten durch Einsatz von Feedback-Loops selbst aufwerten. Auch wird die Frage betrachtet, inwieweit die einzelne Person vom Handel mit ihren Daten Kenntnis erlangen kann, wie sie ihn unterbinden bzw. wie sie selbst Nutzen daraus ziehen kann.
- Open Access
- 1 November 2019
- Published by MIT Press in Transactions of the Association for Computational Linguistics
- Vol. 7, 169-184
SECTOR: A Neural Model for Coherent Topic Segmentation and Classification
When searching for information, a human reader first glances over a document, spots relevant sections, and then focuses on a few sentences for resolving her intention. However, the high variance of document structure complicates the identification of the salient topic of a given section at a glance. To tackle this challenge, we present SECTOR, a model to support machine reading systems by segmenting documents into coherent sections and assigning topic labels to each section. Our deep neural network architecture learns a latent topic embedding over the course of a document. This can be leveraged to classify local topics from plain text and segment a document at topic shifts. In addition, we contribute WikiSection, a publicly available data set with 242k labeled sections in English and German from two distinct domains: diseases and cities. From our extensive evaluation of 20 architectures, we report a highest score of 71.6% F1 for the segmentation and classification of 30 topics from the English city domain, scored by our SECTOR long short-term memory model with Bloom filter embeddings and bidirectional segmentation. This is a significant improvement of 29.5 points F1 over state-of-the-art CNN classifiers with baseline segmentation.
- 1 November 2019
- Published by MIT Press in Transactions of the Association for Computational Linguistics
- Vol. 7, 169-184
Open AccessSECTOR: A Neural Model for Coherent Topic Segmentation and Classification
When searching for information, a human reader first glances over a document, spots relevant sections, and then focuses on a few sentences for resolving her intention. However, the high variance of document structure complicates the identification of the salient topic of a given section at a glance. To tackle this challenge, we present SECTOR, a model to support machine reading systems by segmenting documents into coherent sections and assigning topic labels to each section. Our deep neural network architecture learns a latent topic embedding over the course of a document. This can be leveraged to classify local topics from plain text and segment a document at topic shifts. In addition, we contribute WikiSection, a publicly available data set with 242k labeled sections in English and German from two distinct domains: diseases and cities. From our extensive evaluation of 20 architectures, we report a highest score of 71.6% F1 for the segmentation and classification of 30 topics from the English city domain, scored by our SECTOR long short-term memory model with Bloom filter embeddings and bidirectional segmentation. This is a significant improvement of 29.5 points F1 over state-of-the-art CNN classifiers with baseline segmentation.
- 1 February 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
IDEL: In-Database Neural Entity Linking
We present a novel architecture In-Database Entity Linking (IDEL), in which we integrate the analytical RDBMS MonetDB with neural text mining abilities. To the best of our knowledge, this is the first defacto implemented system integrating entity-linking in a database. IDEL represents text and relational data in a joint vector space with neural embeddings and can compensate errors with ambiguous entity representations. To detect matching entities, we propose a novel similarity function based on joint neural embeddings which are learned via minimizing pairwise contrastive ranking loss. This function utilizes high dimensional index structures for fast retrieval of matching entities. The system achieves zero cost for data shipping and transformation by utilizing MonetDB's ability to embed Python processes in its kernel and exchange data in NumPy arrays. We report from experiments on the WebNLG corpus on ten entity types high F-measures and low execution times.
- 1 February 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
IDEL: In-Database Neural Entity Linking
We present a novel architecture In-Database Entity Linking (IDEL), in which we integrate the analytical RDBMS MonetDB with neural text mining abilities. To the best of our knowledge, this is the first defacto implemented system integrating entity-linking in a database. IDEL represents text and relational data in a joint vector space with neural embeddings and can compensate errors with ambiguous entity representations. To detect matching entities, we propose a novel similarity function based on joint neural embeddings which are learned via minimizing pairwise contrastive ranking loss. This function utilizes high dimensional index structures for fast retrieval of matching entities. The system achieves zero cost for data shipping and transformation by utilizing MonetDB's ability to embed Python processes in its kernel and exchange data in NumPy arrays. We report from experiments on the WebNLG corpus on ten entity types high F-measures and low execution times.
- Open Access
- 1 January 2018
- Published by Association for Computational Linguistics (ACL)
Challenges for Toxic Comment Classification: An In-Depth Error Analysis
- 1 January 2018
- Published by Association for Computational Linguistics (ACL)
Open AccessChallenges for Toxic Comment Classification: An In-Depth Error Analysis
- Open Access
- 1 January 2017
- Published by Association for Computational Linguistics (ACL)
- p. 11-18
Analysing Errors of Open Information Extraction Systems
- 1 January 2017
- Published by Association for Computational Linguistics (ACL)
- p. 11-18
Open AccessAnalysing Errors of Open Information Extraction Systems
- Open Access
- 22 October 2015
- Published by Association for Computing Machinery (ACM)
- p. 75-84
Resolving Common Analytical Tasks in Text Databases
With the convergence of data warehousing, online analytical processing and the Semantic Web, analytical tasks are no longer only designed and executed by experts. Instead, various users expect to query keyword search engines with analytical intentions. One efficient approach to answer these tasks is to leverage the factual information stored in large-scale text databases. These systems enable analysts to access unstructured text sources from the Web with structured query languages. The challenge of mapping keyword queries to structured queries has been approached in various forms. However, these systems are not able to detect the underlying intent of a task. Thus, they cannot infer the user's expectations towards specificity and form of the results. Moreover, a large fraction of queries for retrieving analytical results is rare. As a result, services for intent-aware task recognition perform poorly or are not even triggered on these long-tail queries. We report from a study over 102,360 query and click patterns from a factual search engine. Our analysis reveals six common analytical tasks: explore, relate, resolve, list, compare and answer. To distinguish among these, we study the effects of syntactical structures in the query, methods for interactive entity detection and query segmentation techniques. We evaluate these features on language models and Naive Bayes classifiers. From our evaluation we report a combined F1 score of 90% for the prediction of task intent from keyword queries.
- 22 October 2015
- Published by Association for Computing Machinery (ACM)
- p. 75-84
Open AccessResolving Common Analytical Tasks in Text Databases
With the convergence of data warehousing, online analytical processing and the Semantic Web, analytical tasks are no longer only designed and executed by experts. Instead, various users expect to query keyword search engines with analytical intentions. One efficient approach to answer these tasks is to leverage the factual information stored in large-scale text databases. These systems enable analysts to access unstructured text sources from the Web with structured query languages. The challenge of mapping keyword queries to structured queries has been approached in various forms. However, these systems are not able to detect the underlying intent of a task. Thus, they cannot infer the user's expectations towards specificity and form of the results. Moreover, a large fraction of queries for retrieving analytical results is rare. As a result, services for intent-aware task recognition perform poorly or are not even triggered on these long-tail queries. We report from a study over 102,360 query and click patterns from a factual search engine. Our analysis reveals six common analytical tasks: explore, relate, resolve, list, compare and answer. To distinguish among these, we study the effects of syntactical structures in the query, methods for interactive entity detection and query segmentation techniques. We evaluate these features on language models and Naive Bayes classifiers. From our evaluation we report a combined F1 score of 90% for the prediction of task intent from keyword queries.
- 1 October 2015
- Published by Elsevier in Information Systems
- Vol. 53, 124-144
INDREX: In-database relation extraction
- 1 October 2015
- Published by Elsevier in Information Systems
- Vol. 53, 124-144
INDREX: In-database relation extraction