Dirk Tasche

dblp:176/5367 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2017
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 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.

Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 67% Learning theory · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › parameter estimation
class prior estimation
0.312017
Fisher Consistency for Prior Probability Shift · J. Mach. Learn. Res. 2017
Machine learning › Learning theory › statistical estimation › statistical consistency
estimator consistency
0.312017
Fisher Consistency for Prior Probability Shift · J. Mach. Learn. Res. 2017
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference › bayesian asymptotics
posterior consistency
0.312017
Fisher Consistency for Prior Probability Shift · J. Mach. Learn. Res. 2017

Methods — techniques the papers use, named apart from their topics

adjusted count · 0.3EM algorithm · 0.3CDE-Iterate · 0.3
YearPublicationVenuePosition
2017 Fisher Consistency for Prior Probability Shift
abstract
We introduce Fisher consistency in the sense of unbiasedness as a desirable property for estimators of class prior probabilities. Lack of Fisher consistency could be used as a criterion to dismiss estimators that are unlikely to deliver precise estimates in test data sets under prior probability and more general data set shift. The usefulness of this unbiasedness concept is demonstrated with three examples of classifiers used for quantification: Adjusted Count, EM-algorithm and CDE- Iterate. We find that Adjusted Count and EM-algorithm are Fisher consistent. A counter-example shows that CDE-Iterate is not Fisher consistent and, therefore, cannot be trusted to deliver reliable estimates of class probabilities.
Dirk Tasche
J. Mach. Learn. Res.1