11 Search Results for "Hochreiter, Sepp"

Document
Research
DOI: 10.4230/TGDK.3.3.4
Mining Inter-Document Argument Structures in Scientific Papers for an Argument Web

Authors: Florian Ruosch, Cristina Sarasua, and Abraham Bernstein

Published in: TGDK, Volume 3, Issue 3 (2025). Transactions on Graph Data and Knowledge, Volume 3, Issue 3

Abstract
In Argument Mining, predicting argumentative relations between texts (or spans) remains one of the most challenging aspects, even more so in the cross-document setting. This paper makes three key contributions to advance research in this domain. We first extend an existing dataset, the Sci-Arg corpus, by annotating it with explicit inter-document argumentative relations, thereby allowing arguments to be distributed over several documents forming an Argument Web; these new annotations are published using Semantic Web technologies (RDF, OWL). Second, we explore and evaluate three automated approaches for predicting these inter-document argumentative relations, establishing critical baselines on the new dataset. We find that a simple classifier based on discourse indicators with access to context outperforms neural methods. Third, we conduct a comparative analysis of these approaches for both intra- and inter-document settings, identifying statistically significant differences in results that indicate the necessity of distinguishing between these two scenarios. Our findings highlight significant challenges in this complex domain and open crucial avenues for future research on the Argument Web of Science, particularly for those interested in leveraging Semantic Web technologies and knowledge graphs to understand scholarly discourse. With this, we provide the first stepping stones in the form of a benchmark dataset, three baseline methods, and an initial analysis for a systematic exploration of this field relevant to the Web of Data and Science.
Cite as

Florian Ruosch, Cristina Sarasua, and Abraham Bernstein. Mining Inter-Document Argument Structures in Scientific Papers for an Argument Web. In Transactions on Graph Data and Knowledge (TGDK), Volume 3, Issue 3, pp. 4:1-4:33, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@Article{ruosch_et_al:TGDK.3.3.4,
  author =	{Ruosch, Florian and Sarasua, Cristina and Bernstein, Abraham},
  title =	{{Mining Inter-Document Argument Structures in Scientific Papers for an Argument Web}},
  journal =	{Transactions on Graph Data and Knowledge},
  pages =	{4:1--4:33},
  ISSN =	{2942-7517},
  year =	{2025},
  volume =	{3},
  number =	{3},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/TGDK.3.3.4},
  URN =		{urn:nbn:de:0030-drops-252159},
  doi =		{10.4230/TGDK.3.3.4},
  annote =	{Keywords: Argument Mining, Large Language Models, Knowledge Graphs, Link Prediction}
}
Document
DOI: 10.4230/OASIcs.DX.2025.12
GEMMA-FD: Zero-Shot Fault Detection in Heat Pumps Using Multimodal Language Models

Authors: Herbert Muehlburger and Franz Wotawa

Published in: OASIcs, Volume 136, 36th International Conference on Principles of Diagnosis and Resilient Systems (DX 2025)

Abstract
Fault detection in heating systems is critical for ensuring energy efficiency and operational reliability. Traditional approaches rely on labeled fault data and expert-defined rules, which are often unavailable or costly to obtain. We introduce GEMMA-FD (GEMMA for Fault Detection), a novel zero-shot framework for fault detection in heat pumps that leverages large language models (LLMs) without requiring labeled anomalies or predefined fault signatures. Our method transforms multivariate sensor time series into structured natural language prompts and augments them with visual features, such as line plots of key variables, to facilitate multimodal reasoning. Using GEMMA-3, an open-weight multimodal LLM, we classify heat pump system states as either normal or faulty. Experiments on a real-world heat pump dataset show that GEMMA-FD can identify unseen faults with reasonable precision, although its performance remains lower than a supervised XGBoost baseline trained on the same prompts. Specifically, GEMMA-FD achieves a macro-F1 score of 0.252, compared to 0.69 for XGBoost, underscoring the trade-off between generalization and targeted accuracy. Nevertheless, GEMMA-FD demonstrates the potential of foundation models for interpretable, multilingual fault detection in cyber-physical systems, while highlighting the need for prompt engineering, few-shot augmentation, and multimodal inputs to improve the classification of rare and complex fault types.
Cite as

Herbert Muehlburger and Franz Wotawa. GEMMA-FD: Zero-Shot Fault Detection in Heat Pumps Using Multimodal Language Models. In 36th International Conference on Principles of Diagnosis and Resilient Systems (DX 2025). Open Access Series in Informatics (OASIcs), Volume 136, pp. 12:1-12:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{muehlburger_et_al:OASIcs.DX.2025.12,
  author =	{Muehlburger, Herbert and Wotawa, Franz},
  title =	{{GEMMA-FD: Zero-Shot Fault Detection in Heat Pumps Using Multimodal Language Models}},
  booktitle =	{36th International Conference on Principles of Diagnosis and Resilient Systems (DX 2025)},
  pages =	{12:1--12:17},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-394-2},
  ISSN =	{2190-6807},
  year =	{2025},
  volume =	{136},
  editor =	{Quinones-Grueiro, Marcos and Biswas, Gautam and Pill, Ingo},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.DX.2025.12},
  URN =		{urn:nbn:de:0030-drops-248015},
  doi =		{10.4230/OASIcs.DX.2025.12},
  annote =	{Keywords: fault detection, anomaly detection, cyber-physical systems, HVAC, heat pumps, energy systems, large language models, zero-shot learning, open-weight LLMs, interpretable AI, multimodal prompts, smart energy}
}
Document
DOI: 10.4230/LIPIcs.GIScience.2025.9
Identifying Resilient Communities in Road Networks: A Path-Based Embedding Approach

Authors: Christopher Wagner, Somayeh Dodge, and Danial Alizadeh

Published in: LIPIcs, Volume 346, 13th International Conference on Geographic Information Science (GIScience 2025)

Abstract
Effective resilience analysis of road networks is fundamental to building sustainable and disaster prepared cities. Identifying which road segments share similar vulnerabilities is important for pinpointing high-risk areas within the network and implementing measures to safeguard them against future disruptions. Graph-based community detection can be applied to group together areas of the network sharing similar structural vulnerabilities. However, current graph-based community detection methods either struggle with integrating node features during partitioning or do not account for the path-based dependencies in road networks. This paper introduces the Path-based Community Embedding (PCE) model, an approach that leverages path-based embeddings to overcome these limitations. PCE combines the strengths of graph attention networks and Long Short-Term Memory models (LSTMs) to learn representations that incorporate both local neighborhood information and long-range path dependencies. Our results on the Santa Barbara road network show that PCE improves community detection performance for resilience analysis, thus offering a powerful tool for urban planners and transportation engineers to preemptively identify vulnerabilities in road networks.
Cite as

Christopher Wagner, Somayeh Dodge, and Danial Alizadeh. Identifying Resilient Communities in Road Networks: A Path-Based Embedding Approach. In 13th International Conference on Geographic Information Science (GIScience 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 346, pp. 9:1-9:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{wagner_et_al:LIPIcs.GIScience.2025.9,
  author =	{Wagner, Christopher and Dodge, Somayeh and Alizadeh, Danial},
  title =	{{Identifying Resilient Communities in Road Networks: A Path-Based Embedding Approach}},
  booktitle =	{13th International Conference on Geographic Information Science (GIScience 2025)},
  pages =	{9:1--9:10},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-378-2},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{346},
  editor =	{Sila-Nowicka, Katarzyna and Moore, Antoni and O'Sullivan, David and Adams, Benjamin and Gahegan, Mark},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GIScience.2025.9},
  URN =		{urn:nbn:de:0030-drops-238380},
  doi =		{10.4230/LIPIcs.GIScience.2025.9},
  annote =	{Keywords: road networks, resilience analysis, machine learning, graph neural networks}
}
Document
DOI: 10.4230/LIPIcs.SAT.2025.32
Efficient Certified Reasoning for Binarized Neural Networks

Authors: Jiong Yang, Yong Kiam Tan, Mate Soos, Magnus O. Myreen, and Kuldeep S. Meel

Published in: LIPIcs, Volume 341, 28th International Conference on Theory and Applications of Satisfiability Testing (SAT 2025)

Abstract
Neural networks have emerged as essential components in safety-critical applications - these use cases demand complex, yet trustworthy computations. Binarized Neural Networks (BNNs) are a type of neural network where each neuron is constrained to a Boolean value; they are particularly well-suited for safety-critical tasks because they retain much of the computational capacities of full-scale (floating-point or quantized) deep neural networks, but remain compatible with satisfiability solvers for qualitative verification and with model counters for quantitative reasoning. However, existing methods for BNN analysis suffer from either limited scalability or susceptibility to soundness errors, which hinders their applicability in real-world scenarios. In this work, we present a scalable and trustworthy approach for both qualitative and quantitative verification of BNNs. Our approach introduces a native representation of BNN constraints in a custom-designed solver for qualitative reasoning, and in an approximate model counter for quantitative reasoning. We further develop specialized proof generation and checking pipelines with native support for BNN constraint reasoning, ensuring trustworthiness for all of our verification results. Empirical evaluations on a BNN robustness verification benchmark suite demonstrate that our certified solving approach achieves a 9× speedup over prior certified CNF and PB-based approaches, and our certified counting approach achieves a 218× speedup over the existing CNF-based baseline. In terms of coverage, our pipeline produces fully certified results for 99% and 86% of the qualitative and quantitative reasoning queries on BNNs, respectively. This is in sharp contrast to the best existing baselines which can fully certify only 62% and 4% of the queries, respectively.
Cite as

Jiong Yang, Yong Kiam Tan, Mate Soos, Magnus O. Myreen, and Kuldeep S. Meel. Efficient Certified Reasoning for Binarized Neural Networks. In 28th International Conference on Theory and Applications of Satisfiability Testing (SAT 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 341, pp. 32:1-32:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{yang_et_al:LIPIcs.SAT.2025.32,
  author =	{Yang, Jiong and Tan, Yong Kiam and Soos, Mate and Myreen, Magnus O. and Meel, Kuldeep S.},
  title =	{{Efficient Certified Reasoning for Binarized Neural Networks}},
  booktitle =	{28th International Conference on Theory and Applications of Satisfiability Testing (SAT 2025)},
  pages =	{32:1--32:22},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-381-2},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{341},
  editor =	{Berg, Jeremias and Nordstr\"{o}m, Jakob},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2025.32},
  URN =		{urn:nbn:de:0030-drops-237665},
  doi =		{10.4230/LIPIcs.SAT.2025.32},
  annote =	{Keywords: Neural network verification, proof certification, SAT solving, approximate model counting}
}
Document
DOI: 10.4230/LITES.7.1.2
We know what you're doing! Application detection using thermal data

Authors: Philipp Miedl, Rehan Ahmed, and Lothar Thiele

Published in: LITES, Volume 7, Issue 1 (2021): Special Issue on Embedded System Security. Leibniz Transactions on Embedded Systems, Volume 7, Issue 1

Abstract
Modern mobile and embedded devices have high computing power which allows them to be used for multiple purposes. Therefore, applications with low security restrictions may execute on the same device as applications handling highly sensitive information. In such a setup, a security risk occurs if it is possible that an application uses system characteristics to gather information about another application on the same device.In this work, we present a method to leak sensitive runtime information by just using temperature sensor readings of a mobile device. We employ a Convolutional-Neural-Network, Long Short-Term Memory units and subsequent label sequence processing to identify the sequence of executed applications over time. To test our hypothesis we collect data from two state-of-the-art smartphones and real user usage patterns. We show an extensive evaluation using laboratory data, where we achieve labelling accuracies up to 90% and negligible timing error. Based on our analysis we state that the thermal information can be used to compromise sensitive user data and increase the vulnerability of mobile devices. A study based on data collected outside of the laboratory opens up various future directions for research.
Cite as

Philipp Miedl, Rehan Ahmed, and Lothar Thiele. We know what you're doing! Application detection using thermal data. In LITES, Volume 7, Issue 1 (2021): Special Issue on Embedded System Security. Leibniz Transactions on Embedded Systems, Volume 7, Issue 1, pp. 02:1-02:28, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)

Copy BibTex To Clipboard

@Article{miedl_et_al:LITES.7.1.2,
  author =	{Miedl, Philipp and Ahmed, Rehan and Thiele, Lothar},
  title =	{{We know what you're doing! Application detection using thermal data}},
  journal =	{Leibniz Transactions on Embedded Systems},
  pages =	{02:1--02:28},
  ISSN =	{2199-2002},
  year =	{2021},
  volume =	{7},
  number =	{1},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LITES.7.1.2},
  URN =		{urn:nbn:de:0030-drops-192850},
  doi =		{10.4230/LITES.7.1.2},
  annote =	{Keywords: Thermal Monitoring, Side Channel, Data Leak, Sequence Labelling}
}
Document
DOI: 10.4230/DagRep.3.5.78
Computational Methods Aiding Early-Stage Drug Design (Dagstuhl Seminar 13212)

Authors: Andreas Bender, Hinrich Göhlmann, Sepp Hochreiter, and Ziv Shkedy

Published in: Dagstuhl Reports, Volume 3, Issue 5 (2013)

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 13212 "Computational Methods Aiding Early-Stage Drug Design". The aim of the seminar was to bring scientists working on various aspects of drug discovery, genomic technologies and computational science (e.g., bioinformatics, chemoinformatics, machine learning, and statistics) together to explore how high dimensional data sets created by genomic technologies can be integrated to identify functional manifestations of drug actions on living cells early in the drug discovery process.
Cite as

Andreas Bender, Hinrich Göhlmann, Sepp Hochreiter, and Ziv Shkedy. Computational Methods Aiding Early-Stage Drug Design (Dagstuhl Seminar 13212). In Dagstuhl Reports, Volume 3, Issue 5, pp. 78-94, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)

Copy BibTex To Clipboard

@Article{bender_et_al:DagRep.3.5.78,
  author =	{Bender, Andreas and G\"{o}hlmann, Hinrich and Hochreiter, Sepp and Shkedy, Ziv},
  title =	{{Computational Methods Aiding Early-Stage Drug Design (Dagstuhl Seminar 13212)}},
  pages =	{78--94},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2013},
  volume =	{3},
  number =	{5},
  editor =	{Bender, Andreas and G\"{o}hlmann, Hinrich and Hochreiter, Sepp and Shkedy, Ziv},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.3.5.78},
  URN =		{urn:nbn:de:0030-drops-41791},
  doi =		{10.4230/DagRep.3.5.78},
  annote =	{Keywords: Bioinformatics, Chemoinformatics, Machine learning, Statistics, Interdisciplinary applications}
}
Document
DOI: 10.4230/DagSemProc.09081.1
09081 Abstracts Collection – Similarity-based learning on structures

Authors: Michael Biehl, Barbara Hammer, Sepp Hochreiter, Stefan C. Kremer, and Thomas Villmann

Published in: Dagstuhl Seminar Proceedings, Volume 9081, Similarity-based learning on structures (2009)

Abstract
From 15.02. to 20.02.2009, the Dagstuhl Seminar 09081 ``Similarity-based learning on structures '' was held in Schloss Dagstuhl~--~Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
Cite as

Michael Biehl, Barbara Hammer, Sepp Hochreiter, Stefan C. Kremer, and Thomas Villmann. 09081 Abstracts Collection – Similarity-based learning on structures. In Similarity-based learning on structures. Dagstuhl Seminar Proceedings, Volume 9081, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{biehl_et_al:DagSemProc.09081.1,
  author =	{Biehl, Michael and Hammer, Barbara and Hochreiter, Sepp and Kremer, Stefan C. and Villmann, Thomas},
  title =	{{09081 Abstracts Collection – Similarity-based learning on structures}},
  booktitle =	{Similarity-based learning on structures},
  pages =	{1--15},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9081},
  editor =	{Michael Biehl and Barbara Hammer and Sepp Hochreiter and Stefan C. Kremer and Thomas Villmann},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09081.1},
  URN =		{urn:nbn:de:0030-drops-20395},
  doi =		{10.4230/DagSemProc.09081.1},
  annote =	{Keywords: Similarity-based clustering and classification, metric adaptation and kernel design, learning on graphs, spatiotemporal data}
}
Document
DOI: 10.4230/DagSemProc.09081.2
09081 Summary – Similarity-based learning on structures

Authors: Michael Biehl, Barbara Hammer, Sepp Hochreiter, Stefan C. Kremer, and Thomas Villmann

Published in: Dagstuhl Seminar Proceedings, Volume 9081, Similarity-based learning on structures (2009)

Abstract
The seminar centered around different aspects of similarity-based clustering with the special focus on structures. This included theoretical foundations, new algorithms, innovative applications, and future challenges for the field.
Cite as

Michael Biehl, Barbara Hammer, Sepp Hochreiter, Stefan C. Kremer, and Thomas Villmann. 09081 Summary – Similarity-based learning on structures. In Similarity-based learning on structures. Dagstuhl Seminar Proceedings, Volume 9081, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{biehl_et_al:DagSemProc.09081.2,
  author =	{Biehl, Michael and Hammer, Barbara and Hochreiter, Sepp and Kremer, Stefan C. and Villmann, Thomas},
  title =	{{09081 Summary – Similarity-based learning on structures}},
  booktitle =	{Similarity-based learning on structures},
  pages =	{1--4},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9081},
  editor =	{Michael Biehl and Barbara Hammer and Sepp Hochreiter and Stefan C. Kremer and Thomas Villmann},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09081.2},
  URN =		{urn:nbn:de:0030-drops-20382},
  doi =		{10.4230/DagSemProc.09081.2},
  annote =	{Keywords: Similarity-based clustering and classification, metric adaptation and kernel design, learning on graphs, spatiotemporal data}
}
Document
DOI: 10.4230/DagSemProc.09081.3
An adaptive model for learning molecular endpoints

Authors: Ian Walsh, Alessandro Vullo, and Gianluca Pollastri

Published in: Dagstuhl Seminar Proceedings, Volume 9081, Similarity-based learning on structures (2009)

Abstract
I will describe a recursive neural network that deals with undirected graphs, and its application to predicting property labels or activity values of small molecules. The model is entirely general, in that it can process any undirected graph with a finite number of nodes by factorising it into a number of directed graphs with the same skeleton. The model's only input in the applications I will present is the graph representing the chemical structure of the molecule. In spite of its simplicity, the model outperforms or matches the state of the art in three of the four tasks, and in the fourth is outperformed only by a method resorting to a very problem-specific feature.
Cite as

Ian Walsh, Alessandro Vullo, and Gianluca Pollastri. An adaptive model for learning molecular endpoints. In Similarity-based learning on structures. Dagstuhl Seminar Proceedings, Volume 9081, pp. 1-16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{walsh_et_al:DagSemProc.09081.3,
  author =	{Walsh, Ian and Vullo, Alessandro and Pollastri, Gianluca},
  title =	{{An adaptive model for learning molecular endpoints}},
  booktitle =	{Similarity-based learning on structures},
  pages =	{1--16},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9081},
  editor =	{Michael Biehl and Barbara Hammer and Sepp Hochreiter and Stefan C. Kremer and Thomas Villmann},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09081.3},
  URN =		{urn:nbn:de:0030-drops-20367},
  doi =		{10.4230/DagSemProc.09081.3},
  annote =	{Keywords: Recursive neural networks, qsar, qspr, small molecules}
}
Document
DOI: 10.4230/DagSemProc.09081.4
Analysis of Robust Soft Learning Vector Quantization and an application to Facial Expression Recognition

Authors: Gert-Jan de Vries and Michael Biehl

Published in: Dagstuhl Seminar Proceedings, Volume 9081, Similarity-based learning on structures (2009)

Abstract
Learning Vector Quantization (LVQ) is a popular method for multiclass classification. Several variants of LVQ have been developed recently, of which Robust Soft Learning Vector Quantization (RSLVQ) is a promising one. Although LVQ methods have an intuitive design with clear updating rules, their dynamics are not yet well understood. In simulations within a controlled environment RSLVQ performed very close to optimal. This controlled environment enabled us to perform a mathematical analysis as a first step in obtaining a better theoretical understanding of the learning dynamics. In this talk I will discuss the theoretical analysis and its results. Moreover, I will focus on the practical application of RSLVQ to a real world dataset containing extracted features from facial expression data.
Cite as

Gert-Jan de Vries and Michael Biehl. Analysis of Robust Soft Learning Vector Quantization and an application to Facial Expression Recognition. In Similarity-based learning on structures. Dagstuhl Seminar Proceedings, Volume 9081, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{devries_et_al:DagSemProc.09081.4,
  author =	{de Vries, Gert-Jan and Biehl, Michael},
  title =	{{Analysis of Robust Soft Learning Vector Quantization and an application to Facial Expression Recognition}},
  booktitle =	{Similarity-based learning on structures},
  pages =	{1--5},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9081},
  editor =	{Michael Biehl and Barbara Hammer and Sepp Hochreiter and Stefan C. Kremer and Thomas Villmann},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09081.4},
  URN =		{urn:nbn:de:0030-drops-20356},
  doi =		{10.4230/DagSemProc.09081.4},
  annote =	{Keywords: Learning Vector Quantization, Analysis, Facial Expression Recognition}
}
Document
DOI: 10.4230/DagSemProc.09081.5
Estimating Time Delay in Gravitationally Lensed Fluxes

Authors: Peter Tino, Juan C. Cuevas-Tello, and Somak Raychaudhury

Published in: Dagstuhl Seminar Proceedings, Volume 9081, Similarity-based learning on structures (2009)

Abstract
We study the problem of estimating the time delay between two signals representing delayed, irregularly sampled and noisy versions of the same underlying pattern. We propose a kernel-based technique in the context of an astronomical problem, namely estimating the time delay between two gravitationally lensed signals from a distant quasar. We test the algorithm on several artificial data sets, and also on real astronomical observations. By carrying out a statistical analysis of the results we present a detailed comparison of our method with the most popular methods for time delay estimation in astrophysics. Our method yields more accurate and more stable time delay estimates. Our methodology can be readily applied to current state-of-the-art optical monitoring data in astronomy, but can also be applied in other disciplines involving similar time series data.
Cite as

Peter Tino, Juan C. Cuevas-Tello, and Somak Raychaudhury. Estimating Time Delay in Gravitationally Lensed Fluxes. In Similarity-based learning on structures. Dagstuhl Seminar Proceedings, Volume 9081, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{tino_et_al:DagSemProc.09081.5,
  author =	{Tino, Peter and Cuevas-Tello, Juan C. and Raychaudhury, Somak},
  title =	{{Estimating Time Delay in Gravitationally Lensed Fluxes}},
  booktitle =	{Similarity-based learning on structures},
  pages =	{1--3},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9081},
  editor =	{Michael Biehl and Barbara Hammer and Sepp Hochreiter and Stefan C. Kremer and Thomas Villmann},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09081.5},
  URN =		{urn:nbn:de:0030-drops-20378},
  doi =		{10.4230/DagSemProc.09081.5},
  annote =	{Keywords: Time series, kernel regression, statistical analysis, evolutionary algorithms, mixed representation}
}
  • Refine by Type
  • 11 Document/PDF
  • 4 Document/HTML

  • Refine by Publication Year
  • 4 2025
  • 1 2021
  • 1 2013
  • 5 2009

  • Refine by Author
  • 3 Biehl, Michael
  • 3 Hochreiter, Sepp
  • 2 Hammer, Barbara
  • 2 Kremer, Stefan C.
  • 2 Villmann, Thomas
  • Show More...

  • Refine by Series/Journal
  • 2 LIPIcs
  • 1 OASIcs
  • 1 LITES
  • 1 TGDK
  • 1 DagRep
  • Show More...

  • Refine by Classification
  • 1 Computer systems organization → Embedded and cyber-physical systems
  • 1 Computing methodologies → Anomaly detection
  • 1 Computing methodologies → Artificial intelligence
  • 1 Computing methodologies → Information extraction
  • 1 Computing methodologies → Knowledge representation and reasoning
  • Show More...

  • Refine by Keyword
  • 2 Similarity-based clustering and classification
  • 2 learning on graphs
  • 2 metric adaptation and kernel design
  • 2 spatiotemporal data
  • 1 Analysis
  • Show More...

Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact