Demo Data from EDBT 2026 / reviewers in the wild / expert
Vasilii Ershov
dblp:255/7044
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2019
—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 · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Data mining · 100% | |
| Theoretical computer science
1 paper |
Computational complexity · 100% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Trustworthy machine learning
interpretability |
0.4 | 1 | 2019 | MonoForest framework for tree ensemble analysis · NeurIPS 2019 |
Machine learning › Trustworthy machine learning › interpretability › tree-based interpretability
tree ensemble explanation |
0.4 | 1 | 2019 | MonoForest framework for tree ensemble analysis · NeurIPS 2019 |
Data mining › model selection
ensemble pruning |
0.4 | 1 | 2019 | MonoForest framework for tree ensemble analysis · NeurIPS 2019 |
Computational complexity › boolean function analysis
polynomial representation |
0.1 | 1 | 2019 | MonoForest framework for tree ensemble analysis · NeurIPS 2019 |
Methods — techniques the papers use, named apart from their topics
polynomial transformation · 1.1greedy optimization · 1.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | MonoForest framework for tree ensemble analysisabstractIn this work, we introduce a new decision tree ensemble representation framework: instead of using a graph model we transform each tree into a well-known polynomial form. We apply the new representation to three tasks: theoretical analysis, model reduction, and interpretation. The polynomial form of a tree ensemble allows a straightforward interpretation of the original model. In our experiments, it shows comparable results with state-of-the-art interpretation techniques. Another application of the framework is the ensemble-wise pruning: we can drop monomials from the polynomial, based on train data statistics. This way we reduce the model size up to 3 times without loss of its quality. It is possible to show the equivalence of tree shape classes that share the same polynomial. This fact gives us the ability to train a model in one tree's shape and exploit it in another, which is easier for computation or interpretation. We formulate a problem statement for optimal tree ensemble translation from one form to another and build a greedy solution to this problem. Igor E. Kuralenok, Vasilii Ershov, Igor Labutin |
NeurIPS | 2 |