Demo Data from SIGIR 2026 / reviewers in the wild / expert
Ulla Holst
dblp:31/1479
· DBLP profile ↗
3ranked-venue papers
1as first author
0since 2021 · last 1995
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 1 first-authorComputer networks · 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.
| Theoretical computer science
3 papers |
Information theory · 58% Algorithms and data structures · 27% Mathematical optimization · 15% | |
| Artificial intelligence
1 paper |
Probabilistic and Bayesian machine learning · 100% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model
hidden markov model |
0.0 | 1 | 1995 | Recursive estimation of parameters in Markov-modulated Poisson processes · IEEE Trans. Commun. 1995 |
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
parameter estimation |
0.0 | 1 | 1995 | Recursive estimation of parameters in Markov-modulated Poisson processes · IEEE Trans. Commun. 1995 |
Information theory › estimation theory
density estimation |
0.0 | 1 | 1995 | On-line density estimators with high efficiency · IEEE Trans. Inf. Theory 1995 |
Algorithms and data structures › kernel methods
kernel density estimation |
0.0 | 1 | 1995 | On-line density estimators with high efficiency · IEEE Trans. Inf. Theory 1995 |
Information theory › probability theory › stochastic processes › markov processes
hidden markov model |
0.0 | 1 | 1991 | Recursive estimation in mixture models with Markov regime · IEEE Trans. Inf. Theory 1991 |
Mathematical optimization
statistical estimation |
0.0 | 1 | 1991 | Recursive estimation in mixture models with Markov regime · IEEE Trans. Inf. Theory 1991 |
Information theory › probability theory › stochastic processes
point processes |
0.0 | 1 | 1995 | Recursive estimation of parameters in Markov-modulated Poisson processes · IEEE Trans. Commun. 1995 |
Information theory › probability theory › stochastic processes › point processes
poisson process |
0.0 | 1 | 1995 | Recursive estimation of parameters in Markov-modulated Poisson processes · IEEE Trans. Commun. 1995 |
Methods — techniques the papers use, named apart from their topics
recursive estimation · 0.0expectation-maximization · 0.0online kernel density estimator · 0.0efficiency analysis · 0.0information matrix · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1995 | Recursive estimation of parameters in Markov-modulated Poisson processesabstractA hidden Markov regime is a Markov process that governs the time or space dependent distributions of an observed stochastic process. Recursive algorithms can be used to estimate parameters in mixed distributions governed by a Markov regime. The authors derive a recursive algorithm for estimation of parameters in a Markov-modulated Poisson process also called a Cox point process. By this the authors mean a doubly stochastic Poisson process with a time dependent intensity that can take on a finite number of different values. The intensity switches randomly between the possible values according to a Markov process. The authors consider two different ways to observe the Markov-modulated Poisson process: in the first model the observations consist of the observed time intervals between events, and in the second model they use the total number of events in successive intervals of fixed length. They derive an algorithm for recursive estimation of the Poisson intensities and the switch intensities between the two states and illustrate the algorithm in a simulation study. The estimates of the switch intensities are based on the observed conditional switch probabilities. Georg Lindgren, Ulla Holst |
IEEE Trans. Commun. | 2 |
| 1995 | On-line density estimators with high efficiencyabstractPresents on-line procedures for estimating density functions and their derivatives. At each step, M terms are updated. By increasing M the efficiency compared to the traditional off-line kernel density estimator tends to one. Already for M=2, it exceeds 99.1% for kernel orders and derivatives of practical interest.> Ola Hössjer, Ulla Holst |
IEEE Trans. Inf. Theory | 2 |
| 1991 | Recursive estimation in mixture models with Markov regimeabstractA recursive algorithm is proposed for estimation of parameters in mixture models, where the observations are governed by a hidden Markov chain. The often badly conditioned information matrix is estimated, and its inverse is incorporated into the algorithm. The performance of the algorithm is studied by simulations of a symmetric normal mixture. The algorithm seems to be stable and produce approximately normally distributed estimates, provided the adaptive matrix is kept well conditioned. Some numerical examples are included.> Ulla Holst, Georg Lindgren |
IEEE Trans. Inf. Theory | 1 |