Publications

• 
  Modeling and Analyzing the Influence of Non-Item Pages on Sequential Next-Item Prediction. Fischer, Elisabeth; Schlör, Daniel; Zehe, Albin; Hotho, Andreas. 2024.
  • [ BibTeX ]
  • [ URL ]
  • [ BibSonomy-Post ]
  @misc{fischer2024modeling, author = {Fischer, Elisabeth and Schlör, Daniel and Zehe, Albin and Hotho, Andreas}, keywords = {recommender}, title = {Modeling and Analyzing the Influence of Non-Item Pages on Sequential Next-Item Prediction}, year = 2024 }

• 
  Enhancing Sequential Next-Item Prediction through Modelling Non-Item Pages. Fischer, Elisabeth; Schlör, Daniel; Zehe, Albin; Hotho, Andreas. 2023.
  • [ BibTeX ]
  • [ BibSonomy-Post ]
  @inproceedings{fischer2023enhancing, author = {Fischer, Elisabeth and Schlör, Daniel and Zehe, Albin and Hotho, Andreas}, keywords = {research_sequential}, title = {Enhancing Sequential Next-Item Prediction through Modelling Non-Item Pages}, year = 2023 }
• 
  CapsKG: Enabling Continual Knowledge Integration in Language Models for Automatic Knowledge Graph Completion. Omeliyanenko, Janna; Zehe, Albin; Hotho, Andreas; Schlör, Daniel. In International Semantic Web Conference ISWC 2023, to appear. 2023.
  • [ Abstract ]
  • [ BibTeX ]
  • [ Download ]
  • [ BibSonomy-Post ]
  Automated completion of knowledge graphs is a popular topic in the Semantic Web community that aims to automatically and continuously integrate new appearing knowledge into knowledge graphs using artificial intelligence. Recently, approaches that leverage implicit knowledge from language models for this task have shown promising re- sults. However, by fine-tuning language models directly to the domain of knowledge graphs, models forget their original language representation and associated knowledge. An existing solution to address this issue is a trainable adapter, which is integrated into a frozen language model to extract the relevant knowledge without altering the model itself. How- ever, this constrains the generalizability to the specific extraction task and by design requires new and independent adapters to be trained for new knowledge extraction tasks. This effectively prevents the model from benefiting from existing knowledge incorporated in previously trained adapters. In this paper, we propose to combine the benefits of adapters for knowl- edge graph completion with the idea of integrating capsules, introduced in the field of continual learning. This allows the continuous integra- tion of knowledge into a joint model by sharing and reusing previously trained capsules. We find that our approach outperforms solutions using traditional adapters, while requiring notably fewer parameters for con- tinuous knowledge integration. Moreover, we show that this architecture benefits significantly from knowledge sharing in low-resource situations, outperforming adapter-based models on the task of link prediction.

  @article{omeliyanenko2023capskg, abstract = {Automated completion of knowledge graphs is a popular topic in the Semantic Web community that aims to automatically and continuously integrate new appearing knowledge into knowledge graphs using artificial intelligence. Recently, approaches that leverage implicit knowledge from language models for this task have shown promising re- sults. However, by fine-tuning language models directly to the domain of knowledge graphs, models forget their original language representation and associated knowledge. An existing solution to address this issue is a trainable adapter, which is integrated into a frozen language model to extract the relevant knowledge without altering the model itself. How- ever, this constrains the generalizability to the specific extraction task and by design requires new and independent adapters to be trained for new knowledge extraction tasks. This effectively prevents the model from benefiting from existing knowledge incorporated in previously trained adapters. In this paper, we propose to combine the benefits of adapters for knowl- edge graph completion with the idea of integrating capsules, introduced in the field of continual learning. This allows the continuous integra- tion of knowledge into a joint model by sharing and reusing previously trained capsules. We find that our approach outperforms solutions using traditional adapters, while requiring notably fewer parameters for con- tinuous knowledge integration. Moreover, we show that this architecture benefits significantly from knowledge sharing in low-resource situations, outperforming adapter-based models on the task of link prediction.}, author = {Omeliyanenko, Janna and Zehe, Albin and Hotho, Andreas and Schlör, Daniel}, journal = {International Semantic Web Conference ISWC 2023, to appear}, keywords = {knowledgegraph}, title = {CapsKG: Enabling Continual Knowledge Integration in Language Models for Automatic Knowledge Graph Completion}, year = 2023 }

• 
  {W}ue{D}evils at {S}em{E}val-2022 Task 8: Multilingual News Article Similarity via Pair-Wise Sentence Similarity Matrices. Wangsadirdja, Dirk; Heinickel, Felix; Trapp, Simon; Zehe, Albin; Kobs, Konstantin; Hotho, Andreas. In Proceedings of the 16th International Workshop on Semantic Evaluation (SemEval-2022), pp. 1235–1243. Association for Computational Linguistics, Seattle, United States, 2022.
  • [ Abstract ]
  • [ BibTeX ]
  • [ URL ]
  • [ Download ]
  • [ BibSonomy-Post ]
  We present a system that creates pair-wise cosine and arccosine sentence similarity matrices using multilingual sentence embeddings obtained from pre-trained SBERT and Universal Sentence Encoder (USE) models respectively. For each news article sentence, it searches the most similar sentence from the other article and computes an average score. Further, a convolutional neural network calculates a total similarity score for the article pairs on these matrices. Finally, a random forest regressor merges the previous results to a final score that can optionally be extended with a publishing date score.

  @inproceedings{wangsadirdja2022wuedevils, abstract = {We present a system that creates pair-wise cosine and arccosine sentence similarity matrices using multilingual sentence embeddings obtained from pre-trained SBERT and Universal Sentence Encoder (USE) models respectively. For each news article sentence, it searches the most similar sentence from the other article and computes an average score. Further, a convolutional neural network calculates a total similarity score for the article pairs on these matrices. Finally, a random forest regressor merges the previous results to a final score that can optionally be extended with a publishing date score.}, address = {Seattle, United States}, author = {Wangsadirdja, Dirk and Heinickel, Felix and Trapp, Simon and Zehe, Albin and Kobs, Konstantin and Hotho, Andreas}, booktitle = {Proceedings of the 16th International Workshop on Semantic Evaluation (SemEval-2022)}, keywords = {multilingual}, month = {07}, pages = {1235–1243}, publisher = {Association for Computational Linguistics}, title = {{W}ue{D}evils at {S}em{E}val-2022 Task 8: Multilingual News Article Similarity via Pair-Wise Sentence Similarity Matrices}, year = 2022 }
• 
  {LSX} team5 at {S}em{E}val-2022 Task 8: Multilingual News Article Similarity Assessment based on Word- and Sentence Mover{’}s Distance. Heil, Stefan; Kopp, Karina; Zehe, Albin; Kobs, Konstantin; Hotho, Andreas. In Proceedings of the 16th International Workshop on Semantic Evaluation (SemEval-2022), pp. 1190–1195. Association for Computational Linguistics, Seattle, United States, 2022.
  • [ Abstract ]
  • [ BibTeX ]
  • [ URL ]
  • [ Download ]
  • [ BibSonomy-Post ]
  This paper introduces our submission for the SemEval 2022 Task 8: Multilingual News Article Similarity. The task of the competition consisted of the development of a model, capable of determining the similarity between pairs of multilingual news articles. To address this challenge, we evaluated the Word Mover{'}s Distance in conjunction with word embeddings from ConceptNet Numberbatch and term frequencies of WorldLex, as well the Sentence Mover{'}s Distance based on sentence embeddings generated by pretrained transformer models of Sentence-BERT. To facilitate the comparison of multilingual articles with Sentence-BERT models, we deployed a Neural Machine Translation system. All our models achieve stable results in multilingual similarity estimation without learning parameters.

  @inproceedings{heil2022lsxteam5, abstract = {This paper introduces our submission for the SemEval 2022 Task 8: Multilingual News Article Similarity. The task of the competition consisted of the development of a model, capable of determining the similarity between pairs of multilingual news articles. To address this challenge, we evaluated the Word Mover{'}s Distance in conjunction with word embeddings from ConceptNet Numberbatch and term frequencies of WorldLex, as well the Sentence Mover{'}s Distance based on sentence embeddings generated by pretrained transformer models of Sentence-BERT. To facilitate the comparison of multilingual articles with Sentence-BERT models, we deployed a Neural Machine Translation system. All our models achieve stable results in multilingual similarity estimation without learning parameters.}, address = {Seattle, United States}, author = {Heil, Stefan and Kopp, Karina and Zehe, Albin and Kobs, Konstantin and Hotho, Andreas}, booktitle = {Proceedings of the 16th International Workshop on Semantic Evaluation (SemEval-2022)}, keywords = {multilingual}, month = {07}, pages = {1190–1195}, publisher = {Association for Computational Linguistics}, title = {{LSX} team5 at {S}em{E}val-2022 Task 8: Multilingual News Article Similarity Assessment based on Word- and Sentence Mover{'}s Distance}, year = 2022 }
• 
  One Graph to Rule them All: Using {NLP} and Graph Neural Networks to analyse Tolkien’s Legendarium. Perri, Vincenzo; Qarkaxhija, Lisi; Zehe, Albin; Hotho, Andreas; Scholtes, Ingo. In Proceedings of the Computational Humanities Research Conference 2022, {CHR} 2022, Antwerp, Belgium, December 12-14, 2022, Vol. 3290 of {CEUR} Workshop Proceedings, F. Karsdorp, K. L. Nielbo (eds.), pp. 291–317. CEUR-WS.org, 2022.
  • [ BibTeX ]
  • [ URL ]
  • [ Download ]
  • [ BibSonomy-Post ]
  @inproceedings{perri2022graph, author = {Perri, Vincenzo and Qarkaxhija, Lisi and Zehe, Albin and Hotho, Andreas and Scholtes, Ingo}, booktitle = {Proceedings of the Computational Humanities Research Conference 2022, {CHR} 2022, Antwerp, Belgium, December 12-14, 2022}, editor = {Karsdorp, Folgert and Nielbo, Kristoffer L.}, keywords = {author:zehe}, pages = {291–317}, publisher = {CEUR-WS.org}, series = {{CEUR} Workshop Proceedings}, title = {One Graph to Rule them All: Using {NLP} and Graph Neural Networks to analyse Tolkien's Legendarium}, volume = 3290, year = 2022 }

• 
  The {F}airy{N}et Corpus - Character Networks for {G}erman Fairy Tales. Schmidt, David; Zehe, Albin; Lorenzen, Janne; Sergel, Lisa; D{ü}ker, Sebastian; Krug, Markus; Puppe, Frank. In Proceedings of the 5th Joint SIGHUM Workshop on Computational Linguistics for Cultural Heritage, Social Sciences, Humanities and Literature, pp. 49–56. Association for Computational Linguistics, Punta Cana, Dominican Republic (online), 2021.
  • [ Abstract ]
  • [ BibTeX ]
  • [ URL ]
  • [ Download ]
  • [ BibSonomy-Post ]
  This paper presents a data set of German fairy tales, manually annotated with character networks which were obtained with high inter rater agreement. The release of this corpus provides an opportunity of training and comparing different algorithms for the extraction of character networks, which so far was barely possible due to heterogeneous interests of previous researchers. We demonstrate the usefulness of our data set by providing baseline experiments for the automatic extraction of character networks, applying a rule-based pipeline as well as a neural approach, and find the neural approach outperforming the rule-approach in most evaluation settings.

  @inproceedings{schmidt2021fairynet, abstract = {This paper presents a data set of German fairy tales, manually annotated with character networks which were obtained with high inter rater agreement. The release of this corpus provides an opportunity of training and comparing different algorithms for the extraction of character networks, which so far was barely possible due to heterogeneous interests of previous researchers. We demonstrate the usefulness of our data set by providing baseline experiments for the automatic extraction of character networks, applying a rule-based pipeline as well as a neural approach, and find the neural approach outperforming the rule-approach in most evaluation settings.}, address = {Punta Cana, Dominican Republic (online)}, author = {Schmidt, David and Zehe, Albin and Lorenzen, Janne and Sergel, Lisa and D{\"u}ker, Sebastian and Krug, Markus and Puppe, Frank}, booktitle = {Proceedings of the 5th Joint SIGHUM Workshop on Computational Linguistics for Cultural Heritage, Social Sciences, Humanities and Literature}, keywords = {networks}, month = 11, pages = {49–56}, publisher = {Association for Computational Linguistics}, title = {The {F}airy{N}et Corpus - Character Networks for {G}erman Fairy Tales}, year = 2021 }
• 
  Assessing Media Bias in Cross-Linguistic and Cross-National Populations. Sales, Allan; Zehe, Albin; Marinho, Leandro Balby; Veloso, Adriano; Hotho, Andreas; Omeliyanenko, Janna. In Proceedings of the International AAAI Conference on Web and Social Media, 15(1), pp. 561–572. 2021.
  • [ BibTeX ]
  • [ URL ]
  • [ Download ]
  • [ BibSonomy-Post ]
  @article{sales2021assessing, author = {Sales, Allan and Zehe, Albin and Marinho, Leandro Balby and Veloso, Adriano and Hotho, Andreas and Omeliyanenko, Janna}, journal = {Proceedings of the International AAAI Conference on Web and Social Media}, keywords = {author:zehe}, month = {05}, number = 1, pages = {561-572}, title = {Assessing Media Bias in Cross-Linguistic and Cross-National Populations}, volume = 15, year = 2021 }
• 
  Shared Task on Scene Segmentation @ KONVENS 2021. Zehe, Albin; Konle, Leonard; Guhr, Svenja; Dümpelmann, Lea; Gius, Evelyn; Hotho, Andreas; Jannidis, Fotis; Kaufmann, Lucas; Krug, Markus; Puppe, Frank; Reiter, Nils; Schreiber, Annekea. In Shared Task on Scene Segmentation @ KONVENS 2021, pp. 1–21. 2021.
  • [ BibTeX ]
  • [ URL ]
  • [ Download ]
  • [ BibSonomy-Post ]
  @inproceedings{zehe2021shared, author = {Zehe, Albin and Konle, Leonard and Guhr, Svenja and Dümpelmann, Lea and Gius, Evelyn and Hotho, Andreas and Jannidis, Fotis and Kaufmann, Lucas and Krug, Markus and Puppe, Frank and Reiter, Nils and Schreiber, Annekea}, booktitle = {Shared Task on Scene Segmentation @ KONVENS 2021}, keywords = {author:zehe}, pages = {1-21}, title = {Shared Task on Scene Segmentation @ KONVENS 2021}, year = 2021 }
• 
  Detecting Scenes in Fiction: A new Segmentation Task. Zehe, Albin; Konle, Leonard; Dümpelmann, Lea; Gius, Evelyn; Hotho, Andreas; Jannidis, Fotis; Kaufmann, Lucas; Krug, Markus; Puppe, Frank; Reiter, Nils; Schreiber, Annekea; Wiedmer, Nathalie. In Proceedings of the 16th Conference of the {E}uropean Chapter of the Association for Computational Linguistics: Volume 1, Long Papers. ACL, 2021.
  • [ BibTeX ]
  • [ Download ]
  • [ BibSonomy-Post ]
  @inproceedings{zehe2021detecting, author = {Zehe, Albin and Konle, Leonard and Dümpelmann, Lea and Gius, Evelyn and Hotho, Andreas and Jannidis, Fotis and Kaufmann, Lucas and Krug, Markus and Puppe, Frank and Reiter, Nils and Schreiber, Annekea and Wiedmer, Nathalie}, booktitle = {Proceedings of the 16th Conference of the {E}uropean Chapter of the Association for Computational Linguistics: Volume 1, Long Papers}, keywords = {author:zehe}, publisher = {ACL}, title = {Detecting Scenes in Fiction: A new Segmentation Task}, year = 2021 }

• 
  SimLoss: Class Similarities in Cross Entropy. Kobs, Konstantin; Steininger, Michael; Zehe, Albin; Lautenschlager, Florian; Hotho, Andreas. 2020.
  • [ Abstract ]
  • [ BibTeX ]
  • [ URL ]
  • [ BibSonomy-Post ]
  One common loss function in neural network classification tasks is Categorical Cross Entropy (CCE), which punishes all misclassifications equally. However, classes often have an inherent structure. For instance, classifying an image of a rose as "violet" is better than as "truck". We introduce SimLoss, a drop-in replacement for CCE that incorporates class similarities along with two techniques to construct such matrices from task-specific knowledge. We test SimLoss on Age Estimation and Image Classification and find that it brings significant improvements over CCE on several metrics. SimLoss therefore allows for explicit modeling of background knowledge by simply exchanging the loss function, while keeping the neural network architecture the same. Code and additional resources can be found at https://github.com/konstantinkobs/SimLoss.

  @misc{kobs2020simloss, abstract = {One common loss function in neural network classification tasks is Categorical Cross Entropy (CCE), which punishes all misclassifications equally. However, classes often have an inherent structure. For instance, classifying an image of a rose as "violet" is better than as "truck". We introduce SimLoss, a drop-in replacement for CCE that incorporates class similarities along with two techniques to construct such matrices from task-specific knowledge. We test SimLoss on Age Estimation and Image Classification and find that it brings significant improvements over CCE on several metrics. SimLoss therefore allows for explicit modeling of background knowledge by simply exchanging the loss function, while keeping the neural network architecture the same. Code and additional resources can be found at https://github.com/konstantinkobs/SimLoss.}, author = {Kobs, Konstantin and Steininger, Michael and Zehe, Albin and Lautenschlager, Florian and Hotho, Andreas}, keywords = {author:zehe}, note = {cite arxiv:2003.03182Comment: This paper is going to be published in the proceedings of the 25th International Symposium on Methodologies for Intelligent Systems (ISMIS)}, title = {SimLoss: Class Similarities in Cross Entropy}, year = 2020 }
• 
  LM4KG: Improving Common Sense Knowledge Graphs with Language Models. Omeliyanenko, Janna; Zehe, Albin; Hettinger, Lena; Hotho, Andreas. In International Semantic Web Conference. Springer, 2020.
  • [ BibTeX ]
  • [ Download ]
  • [ BibSonomy-Post ]
  @inproceedings{omeliyanenko2020reweight, author = {Omeliyanenko, Janna and Zehe, Albin and Hettinger, Lena and Hotho, Andreas}, booktitle = {International Semantic Web Conference}, keywords = {graph}, organization = {Springer}, title = {LM4KG: Improving Common Sense Knowledge Graphs with Language Models}, year = 2020 }
• 
  Time Series Forecasting for Self-Aware Systems. {Bauer}, A.; {Züfle}, M.; {Herbst}, N.; {Zehe}, A.; {Hotho}, A.; {Kounev}, S. In Proceedings of the IEEE, pp. 1–26. 2020.
  • [ Abstract ]
  • [ BibTeX ]
  • [ BibSonomy-Post ]
  Modern distributed systems and Internet-of-Things applications are governed by fast living and changing requirements. Moreover, they have to struggle with huge amounts of data that they create or have to process. To improve the self-awareness of such systems and enable proactive and autonomous decisions, reliable time series forecasting methods are required. However, selecting a suitable forecasting method for a given scenario is a challenging task. According to the ``No-Free-Lunch Theorem,'' there is no general forecasting method that always performs best. Thus, manual feature engineering remains to be a mandatory expert task to avoid trial and error. Furthermore, determining the expected time-to-result of existing forecasting methods is a challenge. In this article, we extensively assess the state-of-the-art in time series forecasting. We compare existing methods and discuss the issues that have to be addressed to enable their use in a self-aware computing context. To address these issues, we present a step-by-step approach to fully automate the feature engineering and forecasting process. Then, following the principles from benchmarking, we establish a level-playing field for evaluating the accuracy and time-to-result of automated forecasting methods for a broad set of application scenarios. We provide results of a benchmarking competition to guide in selecting and appropriately using existing forecasting methods for a given self-aware computing context. Finally, we present a case study in the area of self-aware data-center resource management to exemplify the benefits of fully automated learning and reasoning processes on time series data.

  @article{9069193, abstract = {Modern distributed systems and Internet-of-Things applications are governed by fast living and changing requirements. Moreover, they have to struggle with huge amounts of data that they create or have to process. To improve the self-awareness of such systems and enable proactive and autonomous decisions, reliable time series forecasting methods are required. However, selecting a suitable forecasting method for a given scenario is a challenging task. According to the ``No-Free-Lunch Theorem,'' there is no general forecasting method that always performs best. Thus, manual feature engineering remains to be a mandatory expert task to avoid trial and error. Furthermore, determining the expected time-to-result of existing forecasting methods is a challenge. In this article, we extensively assess the state-of-the-art in time series forecasting. We compare existing methods and discuss the issues that have to be addressed to enable their use in a self-aware computing context. To address these issues, we present a step-by-step approach to fully automate the feature engineering and forecasting process. Then, following the principles from benchmarking, we establish a level-playing field for evaluating the accuracy and time-to-result of automated forecasting methods for a broad set of application scenarios. We provide results of a benchmarking competition to guide in selecting and appropriately using existing forecasting methods for a given self-aware computing context. Finally, we present a case study in the area of self-aware data-center resource management to exemplify the benefits of fully automated learning and reasoning processes on time series data.}, author = {{Bauer}, A. and {Züfle}, M. and {Herbst}, N. and {Zehe}, A. and {Hotho}, A. and {Kounev}, S.}, journal = {Proceedings of the IEEE}, keywords = {Forecasting}, pages = {1-26}, title = {Time Series Forecasting for Self-Aware Systems}, year = 2020 }
• 
  HarryMotions – Classifying Relationships in Harry Potter based on Emotion Analysis. Zehe, Albin; Arns, Julia; Hettinger, Lena; Hotho, Andreas. In 5th SwissText & 16th KONVENS Joint Conference. 2020.
  • [ BibTeX ]
  • [ Download ]
  • [ BibSonomy-Post ]
  @inproceedings{zehe2020harrymotions, author = {Zehe, Albin and Arns, Julia and Hettinger, Lena and Hotho, Andreas}, booktitle = {5th SwissText & 16th KONVENS Joint Conference}, keywords = {author:zehe}, title = {HarryMotions – Classifying Relationships in Harry Potter based on Emotion Analysis}, year = 2020 }
• 
  Emote-Controlled: Obtaining Implicit Viewer Feedback through Emote based Sentiment Analysis on Comments of Popular Twitch.tv Channels. Kobs, Konstantin; Zehe, Albin; Bernstetter, Armin; Chibane, Julian; Pfister, Jan; Tritscher, Julian; Hotho, Andreas. In ACM Transactions on Social Computing. 2020.
  • [ BibTeX ]
  • [ BibSonomy-Post ]
  @article{noauthororeditor, author = {Kobs, Konstantin and Zehe, Albin and Bernstetter, Armin and Chibane, Julian and Pfister, Jan and Tritscher, Julian and Hotho, Andreas}, journal = {ACM Transactions on Social Computing}, keywords = {author:zehe}, note = {accepted but not published}, title = {Emote-Controlled: Obtaining Implicit Viewer Feedback through Emote based Sentiment Analysis on Comments of Popular Twitch.tv Channels}, year = 2020 }
• 
  MapLUR: Exploring a New Paradigm for Estimating Air Pollution Using Deep Learning on Map Images. Steininger, Michael; Kobs, Konstantin; Zehe, Albin; Lautenschlager, Florian; Becker, Martin; Hotho, Andreas. In ACM Trans. Spatial Algorithms Syst., 6(3). Association for Computing Machinery, New York, NY, USA, 2020.
  • [ Abstract ]
  • [ BibTeX ]
  • [ URL ]
  • [ BibSonomy-Post ]
  Land-use regression (LUR) models are important for the assessment of air pollution concentrations in areas without measurement stations. While many such models exist, they often use manually constructed features based on restricted, locally available data. Thus, they are typically hard to reproduce and challenging to adapt to areas beyond those they have been developed for. In this paper, we advocate a paradigm shift for LUR models: We propose the Data-driven, Open, Global (DOG) paradigm that entails models based on purely data-driven approaches using only openly and globally available data. Progress within this paradigm will alleviate the need for experts to adapt models to the local characteristics of the available data sources and thus facilitate the generalizability of air pollution models to new areas on a global scale. In order to illustrate the feasibility of the DOG paradigm for LUR, we introduce a deep learning model called MapLUR. It is based on a convolutional neural network architecture and is trained exclusively on globally and openly available map data without requiring manual feature engineering. We compare our model to state-of-the-art baselines like linear regression, random forests and multi-layer perceptrons using a large data set of modeled NO2 concentrations in Central London. Our results show that MapLUR significantly outperforms these approaches even though they are provided with manually tailored features. Furthermore, we illustrate that the automatic feature extraction inherent to models based on the DOG paradigm can learn features that are readily interpretable and closely resemble those commonly used in traditional LUR approaches.

  @article{10.1145/3380973, abstract = {Land-use regression (LUR) models are important for the assessment of air pollution concentrations in areas without measurement stations. While many such models exist, they often use manually constructed features based on restricted, locally available data. Thus, they are typically hard to reproduce and challenging to adapt to areas beyond those they have been developed for. In this paper, we advocate a paradigm shift for LUR models: We propose the Data-driven, Open, Global (DOG) paradigm that entails models based on purely data-driven approaches using only openly and globally available data. Progress within this paradigm will alleviate the need for experts to adapt models to the local characteristics of the available data sources and thus facilitate the generalizability of air pollution models to new areas on a global scale. In order to illustrate the feasibility of the DOG paradigm for LUR, we introduce a deep learning model called MapLUR. It is based on a convolutional neural network architecture and is trained exclusively on globally and openly available map data without requiring manual feature engineering. We compare our model to state-of-the-art baselines like linear regression, random forests and multi-layer perceptrons using a large data set of modeled NO2 concentrations in Central London. Our results show that MapLUR significantly outperforms these approaches even though they are provided with manually tailored features. Furthermore, we illustrate that the automatic feature extraction inherent to models based on the DOG paradigm can learn features that are readily interpretable and closely resemble those commonly used in traditional LUR approaches.}, address = {New York, NY, USA}, author = {Steininger, Michael and Kobs, Konstantin and Zehe, Albin and Lautenschlager, Florian and Becker, Martin and Hotho, Andreas}, journal = {ACM Trans. Spatial Algorithms Syst.}, keywords = {pollution}, month = {04}, number = 3, publisher = {Association for Computing Machinery}, title = {MapLUR: Exploring a New Paradigm for Estimating Air Pollution Using Deep Learning on Map Images}, volume = 6, year = 2020 }
• 
  Improving Sentiment Analysis with Biofeedback Data. Schl{ö}r, Daniel; Zehe, Albin; Kobs, Konstantin; Veseli, Blerta; Westermeier, Franziska; Br{ü}bach, Larissa; Roth, Daniel; Latoschik, Marc Erich; Hotho, Andreas. In Proceedings of LREC2020 Workshop ``People in language, vision and the mind’’ (ONION2020), pp. 28–33. European Language Resources Association (ELRA), Marseille, France, 2020.
  • [ Abstract ]
  • [ BibTeX ]
  • [ URL ]
  • [ Download ]
  • [ BibSonomy-Post ]
  Humans frequently are able to read and interpret emotions of others by directly taking verbal and non-verbal signals in human-to-human communication into account or to infer or even experience emotions from mediated stories. For computers, however, emotion recognition is a complex problem: Thoughts and feelings are the roots of many behavioural responses and they are deeply entangled with neurophysiological changes within humans. As such, emotions are very subjective, often are expressed in a subtle manner, and are highly depending on context. For example, machine learning approaches for text-based sentiment analysis often rely on incorporating sentiment lexicons or language models to capture the contextual meaning. This paper explores if and how we further can enhance sentiment analysis using biofeedback of humans which are experiencing emotions while reading texts. Specifically, we record the heart rate and brain waves of readers that are presented with short texts which have been annotated with the emotions they induce. We use these physiological signals to improve the performance of a lexicon-based sentiment classifier. We find that the combination of several biosignals can improve the ability of a text-based classifier to detect the presence of a sentiment in a text on a per-sentence level.

  @inproceedings{schlor-etal-2020-improving, abstract = {Humans frequently are able to read and interpret emotions of others by directly taking verbal and non-verbal signals in human-to-human communication into account or to infer or even experience emotions from mediated stories. For computers, however, emotion recognition is a complex problem: Thoughts and feelings are the roots of many behavioural responses and they are deeply entangled with neurophysiological changes within humans. As such, emotions are very subjective, often are expressed in a subtle manner, and are highly depending on context. For example, machine learning approaches for text-based sentiment analysis often rely on incorporating sentiment lexicons or language models to capture the contextual meaning. This paper explores if and how we further can enhance sentiment analysis using biofeedback of humans which are experiencing emotions while reading texts. Specifically, we record the heart rate and brain waves of readers that are presented with short texts which have been annotated with the emotions they induce. We use these physiological signals to improve the performance of a lexicon-based sentiment classifier. We find that the combination of several biosignals can improve the ability of a text-based classifier to detect the presence of a sentiment in a text on a per-sentence level.}, address = {Marseille, France}, author = {Schl{\"o}r, Daniel and Zehe, Albin and Kobs, Konstantin and Veseli, Blerta and Westermeier, Franziska and Br{\"u}bach, Larissa and Roth, Daniel and Latoschik, Marc Erich and Hotho, Andreas}, booktitle = {Proceedings of LREC2020 Workshop ``People in language, vision and the mind'' (ONION2020)}, keywords = {author:zehe}, month = {05}, pages = {28–33}, publisher = {European Language Resources Association (ELRA)}, title = {Improving Sentiment Analysis with Biofeedback Data}, year = 2020 }
• 
  Where to Submit? Helping Researchers to Choose the Right Venue. Kobs, Konstantin; Koopmann, Tobias; Zehe, Albin; Fernes, David; Krop, Philipp; Hotho, Andreas. In Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing: Findings, pp. 878–883. Association for Computational Linguistics, Online, 2020.
  • [ BibTeX ]
  • [ URL ]
  • [ BibSonomy-Post ]
  @inproceedings{kobs-etal-2020-submit, address = {Online}, author = {Kobs, Konstantin and Koopmann, Tobias and Zehe, Albin and Fernes, David and Krop, Philipp and Hotho, Andreas}, booktitle = {Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing: Findings}, keywords = {author:zehe}, month = 11, pages = {878–883}, publisher = {Association for Computational Linguistics}, title = {Where to Submit? Helping Researchers to Choose the Right Venue}, year = 2020 }
• 
  Towards Predicting the Subscription Status of Twitch.tv Users. Kobs, Konstantin; Potthast, Martin; Wiegmann, Matti; Zehe, Albin; Stein, Benno; Hotho, Andreas. In Proceedings of ECML-PKDD 2020 ChAT Discovery Challenge on Chat Analytics for Twitch. 2020.
  • [ BibTeX ]
  • [ URL ]
  • [ BibSonomy-Post ]
  @article{kobstowards, author = {Kobs, Konstantin and Potthast, Martin and Wiegmann, Matti and Zehe, Albin and Stein, Benno and Hotho, Andreas}, journal = {Proceedings of ECML-PKDD 2020 ChAT Discovery Challenge on Chat Analytics for Twitch}, keywords = {author:zehe}, title = {Towards Predicting the Subscription Status of Twitch.tv Users}, year = 2020 }

• 
  Team Xenophilius Lovegood at SemEval-2019 Task 4: Hyperpartisanship Classification using Convolutional Neural Networks. Zehe, Albin; Hettinger, Lena; Ernst, Stefan; Hauptmann, Christian; Hotho, Andreas. In Proceedings of The 13th International Workshop on Semantic Evaluation. Association for Computational Linguistics, 2019.
  • [ BibTeX ]
  • [ Download ]
  • [ BibSonomy-Post ]
  @inproceedings{zehe2019xenophilius, author = {Zehe, Albin and Hettinger, Lena and Ernst, Stefan and Hauptmann, Christian and Hotho, Andreas}, booktitle = {Proceedings of The 13th International Workshop on Semantic Evaluation}, keywords = {neuralnets}, publisher = {Association for Computational Linguistics}, title = {Team Xenophilius Lovegood at SemEval-2019 Task 4: Hyperpartisanship Classification using Convolutional Neural Networks}, year = 2019 }
• 
  EClaiRE: Context Matters! – Comparing Word Embeddings for Relation Classification. Hettinger, Lena; Zehe, Albin; Dallmann, Alexander; Hotho, Andreas. In INFORMATIK 2019: 50 Jahre Gesellschaft für Informatik – Informatik für Gesellschaft, K. David, K. Geihs, M. Lange, G. Stumme (eds.), pp. 191–204. Gesellschaft für Informatik e.V., Bonn, 2019.
  • [ BibTeX ]
  • [ Download ]
  • [ BibSonomy-Post ]
  @inproceedings{mci/Hettinger2019, address = {Bonn}, author = {Hettinger, Lena and Zehe, Albin and Dallmann, Alexander and Hotho, Andreas}, booktitle = {INFORMATIK 2019: 50 Jahre Gesellschaft für Informatik – Informatik für Gesellschaft}, editor = {David, Klaus and Geihs, Kurt and Lange, Martin and Stumme, Gerd}, keywords = {relations}, pages = {191-204}, publisher = {Gesellschaft für Informatik e.V.}, title = {EClaiRE: Context Matters! – Comparing Word Embeddings for Relation Classification}, year = 2019 }
• 
  Detection of Scenes in Fiction. Gius, Evelyn; Jannidis, Fotis; Krug, Markus; Zehe, Albin; Hotho, Andreas; Puppe, Frank; Krebs, Jonathan; Reiter, Nils; Wiedmer, Nathalie; Konle, Leonard. In Proceedings of Digital Humanities 2019. 2019.
  • [ BibTeX ]
  • [ Download ]
  • [ BibSonomy-Post ]
  @inproceedings{gius2019detection, author = {Gius, Evelyn and Jannidis, Fotis and Krug, Markus and Zehe, Albin and Hotho, Andreas and Puppe, Frank and Krebs, Jonathan and Reiter, Nils and Wiedmer, Nathalie and Konle, Leonard}, booktitle = {Proceedings of Digital Humanities 2019}, keywords = {author:zehe}, title = {Detection of Scenes in Fiction}, year = 2019 }

• 
  A White-Box Model for Detecting Author Nationality by Linguistic Differences in Spanish Novels. Zehe, Albin; Schlör, Daniel; Henny-Krahmer, Ulrike; Becker, Martin; Hotho, Andreas. In DH. ADHO, 2018.
  • [ BibTeX ]
  • [ Download ]
  • [ BibSonomy-Post ]
  @inproceedings{zehe2018whitebox, author = {Zehe, Albin and Schlör, Daniel and Henny-Krahmer, Ulrike and Becker, Martin and Hotho, Andreas}, booktitle = {DH}, keywords = {classification}, organization = {ADHO}, title = {A White-Box Model for Detecting Author Nationality by Linguistic Differences in Spanish Novels}, year = 2018 }
• 
  Burrows’ Zeta: Exploring and Evaluating Variants and Parameters. Schöch, Christof; Schlör, Daniel; Zehe, Albin; Gebhard, Henning; Becker, Martin; Hotho, Andreas. In DH, pp. 274–277. 2018.
  • [ BibTeX ]
  • [ URL ]
  • [ BibSonomy-Post ]
  @inproceedings{schoech2018zeta, author = {Schöch, Christof and Schlör, Daniel and Zehe, Albin and Gebhard, Henning and Becker, Martin and Hotho, Andreas}, booktitle = {DH}, keywords = {zeta}, pages = {274-277}, title = {Burrows’ Zeta: Exploring and Evaluating Variants and Parameters}, year = 2018 }
• 
  ClaiRE at SemEval-2018 Task 7: Classification of Relations using Embeddings. Hettinger, Lena; Dallmann, Alexander; Zehe, Albin; Niebler, Thomas; Hotho, Andreas. In Proceedings of International Workshop on Semantic Evaluation (SemEval-2018). New Orleans, LA, USA, 2018.
  • [ BibTeX ]
  • [ BibSonomy-Post ]
  @inproceedings{hettinger2018semeval, address = {New Orleans, LA, USA}, author = {Hettinger, Lena and Dallmann, Alexander and Zehe, Albin and Niebler, Thomas and Hotho, Andreas}, booktitle = {Proceedings of International Workshop on Semantic Evaluation (SemEval-2018)}, keywords = {classification}, title = {ClaiRE at SemEval-2018 Task 7: Classification of Relations using Embeddings}, year = 2018 }
• 
  Burrows Zeta: Varianten und Evaluation. Schöch, Christof; Calvo, José; Zehe, Albin; Hotho, Andreas. In DHd 2018. 2018.
  • [ BibTeX ]
  • [ Download ]
  • [ BibSonomy-Post ]
  @inproceedings{schoch2018burrows, author = {Schöch, Christof and Calvo, José and Zehe, Albin and Hotho, Andreas}, booktitle = {DHd 2018}, keywords = {zeta}, title = {Burrows Zeta: Varianten und Evaluation}, year = 2018 }
• 
  Analysing Direct Speech in German Novels. Jannidis, Fotis; Konle, Leonard; Zehe, Albin; Hotho, Andreas; Krug, Markus. In DHd 2018. 2018.
  • [ BibTeX ]
  • [ Download ]
  • [ BibSonomy-Post ]
  @inproceedings{jannidis2018analysing, author = {Jannidis, Fotis and Konle, Leonard and Zehe, Albin and Hotho, Andreas and Krug, Markus}, booktitle = {DHd 2018}, keywords = {directspeech}, title = {Analysing Direct Speech in German Novels}, year = 2018 }

• 
  Towards Sentiment Analysis on German Literature. Zehe, Albin; Becker, Martin; Jannidis, Fotis; Hotho, Andreas. In Joint German/Austrian Conference on Artificial Intelligence (K{ü}nstliche Intelligenz), pp. 387–394. Springer, 2017.
  • [ BibTeX ]
  • [ Download ]
  • [ BibSonomy-Post ]
  @inproceedings{zehe2017sentiment, author = {Zehe, Albin and Becker, Martin and Jannidis, Fotis and Hotho, Andreas}, booktitle = {Joint German/Austrian Conference on Artificial Intelligence (K{\"u}nstliche Intelligenz)}, keywords = {author:zehe}, organization = {Springer}, pages = {387-394}, title = {Towards Sentiment Analysis on German Literature}, year = 2017 }
• 
  Sentiment Analysis on German Novels. Zehe, Albin. 2017.
  • [ BibTeX ]
  • [ BibSonomy-Post ]
  @mastersthesis{zehe2017sentiment, author = {Zehe, Albin}, keywords = {author:zehe}, title = {Sentiment Analysis on German Novels}, year = 2017 }

• 
  Prediction of Happy Endings in German Novels. Zehe, Albin; Becker, Martin; Hettinger, Lena; Hotho, Andreas; Reger, Isabella; Jannidis, Fotis. In Proceedings of the Workshop on Interactions between Data Mining and Natural Language Processing 2016, P. Cellier, T. Charnois, A. Hotho, S. Matwin, M.-F. Moens, Y. Toussaint (eds.), pp. 9–16. 2016.
  • [ Abstract ]
  • [ BibTeX ]
  • [ URL ]
  • [ Download ]
  • [ BibSonomy-Post ]
  Identifying plot structure in novels is a valuable step towards automatic processing of literary corpora. We present an approach to classify novels as either having a happy ending or not. To achieve this, we use features based on different sentiment lexica as input for an SVM- classifier, which yields an average F1-score of about 73%.

  @inproceedings{zehe2016prediction, abstract = {Identifying plot structure in novels is a valuable step towards automatic processing of literary corpora. We present an approach to classify novels as either having a happy ending or not. To achieve this, we use features based on different sentiment lexica as input for an SVM- classifier, which yields an average F1-score of about 73%.}, author = {Zehe, Albin and Becker, Martin and Hettinger, Lena and Hotho, Andreas and Reger, Isabella and Jannidis, Fotis}, booktitle = {Proceedings of the Workshop on Interactions between Data Mining and Natural Language Processing 2016}, editor = {Cellier, Peggy and Charnois, Thierry and Hotho, Andreas and Matwin, Stan and Moens, Marie-Francine and Toussaint, Yannick}, keywords = {author:zehe}, month = {07}, pages = {9-16}, title = {Prediction of Happy Endings in German Novels}, year = 2016 }
• 
  Analyzing Features for the Detection of Happy Endings in German Novels. Jannidis, Fotis; Reger, Isabella; Zehe, Albin; Becker, Martin; Hettinger, Lena; Hotho, Andreas. 2016.
  • [ Abstract ]
  • [ BibTeX ]
  • [ URL ]
  • [ Download ]
  • [ BibSonomy-Post ]
  With regard to a computational representation of literary plot, this paper looks at the use of sentiment analysis for happy ending detection in German novels. Its focus lies on the investigation of previously proposed sentiment features in order to gain insight about the relevance of specific features on the one hand and the implications of their performance on the other hand. Therefore, we study various partitionings of novels, considering the highly variable concept of "ending". We also show that our approach, even though still rather simple, can potentially lead to substantial findings relevant to literary studies.

  @misc{jannidis2016analyzing, abstract = {With regard to a computational representation of literary plot, this paper looks at the use of sentiment analysis for happy ending detection in German novels. Its focus lies on the investigation of previously proposed sentiment features in order to gain insight about the relevance of specific features on the one hand and the implications of their performance on the other hand. Therefore, we study various partitionings of novels, considering the highly variable concept of "ending". We also show that our approach, even though still rather simple, can potentially lead to substantial findings relevant to literary studies.}, author = {Jannidis, Fotis and Reger, Isabella and Zehe, Albin and Becker, Martin and Hettinger, Lena and Hotho, Andreas}, keywords = {author:zehe}, note = {cite arxiv:1611.09028}, title = {Analyzing Features for the Detection of Happy Endings in German Novels}, year = 2016 }