A fair classifier chain for multi‐label bank marketing strategy classification

As more objections have been raised against grant peer-review for being costly and time-consuming, the legitimate question arises whether machine learning algorithms could help assess the epistemic efficiency of the proposed projects. As a case study, we investigated whether project efficiency in high energy physics (HEP) can be algorithmically predicted based on the data from the proposal. To analyze the potential of algorithmic prediction in HEP, we conducted a study on data about the structure (project duration, team number, and team size) and outcomes (citations per paper) of HEP experiments with the goal of predicting their efficiency. In the first step, we assessed the project efficiency using Data Envelopment Analysis (DEA) of 67 experiments conducted in the HEP laboratory Fermilab. In the second step, we employed predictive algorithms to detect which team structures maximize the epistemic performance of an expert group. For this purpose, we used the efficiency scores obtained by DEA and applied predictive algorithms – lasso and ridge linear regression, neural network, and gradient boosted trees – on them. The results of the predictive analyses show moderately high accuracy (mean absolute error equal to 0.123), indicating that they can be beneficial as one of the steps in grant review. Still, their applicability in practice should be approached with caution. Some of the limitations of the algorithmic approach are the unreliability of citation patterns, unobservable variables that influence scientific success, and the potential predictability of the model.

show abstract

A novel bayesian network-based ensemble classifier chains for multi-label classification

Wang,

Zhang,

Chen

et al. 2024

Complex Intell. Syst.

View full text Add to dashboard Cite

In this paper, we address the challenges of random label ordering and limited interpretability associated with Ensemble Classifier Chains (ECC) by introducing a novel ECC method, ECC-MOO&BN, which integrates Bayesian Networks (BN) and Multi-Objective Optimization (MOO). This approach is designed to concurrently overcome these ECC limitations. The ECC-MOO&BN method focuses on extracting diverse and interpretable label orderings for the ECC classifier. We initiated this process by employing mutual information to investigate label relationships and establish the initial structures of the BN. Subsequently, an enhanced NSGA-II algorithm was applied to develop a series of Directed Acyclic Graphs (DAGs) that effectively balance the likelihood and complexity of the BN structure. The rationale behind using the MOO method lies in its ability to optimize both complexity and likelihood simultaneously, which not only diversifies DAG generation but also helps avoid overfitting during the production of label orderings. The DAGs, once sorted topologically, yielded a series of label orderings, which were then seamlessly integrated into the ECC framework for addressing multi-label classification (MLC) problems. Experimental results show that when benchmarked against eleven leading-edge MLC algorithms, our proposed method achieves the highest average ranking across seven evaluation criteria on nine out of thirteen MLC datasets. The results of the Friedman test and Nemenyi test also indicate that the performance of the proposed method has a significant advantage compared to other algorithms.

show abstract

A fair classifier chain for multi‐label bank marketing strategy classification

Cited by 3 publications

References 48 publications

Enhancing Fairness in Classification Tasks with Multiple Variables: A Data- and Model-Agnostic Approach

Enhancing Fairness in Classification Tasks with Multiple Variables: A Data- and Model-Agnostic Approach

Machine learning in scientific grant review: algorithmically predicting project efficiency in high energy physics

A novel bayesian network-based ensemble classifier chains for multi-label classification

Contact Info

Product

Resources

About