Demo Data from EDBT 2026 / reviewers in the wild / expert
Helge Holzmann
dblp:117/8663
· DBLP profile ↗
7ranked-venue papers
4as first author
0since 2021 · last 2018
0000-0003-4811-6902ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 5 · 4 first-authorArtificial intelligence and machine learning · 2 · 1 first-authorSoftware engineering, systems software and programming languages · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Databases, data mining, and information retrieval
1 paper |
Information retrieval · 77% Web and social media mining · 23% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information retrieval › document retrieval
temporal information retrieval |
0.2 | 1 | 2016 | On the Applicability of Delicious for Temporal Search on Web Archives · SIGIR 2016 |
Web and social media mining › social tagging
social bookmarking |
0.1 | 1 | 2016 | On the Applicability of Delicious for Temporal Search on Web Archives · SIGIR 2016 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2018 | An Analytics Tool for Exploring Scientific Software and Related Publications
Anett Hoppe, Jascha Hagen, Helge Holzmann, Günter Kniesel-Wünsche, Ralph Ewerth |
TPDL | 3 |
| 2017 | Universal distant reading through metadata proxies with archivesparkabstractDigitization and the large-scale preservation of digitized content have engendered new ways of accessing and analyzing collections concurrent with other data mining and extraction efforts. Distant reading refers to the analysis of entire collections instead of close reading individual items like a single physical book or electronic document. The steps performed in distant reading are often common across various types of data collections like books, journals, or web archives, sources that are very valuable and have often been neglected as Big Data. We have extended our tool ArchiveSpark, originally designed to efficiently process Web archives, in order to support arbitrary data collections being served from either local or remote data sources by using metadata proxies. The ability to share and reuse researcher workflows across disciplines with very different datasets makes ArchiveSpark a universal distant reading framework. In this paper, we describe ArchiveSpark's design extensions along an example of how it can be leveraged to analyze symptoms of Polio mentioned in journals from the Medical Heritage Library. Our experiments demonstrate how users can reuse large portions of their job pipeline to accomplish a specific task across diverse data types and sources. Migrating an ArchiveSpark job to process a different dataset introduces an additional average code complexity of only 4.8%. Its expressiveness, scalability, extensibility, reusability, and efficiency has the potential to advance novel and rich methods of scholarly inquiry. Helge Holzmann, Vinay Goel, Emily Novak Gustainis |
IEEE BigData | 1 |
| 2016 | Archiving Software Surrogates on the Web for Future Reference
Helge Holzmann, Wolfram Sperber, Mila Runnwerth |
TPDL | 1 |
| 2016 | On the Applicability of Delicious for Temporal Search on Web ArchivesabstractWeb archives are large longitudinal collections that store webpages from the past, which might be missing on the current live Web. Consequently, temporal search over such collections is essential for finding prominent missing webpages and tasks like historical analysis. However, this has been challenging due to the lack of popularity information and proper ground truth to evaluate temporal retrieval models. In this paper we investigate the applicability of external longitudinal resources to identify important and popular websites in the past and analyze the social bookmarking service Delicious for this purpose. The timestamped bookmarks on Delicious provide explicit cues about popular time periods in the past along with relevant descriptors. These are valuable to identify important documents in the past for a given temporal query. Focusing purely on recall, we analyzed more than 12,000 queries and find that using Delicious yields average recall values from 46% up to 100%, when limiting ourselves to the best represented queries in the considered dataset. This constitutes an attractive and low-overhead approach for quick access into Web archives by not dealing with the actual contents. Helge Holzmann, Wolfgang Nejdl, Avishek Anand |
SIGIR | 1 |
| 2014 | Insights into Entity Name Evolution on Wikipedia
Helge Holzmann, Thomas Risse 0001 |
WISE (2) | 1 |
| 2014 | Tailoring video recording to support efficient GUI testing and debugging
Raphael Pham, Helge Holzmann, Kurt Schneider, Christian Brüggemann |
Softw. Qual. J. | 2 |
| 2012 | NEER: An Unsupervised Method for Named Entity Evolution Recognition
Nina Tahmasebi, Gerhard Gossen, Nattiya Kanhabua, Helge Holzmann, Thomas Risse 0001 |
COLING | 4 |