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

Gerda Claeskens

dblp:65/8000 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
1since 2021 · last 2025
0000-0002-3863-5197ORCID · corroborated

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

Artificial intelligence and machine learning · 4 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1Human-computer interaction and ubiquitous computing · 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
2 papers
Probabilistic and Bayesian machine learning · 78% Learning theory · 15% Kernel, tree and ensemble methods · 7%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models
graphical lasso
0.412020
Community-Based Group Graphical Lasso · J. Mach. Learn. Res. 2020
Machine learning › Probabilistic and Bayesian machine learning › structured models
graphical models
0.412020
Community-Based Group Graphical Lasso · J. Mach. Learn. Res. 2020
Data mining › structured data mining › graph mining
community detection
0.112020
Community-Based Group Graphical Lasso · J. Mach. Learn. Res. 2020
Machine learning › Learning theory
model selection
0.112008
An Information Criterion for Variable Selection in Support Vector Machines · J. Mach. Learn. Res. 2008
Machine learning › Kernel, tree and ensemble methods
support vector machine
0.112008
An Information Criterion for Variable Selection in Support Vector Machines · J. Mach. Learn. Res. 2008
Machine learning › Learning theory › model selection
variable selection
0.112008
An Information Criterion for Variable Selection in Support Vector Machines · J. Mach. Learn. Res. 2008

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

group graphical lasso · 0.9community detection · 0.9support vector machine · 0.1information criterion · 0.1
YearPublicationVenuePosition
2025 Instance-dependent cost-sensitive parametric learning
abstract
Instance-dependent cost-sensitive learning addresses classification problems where each observation has a different misclassification cost. In this paper, we propose cost-sensitive parametric models to minimize the expectation of losses. A loss function incorporating the misclassification costs is defined, which serves as the objective function for obtaining cost-sensitive parameter estimators. The consistency and asymptotic normality of these estimators are established under general conditions, theoretically demonstrating their good performance. Additionally, we derive bounds for the bias introduced when regularizing the optimization problem, which is generally necessary in practice. To conclude, the effectiveness of the proposed estimators is evaluated through an extensive novel simulation study and the analysis of five real data sets, further demonstrating their proficiency in practical settings.
Jorge C.-Rella, Gerda Claeskens, Ricardo Cao, Juan Manuel Vilar
Neurocomputing2
2020 Community-Based Group Graphical Lasso
abstract
A new strategy for probabilistic graphical modeling is developed that draws parallels to community detection analysis. The method jointly estimates an undirected graph and homogeneous communities of nodes. The structure of the communities is taken into account when estimating the graph and at the same time, the structure of the graph is accounted for when estimating communities of nodes. The procedure uses a joint group graphical lasso approach with community detection-based grouping, such that some groups of edges co-occur in the estimated graph. The grouping structure is unknown and is estimated based on community detection algorithms. Theoretical derivations regarding graph convergence and sparsistency, as well as accuracy of community recovery are included, while the method's empirical performance is illustrated in an fMRI context, as well as with simulated examples.
Eugen Pircalabelu, Gerda Claeskens
J. Mach. Learn. Res.2
2015 Combining Local and Social Network Classifiers to Improve Churn Prediction
abstract
Past research has shown that both social and local features are informative for customer churn, however some studies have found that combining both kinds of data into a single model is ineffective. People who churn based on their neighbors' behavior are a distinct subset of customers from those who churn for personal reasons. However, for an effective retention campaign, it is desired to identify both groups of likely churners, attempt to explain the factors that lead to churn in both cases, and still determine the customers most likely to churn so they can be contacted. The goal of this research is to evaluate different techniques for combining features and models based on customer attributes and customer social networks to identify the best approaches to deal with this problem.
Aimée Backiel, Yannick Verbinnen, Bart Baesens, Gerda Claeskens
ASONAM4
2008 An Information Criterion for Variable Selection in Support Vector Machines
Gerda Claeskens, Christophe Croux, Johan Van Kerckhoven
J. Mach. Learn. Res.1