Demo Data from VLDB 2026 / reviewers in the wild / expert
Stefan Schrödl
dblp:17/4288 · also Stefan Schroedl
· DBLP profile ↗
7ranked-venue papers
4as first author
0since 2021 · last 2010
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 2 first-authorDatabases, data management, data science and information retrieval · 3 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1
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
2 papers |
Information retrieval · 76% Data mining · 24% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information retrieval › user behavior › search behavior
click model |
0.1 | 1 | 2010 | Improving ad relevance in sponsored search · WSDM 2010 |
Information retrieval › online advertising › sponsored search
query-ad relevance |
0.1 | 1 | 2010 | Improving ad relevance in sponsored search · WSDM 2010 |
Information retrieval › online advertising
sponsored search |
0.1 | 1 | 2010 | Improving ad relevance in sponsored search · WSDM 2010 |
Data mining
clustering |
0.0 | 1 | 2001 | Constrained K-means Clustering with Background Knowledge · ICML 2001 |
Data mining › clustering
constrained clustering |
0.0 | 1 | 2001 | Constrained K-means Clustering with Background Knowledge · ICML 2001 |
Data mining › clustering
k-means clustering |
0.0 | 1 | 2001 | Constrained K-means Clustering with Background Knowledge · ICML 2001 |
Data mining › clustering
semi-supervised clustering |
0.0 | 1 | 2001 | Constrained K-means Clustering with Background Knowledge · ICML 2001 |
Methods — techniques the papers use, named apart from their topics
translation model · 0.1text overlap features · 0.1machine learning · 0.1constrained clustering · 0.0background knowledge · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2010 | Improving ad relevance in sponsored searchabstractWe describe a machine learning approach for predicting sponsored search ad relevance. Our baseline model incorporates basic features of text overlap and we then extend the model to learn from past user clicks on advertisements. We present a novel approach using translation models to learn user click propensity from sparse click logs. Dustin Hillard, Stefan Schrödl, Eren Manavoglu, Hema Raghavan, Chris Leggetter |
WSDM | 2 |
| 2005 | An Improved Search Algorithm for Optimal Multiple-Sequence AlignmentabstractMultiple sequence alignment (MSA) is a ubiquitous problem in computational biology. Although it is NP-hard to find an optimal solution for an arbitrary number of sequences, due to the importance of this problem researchers are trying to push the limits of exact algorithms further. Since MSA can be cast as a classical path finding problem, it is attracting a growing number of AI researchers interested in heuristic search algorithms as a challenge with actual practical relevance. In this paper, we first review two previous, complementary lines of research. Based on Hirschberg's algorithm, Dynamic Programming needs O(kN^(k-1)) space to store both the search frontier and the nodes needed to reconstruct the solution path, for k sequences of length N. Best first search, on the other hand, has the advantage of bounding the search space that has to be explored using a heuristic. However, it is necessary to maintain all explored nodes up to the final solution in order to prevent the search from re-expanding them at higher cost. Earlier approaches to reduce the Closed list are either incompatible with pruning methods for the Open list, or must retain at least the boundary of the Closed list. In this article, we present an algorithm that attempts at combining the respective advantages; like A* it uses a heuristic for pruning the search space, but reduces both the maximum Open and Closed size to O(kN^(k-1)), as in Dynamic Programming. The underlying idea is to conduct a series of searches with successively increasing upper bounds, but using the DP ordering as the key for the Open priority queue. With a suitable choice of thresholds, in practice, a running time below four times that of A* can be expected. In our experiments we show that our algorithm outperforms one of the currently most successful algorithms for optimal multiple sequence alignments, Partial Expansion A*, both in time and memory. Moreover, we apply a refined heuristic based on optimal alignments not only of pairs of sequences, but of larger subsets. This idea is not new; however, to make it practically relevant we show that it is equally important to bound the heuristic computation appropriately, or the overhead can obliterate any possible gain. Furthermore, we discuss a number of improvements in time and space efficiency with regard to practical implementations. Our algorithm, used in conjunction with higher-dimensional heuristics, is able to calculate for the first time the optimal alignment for almost all of the problems in Reference 1 of the benchmark database BAliBASE. Stefan Schrödl |
J. Artif. Intell. Res. | 1 |
| 2005 | Lane keeping based on location technologyabstractVehicle positioning with an accuracy of 10 cm or less will enable lane-keeping assistance in addition to other safety benefits when an enhanced lane-level digital map is in place. With constantly evolving technology and sensors, a high-precision positioning system that fits into the automotive market can be expected within the next decade. Such a system will incorporate Global Positioning System (GPS) and inertial system (INS) for enhanced positioning performance and availability. In this paper, the technology fields that will have a significant impact on the deployment of a centimeter-level vehicle-positioning system will be discussed. Vision-based lane-recognition (VBLR) systems are relatively mature and have already been introduced to the market for lane-departure warning, etc. However, both systems have some limitations. GPS/INS-based systems may suffer from frequent satellite signal masking or blockage, while vision-based systems do not work well in adverse weather conditions or with poor lane signature. Effectively combining these two technologies can make a robust lane-departure warning system. A precision map was made for the test area near Stuttgart using DaimlerChrysler Research and Technology North America (RTNA)'s map-making approach. A Mercedes S-class equipped with both a vision system and a high-precision GPS/INS was used for the test. The positioning map-matching results and the vision offset are compared and the complementary effectiveness is illustrated. Stefan Schrödl, Klaus Mezger, Roland Ortloff, Armin Joos, Thomas Passegger |
IEEE Trans. Intell. Transp. Syst. | 2 |
| 2004 | Mining GPS Traces for Map Refinement
Stefan Schrödl, Kiri Wagstaff, Seth Rogers, Pat Langley |
Data Min. Knowl. Discov. | 1 |
| 2001 | Constrained K-means Clustering with Background Knowledge
Kiri Wagstaff, Claire Cardie, Seth Rogers, Stefan Schrödl |
ICML | 4 |
| 1998 | Explanation-Based Generalization in Game Playing: Quantitative Results
Stefan Schrödl |
ECML | 1 |
| 1996 | Explanation-Based Generalization for Negation as Failure and Multiple Examples
Stefan Schrödl |
ECAI | 1 |