Demo Data from EDBT 2026 / reviewers in the wild / expert
A. F. M. Smith
dblp:72/116
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 1981
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 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.
| Artificial intelligence
1 paper |
Learning paradigms · 100% | |
| Theoretical computer science
1 paper |
Algorithms and data structures · 100% | |
| Computer networks
1 paper |
Physical-layer communications · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Learning paradigms
unsupervised learning |
0.0 | 1 | 1981 | Unsupervised learning for signal versus noise · IEEE Trans. Inf. Theory 1981 |
Algorithms and data structures › learning algorithms
unsupervised learning |
0.0 | 1 | 1977 | A quasi-Bayes unsupervised learning procedure for priors (Corresp.) · IEEE Trans. Inf. Theory 1977 |
Physical-layer communications
signal detection |
0.0 | 1 | 1981 | Unsupervised learning for signal versus noise · IEEE Trans. Inf. Theory 1981 |
Physical-layer communications
signal processing for communications |
0.0 | 1 | 1981 | Unsupervised learning for signal versus noise · IEEE Trans. Inf. Theory 1981 |
Algorithms and data structures
classification |
0.0 | 1 | 1977 | A quasi-Bayes unsupervised learning procedure for priors (Corresp.) · IEEE Trans. Inf. Theory 1977 |
Methods — techniques the papers use, named apart from their topics
mixture model · 0.0bayesian inference · 0.0convergence analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1981 | Unsupervised learning for signal versus noiseabstractThe Bayes solution to the unsupervised sequential learning problem induced by a mixture model for the two-class signal versus noise decision problem generates a computational and storage explosion. A quasi-Bayes approximate learning procedure is proposed that avoids the computational explosion while retaining the flavor of the Bayes solution. Convergence is established and efficiency is investigated. A. F. M. Smith, Udi E. Makov |
IEEE Trans. Inf. Theory | 1 |
| 1977 | A quasi-Bayes unsupervised learning procedure for priors (Corresp.)abstractUnsupervised Bayes sequential learning procedures for classification and estimation are often useless in practice because of the amount of computation required. In this paper, a version of a two-class decision problem is considered, and a quasi-Bayes procedure is motivated and defined. The proposed procedure mimics closely the formal Bayes solution while involving only a minimal amount of computation. Convergence properties are established and some numerical illustrations provided. The approach compares favorably with other non-Bayesian learning procedures that have been proposed and can be extended to more general situations. Udi E. Makov, A. F. M. Smith |
IEEE Trans. Inf. Theory | 2 |