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

Evgeni Levin

dblp:169/0257 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
1since 2021 · last 2022
0000-0002-0368-6146ORCID · corroborated

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

Artificial intelligence and machine learning · 4 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 2

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
Trustworthy machine learning · 69% Graph learning · 25% Probabilistic and Bayesian machine learning · 6%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
interpretability
1.022022
Covered Information Disentanglement: Model Transparency via Unbiased Permutation Importance · AAAI 2022
Graph Space Embedding · IJCAI 2019
Machine learning › Trustworthy machine learning › interpretability
feature importance
0.612022
Covered Information Disentanglement: Model Transparency via Unbiased Permutation Importance · AAAI 2022
Machine learning › Trustworthy machine learning › interpretability › feature importance
permutation importance
0.612022
Covered Information Disentanglement: Model Transparency via Unbiased Permutation Importance · AAAI 2022
Machine learning › Graph learning
graph representation learning
0.412019
Graph Space Embedding · IJCAI 2019
Machine learning › Graph learning
network embedding
0.412019
Graph Space Embedding · IJCAI 2019
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models
markov random field
0.212022
Covered Information Disentanglement: Model Transparency via Unbiased Permutation Importance · AAAI 2022

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

permutation importance · 0.6markov random field · 0.6graph space embedding · 0.4
YearPublicationVenuePosition
2022 Covered Information Disentanglement: Model Transparency via Unbiased Permutation Importance
abstract
Model transparency is a prerequisite in many domains and an increasingly popular area in machine learning research. In the medical domain, for instance, unveiling the mechanisms behind a disease often has higher priority than the diagnostic itself since it might dictate or guide potential treatments and research directions. One of the most popular approaches to explain model global predictions is the permutation importance where the performance on permuted data is benchmarked against the baseline. However, this method and other related approaches will undervalue the importance of a feature in the presence of covariates since these cover part of its provided information. To address this issue, we propose Covered Information Disentanglement CID, a framework that considers all feature information overlap to correct the values provided by permutation importance. We further show how to compute CID efficiently when coupled with Markov random fields. We demonstrate its efficacy in adjusting permutation importance first on a controlled toy dataset and discuss its effect on real-world medical data.
João P. B. Pereira, Erik S. G. Stroes, Aeilko H. Zwinderman, Evgeni Levin
AAAI4
2019 Graph Space Embedding
abstract
We propose the Graph Space Embedding (GSE), a technique that maps the input into a space where interactions are implicitly encoded, with little computations required. We provide theoretical results on an optimal regime for the GSE, namely a feasibility region for its parameters, and demonstrate the experimental relevance of our findings. Next, we introduce a strategy to gain insight on which interactions are responsible for the certain predictions, paving the way for a far more transparent model. In an empirical evaluation on a real-world clinical cohort containing patients with suspected coronary artery disease, the GSE achieves far better performance than traditional algorithms.
João P. B. Pereira, Albert K. Groen, Erik S. G. Stroes, Evgeni Levin
IJCAI4
2017 Discovery of Salivary Gland Tumors' Biomarkers via Co-Regularized Sparse-Group Lasso
Sultan Imangaliyev, Johannes H. Matse, Jan G. M. Bolscher, Ruud H. Brakenhoff, David T. W. Wong, Elisabeth Bloemena, Enno C. I. Veerman, Evgeni Levin
DS8
2015 KeCo: Kernel-Based Online Co-agreement Algorithm
Laurens Wiel, Tom Heskes, Evgeni Levin
Discovery Science3