Volume

Dagstuhl Seminar Proceedings, Volume 9081



Publication Details

  • published at: 2009-06-23
  • Publisher: Schloss-Dagstuhl - Leibniz Zentrum für Informatik

Access Numbers

Documents

No documents found matching your filter selection.
Document
09081 Abstracts Collection – Similarity-based learning on structures

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


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
09081 Summary – Similarity-based learning on structures

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


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
An adaptive model for learning molecular endpoints

Authors: Ian Walsh, Alessandro Vullo, and Gianluca Pollastri


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
Analysis of Robust Soft Learning Vector Quantization and an application to Facial Expression Recognition

Authors: Gert-Jan de Vries and Michael Biehl


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
Estimating Time Delay in Gravitationally Lensed Fluxes

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


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}
}

Filters


Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail