Multi-Label Feature Selection Combining Three Types of Conditional Relevance

Abstract

With the rapid growth of the Internet, the curse of dimensionality caused by massive multi-label data has attracted extensive attention. Feature selection plays an indispensable role in dimensionality reduction processing. Many researchers have focused on this subject based on information theory. Here, to evaluate feature relevance, a novel feature relevance term (FR) that employs three incremental information terms to comprehensively consider three key aspects (candidate features, selected features, and label correlations) is designed. A thorough examination of the three key aspects of FR outlined above is more favorable to capturing the optimal features. Moreover, we employ label-related feature redundancy as the label-related feature redundancy term (LR) to reduce unnecessary redundancy. Therefore, a designed multi-label feature selection method that integrates FR with LR is proposed, namely, Feature Selection combining three types of Conditional Relevance (TCRFS). Numerous experiments indicate that TCRFS outperforms the other 6 state-of-the-art multi-label approaches on 13 multi-label benchmark data sets from 4 domains.

1. Introduction

In recent years, multi-label learning [1,2,3,4] has been increasingly popular in applications such as text categorization [5], image annotation [6], protein function prediction [7], etc. Additionally, feature selection is of great significance to solving industrial application problems. Some researchers monitor the wind speed in the wake region to detect wind farm faults based on feature selection [8]. In signal processing applications, feature selection is effective for chatter vibration diagnosis in CNC machines [9]. Feature selection is adopted to classify the cutting stabilities based on the selected features [10]. The most crucial thing in diverse multi-label applications is to classify each sample and its corresponding label accurately. Multi-label learning, such as traditional classification approaches, is vulnerable to dimensional catastrophes. The number of features in text multi-label data is frequently in the tens of thousands, which means that there are a lot of redundant or irrelevant features [11,12]. It can easily lead to the “curse of dimensionality”, which dramatically increases the model complexity and computation time [13]. Feature selection is the process of selecting a set of feature subsets with distinguishing features from the original data set according to specific evaluation criteria. Redundant or irrelevant features can be eliminated to improve model accuracy and reduce feature dimensions, feature space, and running time [14,15]. Simultaneously, the selected features are more conducive to model understanding and data analysis.

In traditional machine learning problems, feature selection approaches include wrapper, embedded, and filter approaches [16,17,18,19]. Among them, wrapper feature selection approaches use the classifier performance to weigh the pros and cons of a feature subset, which has high computational complexity and a large memory footprint [20,21]. The processes of feature selection and learner training are combined in embedded approaches [22,23]. Feature selection is automatically conducted during the learner training procedure when the two are completed in the same optimization procedure. Filter feature selection approaches weigh the pros and cons of feature subsets using specific evaluation criteria [24,25]. It is independent of the classifier, and the calculation is fast and straight. As a result, the filter feature selection approaches are generally used for feature selection.

There are also the above-mentioned three feature selection approaches in multi-label feature selection, with filter feature selection being the most popular. Information theory is a standard mathematical tool for filter feature selection [26]. Based on information theory, this paper mainly focuses on three key aspects that affect feature relevance: candidate features, selected features, and label correlations. The method proposed in this paper examines the amount of information shared between the selected feature subset and the total label set to evaluate feature relevance and denotes it as $\mathsf{\Delta }I$ for the time being. Once any candidate feature is selected in the current selected feature subset, the current selected feature subset will be updated at this point, and $\mathsf{\Delta }I$ will be altered accordingly. Moreover, the original label correlations in the total label set also affect $\mathsf{\Delta }I$ due to some new candidate features being added to the current selected feature subset. Hence, three incremental information terms which combine candidate features, selected features, and label correlations to evaluate feature relevance are used to design a novel feature relevance term. Furthermore, we employ label-related feature redundancy as the feature redundancy term to reduce unnecessary redundancy.

Table 1. Abbreviations meaning statistics.

Abbreviations	Corresponding Meanings
FR	A novel feature relevance term
LR	A label-related feature redundancy term
TCRFS	Feature Selection combining three types of Conditional Relevance

provides three abbreviations and their corresponding meanings we mentioned. We explain them in detail in Section 4.

The major contributions of this paper are as follows:

• Analyze and discuss the indispensability of the three key aspects (candidate features, selected features and label correlations) for feature relevance evaluation;
• Three incremental information terms taking three key aspects into account are used to express three types of conditional relevance. Then, FR combining the three incremental information terms is designed;
• A designed multi-label feature selection method that integrates FR with LR is proposed, namely TCRFS;
• TCRFS is compared to 6 state-of-the-art multi-label feature selection methods on 13 benchmark multi-label data sets using 4 evaluation criteria and certified the efficacy in numerous experiments.

The rest of this paper is structured as follows. Section 2 introduces the preliminary theoretical knowledge of this paper: information theory and the four evaluation criteria used in our experiments. Related works are reviewed in Section 3. Section 4 combines three types of conditional relevance to design FR and proposes TCRFS, which integrates FR with LR. The efficacy of TCRFS is proven by comparing it with 6 multi-label methods on 13 benchmark data sets applying 4 evaluation criteria in Section 5. Section 6 concludes our work in this paper.

2. Preliminaries

2.1. Information Theory for Multi-Label Feature Selection

Information theory is a popular and effective means to tackle the problem of multi-label feature selection [27,28,29]. It is used to measure the correlation between random variables [30] and its fundamentals are covered in this subsection.

Assume that the selected feature subset $S=\{f_1,f_2,\dots ,f_n\}$, the label set $L=\{l_1,l_2,\dots ,l_m\}$. To convey feature relevance, we typically employ $I(S;L)$, which is mutual information between the selected feature subset and the total label set. Mutual information is a measure in information theory. It can be seen as the amount of information contained in one random variable about another random variable. Assume two discrete random variables $X=\{x_1,x_2,\dots ,x_n\}$, $Y=\{y_1,y_2,\dots ,y_m\}$, then the mutual information between X and Y can be represented as $I(X;Y)$. Its expansion formula is as follows:

$$\begin{array}{c}\hfill I(X;Y)=H\left(X\right)-H\left(X\right|Y)=H(Y)-H(Y\left|X\right)\end{array}$$

(1)

where $H\left(X\right)$ denotes the information entropy of X, and $H\left(X\right|Y)$ denotes the conditional entropy of X given Y. Information entropy is a concept used to measure the amount of information in information theory. $H\left(X\right)$ is defined as:

$$\begin{array}{c}\hfill H\left(X\right)=-\sum _{i=1}^{n}p\left(x_i\right)logp\left(x_i\right)\end{array}$$

(2)

where $p\left(x_i\right)$ represents the probability distribution of $x_i$, and the base of the logarithm is 2. The conditional entropy $H\left(X\right|Y)$ is defined as the mathematical expectation of Y for the entropy of the conditional probability distribution of X under the given condition Y:

$$\begin{array}{c}\hfill H\left(X\right|Y)=-\sum _{i=1}^n\sum _{j=1}^{m}p(x_i,y_j)logp\left(x_i\right|y_j)\end{array}$$

(3)

where $p(x_i,y_i)$ and $p\left(x_i\right|y_i)$ represent the joint probability distribution of $(x_i,y_i)$ and the conditional probability distribution of $x_i$ given $y_i$, respectively. $H\left(X\right|Y)$ can also be represented as follows:

$$\begin{array}{c}\hfill H\left(X\right|Y)=H(X,Y)-H(Y)\end{array}$$

(4)

where $H(X,Y)$ is another measure in information theory, namely, the joint entropy. Its definition is as follows:

$$\begin{array}{c}\hfill H(X,Y)=-\sum _{i=1}^n\sum _{j=1}^{m}p(x_i,y_j)logp(x_i,y_j)\end{array}$$

(5)

According to Equation (4), combining the relationship between the three different measures of the amount information, the mutual information $I(X;Y)$ can also be alternatively written as follows:

$$\begin{array}{c}\hfill I(X;Y)=H\left(X\right)+H\left(Y\right)-H(X,Y)\end{array}$$

(6)

It is common in multi-label feature selection to have more than two random variables, assuming another discrete random variable $Z=\{z_1,z_2,\dots ,z_q\}$. The conditional mutual information $I(X;Y|Z)$, which expresses the expected value of mutual information of two discrete random variables X and Y given the value of the third discrete variable Z. It is represented as follows:

$$\begin{array}{c}\hfill I(X;Y|Z)=I(X,Z;Y)-I(Y;Z)=I(X;Y,Z)-I(X;Z)=I(X;Y)-I(X;Y;Z)\end{array}$$

(7)

where $I(X,Z;Y)$ is the joint mutual information and $I(X;Y;Z)$ is the interaction information. Their expansion formulas are as follows:

$$I(X,Z;Y)=I(X;Y|Z)+I(Y;Z)=I(Y;Z\left|X\right)+I(X;Y)$$

(8)

$$I(X;Y;Z)=I(X;Y)+I(X;Z)-I(X;Y,Z)=I(X;Y)-I(X;Y|Z)$$

(9)

2.2. Evaluation Criteria for Multi-Label Feature Selection

In our experiments, we employ four distinct evaluation criteria to confirm the efficacy of TCRFS. The four evaluation criteria are essentially separated into two categories: label-based evaluation criteria and example-based evaluation criteria [31]. The label-based evaluation criteria include Macro-$F_1$ and Micro-$F_1$ [32]. The higher the value of these two indicators, the better the classification effect. Macro-$F_1$ actually calculates the $F_1$-score of q categories first and then averages it as follows:

$$\begin{array}{c}\hfill \mathrm{Macro}\text{-}{F}_1=\frac{1}{q}\sum _{i=1}^q\frac{2T{P}_i}{2T{P}_i+F{P}_i+F{N}_i}\end{array}$$

(10)

where $T{P}_i$, $F{P}_i$, and $F{N}_i$ represent true positives, false positives, and false negatives in i-th category, respectively. Micro-$F_1$ calculates the confusion matrix of each category, and adds the confusion matrix to obtain a multi-category confusion matrix and then calculates the $F_1$-score as follows:

$$\begin{array}{c}\hfill \mathrm{Macro}\text{-}{F}_1=\frac{{\displaystyle \sum _{i=1}^q}2T{P}_i}{{\displaystyle \sum _{i=1}^q}(2T{P}_i+F{P}_i+F{N}_i)}\end{array}$$

(11)

The example-based evaluation criteria include the Hamming Loss (HL) and Zero One Loss (ZOL) [33]. The lower the value of these two indicators, the better the classification effect. HL is a metric for the number of times a label is misclassified. That is, a label belonging to a sample is not predicted, and a label not belonging to the sample is projected to belong to the sample. Suppose that $\mathcal{D}=\left\{(x_i,Y_i)\right|1\le i\le m\}$ is a label test set and $Y_i\subseteq \mathcal{Y}$ is a set of class labels corresponding to $x_i$, where $\mathcal{Y}$ is the label space with q categories. The definition of HL is as follows:

$$\begin{array}{c}\hfill HL=\frac{1}{m}\sum _{i=1}^m\frac{Y_i^{{}^{\prime }}\oplus Y_i}{q}\end{array}$$

(12)

where ⊕ means the XOR operation. $Y_i^{{}^{\prime }}$ denotes the predicted label set corresponding to $x_i$. The other example-based criterion ZOL is defined as follows:

$$\begin{array}{c}\hfill ZOL=\frac{1}{m}\sum _{i=1}^m\delta \left(argma{x}_{y\in \mathcal{Y}}h(x_i,y)\right)\end{array}$$

(13)

If the predicted label subset and the true label subset match, the ZOL score is 1 (i.e., $\delta =1$), but if there is no error, the score is 0 (i.e., $\delta =0$).

3. Related Work

There have been a lot of multi-label learning algorithms proposed so far. These multi-label learning algorithms can be divided into problem transform and algorithm adaptation [34,35]. Problem transform is the conversion of multi-label learning into traditional single-label learning, such as Binary Relevance (BR) [36], Pruned Problem Transformation (PPT) [37], and Label Power (LP) [38]. BR treats the prediction of each label as an independent single classification issue and trains an individual classifier for each label with all of the training data [33]. However, it ignores the relationships between the labels, so it is possible to end up with imbalanced data. PPT removes the labels with a low frequency by considering the label set with a predetermined minimum number of occurrences. However, this irreversible conversion will result in the loss of class information [39].

In contrast to problem transform, algorithm adaptation directly enhances the existing single-label data learning algorithms to adapt to multi-label data processing. Algorithm adaption improves the issues caused by problem transformation. Cai et al. [40] propose Robust and Pragmatic Multi-class Feature Selection (RALM-FS) based on an augmented Lagrangian method, where there is just one ${\ell }_{2,1}$-norm loss term in RALM-FS, with an apparent ${\ell }_{2,0}$-norm equality constraint. Lee and Kim [41] propose the D2F method that makes use of interactive information based on mutual information. It is capable of measuring multiple variable dependencies by default, and its definition is as follows:

$$\begin{array}{c}\hfill J\left(f_k\right)=\sum _{l_i\in L}I(f_k;l_i)-\sum _{f_j\in S}\sum _{l_i\in L}I(f_k;f_j;l_i)\end{array}$$

(14)

where ${\displaystyle \sum _{l_i\in L}}I(f_k;l_i)$ and ${\displaystyle \sum _{f_j\in S}}{\displaystyle \sum _{l_i\in L}}I(f_k;f_j;l_i)$ are regarded as the feature relevance term and the feature redundancy term, respectively. The feature relevance of D2F only considers the candidate features in feature relevance, which ignores selected features and label correlations. Lee and Kim [42] propose the Pairwise Multi-label Utility (PMU), which is derived from $I(S;L)$ as follows:

$$\begin{array}{c}\hfill J\left(f_k\right)=\sum _{l_i\in L}I(f_k;l_i)-\sum _{f_j\in S}\sum _{l_i\in L}I(f_k;f_j;l_i)-\sum _{l_i\in L}\sum _{l_j\in L}I(f_k;l_i;l_j)\end{array}$$

(15)

where ${\displaystyle \sum _{l_i\in L}}I(f_k;l_i)$ is to measure the feature relevance and ${\displaystyle \sum _{f_j\in S}}{\displaystyle \sum _{l_i\in L}}I(f_k;f_j;l_i)+$${\displaystyle \sum _{l_i\in L}\sum _{l_j\in L}}I(f_k;l_i;l_j)$ is to measure the feature redundancy. Afterward, Lee and Kim [43] propose multi-label feature selection based on a scalable criterion for large SCLS. SCLS uses a scalable relevance evaluation approach to assess conditional relevance more correctly:

$$\begin{array}{c}\hfill J\left(f_k\right)=\sum _{l_i\in L}I(f_k;l_i)-\sum _{f_j\in S}\frac{I(f_k;f_j)}{H\left(f_k\right)}\sum _{l_i\in L}I(f_k;l_i)=\left[1-\sum _{f_j\in S}\frac{I(f_k;f_j)}{H\left(f_k\right)}\right]\sum _{l_i\in L}I(f_k;l_i)\end{array}$$

(16)

In fact, the scalable relevance in SCLS considers both candidate features and selected features but ignores label correlations. Liu et al. [44] propose feature selection for multi-label learning with streaming label (FSSL) in which label-specific features are learned for each newly received label, and then label-specific features are fused for all currently received labels. Lin et al. [45] apply a multi-label feature selection method based on fuzzy mutual information (MUCO) to the redundancy and correlation analysis strategies. The next feature that enters S can be selected by the following:

$$\begin{array}{c}\hfill J\left(f_k\right)=FMI(f_k;L)-\frac{1}{\left|S\right|}\sum _{f_j\in S}\left(FMI(f_k;f_j)\right)\end{array}$$

(17)

where $FMI(f_k;L)$ denotes the fuzzy mutual information.

When we try to add a new candidate feature $f_k$ to the current selected feature subset S, the feature $f_k$, the selected features $f_j$ in S, and label correlations in the total label set will all impact feature relevance. To this end, FR is devised by merging the three types of conditional relevance. Therefore, a designed multi-label feature selection method TCRFS that integrates FR with LR is proposed.

4. TCRFS: Feature Selection Combining Three Types of Conditional Relevance

According to the past multi-label feature selection methods, they do not take into account all the three key aspects of influencing feature relevance. That is, the key aspects that influence feature relevance are not comprehensively examined. Here, we utilize three incremental information terms to depict three types of conditional relevance that consider candidate features, selected features, and label correlations comprehensively. The reasons for our consideration are as follows.

4.1. The Three Key Aspects of Feature Relevance We Consider

4.1.1. Candidate Features

We evaluate each candidate feature according to specific criteria. When a candidate feature $f_k$ attempts to enter the current selected feature subset S as a new selected feature to generate a new selected feature subset, it will affect the amount of information provided by the current selected feature subset to the label set. The influence of candidate features is represented by a Venn diagram, as shown in Figure 1.

In Figure 1, we assume that $f_{k_1}$ and $f_{k_2}$ are two candidate features, $f_j$ is a selected feature in S, and $l_i$ is a label in the total label set L. $f_{k_1}$ is irrelevant to $f_j$, and $f_{k_2}$ is redundant with $f_j$. The amount of information provided by $f_j$ to $l_i$ is mutual information $I(f_j;l_i)$, that is, the area $\{2,3\}$. If $f_{k_1}$ is selected, then the amount of information provided by $f_j$ to $l_i$ will be $I(f_j;l_i|f_{k_1})$, which corresponds to the area $\{2,3\}$. If $f_{k_2}$ is selected, then the amount of information provided by $f_j$ to $l_i$ will be $I(f_j;l_i|f_{k_2})$, which corresponds to the area $\left\{2\right\}$ since the area $\left\{2\right\}$ is less than the area $\{2,3\}$, $I(f_j;l_i|f_{k_2})<I(f_j;l_i|f_{k_1})$. Therefore, the higher the label-related redundancy between the candidate feature and the selected feature in the current selected feature subset, the greater the amount of information between $f_j$ and $l_i$ is reduced. In other words, the label-related redundancy between the candidate feature and the selected features should be kept to a minimum. From this point of view, $f_{k_1}$ takes precedence over $f_{k_2}$.

4.1.2. Selected Features

The influence of selected features is represented by a Venn diagram as shown in Figure 2.

As shown in Figure 2, $f_{k_1}$ and $f_{k_2}$ are both redundant with $f_j$. Without considering selected features, the information that $f_{k_1}$ and $f_{k_2}$ shared with the label $l_i$ are $I(f_{k_1};l_i)$ and $I(f_{k_2};l_i)$, respectively. The area $\{1,2\}$ denotes $I(f_{k_1};l_i)$, and the area $\{5,6\}$ denotes $I(f_{k_2};l_i)$. We assume that the area $\{1,2\}$ is less than the area $\{5,6\}$, the area $\left\{2\right\}$ is less than the area $\left\{5\right\}$, but the area $\left\{1\right\}$ is larger than $\left\{6\right\}$. With the selected features taken into account, the information shared by $f_{k_1}$ and $l_i$ is $I(f_{k_1};l_i|f_j)$ (i.e., the area $\left\{1\right\}$), and the information shared by $f_{k_2}$ and $l_i$ is $I(f_{k_2};l_i|f_j)$ (i.e., the area $\left\{6\right\}$): $I(f_{k_1};l_i)<I(f_{k_2};l_i)$, but $I(f_{k_1};l_i|f_j)>I(f_{k_2};l_i|f_j)$. There are two causes for this situation, the first is that the amount of information provided to $l_i$ by $f_{k_2}$ itself is insufficient, and the second is that the label-related redundancy between $f_{k_2}$ and $f_j$ is excessive. Now, in the hypothesis, replace the condition that area $\left\{1\right\}$ is larger than the area $\left\{6\right\}$ to the area $\left\{1\right\}$ is less than the area $\left\{6\right\}$, and we obtain the following result: $I(f_{k_1};l_i)<I(f_{k_2};l_i)$ but $I(f_{k_1};l_i|f_j)<I(f_{k_2};l_i|f_j)$. Therefore, considering the influence of the selected features on feature relevance is necessary.

4.1.3. Label Correlations

It has no influence on the amount of information between candidate features and each label if the labels are independent. The influence of label correlations is represented by a Venn diagram as shown in Figure 3.

In Figure 3, $l_i$ and $l_j$ are two redundant labels, that is, there exists a correlation between $l_i$ and $l_j$. Without the consideration of label correlations, the amount of information provided to $l_i$ by $f_{k_1}$ is $I(f_{k_1};l_i)$ (the area $\{1,2\}$) and the amount of information provided to $l_i$ by $f_{k_2}$ is $I(f_{k_2};l_i)$ (the area $\{4,5\}$). Then, while taking label correlations into consideration, the amount of information provided to $l_i$ by $f_{k_1}$ is $I(f_{k_1};l_i|l_j)$ (the area $\left\{1\right\}$) and the amount of information provided to $l_i$ by $f_{k_2}$ is $I(f_{k_2};l_i|l_j)$ (the area $\left\{4\right\}$). Now, provide the first hypothesis: the area $\{1,2\}$ is larger than the area $\{4,5\}$, the area $\left\{2\right\}$ is larger than the area $\left\{5\right\}$, but the area $\left\{1\right\}$ is less than the area $\left\{4\right\}$. Hence, $I(f_{k_1};l_i)>I(f_{k_2};l_i)$ but $I(f_{k_1};l_i|l_j)<I(f_{k_2};l_i|l_j)$. The second hypothesis modifies the last condition in the first hypothesis: the area $\left\{1\right\}$ is larger than the area $\left\{4\right\}$. Hence, $I(f_{k_1};l_i)>I(f_{k_2};l_i)$ and $I(f_{k_1};l_i|l_j)>I(f_{k_2};l_i|l_j)$. We call the area $\left\{2\right\}$ and the area $\left\{5\right\}$ feature-related label redundancy. Therefore, the original amount of information between candidate features and labels and the feature-related label redundancy can affect the selection of features. Merely using the accumulation of mutual information as the feature relevance will cause the redundant recalculation of feature-related label redundancy.

According to the three key aspects of feature relevance described above, they are indispensable. As a result, we devise FR as the feature relevance term of TCRFS.

4.2. Evaluation Function of TCRFS

4.2.1. Definitions of FR and LR

Regarding the feature relevance evaluation, we distinguish the importance of features based on the closeness of the relationship between features and labels. According to Section 4.1, candidate features, selected features, and label correlations are three key aspects on evaluating feature relevance. In order to be able to perform better in multi-label classification, we utilize three types of conditional relevance ($I(f_k;l_i|f_j)$, $I(f_j;l_i|f_k)$ and $I(f_k;l_i|l_j$) to represent the feature relevance term in the proposed method. By using three incremental information terms to summarize the three key aspects of feature relevance, FR is devised. The three incremental information terms represent the three respective types of conditional relevance.

Definition 1. 

(FR). Suppose that $F=\{f_1,f_2,\dots ,f_m\}$ and $L=\{l_1,l_2,\dots ,1_n\}$ are the total feature set and the total label set, respectively. Let S be the selected feature set excluding candidate features, that is, $f_k\in F-S$. FR is depicted as follows:

$$\begin{array}{c}\hfill FR\left(f_k\right)=\sum _{l_i\in L}\sum _{f_j\in S}I(f_k;l_i|f_j)+\sum _{l_i\in L}\sum _{f_j\in S}I(f_j;l_i|f_k)+\sum _{l_i\in L}\sum _{i\ne j,l_j\in L}I(f_k;l_i|l_j)\end{array}$$

(18)

where ${\displaystyle \sum _{l_i\in L}\sum _{f_j\in S}}I(f_k;l_i|f_j)$ denotes the conditional relevance taking candidate features into account while evaluating feature relevance, ${\displaystyle \sum _{l_i\in L}\sum _{f_j\in S}}I(f_j;l_i|f_k)$ denotes the conditional relevance taking selected features into account while evaluating feature relevance, and ${\displaystyle \sum _{l_i\in L}\sum _{i\ne j,l_j\in L}}I(f_k;l_i|l_j)$ denotes the conditional relevance taking label correlations into account while evaluating feature relevance. The comprehensive evaluation of the above-mentioned three key aspects of feature relevance is more conducive to capturing the optimal features. Furthermore, FR can be expanded as follows:

$$\begin{array}{cc}\hfill FR\left(f_k\right)=& \sum _{l_i\in L}\sum _{f_j\in S}I(f_k;l_i|f_j)+\sum _{l_i\in L}\sum _{f_j\in S}I(f_j;l_i|f_k)+\sum _{l_i\in L}\sum _{i\ne j,l_j\in L}I(f_k;l_i|l_j)\hfill \\ \hfill =& \sum _{l_i\in L}\sum _{f_j\in S}[I(f_k;l_i|f_j)+I(f_j;l_i|f_k)]+\sum _{l_i\in L}\sum _{i\ne j,l_j\in L}I(f_k;l_i|l_j)\hfill \\ \hfill =& \sum _{l_i\in L}\sum _{f_j\in S}[I(f_k,f_j;l_i)-I(f_j;l_i)+I(f_j,f_k;l_i)-I(f_k;l_i)]+\sum _{l_i\in L}\sum _{i\ne j,l_j\in L}[I(f_k;l_i,l_j)-I(l_i;l_j)]\hfill \\ \hfill \propto & \sum _{l_i\in L}\sum _{f_j\in S}[2I(f_k,f_j;l_i)-I(f_k;l_i)]+\sum _{l_i\in L}\sum _{i\ne j,l_j\in L}I(f_k;l_i,l_j)\hfill \end{array}$$

(19)

where $I(f_j;l_i)$ and $I(l_i;l_j)$ are considered to be two constants in feature selection.

Definition 2. 

(LR). In the initial analysis of the three key aspects of feature relevance, it is mentioned that the label-related feature redundancy is repeatedly calculated in the previous methods, which will impact on capturing the optimal features. Here, LR is devised as follows:

$$\begin{array}{c}\hfill LR\left(f_k\right)=\sum _{l_i\in L}\sum _{f_j\in S}[I(f_k;f_j)-I(f_k;f_j|l_i)]\end{array}$$

(20)

As indicated in

Table 2. Feature relevance terms and feature redundancy terms of multi-label feature selection methods.

Methods	Feature Relevance Terms	Feature Redundancy Terms
D2F	${\displaystyle \sum _{l_i\in L}}I(f_k;l_i)$	${\displaystyle \sum _{f_j\in S}\sum _{l_i\in L}}I(f_k;f_j;l_i)$
PMU	${\displaystyle \sum _{l_i\in L}}I(f_k;l_i)$	${\displaystyle \sum _{f_j\in S}\sum _{l_i\in L}}I(f_k;f_j;l_i)+{\displaystyle \sum _{l_i\in L}\sum _{l_j\in L}}I(f_k;l_i;l_j)$
SCLS	$\left[1-{\displaystyle \sum _{f_j\in S}}\frac{I(f_k;f_j)}{H\left(f_k\right)}\right]{\displaystyle \sum _{l_i\in L}}I(f_k;l_i)$	None
MUCO	$FMI(f_k;L)$	$\frac{1}{\left|S\right|}{\displaystyle \sum _{f_j\in S}}\left(FMI(f_k;f_j)\right)$
TCRFS	$\frac{1}{\left|L\right|\left|S\right|}{\displaystyle \sum _{l_i\in L}\sum _{f_j\in S}}[I(f_k;l_i|f_j)+I(f_j;l_i|f_k)]+\frac{1}{\left|L\right||L-1|}{\displaystyle \sum _{l_i\in L}\sum _{i\ne j,l_j\in L}}I(f_k;l_i|l_j)$	$\frac{1}{\left|L\right||L-1|}{\displaystyle \sum _{l_i\in L}\sum _{f_j\in S}}[I(f_k;f_j)-I(f_k;f_j|l_i)]$

, we have compiled a list of feature relevance terms and feature redundancy terms for TCRFS and the contrasted methods based on information theory.

4.2.2. Proposed Method

We design FR and LR to analyze and discuss feature relevance and feature redundancy, respectively, in Section 4.2.1. Subsequently, TCRFS, a designed multi-label feature selection method that integrates FR with LR, is suggested. The definition of TCRFS is as follows:

$$\begin{array}{cc}\hfill J\left(f_k\right)=& \frac{1}{\left|L\right|\left|S\right|}\sum _{l_i\in L}\sum _{f_j\in S}I(f_k;l_i|f_j)+\frac{1}{\left|L\right|\left|S\right|}\sum _{l_i\in L}\sum _{f_j\in S}I(f_j;l_i|f_j)+\frac{1}{\left|L\right||L-1|}\sum _{l_i\in L}\sum _{i\ne j,l_j\in L}I(f_k;l_i|l_j)\hfill \\ \hfill -& \frac{1}{\left|L\right|\left|S\right|}\sum _{l_i\in L}\sum _{f_j\in S}[I(f_k;f_j)-I(f_k;f_j|l_i)],\hfill \end{array}$$

(21)

where $\left|L\right|$ and $\left|S\right|$ represent the number of the total label set and the number of the selected subset, respectively, and their inversions are $\frac{1}{\left|L\right|}$ and $\frac{1}{\left|S\right|}$, respectively. The feature relevance term and the feature redundancy term can be balanced using the two balance parameters $\frac{1}{\left|L\right|\left|S\right|}$ and $\frac{1}{\left|L\right||L-1|}$. According to Formula (19), Formula (21) can be rewritten as follows:

$$\begin{array}{cc}\hfill J\left(f_k\right)=& \frac{1}{\left|L\right|\left|S\right|}\sum _{l_i\in L}\sum _{f_j\in S}I(f_k;l_i|f_j)+\frac{1}{\left|L\right|\left|S\right|}\sum _{l_i\in L}\sum _{f_j\in S}I(f_j;l_i|f_j)+\frac{1}{\left|L\right||L-1|}\sum _{l_i\in L}\sum _{i\ne j,l_j\in L}(I(f_k;l_i|l_j)\hfill \\ \hfill & -\frac{1}{\left|L\right|\left|S\right|}\sum _{l_i\in L}\sum _{f_j\in S}\{I(f_k;f_j)-I(f_k;f_j|l_i)\}\hfill \\ \hfill =& \frac{1}{\left|L\right|\left|S\right|}\sum _{l_i\in L}\sum _{f_j\in S}\{I(f_k;l_i|f_j)+I(f_j;l_i|f_j)-I(f_k;f_j)+I(f_k;f_j|l_i)\}+\frac{1}{\left|L\right||L-1|}\sum _{l_i\in L}\sum _{i\ne j,l_j\in L}I(f_k;l_i|l_j)\hfill \\ \hfill \propto & \frac{1}{\left|L\right|\left|S\right|}\sum _{l_i\in L}\sum _{f_j\in S}\{2I(f_k,f_j;l_i)-I(f_k;l_i)-I(f_k;f_j;l_i)\}+\frac{1}{\left|L\right||L-1|}\sum _{l_i\in L}\sum _{i\ne j,l_j\in L}I(f_k;l_i,l_j)\hfill \\ \hfill =& \frac{1}{\left|L\right|\left|S\right|}\sum _{l_i\in L}\sum _{f_j\in S}\{2I(f_k,f_j;l_i)-I(f_k;l_i|f_j)-2I(f_k;f_j;l_i)\}+\frac{1}{\left|L\right||L-1|}\sum _{l_i\in L}\sum _{i\ne j,l_j\in L}I(f_k;l_i,l_j)\hfill \\ \hfill =& \frac{1}{\left|L\right|\left|S\right|}\sum _{l_i\in L}\sum _{f_j\in S}\{2I(f_k,f_j;l_i)-I(f_k,f_j;l_i)+I(f_j;l_i)-2I(f_k;f_j;l_i)\}+\frac{1}{\left|L\right||L-1|}\sum _{l_i\in L}\sum _{i\ne j,l_j\in L}I(f_k;l_i,l_j)\hfill \\ \hfill \propto & \frac{1}{\left|L\right|\left|S\right|}\sum _{l_i\in L}\sum _{f_j\in S}\{I(f_k,f_j;l_i)-2I(f_k;f_j;l_i)\}+\frac{1}{\left|L\right||L-1|}\sum _{l_i\in L}\sum _{i\ne j,l_j\in L}I(f_k;l_i,l_j)\hfill \\ \hfill =& \frac{1}{\left|L\right|\left|S\right|}\sum _{l_i\in L}\sum _{f_j\in S}I(f_k,f_j;l_i)+\frac{1}{\left|L\right||L-1|}\sum _{l_i\in L}\sum _{i\ne j,l_j\in L}I(f_k;l_i,l_j)-\frac{2}{\left|L\right|\left|S\right|}\sum _{l_i\in L}\sum _{f_j\in S}I(f_k;f_j;l_i),\hfill \end{array}$$

(22)

where $\frac{1}{\left|L\right|\left|S\right|}{\displaystyle \sum _{l_i\in L}\sum _{f_j\in S}}I(f_k,f_j;l_i)+\frac{1}{\left|L\right||L-1|}{\displaystyle \sum _{l_i\in L}\sum _{i\ne j,l_j\in L}}I(f_k;l_i,l_j)$ is regarded as the new feature relevance term and $\frac{2}{\left|L\right|\left|S\right|}{\displaystyle \sum _{l_i\in L}\sum _{f_j\in S}}I(f_k;f_j;l_i)$ is regarded as the new feature redundancy term. The pseudo-code of TCRFS (Algorithm 1) is as follows:

Algorithm 1. TCRFS.

Input:         A training sample D with a full feature set $F=\{f_1,f_2,\dots ,f_n\}$ and the label set $L=\{l_1,l_2,\dots ,l_m\}$; User-specified threshold K. Output:         The selected feature subset S. 1: $S\leftarrow ⌀;$ 2: $k\leftarrow 0;$ 3: for$i=1$ to n do 4:    Calculate the feature relevance $I(f_i;l_i|l_j)$; 5: end for 6: while$k<K$do 7:    if k == 0 then 8:        Select the first feature $f_j$ with the largest $I(f_i;l_i|l_j)$; 9:        $k=k+1$; 10:      $S=S\cup \left\{f_j\right\}$; 11:      $F=F-\left\{f_j\right\}$; 12:    end if 13:    for each candidate feature $f_i\in F$ do 14:      According to the Formula (21) and calculate the $J\left(f_i\right)$; 15:    end for 16:    Select the feature $f_j$ with the largest $J\left(f_i\right)$; 17:    $S=S\cup \left\{f_j\right\}$; 18:    $F=F-\left\{f_j\right\}$; 19:    $k=k+1$; 20: end while

First, in lines 1–5, the selected feature subset S and the number of selected features k in the proposed method are initialized. To capture the initial feature, we calculate the incremental information $I(f_i;l_i|l_j)$ to capture the first feature (lines 6–12). Then, until the procedure is complete, calculate and capture the following feature (lines 13–20).

4.3. Time Complexity

Time complexity is also one of the criteria for evaluating the pros and cons of methods. The time complexity of each contrasted method and TCRFS has been computed here. Assume that there are n, p, and q instances, features, and labels, respectively. The computational complexity of mutual information and conditional mutual information is $O\left(n\right)$ for all instances that have to be visited for probability. Each iteration of RALM-FS requires $O\left(p^3\right)$. Assume that k denotes the number of selected features. The time complexity of TCRFS is $O(np{q}^2+knpq)$ as three incremental information terms and one label-related feature redundancy term are calculated. Similarly, D2F, PMU, and SCLS have time complexities of $O(npq+knpq)$, $O(npq+knpq+np{q}^2)$, and $O(nma+knm)$, respectively. FSSL has a time complexity of $O\left(knpq\right)$. The time complexity of MUCO is $O(n^2+p(p-k))$ since it constructs a fuzzy matrix and incremental search.

5. Experimental Evaluation

Against the demonstrated efficacy of TCRFS, we compare it to 6 advanced multi-label feature selection approaches (RALM-FS [40], D2F [41], PMU [42], SCLS [43], FSSL [44], and MUCO [45]), on 13 benchmark data sets in this section. As a result, we have conducted numerous experiments based on four different criteria using three classifiers, which are Support Vector Machine (SVM), 3-Nearest Neighbor (3NN), and Multi-Label k-Nearest Neighbor (ML-kNN) [46,47]. The 13 multi-label benchmark data sets utilized in the experiments are depicted first. Following that, the findings of the experiments are discussed and examined. Four evaluation metrics that we employed in the experiments have been offered in Section 2.2. The approximate experimental framework is depicted in Figure 4.

5.1. Multi-Label Data Sets

A total of 13 multi-label benchmark data sets from 4 different domains have been depicted in

Table 3. The depiction of data sets in our experiments.

No.	Data Set	#Domains	#Labels	#Features	#Training	#Test	#Instance
1	Birds	Audio	19	260	322	323	645
2	Emotions	Music	6	72	391	202	593
3	Genbase	Biology	27	1185	463	199	662
4	Yeast	Biology	14	103	1500	917	2417
5	Medical	Text	45	1449	333	645	978
6	Entertain	Text	21	640	2000	3000	5000
7	Recreation	Text	22	606	2000	3000	5000
8	Arts	Text	26	462	2000	3000	5000
9	Health	Text	32	612	2000	3000	5000
10	Education	Text	33	550	2000	3000	5000
11	Reference	Text	33	793	2000	3000	5000
12	Social	Text	39	1047	2000	3000	5000
13	Science	Text	40	743	2000	3000	5000

, which are collected on the Mulan repository [48]. Among them, the Birds data set classifies the birds in Audio [49], the Emotions data set is gathered for Music [38], the Genbase and Yeast data sets are primarily concerned with the Biology category [34], and the remaining 9 data sets are categorized as Text. The 13 data sets we chose have an abundant number of instances, which are split into two parts: training set and test set [48]. Ueda and Saito [50] attempted to classify real Web pages linked from the “yahoo.com” domain, which is composed of 14 top-level categories, each of which is split into many second-level subcategories. They tested 11 of the 14 independent text classification problems by focusing on the second-level categories. For each problem, the training set includes 2000 documents and the test set includes 3000 documents, such as the Arts and Health data sets, and so on [51]. The number of labels and the number of features both vary substantially. Previous research demonstrates that maintaining 10% of the features results in no loss, while retaining 1% of the features results in a slight loss dependent on document frequency [3]. For example, the Arts and Social data sets have more than 20,000 features and 50,000 features, respectively, and they retain about 2% of the features with the highest document frequency. The continuous features of 13 data sets are discretized into equal intervals with 3 bins as indicated in the literature [38,52].

5.2. The Theoretical Justification of TCRFS on an Artificial Data Set

To further justify the indispensability of the three key aspects (candidate features, selected features, and label correlations) for feature relevance evaluation. We employ an artificial data set to compare the classification performance of five information-theoretical-based methods (D2F, PMU, SCLS, MUCO, and TCRFS) that use distinct feature relevance terms. With respect to the feature relevance terms, D2F and PMU employ the amount of information between candidate features and labels, SCLS employs a scalable relevance evaluation, which takes feature redundancy into account in feature relevance, MUCO employs fuzzy mutual information, and TCRFS comprehensively considers the three types of conditional relevance we mentioned to design FR.

Table 4. Training set.

${\mathit{f}}_0$	${\mathit{f}}_1$	${\mathit{f}}_2$	${\mathit{f}}_3$	${\mathit{f}}_4$	${\mathit{f}}_5$	${\mathit{f}}_6$	${\mathit{f}}_7$	${\mathit{f}}_8$	${\mathit{f}}_9$	${\mathit{y}}_0$	${\mathit{y}}_1$	${\mathit{y}}_2$	${\mathit{y}}_3$
1	1	0	0	0	0	1	0	1	0	1	0	0	1
0	0	0	1	1	0	1	0	0	0	1	1	1	1
0	1	0	1	0	0	0	0	1	0	0	0	1	1
0	1	0	0	1	0	0	1	0	1	1	0	0	0
1	1	1	0	0	1	0	1	1	0	0	0	0	0
1	0	0	0	0	0	1	0	1	0	1	1	0	0
1	0	0	0	1	0	1	0	1	0	0	1	0	1
0	0	1	0	1	0	0	1	0	1	0	0	0	0
0	1	0	1	0	1	0	0	0	0	0	1	1	0
0	1	1	0	0	0	0	0	1	0	1	0	0	1
1	1	0	0	0	0	1	1	1	0	1	1	0	1
1	1	0	1	1	0	0	1	0	0	1	0	0	0
0	1	1	1	0	0	0	0	0	0	0	1	1	0
0	1	1	0	1	0	0	1	0	1	1	0	0	0
1	1	0	0	0	1	0	1	1	0	0	1	1	0
1	0	1	0	0	0	0	0	1	0	1	1	0	1
0	0	0	0	1	0	1	0	1	0	0	0	1	0
0	0	1	0	1	0	0	1	0	1	0	0	0	1
0	0	0	1	0	1	0	0	0	0	0	1	0	0
0	1	1	0	1	0	0	1	1	1	1	1	0	0

and

Table 5. Test set.

${\mathit{f}}_1$	${\mathit{f}}_2$	${\mathit{f}}_3$	${\mathit{f}}_4$	${\mathit{f}}_5$	${\mathit{f}}_6$	${\mathit{f}}_7$	${\mathit{f}}_8$	${\mathit{f}}_9$	${\mathit{f}}_{10}$	${\mathit{y}}_1$	${\mathit{y}}_2$	${\mathit{y}}_3$	${\mathit{y}}_4$
1	1	0	0	0	0	1	0	1	1	0	1	1	0
0	0	1	1	1	0	1	0	1	1	0	0	1	0
1	0	1	1	0	1	0	1	0	0	0	1	0	1
1	1	0	0	0	1	0	0	0	0	0	0	1	0
1	0	0	1	1	0	0	1	0	1	0	1	1	0
1	0	1	0	1	1	0	0	1	1	0	1	0	1
1	1	0	0	0	0	1	0	1	0	0	1	1	1
0	0	1	0	1	0	1	1	1	1	1	0	1	0
1	0	1	1	1	1	0	0	0	0	0	1	0	0
0	1	0	0	0	1	0	0	0	0	1	1	0	1

display the training set and the test set, respectively.

Table 6. Experimental results on the artificial data set.

Methods	Feature Ranking	SVM		ML-kNN
		Macro-${\mathit{F}}_1$ ↑	Micro-${\mathit{F}}_1$ ↑	Macro-${\mathit{F}}_1$ ↑	Micro-${\mathit{F}}_1$ ↑	HL ↓	ZOL ↓
TCRFS	$\{f_5,f_0,f_7,f_8,f_3,f_4,f_1,f_6,f_9,f_2\}$	0.332	0.457	0.375	0.435	0.5000	0.97
D2F	$\{f_5,f_0,f_7,f_8,f_3,f_4,f_1,f_6,f_2,f_9\}$	0.331	0.455	0.374	0.431	0.5150	0.97
PMU	$\{f_5,f_0,f_7,f_8,f_3,f_4,f_1,f_6,f_2,f_9\}$	0.331	0.455	0.374	0.431	0.5150	0.97
SCLS	$\{f_5,f_9,f_3,f_7,f_0,f_6,f_1,f_2,f_8,f_4\}$	0.32	0.409	0.373	0.427	0.5025	0.98
MUCO	$\{f_4,f_6,f_7,f_8,f_1,f_2,f_3,f_0,f_5,f_9\}$	0.331	0.397	0.334	0.385	0.5450	0.98

shows the experimental results and the feature ranking of each approach on the artificial data set. As shown in Table 6, the first feature selected by TCRFS is $f_5$. Different from D2F and PMU, $f_2$ is regarded as the least essential feature. In TCRFS, feature rankings $f_0,f_8$, and $f_4$ are higher than the feature ranking of SCLS, whereas MUCO selects $f_4$ as the first feature. TCRFS achieves the best classification performance overall. Therefore, TCRFS, which considers three key aspects (candidate features, selected features, and label correlations), is justified.

5.3. Analysis and Discussion of the Experimental Findings

The experiments that run on a 3.70 GHz Intel Core i9-10900K processor with 32 GB of main memory are performed on four different evaluation criteria regarding three classifiers. Python is used to create the proposed method [53]. Hamming Loss is conducted on the ML-kNN (k = 10) classifier, and Macro-$F_1$ and Micro-$F_1$ measures are conducted on the SVM and 3NN classifiers. The number of selected features on the 12 data sets is set to {1%, 2%,..., 20%} of the total number of features when using a step size of 1, whereas the number of selected features on the Medical data set is set to {1%, 2%,..., 17%}.

Table 7. Classification performance of each method regarding Macro-$F_1$ on SVM classifier (mean ± std).

Data Set	RALM-FS	D2F	PMU	SCLS	FSSL	MUCO	TCRFS
Birds	0.058$\pm$0.024	0.077$\pm$0.04	0.075$\pm$0.036	0.039$\pm$0.026	0.049$\pm$0.027	0.1$\pm$0.051	0.116$\pm$0.058
Emotions	0.147$\pm$0.101	0.315$\pm$0.061	0.239$\pm$0.095	0.336$\pm$0.055	0.35$\pm$0.085	0.366$\pm$0.127	0.381$\pm$0.089
Genbase	0.738$\pm$0.153	0.706$\pm$0.107	0.628$\pm$0.093	0.241$\pm$0.022	0.762$\pm$0.133	0.758$\pm$0.14	0.765$\pm$0.129
Yeast	0.229$\pm$0.036	0.258$\pm$0.034	0.262$\pm$0.031	0.207$\pm$0.014	0.213$\pm$0.037	0.227$\pm$0.044	0.276$\pm$0.036
Medical	0.129$\pm$0.063	0.191$\pm$0.055	0.188$\pm$0.057	0.079$\pm$0.013	0.227$\pm$0.086	0.254$\pm$0.074	0.311$\pm$0.075
Entertain	0.059$\pm$0.022	0.081$\pm$0.006	0.051$\pm$0.004	0.067$\pm$0.006	0.075$\pm$0.028	0.058$\pm$0.013	0.119$\pm$0.023
Recreation	0.024$\pm$0.008	0.077$\pm$0.009	0.026$\pm$0.002	0.044$\pm$0.004	0.042$\pm$0.024	0.041$\pm$0.018	0.105$\pm$0.019
Arts	0.024$\pm$0.014	0.031$\pm$0.005	0.014$\pm$0.007	0.027$\pm$0.005	0.025$\pm$0.014	0.026$\pm$0.014	0.072$\pm$0.024
Health	0.062$\pm$0.021	0.089$\pm$0.008	0.078$\pm$0.008	0.089$\pm$0.01	0.087$\pm$0.022	0.077$\pm$0.021	0.141$\pm$0.028
Education	0.024$\pm$0.009	0.046$\pm$0.009	0.027$\pm$0.008	0.038$\pm$0.006	0.041$\pm$0.015	0.041$\pm$0.019	0.065$\pm$0.013
Reference	0.023$\pm$0.01	0.039$\pm$0.004	0.026$\pm$0.006	0.024$\pm$0.004	0.03$\pm$0.011	0.04$\pm$0.017	0.065$\pm$0.013
Social	0.046$\pm$0.018	0.07$\pm$0.01	0.052$\pm$0.012	0.052$\pm$0.006	0.055$\pm$0.02	0.059$\pm$0.019	0.101$\pm$0.028
Science	0.008$\pm$0.006	0.021$\pm$0.003	0.009$\pm$0.005	0.016$\pm$0.004	0.023$\pm$0.013	0.024$\pm$0.013	0.049$\pm$0.017
Average	0.121	0.154	0.129	0.097	0.152	0.159	0.197

,

Table 8. Classification performance of each method regarding Micro-$F_1$ on SVM classifier (mean ± std).

Data Set	RALM-FS	D2F	PMU	SCLS	FSSL	MUCO	TCRFS
Birds	0.096$\pm$0.046	0.135$\pm$0.075	0.129$\pm$0.055	0.06$\pm$0.04	0.084$\pm$0.049	0.197$\pm$0.078	0.207$\pm$0.086
Emotions	0.178$\pm$0.113	0.372$\pm$0.038	0.295$\pm$0.099	0.422$\pm$0.038	0.434$\pm$0.06	0.425$\pm$0.118	0.45$\pm$0.07
Genbase	0.958$\pm$0.136	0.968$\pm$0.066	0.946$\pm$0.066	0.541$\pm$0.014	0.969$\pm$0.108	0.977$\pm$0.071	0.979$\pm$0.067
Yeast	0.552$\pm$0.027	0.565$\pm$0.023	0.571$\pm$0.021	0.532$\pm$0.008	0.54$\pm$0.026	0.549$\pm$0.031	0.584$\pm$0.027
Medical	0.363$\pm$0.147	0.629$\pm$0.07	0.625$\pm$0.075	0.37$\pm$0.009	0.661$\pm$0.168	0.711$\pm$0.087	0.753$\pm$0.058
Entertain	0.108$\pm$0.043	0.163$\pm$0.015	0.096$\pm$0.013	0.149$\pm$0.016	0.192$\pm$0.062	0.127$\pm$0.041	0.251$\pm$0.054
Recreation	0.043$\pm$0.018	0.138$\pm$0.016	0.038$\pm$0.003	0.07$\pm$0.007	0.065$\pm$0.038	0.077$\pm$0.034	0.198$\pm$0.035
Arts	0.059$\pm$0.033	0.075$\pm$0.013	0.033$\pm$0.016	0.072$\pm$0.015	0.062$\pm$0.033	0.056$\pm$0.031	0.16$\pm$0.051
Health	0.401$\pm$0.018	0.418$\pm$0.012	0.391$\pm$0.029	0.406$\pm$0.004	0.426$\pm$0.02	0.396$\pm$0.061	0.479$\pm$0.026
Education	0.073$\pm$0.024	0.117$\pm$0.017	0.077$\pm$0.014	0.138$\pm$0.023	0.142$\pm$0.056	0.132$\pm$0.06	0.203$\pm$0.045
Reference	0.153$\pm$0.077	0.305$\pm$0.039	0.265$\pm$0.05	0.259$\pm$0.039	0.286$\pm$0.062	0.314$\pm$0.093	0.344$\pm$0.058
Social	0.252$\pm$0.107	0.396$\pm$0.072	0.31$\pm$0.07	0.384$\pm$0.049	0.357$\pm$0.105	0.356$\pm$0.082	0.426$\pm$0.073
Science	0.029$\pm$0.015	0.053$\pm$0.01	0.024$\pm$0.016	0.058$\pm$0.014	0.071$\pm$0.034	0.074$\pm$0.037	0.122$\pm$0.032
Average	0.251	0.333	0.292	0.266	0.33	0.338	0.397

,

Table 9. Classification performance of each method regarding Macro-$F_1$ on 3NN classifier (mean ± std).

Data Set	RALM-FS	D2F	PMU	SCLS	FSSL	MUCO	TCRFS
Birds	0.093$\pm$0.036	0.15$\pm$0.066	0.122$\pm$0.036	0.078$\pm$0.028	0.075$\pm$0.037	0.131$\pm$0.038	0.17$\pm$0.048
Emotions	0.312$\pm$0.074	0.434$\pm$0.033	0.413$\pm$0.046	0.426$\pm$0.042	0.442$\pm$0.124	0.434$\pm$0.101	0.468$\pm$0.068
Genbase	0.689$\pm$0.132	0.65$\pm$0.086	0.604$\pm$0.089	0.224$\pm$0.018	0.702$\pm$0.12	0.7$\pm$0.123	0.71$\pm$0.103
Yeast	0.3$\pm$0.027	0.348$\pm$0.038	0.34$\pm$0.03	0.301$\pm$0.026	0.309$\pm$0.041	0.314$\pm$0.033	0.334$\pm$0.039
Medical	0.069$\pm$0.029	0.121$\pm$0.019	0.114$\pm$0.018	0.063$\pm$0.006	0.149$\pm$0.04	0.155$\pm$0.03	0.184$\pm$0.025
Entertain	0.079$\pm$0.031	0.108$\pm$0.011	0.083$\pm$0.014	0.095$\pm$0.013	0.094$\pm$0.028	0.089$\pm$0.014	0.128$\pm$0.019
Recreation	0.06$\pm$0.014	0.082$\pm$0.011	0.053$\pm$0.01	0.066$\pm$0.011	0.057$\pm$0.026	0.057$\pm$0.021	0.114$\pm$0.019
Arts	0.036$\pm$0.018	0.064$\pm$0.01	0.058$\pm$0.014	0.072$\pm$0.016	0.061$\pm$0.026	0.064$\pm$0.019	0.092$\pm$0.02
Health	0.064$\pm$0.027	0.087$\pm$0.011	0.093$\pm$0.008	0.087$\pm$0.011	0.087$\pm$0.024	0.08$\pm$0.018	0.122$\pm$0.022
Education	0.047$\pm$0.011	0.065$\pm$0.009	0.057$\pm$0.009	0.059$\pm$0.01	0.063$\pm$0.015	0.06$\pm$0.019	0.074$\pm$0.012
Reference	0.032$\pm$0.01	0.044$\pm$0.004	0.034$\pm$0.007	0.036$\pm$0.005	0.041$\pm$0.01	0.046$\pm$0.015	0.07$\pm$0.011
Social	0.052$\pm$0.013	0.064$\pm$0.006	0.054$\pm$0.006	0.051$\pm$0.004	0.064$\pm$0.024	0.058$\pm$0.016	0.091$\pm$0.011
Science	0.024$\pm$0.008	0.04$\pm$0.005	0.028$\pm$0.008	0.03$\pm$0.004	0.039$\pm$0.019	0.036$\pm$0.011	0.057$\pm$0.012
Average	0.143	0.174	0.158	0.122	0.168	0.171	0.201

,

Table 10. Classification performance of each method regarding Micro-$F_1$ on 3NN classifier (mean ± std).

Data Set	RALM-FS	D2F	PMU	SCLS	FSSL	MUCO	TCRFS
Birds	0.171$\pm$0.066	0.231$\pm$0.072	0.203$\pm$0.05	0.144$\pm$0.043	0.159$\pm$0.054	0.227$\pm$0.057	0.273$\pm$0.061
Emotions	0.353$\pm$0.051	0.469$\pm$0.02	0.445$\pm$0.022	0.46$\pm$0.028	0.478$\pm$0.114	0.471$\pm$0.079	0.503$\pm$0.05
Genbase	0.956$\pm$0.134	0.95$\pm$0.061	0.919$\pm$0.064	0.518$\pm$0.012	0.959$\pm$0.126	0.974$\pm$0.074	0.977$\pm$0.065
Yeast	0.529$\pm$0.019	0.549$\pm$0.041	0.553$\pm$0.014	0.518$\pm$0.035	0.526$\pm$0.049	0.523$\pm$0.041	0.552$\pm$0.041
Medical	0.294$\pm$0.108	0.53$\pm$0.038	0.522$\pm$0.037	0.353$\pm$0.013	0.558$\pm$0.121	0.591$\pm$0.053	0.638$\pm$0.032
Entertain	0.187$\pm$0.085	0.241$\pm$0.032	0.22$\pm$0.053	0.217$\pm$0.031	0.229$\pm$0.037	0.234$\pm$0.048	0.249$\pm$0.032
Recreation	0.102$\pm$0.014	0.159$\pm$0.024	0.094$\pm$0.02	0.115$\pm$0.017	0.111$\pm$0.045	0.112$\pm$0.041	0.224$\pm$0.033
Arts	0.095$\pm$0.045	0.15$\pm$0.031	0.137$\pm$0.028	0.172$\pm$0.028	0.126$\pm$0.044	0.155$\pm$0.029	0.237$\pm$0.028
Health	0.2$\pm$0.097	0.367$\pm$0.05	0.361$\pm$0.038	0.366$\pm$0.064	0.33$\pm$0.092	0.339$\pm$0.038	0.38$\pm$0.063
Education	0.254$\pm$0.026	0.19$\pm$0.032	0.18$\pm$0.04	0.19$\pm$0.033	0.238$\pm$0.032	0.191$\pm$0.054	0.22$\pm$0.036
Reference	0.164$\pm$0.073	0.364$\pm$0.048	0.35$\pm$0.043	0.294$\pm$0.048	0.334$\pm$0.049	0.319$\pm$0.085	0.42$\pm$0.046
Social	0.302$\pm$0.04	0.39$\pm$0.051	0.363$\pm$0.051	0.368$\pm$0.04	0.354$\pm$0.069	0.349$\pm$0.056	0.432$\pm$0.045
Science	0.08$\pm$0.037	0.123$\pm$0.019	0.099$\pm$0.018	0.147$\pm$0.034	0.112$\pm$0.041	0.136$\pm$0.037	0.153$\pm$0.031
Average	0.284	0.363	0.342	0.297	0.347	0.355	0.404

,

Table 11. Classification performance of each method regarding HL on ML-kNN classifier (mean ± std).

Data Set	RALM-FS	D2F	PMU	SCLS	FSSL	MUCO	TCRFS
Birds	0.05081$\pm$0.00106	0.05269$\pm$0.00164	0.05227$\pm$0.0017	0.0544$\pm$0.00188	0.0526$\pm$0.00143	0.05138$\pm$0.00133	0.05147$\pm$0.00103
Emotions	0.33752$\pm$0.01318	0.29408$\pm$0.01324	0.31854$\pm$0.00914	0.27947$\pm$0.00716	0.2922$\pm$0.01356	0.28878$\pm$0.02079	0.28012$\pm$0.01018
Genbase	0.00377$\pm$0.0068	0.00315$\pm$0.00391	0.00469$\pm$0.00405	0.03093$\pm$0.00042	0.00301$\pm$0.00585	0.00296$\pm$0.00433	0.00269$\pm$0.00396
Yeast	0.23706$\pm$0.00434	0.22784$\pm$0.00287	0.22793$\pm$0.00356	0.2332$\pm$0.00431	0.23182$\pm$0.00293	0.23341$\pm$0.00377	0.22565$\pm$0.00404
Medical	0.02702$\pm$0.0007	0.01955$\pm$0.00105	0.01972$\pm$0.00107	0.02332$\pm$0.00018	0.01842$\pm$0.00237	0.01852$\pm$0.00108	0.01774$\pm$0.0009
Entertain	0.06652$\pm$0.00057	0.06568$\pm$0.00133	0.06708$\pm$0.00112	0.06587$\pm$0.00144	0.06415$\pm$0.00103	0.06631$\pm$0.00085	0.06315$\pm$0.00145
Recreation	0.06513$\pm$0.00038	0.06239$\pm$0.00077	0.06484$\pm$0.00068	0.06444$\pm$0.0006	0.06513$\pm$0.00069	0.06419$\pm$0.0007	0.06144$\pm$0.00111
Arts	0.06285$\pm$0.00023	0.0635$\pm$0.00122	0.06441$\pm$0.00104	0.06339$\pm$0.00074	0.06389$\pm$0.00057	0.06412$\pm$0.00075	0.06135$\pm$0.00063
Health	0.04969$\pm$0.00132	0.04831$\pm$0.00051	0.04934$\pm$0.00059	0.04848$\pm$0.00114	0.04764$\pm$0.00101	0.04898$\pm$0.00068	0.04545$\pm$0.00111
Education	0.04414$\pm$0.00034	0.04427$\pm$0.00073	0.04453$\pm$0.00082	0.04408$\pm$0.00101	0.04403$\pm$0.0006	0.0444$\pm$0.00054	0.04303$\pm$0.00069
Reference	0.03503$\pm$0.00035	0.03223$\pm$0.00117	0.03357$\pm$0.00095	0.0329$\pm$0.00021	0.03262$\pm$0.00068	0.03332$\pm$0.00061	0.03133$\pm$0.00075
Social	0.03061$\pm$0.00122	0.03032$\pm$0.00046	0.03091$\pm$0.00031	0.02866$\pm$0.0007	0.02906$\pm$0.00092	0.02967$\pm$0.00055	0.02766$\pm$0.00077
Science	0.03615$\pm$0.00028	0.03579$\pm$0.0004	0.03626$\pm$0.00036	0.03583$\pm$0.00041	0.03567$\pm$0.00027	0.0361$\pm$0.00058	0.03543$\pm$0.00042
Average	0.08048	0.07537	0.07801	0.07731	0.0754	0.07555	0.07281

and

Table 12. Classification performance of each method regarding ZOL on ML-kNN classifier (mean ± std).

Data Set	RALM-FS	D2F	PMU	SCLS	FSSL	MUCO	TCRFS
Birds	0.53239$\pm$0.00619	0.53352$\pm$0.01484	0.55013$\pm$0.02117	0.53543$\pm$0.00551	0.52745$\pm$0.00789	0.53007$\pm$0.00864	0.54019$\pm$0.01396
Emotions	0.92468$\pm$0.03724	0.82815$\pm$0.02803	0.88331$\pm$0.05054	0.85502$\pm$0.03048	0.85431$\pm$0.03856	0.83982$\pm$0.03592	0.83522$\pm$0.02541
Genbase	0.07909$\pm$0.15179	0.06976$\pm$0.07896	0.09236$\pm$0.07004	0.56379$\pm$0.01154	0.06285$\pm$0.12667	0.06058$\pm$0.07839	0.05795$\pm$0.0815
Yeast	0.94729$\pm$0.02727	0.88602$\pm$0.02723	0.89168$\pm$0.02807	0.91671$\pm$0.01147	0.9233$\pm$0.03139	0.91613$\pm$0.03483	0.88586$\pm$0.01848
Medical	0.86604$\pm$0.07297	0.65611$\pm$0.03702	0.66257$\pm$0.04058	0.82617$\pm$0.00642	0.62048$\pm$0.0981	0.61537$\pm$0.0484	0.58932$\pm$0.0373
Entertain	0.94447$\pm$0.01955	0.90565$\pm$0.01002	0.94136$\pm$0.00863	0.90345$\pm$0.01303	0.88309$\pm$0.03407	0.91441$\pm$0.02957	0.85752$\pm$0.02652
Recreation	0.97955$\pm$0.01057	0.92066$\pm$0.00898	0.97122$\pm$0.00609	0.95327$\pm$0.00543	0.95681$\pm$0.02178	0.9493$\pm$0.02212	0.87796$\pm$0.01967
Arts	0.96399$\pm$0.0181	0.9548$\pm$0.01101	0.97061$\pm$0.0167	0.9529$\pm$0.01086	0.96364$\pm$0.02175	0.96234$\pm$0.02165	0.92196$\pm$0.02549
Health	0.7561$\pm$0.0662	0.77159$\pm$0.05271	0.77152$\pm$0.04486	0.73661$\pm$0.0437	0.74891$\pm$0.05006	0.7876$\pm$0.05694	0.70867$\pm$0.04394
Education	0.95281$\pm$0.0162	0.94833$\pm$0.00936	0.95489$\pm$0.01428	0.9339$\pm$0.01388	0.94176$\pm$0.02666	0.93868$\pm$0.02975	0.90171$\pm$0.02493
Reference	0.90776$\pm$0.05755	0.80313$\pm$0.03802	0.81068$\pm$0.05208	0.8284$\pm$0.0372	0.80829$\pm$0.04754	0.80433$\pm$0.0658	0.7591$\pm$0.06182
Social	0.84735$\pm$0.07255	0.73236$\pm$0.08727	0.77499$\pm$0.06847	0.74463$\pm$0.04251	0.75138$\pm$0.08065	0.76243$\pm$0.052	0.72314$\pm$0.05028
Science	0.98663$\pm$0.00642	0.9725$\pm$0.00583	0.98477$\pm$0.00815	0.95488$\pm$0.01192	0.95139$\pm$0.01995	0.96111$\pm$0.02084	0.94441$\pm$0.0112
Average	0.82217	0.76789	0.78924	0.82347	0.76874	0.77247	0.73869

present the classification performance of 6 contrasted approaches and TCRFS on 13 data sets. The average classification results and standard deviations are used to express the classification performance. The average classification results of each method on all data sets are represented in the row “Average”. The data of the best-performing classification results in Table 7, Table 8, Table 9, Table 10, Table 11 and Table 12 are bolded.

Observing Table 7 and Table 8, TCRFS delivers the optimum classification performance on SVM classifier regarding Macro-$F_1$ and Micro-$F_1$ measures, since the higher the values of the two measures, the more superior the classification performance. In Table 9, except for the Yeast data set, TCRFS beats 6 other contrasted approaches on 12 data sets using 3NN classifier for Macro-$F_1$. TCRFS surpasses the other 6 contrasted approaches on 11 data sets using the 3NN classifier for Micro-$F_1$ in Table 10. According to the properties of the HL and ZOL measures, the lower values of the two measures mean the more excellent classification performance. In Table 11 and Table 12, TCRFS can exhibit the best system performance on 11 data sets on the ML-kNN classifier for the HL and ZOL criteria. In some cases, comprehensive consideration of the three key aspects to assess feature relevance does not achieve the best classification effect. The classification results of D2F takes the first position on the Yeast data set regarding Macro-$F_1$ on the 3NN classifier. PMU and RALM-FS possess the optimal classification performance on the Yeast data set and the Education data sets, respectively. In terms of HL (Table 11), RALM-FS and SCLS surpass other approaches on the Birds and Emotions data sets, respectively. In terms of ZOL (Table 12), FSSL and D2F surpass other approaches on the Birds and Emotions data sets, respectively. Despite the fact that D2F, PMU, RALM-FS, SCLS and FSSL have the greatest system performance on individual data sets, the overall optimal classification performance is still TCRFS. The average values of each method for different evaluation criteria are illustrated in Figure 5. The abscissa and different colored bars represent different feature selection methods, while the ordinate represents the average value.

Observing the trend of the bar graphs in Figure 5a,b, Macro-$F_1$ results and Micro-$F_1$ results achieved on the SVM classifier and 3NN classifier have reached similar classification performance. The average results of TCRFS in terms of Macro-$F_1$ are roughly 0.2 or above, and the average results of TCRFS in terms of Micro-$F_1$ are roughly 0.4 or above, which are clearly greater than the average results of other approaches. The average result of TCRFS is less than 0.074 in Figure 5c and less than 0.74 in Figure 5d, which are clearly less than the average results of other approaches. Intuitively, TCRFS clearly presents the most excellent average values in terms of the four evaluation criteria. In order to further observe the classification performance of the seven methods on the data sets, we draw Figure 6, Figure 7, Figure 8 and Figure 9.

Figure 6, Figure 7, Figure 8 and Figure 9 indicate that TCRFS delivers superior classification performance on the Arts, Recreation, Entertain, and Health data sets regarding the four evaluation criteria. As shown in Figure 6, the classification performance of our method is significantly better than the other six contrasted methods. On the Recreation data set (Figure 7), the classification performance of the method is not constantly improved by increasing the number of selected features. TCRFS, for example, may obtain the most significant classification results regarding the ZOL measure when the number of selected features is set at 8% or 11% of the total number of features. On the Entertain data set (Figure 8), TCRFS is clearly in the lead regarding Macro-$F_1$ when the percentage of the selected features is larger than one. In terms of HL and ZOL, TCRFS also possesses significant advantages among the seven methods. The proposed method can obtain the optimum classification performance for each metric when the percentage of the selected features is set to 6%. In Figure 9, our method outperforms the other six contrasted methods on the Health data set utilizing the four metrics. Although in most cases the performance of feature selection methods improves as the number of selected features increases, as the number of features increases to a certain number, the improvement in the classification performance tends to be flat. When the percentage of the number of features increases to about 16% on the Arts data set (Figure 6a–d) and the percentage of the number of features increases to about 19% on the Entertain data (Figure 8a–d), the classification performance has reached a relatively high level. That is to say, an optimal feature subset is to select a smaller number of features to achieve a better classification performance. However, some methods appear to have the same classification performance as TCRFS in Figure 8d and Figure 9e, but TCRFS is superior on average, and they are not as excellent as TCRFS overall. As a consequence, it is critical to consider the three types of conditional relevance for multi-label feature selection.

We create the final feature subset by starting from an empty feature subset and adding a feature after each calculation of the proposed method. According to the TCRFS evaluation function, the score of each candidate feature is calculated and sorted. Due to TCRFS using three incremental information terms as the evaluation criteria for feature relevance, the incremental information of the remaining candidate features will change after each time the selection operation of candidate features is completed. It needs to be recalculated and scored. Therefore, while achieving better classification performance, more time is consumed.

6. Conclusions

In this paper, a TCRFS that combines FR and LR is proposed to capture the optimal selected feature subset. FR fuses three incremental information terms that take three key aspects into consideration to convey three types of conditional relevance. Then, TCRFS is compared with 1 embedded approach (RALM-FS) and 5 information-theoretical-based approaches (D2F, PMU, SCLS, FSSL, and MUCO) on 13 multi-label benchmark data sets to demonstrate its efficacy. The classification performance of seven multi-label feature selection methods is evaluated through four multi-label metrics (Macro-$F_1$, Micro-$F_1$, Hamming Loss, and Zero One Loss) for three classifiers (SVM, 3NN, and ML-kNN). Finally, the classification results verify that TCRFS outperforms the other six contrasted approaches. Therefore, candidate features, selected features, and label correlations are critical for feature relevance evaluation, and they can aid in the selection of a more suitable subset of selected features. Our current research is based on a fixed label set for multi-label feature selection. In our future research, we intend to explore multi-label feature selection integrating information theory with the stream label problem.