Alert button
Picture for Louis Wehenkel

Louis Wehenkel

Alert button

From global to local MDI variable importances for random forests and when they are Shapley values

Nov 03, 2021
Antonio Sutera, Gilles Louppe, Van Anh Huynh-Thu, Louis Wehenkel, Pierre Geurts

Figure 1 for From global to local MDI variable importances for random forests and when they are Shapley values
Figure 2 for From global to local MDI variable importances for random forests and when they are Shapley values
Figure 3 for From global to local MDI variable importances for random forests and when they are Shapley values
Figure 4 for From global to local MDI variable importances for random forests and when they are Shapley values
Viaarxiv icon

Gradient tree boosting with random output projections for multi-label classification and multi-output regression

May 18, 2019
Arnaud Joly, Louis Wehenkel, Pierre Geurts

Figure 1 for Gradient tree boosting with random output projections for multi-label classification and multi-output regression
Figure 2 for Gradient tree boosting with random output projections for multi-label classification and multi-output regression
Figure 3 for Gradient tree boosting with random output projections for multi-label classification and multi-output regression
Figure 4 for Gradient tree boosting with random output projections for multi-label classification and multi-output regression
Viaarxiv icon

Unit Commitment using Nearest Neighbor as a Short-Term Proxy

Feb 28, 2018
Gal Dalal, Elad Gilboa, Shie Mannor, Louis Wehenkel

Figure 1 for Unit Commitment using Nearest Neighbor as a Short-Term Proxy
Figure 2 for Unit Commitment using Nearest Neighbor as a Short-Term Proxy
Figure 3 for Unit Commitment using Nearest Neighbor as a Short-Term Proxy
Figure 4 for Unit Commitment using Nearest Neighbor as a Short-Term Proxy
Viaarxiv icon

Random Subspace with Trees for Feature Selection Under Memory Constraints

Sep 06, 2017
Antonio Sutera, Célia Châtel, Gilles Louppe, Louis Wehenkel, Pierre Geurts

Figure 1 for Random Subspace with Trees for Feature Selection Under Memory Constraints
Viaarxiv icon

Context-dependent feature analysis with random forests

May 12, 2016
Antonio Sutera, Gilles Louppe, Vân Anh Huynh-Thu, Louis Wehenkel, Pierre Geurts

Figure 1 for Context-dependent feature analysis with random forests
Figure 2 for Context-dependent feature analysis with random forests
Figure 3 for Context-dependent feature analysis with random forests
Figure 4 for Context-dependent feature analysis with random forests
Viaarxiv icon

Random forests with random projections of the output space for high dimensional multi-label classification

Sep 29, 2014
Arnaud Joly, Pierre Geurts, Louis Wehenkel

Figure 1 for Random forests with random projections of the output space for high dimensional multi-label classification
Figure 2 for Random forests with random projections of the output space for high dimensional multi-label classification
Figure 3 for Random forests with random projections of the output space for high dimensional multi-label classification
Figure 4 for Random forests with random projections of the output space for high dimensional multi-label classification
Viaarxiv icon

Classifying pairs with trees for supervised biological network inference

Apr 24, 2014
Marie Schrynemackers, Louis Wehenkel, M. Madan Babu, Pierre Geurts

Figure 1 for Classifying pairs with trees for supervised biological network inference
Figure 2 for Classifying pairs with trees for supervised biological network inference
Figure 3 for Classifying pairs with trees for supervised biological network inference
Figure 4 for Classifying pairs with trees for supervised biological network inference
Viaarxiv icon

On the Construction of the Inclusion Boundary Neighbourhood for Markov Equivalence Classes of Bayesian Network Structures

Dec 12, 2012
Vincent Auvray, Louis Wehenkel

Figure 1 for On the Construction of the Inclusion Boundary Neighbourhood for Markov Equivalence Classes of Bayesian Network Structures
Figure 2 for On the Construction of the Inclusion Boundary Neighbourhood for Markov Equivalence Classes of Bayesian Network Structures
Figure 3 for On the Construction of the Inclusion Boundary Neighbourhood for Markov Equivalence Classes of Bayesian Network Structures
Figure 4 for On the Construction of the Inclusion Boundary Neighbourhood for Markov Equivalence Classes of Bayesian Network Structures
Viaarxiv icon

Optimized Look-Ahead Tree Policies: A Bridge Between Look-Ahead Tree Policies and Direct Policy Search

Aug 23, 2012
Tobias Jung, Louis Wehenkel, Damien Ernst, Francis Maes

Figure 1 for Optimized Look-Ahead Tree Policies: A Bridge Between Look-Ahead Tree Policies and Direct Policy Search
Figure 2 for Optimized Look-Ahead Tree Policies: A Bridge Between Look-Ahead Tree Policies and Direct Policy Search
Figure 3 for Optimized Look-Ahead Tree Policies: A Bridge Between Look-Ahead Tree Policies and Direct Policy Search
Figure 4 for Optimized Look-Ahead Tree Policies: A Bridge Between Look-Ahead Tree Policies and Direct Policy Search
Viaarxiv icon

Meta-Learning of Exploration/Exploitation Strategies: The Multi-Armed Bandit Case

Jul 22, 2012
Francis Maes, Damien Ernst, Louis Wehenkel

Figure 1 for Meta-Learning of Exploration/Exploitation Strategies: The Multi-Armed Bandit Case
Figure 2 for Meta-Learning of Exploration/Exploitation Strategies: The Multi-Armed Bandit Case
Figure 3 for Meta-Learning of Exploration/Exploitation Strategies: The Multi-Armed Bandit Case
Viaarxiv icon