Search Results

Documents authored by Frommer, Andreas

Document
DOI: 10.4230/DagRep.1.11.23
Data Mining, Networks and Dynamics (Dagstuhl Seminar 11451)

Authors: Lars Elden and Andreas Frommer

Published in: Dagstuhl Reports, Volume 1, Issue 11 (2012)

Abstract
In many areas one needs to extract relevant information from signals generated by dynamical systems evolving on networks with a configuration that itself evolves with time. Such problems occur e.g. in surveillance systems for security, in early warning systems of disasters such as earthquakes, hurricanes and forest fires, in collaborative filtering, in search engines for evolving data bases and in reputation systems based on evolving votes. In each of those examples one wants to extract relevant information from an evolving database. Information science is one of the most expansive scientific areas nowadays, much due to the vast amount of information that is available on the Internet, and and the rapid growth of e-business. There are several open problems in these areas of research and even partial answers would have an important impact. There is a pressing need to make progress in analysis tools and in algorithms for such complex tasks. The purpose of the Dagstuhl Seminar 11451 ``Data Mining, Networks and Dynamics'' was to bring together a diverse community of researchers working in different aspects of this exciting field.
Cite as

Lars Elden and Andreas Frommer. Data Mining, Networks and Dynamics (Dagstuhl Seminar 11451). In Dagstuhl Reports, Volume 1, Issue 11, pp. 23-38, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)

Copy BibTex To Clipboard

@Article{elden_et_al:DagRep.1.11.23,
  author =	{Elden, Lars and Frommer, Andreas},
  title =	{{Data Mining, Networks and Dynamics (Dagstuhl Seminar 11451)}},
  pages =	{23--38},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2012},
  volume =	{1},
  number =	{11},
  editor =	{Elden, Lars and Frommer, Andreas},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.11.23},
  URN =		{urn:nbn:de:0030-drops-33765},
  doi =		{10.4230/DagRep.1.11.23},
  annote =	{Keywords: dynamic networks, data mining, optimization on manifolds, iterative methods, graph algorithms, network models in applications}
}
Document
DOI: 10.4230/DagSemProc.07071.1
07071 Abstracts Collection – Web Information Retrieval and Linear Algebra Algorithms

Authors: Andreas Frommer, Michael W. Mahoney, and Daniel B. Szyld

Published in: Dagstuhl Seminar Proceedings, Volume 7071, Web Information Retrieval and Linear Algebra Algorithms (2007)

Abstract
From 12th to 16th February 2007, the Dagstuhl Seminar 07071 ``Web Information Retrieval and Linear Algebra Algorithms'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. 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

Andreas Frommer, Michael W. Mahoney, and Daniel B. Szyld. 07071 Abstracts Collection – Web Information Retrieval and Linear Algebra Algorithms. In Web Information Retrieval and Linear Algebra Algorithms. Dagstuhl Seminar Proceedings, Volume 7071, pp. 1-20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{frommer_et_al:DagSemProc.07071.1,
  author =	{Frommer, Andreas and Mahoney, Michael W. and Szyld, Daniel B.},
  title =	{{07071 Abstracts Collection – Web Information Retrieval and Linear Algebra Algorithms}},
  booktitle =	{Web Information Retrieval and Linear Algebra Algorithms},
  pages =	{1--20},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7071},
  editor =	{Andreas Frommer and Michael W. Mahoney and Daniel B. Szyld},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07071.1},
  URN =		{urn:nbn:de:0030-drops-10743},
  doi =		{10.4230/DagSemProc.07071.1},
  annote =	{Keywords: Information retrieval, Markov chains, PageRank, numerical linear algebra, low rank approximations, sparsity, ranking}
}
Document
DOI: 10.4230/DagSemProc.07071.2
07071 Report on Dagstuhl Seminar – Web Information Retrieval and Linear Algebra Algorithms

Authors: Andreas Frommer, Michael W. Mahoney, and Daniel B. Szyld

Published in: Dagstuhl Seminar Proceedings, Volume 7071, Web Information Retrieval and Linear Algebra Algorithms (2007)

Abstract
A seminar concentrating on the intersection of the fields of information retrieval and other web-related aspects with numerical and applied linear algebra techniques was held with the attendance of scientists from industry and academia.
Cite as

Andreas Frommer, Michael W. Mahoney, and Daniel B. Szyld. 07071 Report on Dagstuhl Seminar – Web Information Retrieval and Linear Algebra Algorithms. In Web Information Retrieval and Linear Algebra Algorithms. Dagstuhl Seminar Proceedings, Volume 7071, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{frommer_et_al:DagSemProc.07071.2,
  author =	{Frommer, Andreas and Mahoney, Michael W. and Szyld, Daniel B.},
  title =	{{07071 Report on Dagstuhl Seminar – Web Information Retrieval and Linear Algebra Algorithms}},
  booktitle =	{Web Information Retrieval and Linear Algebra Algorithms},
  pages =	{1--3},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7071},
  editor =	{Andreas Frommer and Michael W. Mahoney and Daniel B. Szyld},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07071.2},
  URN =		{urn:nbn:de:0030-drops-10709},
  doi =		{10.4230/DagSemProc.07071.2},
  annote =	{Keywords: Information retrieval, Markov chains, PageRank, numerical linear algebra, low rank approximations, sparsity , ranking}
}
Document
DOI: 10.4230/DagSemRep.363
Numerical Software with Result Verification (Dagstuhl Seminar 03041)

Authors: René Alt, Andreas Frommer, Ralph Baker Kearfott, and Wolfram Luther

Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)

Abstract
Cite as

René Alt, Andreas Frommer, Ralph Baker Kearfott, and Wolfram Luther. Numerical Software with Result Verification (Dagstuhl Seminar 03041). Dagstuhl Seminar Report 363, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2003)

Copy BibTex To Clipboard

@TechReport{alt_et_al:DagSemRep.363,
  author =	{Alt, Ren\'{e} and Frommer, Andreas and Kearfott, Ralph Baker and Luther, Wolfram},
  title =	{{Numerical Software with Result Verification (Dagstuhl Seminar 03041)}},
  pages =	{1--5},
  ISSN =	{1619-0203},
  year =	{2003},
  type = 	{Dagstuhl Seminar Report},
  number =	{363},
  institution =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemRep.363},
  URN =		{urn:nbn:de:0030-drops-152430},
  doi =		{10.4230/DagSemRep.363},
}
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-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact