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

Håvard Kvamme

dblp:216/9969 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
1since 2021 · last 2023
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 3 first-author · 1 since 2021

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
2 papers
Probabilistic and Bayesian machine learning · 50% Trustworthy machine learning · 37% Learning paradigms · 13%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
brier score
1.022023
The Brier Score under Administrative Censoring: Problems and a Solution · J. Mach. Learn. Res. 2023
Time-to-Event Prediction with Neural Networks and Cox Regression · J. Mach. Learn. Res. 2019
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
survival analysis
1.022023
The Brier Score under Administrative Censoring: Problems and a Solution · J. Mach. Learn. Res. 2023
Time-to-Event Prediction with Neural Networks and Cox Regression · J. Mach. Learn. Res. 2019
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › survival analysis
cox proportional hazards model
0.412019
Time-to-Event Prediction with Neural Networks and Cox Regression · J. Mach. Learn. Res. 2019
Machine learning › Learning paradigms › supervised learning
time-to-event prediction
0.412019
Time-to-Event Prediction with Neural Networks and Cox Regression · J. Mach. Learn. Res. 2019

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

kaplan-meier estimator · 0.7inverse probability of censoring weighting · 0.7nested case-control · 0.4cox partial log-likelihood · 0.4
YearPublicationVenuePosition
2023 The Brier Score under Administrative Censoring: Problems and a Solution
abstract
The Brier score is commonly used for evaluating probability predictions. In survival analysis, with right-censored observations of the event times, this score can be weighted by the inverse probability of censoring (IPCW) to retain its original interpretation. It is common practice to estimate the censoring distribution with the Kaplan-Meier estimator, even though it assumes that the censoring distribution is independent of the covariates. This paper investigates problems that may arise for the IPCW weighting scheme when the covariates used in the prediction model contain information about the censoring times. In particular, this may occur for administratively censored data if the distribution of the covariates varies with calendar time. For administratively censored data, we propose an alternative version of the Brier score. This administrative Brier score does not require estimation of the censoring distribution and is valid also when the censoring times can be predicted from the covariates.
Håvard Kvamme, Ørnulf Borgan
J. Mach. Learn. Res.1
2019 Time-to-Event Prediction with Neural Networks and Cox Regression
abstract
New methods for time-to-event prediction are proposed by extending the Cox proportional hazards model with neural networks. Building on methodology from nested case-control studies, we propose a loss function that scales well to large data sets and enables fitting of both proportional and non-proportional extensions of the Cox model. Through simulation studies, the proposed loss function is verified to be a good approximation for the Cox partial log-likelihood. The proposed methodology is compared to existing methodologies on real-world data sets and is found to be highly competitive, typically yielding the best performance in terms of Brier score and binomial log-likelihood. A python package for the proposed methods is available at https://github.com/havakv/pycox.
Håvard Kvamme, Ørnulf Borgan, Ida Scheel
J. Mach. Learn. Res.1
2018 Predicting mortgage default using convolutional neural networks
abstract
We predict mortgage default by applying convolutional neural networks to consumer transaction data. For each consumer we have the balances of the checking account, savings account, and the credit card, in addition to the daily number of transactions on the checking account, and amount transferred into the checking account. With no other information about each consumer we are able to achieve a ROC AUC of 0.918 for the networks, and 0.926 for the networks in combination with a random forests classifier.
Håvard Kvamme, Nikolai Sellereite, Kjersti Aas, Steffen Sjursen
Expert Syst. Appl.1