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

Bret Hoehn

dblp:26/3987 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
0since 2021 · last 2020
—ORCID · none

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

Artificial intelligence and machine learning · 5 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 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.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 50% Medical and health informatics · 50%
Artificial intelligence
1 paper
Planning, search and constraint satisfaction · 50% Multi-agent systems · 50%
Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
survival analysis
0.412020
Effective Ways to Build and Evaluate Individual Survival Distributions · J. Mach. Learn. Res. 2020
Medical and health informatics › clinical prediction
survival model evaluation
0.412020
Effective Ways to Build and Evaluate Individual Survival Distributions · J. Mach. Learn. Res. 2020
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
game playing
0.112005
Effective Short-Term Opponent Exploitation in Simplified Poker · AAAI 2005
Knowledge, reasoning and agents › Multi-agent systems › imperfect information games
poker
0.112005
Effective Short-Term Opponent Exploitation in Simplified Poker · AAAI 2005
Algorithmic game theory and mechanism design › learning in games
opponent exploitation
0.112005
Effective Short-Term Opponent Exploitation in Simplified Poker · AAAI 2005

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

random survival forests · 0.4multi-task logistic regression · 0.4integrated brier score · 0.4cox proportional hazards · 0.4concordance index · 0.4game theory · 0.1
YearPublicationVenuePosition
2020 Effective Ways to Build and Evaluate Individual Survival Distributions
abstract
An accurate model of a patient’s individual survival distribution can help determine the appropriate treatment for terminal patients. Unfortunately, risk scores (for example from Cox Proportional Hazard models) do not provide survival probabilities, single-time probability models (for instance the Gail model, predicting 5 year probability) only provide for a single time point, and standard Kaplan-Meier survival curves provide only population averages for a large class of patients, meaning they are not specific to individual patients. This motivates an alternative class of tools that can learn a model that provides an individual survival distribution for each subject, which gives survival probabilities across all times, such as extensions to the Cox model, Accelerated Failure Time, an extension to Random Survival Forests, and Multi-Task Logistic Regression. This paper first motivates such 'individual survival distribution' (ISD) models, and explains how they differ from standard models. It then discusses ways to evaluate such models — namely Concordance, 1-Calibration, Integrated Brier score, and versions of L1-loss — then motivates and defines a novel approach, 'D-Calibration', which determines whether a model's probability estimates are meaningful. We also discuss how these measures differ, and use them to evaluate several ISD prediction tools over a range of survival data sets. We also provide a code base for all of these survival models and evaluation measures, at https://github.com/haiderstats/ISDEvaluation.
Humza Haider, Bret Hoehn, Sarah Davis, Russell Greiner
J. Mach. Learn. Res.2
2009 Improved Mean and Variance Approximations for Belief Net Responses via Network Doubling
Peter Hooper, Yasin Abbasi-Yadkori, Russell Greiner, Bret Hoehn
UAI4
2009 Effective short-term opponent exploitation in simplified poker
Finnegan Southey, Bret Hoehn, Robert C. Holte
Mach. Learn.2
2008 Does Wikipedia Information Help Netflix Predictions?
abstract
We explore several ways to estimate movie similarity from the free encyclopedia Wikipedia with the goal of im-proving our predictions for the Netflix Prize. Our system first uses the content and hyperlink structure of Wikipedia articles to identify similarities between movies. We then predict a user’s unknown ratings by using these similarities in conjunction with the user’s known ratings to initialize matrix factorization and k-Nearest Neighbours algorithms. We blend these results with existing ratings-based predic-tors. Finally, we discuss our empirical results, which sug-gest that external Wikipedia data does not significantly im-prove the overall prediction accuracy. 1
John D. Lees-Miller, Fraser Anderson, Bret Hoehn, Russell Greiner
ICMLA3
2005 Effective Short-Term Opponent Exploitation in Simplified Poker
Bret Hoehn, Finnegan Southey, Robert C. Holte, Valeriy Bulitko
AAAI1