Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Bob Williamson

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

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

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

Artificial intelligence
1 paper
Trustworthy machine learning · 44% Probabilistic and Bayesian machine learning · 44% Learning theory · 13%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning
class probability estimation
0.212015
Learning from Corrupted Binary Labels via Class-Probability Estimation · ICML 2015
Machine learning › Trustworthy machine learning › robustness
learning with noisy labels
0.212015
Learning from Corrupted Binary Labels via Class-Probability Estimation · ICML 2015
Machine learning › Learning theory › ranking
AUC optimization
0.112015
Learning from Corrupted Binary Labels via Class-Probability Estimation · ICML 2015

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

class probability estimation · 0.2balanced error · 0.2
YearPublicationVenuePosition
2015 Learning from Corrupted Binary Labels via Class-Probability Estimation
abstract
Many supervised learning problems involve learning from samples whose labels are corrupted in some way. For example, each sample may have some constant probability of being incorrectly labelled (learning with label noise), or one may have a pool of unlabelled samples in lieu of negative samples (learning from positive and unlabelled data). This paper uses class-probability estimation to study these and other corruption processes belonging to the mutually contaminated distributions framework (Scott et al., 2013), with three conclusions. First, one can optimise balanced error and AUC without knowledge of the corruption process parameters. Second, given estimates of the corruption parameters, one can minimise a range of classification risks. Third, one can estimate the corruption parameters using only corrupted data. Experiments confirm the efficacy of class-probability estimation in learning from corrupted labels.
Aditya Krishna Menon, Brendan van Rooyen, Cheng Soon Ong, Bob Williamson
ICML4