# In-Depth Research and Analysis of Multilabel Learning Algorithm

Authors: Daowang Li; Canwei Wang
Journal: Journal of Sensors
 (2022)

---

## Abstract

Multilabel learning (MLL), as a hot topic in the field of machine learning, has attracted wide attention from many scholars due to its ability to express output space polysemy. In recent years, a large number of achievements about MLL have emerged. Among these achievements, there are several typical issues worthy of attention. Firstly, the correlation among labels plays a key role in improving MLL model training process. Many MLL algorithms try to fully and effectively use the correlation among labels to improve the performance. Secondly, existing MLL evaluation metrics, which is different from those in binary classification, often reflects the generalization performance of MLL classifiers in some aspects. How to choose metrics in algorithms to improve their generalization performance and fairness is another issue that should be concerned. Thirdly, in many practical MLL applications, there are many unlabeled instances due to their labeling cost in training datasets. How to use the wealth information contained in the correlation among unlabeled instances may contribute to reducing of the labeling cost in MLL and improving performance. Fourthly, labels assigned to instances may not be equally descriptive in many applications. How to describe the importance of each label in output space to an instance has become one of research points that many scholars have paid attention to in recent years. This paper reviews the MLL-related research results of correlation among labels, evaluation metric, multilabel semisupervised learning, and label distribution learning (LDL) from a theoretical and algorithmic perspective. Finally, the related research work on MLL is summarized and discussed.


---

## Body

## 1. Introduction

Traditional supervised learning assumes that each sample corresponds to a single class label that is unique in the output space, which is binary classification. But many real-world learning tasks do not fit the hypothesis. For example, an image of Yao Ming smiling while holding a basketball in classification tasks can be labeled “movement,” “basketball,” “NBA superstar,” or “smile.” Another example is the article “Moonlight” in text categorization tasks, which might cover the topics “essay” or “zhu ziqing” labels. In these cases, an example is polysemous. In other words, an example is associated with multiple class labels in output space. In order to solve these problems, there appear multilabel learning frameworks [1].A multilabel learning framework was originally applied to text categorization tasks. Because of its ability to express the world more accurately, MLL has attracted wide attention from researchers and has been gradually applied in applications such as automatic annotation of multimedia information, Web mining, information retrieval, and tag recommendation [2, 3]. A lot of influential MLL methods have been proposed in the recent years, and more and more detailed and deep-level problems have gradually become clear and solvable. A number of scholars have systematically studied and combed the research progresses towards MLL. Tsoumakas et al. gave a structured representation of sparse literatures on MLL methods with comments on their advantages and disadvantages. Label cardinality and label density were defined to quantify the multiple labels properties of a dataset, and some comparative experimental results were provided to demonstrate the performance of different MLL methods in their work. Zhang et al. providing the fundamentals on MLL including formal definition and evaluation metrics. And in their work, some representative MLL algorithms are highlighted and related analysis is carried out [4]. From the research in recent years, several research hotspots on MLL have attracted the interest of scholars. In order to inspire the future research for scholars interested in MLL, we combed the relevant works. In this paper, we will focus on the following: (1) the correlation among labels, (b) evaluation metric, (c) multilevel semisupervised learning, and (d) distribution characteristics of labels.


## 2. The Unified Description of the Relevant Concepts

For the sake of further description, here, we give the formal description on the relevant concepts on MLL.AssumeX=ℝd expresses a d-dimensional instance space, in which each instance could be expressed as a vector xi=xi1,xi2⋯.xidxiϵX; Y=y1,y2⋯.yq expresses q-dimensional class label space. A multilabel learning framework is to learn a mapping function h:X⟶2Y from instance space X to the subsets of class label space Y in given training set D=x1,Y1x2,Y2⋯.xm,Ym (Yi⊆Y was a subset of label space Y, i∈1,m, noting the size of D as D. For any unknown instance x∈X in a testing set, a multilabel classifier will predict a set hx⊆Y as a predicted label set of x. In general, most of the multilabel learning model will attune h to a real-valued function f:X×Y⟶ℝ, and fx,y can be expressed as a confidence value with which the MLL model predicts y∈Y was the label assigned to x. Thus, fx,y will make the label y′ corresponding to lager output as relevant labels of x, while making the label y′′ corresponding to smaller output as irrelevant labels of x, that is, fx,y′>fx,y′′. The above-mentioned classification prediction modelhusually sets a threshold valuetin which cloud divides the label spaceYinto two parts: relevant and irrelevant segmentation. If the real value classifier model fx,y>t, we can consider y relevant labels of x; otherwise, y is considered irrelevant labels of x.There are usually two approaches to selectt: One is for the fixed constant (eg., 0.5); another one is for the variable function [5].And it is worth mentioning that there are several concepts related to MLL. Multiclass classification deals with the cases in which each instance is associated with only one label, while the label belongs to a label set that consist to more than two labels. For example, an image of fruit could be associated with apple, banana, orange, or peach, but it could not be associated with more than one of them. If we describe binary classification as “True-False,” multiclass classification could be described as a “Single-Answer” from multiple items, and multilabel classification could be described as “Multiple-Answer.” Their relationship is shown in Figure1Figure 1
The distinctions about binary classification, multiclass classification, and multilabel classification.Multi-instance learning refers to the cases in which some instances are packed into a bag as an example, and each example is associated with only one binary label. In contrast to MLL which handle the polysemy of labels in output space, multi-instance learning handles the polysemy of examples in an input space [6–8]. What is interesting and important is that if we combine multilabel with multi-instance, we would get a new learning framework—MIML (Multiple Instances Multiple labels) that could deal with complex and ambiguous cases. For example, we can put an image including sky, cloud, lake, and trees into a bag (without being splitted) as an example, and based on these examples, MIML could be trained to predict whether a new instance is correlated to the labels (sky, cloud, lake, and tree). There are a number of attempts towards exploiting MIML in real applications such as text categorization and image classification [9].Ordinal classification in multilabel learning tries to generalize each original labelyij∈−1,1 to a member of graded label series yij∈m1,m2⋯,mk,m1<m2<⋯,<mk. It does not output the defined class labels but the fuzzy label series. This case may be reasonable in practical application, because it may be hard to answer “yes” or “no” exclusively but easier to answer “somewhat” or “almost.” Give an example of emotional classification of songs; the labels associated with a song may be not “angry-aggressive” at all, somewhat “quiet-still,” almost “relaxing-clam,” fully “happy-pleased” (“angry-aggressive”<“quiet-still”<“relaxing-clam”<“happy-pleased”), while the datasets on this case is few as far as we know [10].Multitask classification attempts to train multiple tasks in parallel by sharing representations and induces bias information on related tasks to improve the generalization performance to others. Just like the correlation between labels for MLL, the bias information for related tasks is helpful if we want to extend tabula rasa learning to complex tasks. For example, each of the following: the number of lanes on the road, the location of road edge, the location of the road center, and the intensity of road surface, can be regarded as a task in the field of road-tracking, respectively. If we take a label as a task, MLL could be considered a special case of multitask. The differences between them lie in two aspects at least: one is that all the examples in MLL need to share the feature space while those in multitask need not; another one is that the goal of MLL is to obtain a label subset while those of multitask is to improve generalization performance using bias information. Some literatures indicate that techniques for multitask classification may be used to benefit MLL [11].


## 3. The Correlation among Labels

### 3.1. Category of Label Correlations

The key challenge of MLL might be increased dramatically with the increase of the label space scaleY. The mainstream solution is to use correlation among labels in Y to lower learning space of model. For example, “blue sky” label usually appears at the same time with the “clouds” label; News pages marked as “politics” usually do not appear “entertainment” label. Formally speaking, Pyi≠Pyiyj. Strategies using the correlation among labels can be roughly divided into three categories based on its order: (1) the first-order strategy is designed to consider a single label to correspond to one binary classification, respectively, ignoring the relationship with other remaining labels. The strategy is simple and efficient, while the performance may not be optimal. (b) The second-order strategy is designed to consider the pairwise relation between labels, such as related and irrelevant labels through the label ranking. The performance is better than the first-order strategy, while the correlation between labels in practical application will surpass the premise of the second order relationship. (c) High-order strategy is designed to consider higher order relation among either all or random subsets of labels, such as considering the influence of the rest of all on each label. The ability in expressing the relationship is the strongest while its computational complexity limits applications to small scale.On the other hand, the correlation among labels can be divided into unconditional and conditional correlation in terms of its probability distribution [12]. Unconditional correlation refers to the expected value of correlation globally, i.e., the expected value of correlation among labels associated with all instances in an input space. Normally speaking, the correlation among labels refers to the unconditional correlation, whereas conditional correlation captures the correlation among labels given a special instance x∈X.


### 3.2. Why Label Correlation Work

The correlation among labels plays a key role in improving MLL model training process. Considering unconditional second order as an example, letbi and bj denote the decision boundaries corresponding to labels yi≈hix and yj≈hjx separately, and α denotes the angle between bi and bj, as shown in Figure 2 (a rectangle represents an instance associated withyi; a round represents an instance associated withyj):Figure 2
The angle between decision boundaries.Andyj can be expressed as
(1)yj=fyi+gx,in which f∙ is a dependence function between yi and yj, the strength of which is related to α; i.e., with the increase of α, the impact strength of f∙ decreases gradually. And gx is a minimum about x, i.e., gx≈0 with high probability or for most instances. Since gx plays a less important role, it is reasonable to believe that yj is determined by fyi in formula (1). That can be illustrated in Figure 3 in which the performance of MLL on the ordinate axis is expressed by subset 0/1 loss.Figure 3
The relationship between the performance of MLL and angleα.


### 3.3. How to Obtain the Correlation among Labels

The correlation among labels is so important that many researchers are interested in this topic: how to obtain it. In fact, this is challenging. To the best of our knowledge, there are four methods to solve this problem. (1) The first one is statistics based on the number of the instances assigned to each label, such as chi-square, difference in proportions, and likelihood ratio test, on the number of these instances [13]. Taking the chi-square test as an example, assume the frequency counts of instances related to label yi and yj cooccurrences as presented in Table 1.Table 1
Frequency counts of instances related to label.
yi¬yiyjab¬yjcdAccording to the chi-square test,(2)x2=ad−bc2a+b+c+da+bc+db+da+c.The greater the value ofx2, the greater the likelihood that the hypothesis of “label yi and yj are correlated” holds. Thus, the correlated label pairs can be sorted according to x2 value in descending order. (2) The second one is based on the similarity of features assigned to different labels. This method assumes that if there are sufficient instances assigned to label yi and yj that contain some similar features it is reasonable to believe yi and yj are correlated. Specifically, for any instance xi in D, if it is assigned to yi and yj simultaneously, put it into set A. Note the common features for all instances in A as a vector fc=xm⋯.xn; the larger the A and n−m+1, the more reason to believe that yi and yj are correlated. Association rules and principal component analysis may be helpful in terms of similarity in feature space. It is worth mentioning that if the dimension of the features in the training set D is too large (i.e., q≪d), the influence of a single label will be diluted. (3) The correlation among labels could be provided to MLL classifier manually using domain knowledge. For example, a hierarchy among labels or dividing labels into several mutually exclusive subsets in a practical application may be helpful in reducing computational complexity and improving accuracy. (4) Using the feedback from the predictor is also helpful in obtaining label correlation. It is a common method in many researches.


### 3.4. MLL Classification Algorithms Based on Label Correlation

Although the correlation among labels plays an important role to MLL, some straightforward algorithms do not take it into account when dealing with multiple labels problems, i.e., the first order strategy. For example, the binary relevance algorithm on which many state-of-the-art algorithms are based and Label Powerset method in which each label set exists in the training dataset will be considered as a single label [14]. Here, we will review some classical algorithms based on label correlation to expound how to deal with multiple labels problems and how to use the correlation among labels.


#### 3.4.1. Classifier Chain Algorithm

The basic idea of classifier chain algorithm is to converse MLL to a chain composed of some binary classifiers in which the precursor must be dependent on the successor to be established. First, set a sorting functionπY to arrange all the labels in the label space in an ordered sequence yπ1≺yπ2≺⋯≺yπq: in which yπ1≺yπ2≺⋯≺yπq represents yπi is prior to yπjand does not indicate the size relation between them. For a label yπj in an ordered sequence, a dichotomous classification training set corresponding to it is constructed as follows:
(3)Dπj=xi,Preπji,φYi,yπj1≤i≤m.Preπji represents the relevance between all the precursor labels of yπj in an ordered sequence and xi, that is,
(4)Preπji=φYi,yπ1,⋯φYi,yπj−1T.AfterDπj is constructed, you can choose a traditional supervised learning algorithm B. to train binary classifiers hπj⟵BDπj. For a testing instance x, it traversal recursively the binary classifiers chain to determine whether a label yπj is assigned to x or not, and the predicted label set of x can be written as
(5)Y=yπjhπjx=1,1≤j≤q.The flowchart of the algorithm classifier chains is shown in Figure4. If the output of binary classifiers hπjx is a real value, we need to symbol for it to judge whether the class labels corresponding to the value are the related labels of x or not.Figure 4
The flow chart of algorithm classifier chains.The successor binary classifier of classifier chain algorithm relies on the precursor classifier, so the sort functionπY is extremely critical. The ECC (ensemble of classifier chains) algorithm gives an efficient sorting method. Firstly, ECC constructs n sort functions π1Y,π2Y,⋯,πnY on class label space, and then for any sort function πjY, it generates a new dataset Dj by sampling from the original dataset D. Finally, for any πjY, a binary classifier chain is produced in corresponding Dj to integrate. For sampling without replacement, the size is generally 67% of the original dataset, while for sampling with replacement, it retains the same size as the original dataset. The algorithm is a high-order strategy, which has the advantage of taking into account about all the relations among labels; the disadvantage is that it is not suitable for parallel training on large-scale datasets due to the successive relation in the chain. Additionally, the dimension of the data is also increasing with constantly iterating.


#### 3.4.2. Calibrated Label Ranking

The idea of this algorithm is to convert MLL problems into label ranking problems by comparing each pair wise among labels. For the label space which scale isq, we need qq−1/2 label pairs in total to describe the one-one relationship among labels. For each label pair yj,yk, construct a training set corresponding to it:
(6)Djk=xi,θYi,yj,ykφYi,yj≠φYi,yk,1≤i≤m,in which
(7)θYi,,yk=1,yj∈Yi⋀yk∉Yi,−1,yk∈Yi⋀yj∉Yi.Thus, for each instancexi, it would be resampled Yi∗Y¯i times for training binary classifiers. And then, the algorithm selects a traditional binary classification algorithm B. to train a binary classifier hjk⟵BDjk. For instance, x the learning system will vote to yj if hjkx>0; otherwise, vote to yk. For a testing instance x, the algorithm calls qq−1/2 classifiers to vote for each label as follows:
(8)Vx,yj=∑k=1j−1hkjx≤0+∑k=j+1qhjkx≥0.In order to divide labels into two types of related and irrelated labels by voting, the algorithm set a virtual labelyv (do not care about its value) as a threshold and constructed q training sets corresponding to the label pair of yv and yjj∈1,q:
(9)Djv=xi,φYi,yj∣1≤i≤m.Ibid.,q binary classifiers were trained on Djv. Let yv and yj join the vote process, if the hjvx≥0 that indicated yj was at the front of the threshold, that is, relevant label. New voting function is updated to
(10)V∗x,yj=Vx,yj+hjvx>0.The flowchart of the algorithm Calibrated Label Ranking is shown in Figure5. The algorithm takes into account the relationship between each label pair and therefore belongs to the second-order strategy. Compared with the one-vs.-rest relationship, the one-vs.-one relationship that the algorithm considered to construct training set could alleviate the imbalance problem among labels. In addition, the number of constructed binary classifiers is upgraded to the secondary from the linear scale, so the algorithm could be improved by using the Pruning branch method in the testing phase [15].Figure 5
The flow chart of algorithm Calibrated Label Ranking.


#### 3.4.3. Randomk Label Sets

The idea of the method is to convert MLL into an ensemble learning problem based on multiclass. The basic classifiers in the ensemble learning randomly selectedn label space subsets contained k labels by using LP (Label Powerset) technology (each subset as a class). Thus, it converted MLL to multiclass problems [16].Assume the multiclass training set isDM=xi,σYi1≤i≤m. A multiclassifier h.⟵MDM could be obtained by using a conventional multiclass learning algorithm M. When the label space Y is very large, there would be too many label subsets in D, which would lead to high complexity. Random k label sets specified the scale of label subsets to be k, and randomly selected n subsets from q/k for learning. So the scale of label space in multiclass tasks is reduced from q to kk<q. For any label subset Yjk, construct a multiple class training set:
(11)DMYjk=xi,σYi∩Yjk1≤i≤m.Ibid., multiclassifierhYjk.⟵MDMYjk can be obtained. The algorithm randomly selected n multiclassifiers for ensemble learning. For any label yrr∈1,q of a testing instance x, the max value maxyr that the ensemble learning system might vote for it and the actual value actyr that the ensemble learning system actually voted for it were calculated as follows:
(12)maxx,yr=∑j=1nyr∈Yjk,actx.yr=∑j=1nyr∈σ−1hYjkx.Whenactyr reached half of maxyr, yr could be considered to be related to x, that is,
(13)Yx=>0.5.Randomk label set is a high-order strategy. The value of k in the algorithm controls the relevant range among labels, so there is a critical impact on the performance of the algorithm; the experience value of k is generally set to 3, while the number of base classifiers n preferably chose 2q.


#### 3.4.4. GLOCAL (Multilabel Learning with GLObal and loCAL Correlation)

In practical applications of MLL, more complex situations may occur. For example, partial labels of some instances are complete, while others may be missing. Since the given data distribution may be different from the ground truth distribution, learning the correlation among labels on such datasets is challenging [17]. In addition, global and local label correlation may exist simultaneously in the same application. For the two cases discussed above, the GLOCAL algorithm transforms the ground truth matrix Y~ into a product of two matrices by the low-rank matrix decomposition, i.e., Y~=UV [18], where the matrix V represents a latent label matrix that is more concise and semantically more abstract than the original label matrix Y~, while the matrix U is used to project Y~ into the latent label space. Let Y denote the given label matric (possibly missing some labels) in training dataset D. The local correlations of labels can be obtained by dividing training dataset D into g-related subsets by domain knowledge or clustering. The GLOCAL algorithm alternately solves the missing labels, learns the linear classifier, and adopts both global and local label correlations by optimizing the following formula:
(14)minU,V,WПΩY−UVF2+λ1V−WTXF2+λ2RU,V,W+λ3trF0TL0F0+∑m=1gλ4trFmTLmFm,where λ1,λ2,λ3,λ4 are tradeoff parameters; when the corresponding position of Y is a non-0 element, ПΩY−UV=Y−UV; otherwise, ПΩY−UV=0. Matrix W is used to implement mapping instance matric X onto the latent label matrix V, which can be achieved by minimizing V−WTXF2. RU,V,W is the regular term part, used to regularize the model using label correlation; that is, the more the two labels are positively correlated, the closer the output value of the model is. Let F0=UWTX. Suppose the global correlation matrix is marked as S0, L0 is the Laplacian matrix of S0. For any training subset Dm, assuming that the local correlation matrix on it is Sm, then Fm=UWTXm, and Lm is the Laplacian matrix of Sm. The alternating optimization ofU,V,W is performed by fixing two of them and optimizing the last one.


### 3.5. Challenging Issues about Label Correlation

Although the correlation among labels has attracted the interest of scholars in recent years, at least the following challenging issues need to be further explored. First of all, the correlation among labels has been approved, but the study on formal characterization on the concept or principled mechanism on appropriate usage of the concept is not yet sufficient so far. Some researches indicate that the correlation among labels might be asymmetric; i.e., the influence of labelyi to label yj might not be valid on label yj to label yi. Furthermore, the correlation among labels might be local; i.e., there are seldom global correlations for all examples on the whole training dataset Secondly, the applicable conditions of the correlation among labels are not given enough consideration. How to use label correlation to improve the performance of MLL algorithm in specific fields still needs a lot of further exploration in experimental comparison. Thirdly, why label correlation can improve the performance of MLL and how it works have not been fully understood. The last but not the least, for large scale label space, how to reduce the computational complexity of the algorithm when the correlation among labels is complex (especially for high order strategy model). In other words, how to trade-off between expressing ability of label correlation and computational complexity. In addition, for all MLL algorithms (not just for that based on label correlation), the nature of training dataset (e.g., the completeness of label or noise data) has a great influence on the performance of MLL algorithms; and the class imbalance in MLL is another challenging topic [19].


## 3.1. Category of Label Correlations

The key challenge of MLL might be increased dramatically with the increase of the label space scaleY. The mainstream solution is to use correlation among labels in Y to lower learning space of model. For example, “blue sky” label usually appears at the same time with the “clouds” label; News pages marked as “politics” usually do not appear “entertainment” label. Formally speaking, Pyi≠Pyiyj. Strategies using the correlation among labels can be roughly divided into three categories based on its order: (1) the first-order strategy is designed to consider a single label to correspond to one binary classification, respectively, ignoring the relationship with other remaining labels. The strategy is simple and efficient, while the performance may not be optimal. (b) The second-order strategy is designed to consider the pairwise relation between labels, such as related and irrelevant labels through the label ranking. The performance is better than the first-order strategy, while the correlation between labels in practical application will surpass the premise of the second order relationship. (c) High-order strategy is designed to consider higher order relation among either all or random subsets of labels, such as considering the influence of the rest of all on each label. The ability in expressing the relationship is the strongest while its computational complexity limits applications to small scale.On the other hand, the correlation among labels can be divided into unconditional and conditional correlation in terms of its probability distribution [12]. Unconditional correlation refers to the expected value of correlation globally, i.e., the expected value of correlation among labels associated with all instances in an input space. Normally speaking, the correlation among labels refers to the unconditional correlation, whereas conditional correlation captures the correlation among labels given a special instance x∈X.


## 3.2. Why Label Correlation Work

The correlation among labels plays a key role in improving MLL model training process. Considering unconditional second order as an example, letbi and bj denote the decision boundaries corresponding to labels yi≈hix and yj≈hjx separately, and α denotes the angle between bi and bj, as shown in Figure 2 (a rectangle represents an instance associated withyi; a round represents an instance associated withyj):Figure 2
The angle between decision boundaries.Andyj can be expressed as
(1)yj=fyi+gx,in which f∙ is a dependence function between yi and yj, the strength of which is related to α; i.e., with the increase of α, the impact strength of f∙ decreases gradually. And gx is a minimum about x, i.e., gx≈0 with high probability or for most instances. Since gx plays a less important role, it is reasonable to believe that yj is determined by fyi in formula (1). That can be illustrated in Figure 3 in which the performance of MLL on the ordinate axis is expressed by subset 0/1 loss.Figure 3
The relationship between the performance of MLL and angleα.


## 3.3. How to Obtain the Correlation among Labels

The correlation among labels is so important that many researchers are interested in this topic: how to obtain it. In fact, this is challenging. To the best of our knowledge, there are four methods to solve this problem. (1) The first one is statistics based on the number of the instances assigned to each label, such as chi-square, difference in proportions, and likelihood ratio test, on the number of these instances [13]. Taking the chi-square test as an example, assume the frequency counts of instances related to label yi and yj cooccurrences as presented in Table 1.Table 1
Frequency counts of instances related to label.
yi¬yiyjab¬yjcdAccording to the chi-square test,(2)x2=ad−bc2a+b+c+da+bc+db+da+c.The greater the value ofx2, the greater the likelihood that the hypothesis of “label yi and yj are correlated” holds. Thus, the correlated label pairs can be sorted according to x2 value in descending order. (2) The second one is based on the similarity of features assigned to different labels. This method assumes that if there are sufficient instances assigned to label yi and yj that contain some similar features it is reasonable to believe yi and yj are correlated. Specifically, for any instance xi in D, if it is assigned to yi and yj simultaneously, put it into set A. Note the common features for all instances in A as a vector fc=xm⋯.xn; the larger the A and n−m+1, the more reason to believe that yi and yj are correlated. Association rules and principal component analysis may be helpful in terms of similarity in feature space. It is worth mentioning that if the dimension of the features in the training set D is too large (i.e., q≪d), the influence of a single label will be diluted. (3) The correlation among labels could be provided to MLL classifier manually using domain knowledge. For example, a hierarchy among labels or dividing labels into several mutually exclusive subsets in a practical application may be helpful in reducing computational complexity and improving accuracy. (4) Using the feedback from the predictor is also helpful in obtaining label correlation. It is a common method in many researches.


## 3.4. MLL Classification Algorithms Based on Label Correlation

Although the correlation among labels plays an important role to MLL, some straightforward algorithms do not take it into account when dealing with multiple labels problems, i.e., the first order strategy. For example, the binary relevance algorithm on which many state-of-the-art algorithms are based and Label Powerset method in which each label set exists in the training dataset will be considered as a single label [14]. Here, we will review some classical algorithms based on label correlation to expound how to deal with multiple labels problems and how to use the correlation among labels.


### 3.4.1. Classifier Chain Algorithm

The basic idea of classifier chain algorithm is to converse MLL to a chain composed of some binary classifiers in which the precursor must be dependent on the successor to be established. First, set a sorting functionπY to arrange all the labels in the label space in an ordered sequence yπ1≺yπ2≺⋯≺yπq: in which yπ1≺yπ2≺⋯≺yπq represents yπi is prior to yπjand does not indicate the size relation between them. For a label yπj in an ordered sequence, a dichotomous classification training set corresponding to it is constructed as follows:
(3)Dπj=xi,Preπji,φYi,yπj1≤i≤m.Preπji represents the relevance between all the precursor labels of yπj in an ordered sequence and xi, that is,
(4)Preπji=φYi,yπ1,⋯φYi,yπj−1T.AfterDπj is constructed, you can choose a traditional supervised learning algorithm B. to train binary classifiers hπj⟵BDπj. For a testing instance x, it traversal recursively the binary classifiers chain to determine whether a label yπj is assigned to x or not, and the predicted label set of x can be written as
(5)Y=yπjhπjx=1,1≤j≤q.The flowchart of the algorithm classifier chains is shown in Figure4. If the output of binary classifiers hπjx is a real value, we need to symbol for it to judge whether the class labels corresponding to the value are the related labels of x or not.Figure 4
The flow chart of algorithm classifier chains.The successor binary classifier of classifier chain algorithm relies on the precursor classifier, so the sort functionπY is extremely critical. The ECC (ensemble of classifier chains) algorithm gives an efficient sorting method. Firstly, ECC constructs n sort functions π1Y,π2Y,⋯,πnY on class label space, and then for any sort function πjY, it generates a new dataset Dj by sampling from the original dataset D. Finally, for any πjY, a binary classifier chain is produced in corresponding Dj to integrate. For sampling without replacement, the size is generally 67% of the original dataset, while for sampling with replacement, it retains the same size as the original dataset. The algorithm is a high-order strategy, which has the advantage of taking into account about all the relations among labels; the disadvantage is that it is not suitable for parallel training on large-scale datasets due to the successive relation in the chain. Additionally, the dimension of the data is also increasing with constantly iterating.


### 3.4.2. Calibrated Label Ranking

The idea of this algorithm is to convert MLL problems into label ranking problems by comparing each pair wise among labels. For the label space which scale isq, we need qq−1/2 label pairs in total to describe the one-one relationship among labels. For each label pair yj,yk, construct a training set corresponding to it:
(6)Djk=xi,θYi,yj,ykφYi,yj≠φYi,yk,1≤i≤m,in which
(7)θYi,,yk=1,yj∈Yi⋀yk∉Yi,−1,yk∈Yi⋀yj∉Yi.Thus, for each instancexi, it would be resampled Yi∗Y¯i times for training binary classifiers. And then, the algorithm selects a traditional binary classification algorithm B. to train a binary classifier hjk⟵BDjk. For instance, x the learning system will vote to yj if hjkx>0; otherwise, vote to yk. For a testing instance x, the algorithm calls qq−1/2 classifiers to vote for each label as follows:
(8)Vx,yj=∑k=1j−1hkjx≤0+∑k=j+1qhjkx≥0.In order to divide labels into two types of related and irrelated labels by voting, the algorithm set a virtual labelyv (do not care about its value) as a threshold and constructed q training sets corresponding to the label pair of yv and yjj∈1,q:
(9)Djv=xi,φYi,yj∣1≤i≤m.Ibid.,q binary classifiers were trained on Djv. Let yv and yj join the vote process, if the hjvx≥0 that indicated yj was at the front of the threshold, that is, relevant label. New voting function is updated to
(10)V∗x,yj=Vx,yj+hjvx>0.The flowchart of the algorithm Calibrated Label Ranking is shown in Figure5. The algorithm takes into account the relationship between each label pair and therefore belongs to the second-order strategy. Compared with the one-vs.-rest relationship, the one-vs.-one relationship that the algorithm considered to construct training set could alleviate the imbalance problem among labels. In addition, the number of constructed binary classifiers is upgraded to the secondary from the linear scale, so the algorithm could be improved by using the Pruning branch method in the testing phase [15].Figure 5
The flow chart of algorithm Calibrated Label Ranking.


### 3.4.3. Randomk Label Sets

The idea of the method is to convert MLL into an ensemble learning problem based on multiclass. The basic classifiers in the ensemble learning randomly selectedn label space subsets contained k labels by using LP (Label Powerset) technology (each subset as a class). Thus, it converted MLL to multiclass problems [16].Assume the multiclass training set isDM=xi,σYi1≤i≤m. A multiclassifier h.⟵MDM could be obtained by using a conventional multiclass learning algorithm M. When the label space Y is very large, there would be too many label subsets in D, which would lead to high complexity. Random k label sets specified the scale of label subsets to be k, and randomly selected n subsets from q/k for learning. So the scale of label space in multiclass tasks is reduced from q to kk<q. For any label subset Yjk, construct a multiple class training set:
(11)DMYjk=xi,σYi∩Yjk1≤i≤m.Ibid., multiclassifierhYjk.⟵MDMYjk can be obtained. The algorithm randomly selected n multiclassifiers for ensemble learning. For any label yrr∈1,q of a testing instance x, the max value maxyr that the ensemble learning system might vote for it and the actual value actyr that the ensemble learning system actually voted for it were calculated as follows:
(12)maxx,yr=∑j=1nyr∈Yjk,actx.yr=∑j=1nyr∈σ−1hYjkx.Whenactyr reached half of maxyr, yr could be considered to be related to x, that is,
(13)Yx=>0.5.Randomk label set is a high-order strategy. The value of k in the algorithm controls the relevant range among labels, so there is a critical impact on the performance of the algorithm; the experience value of k is generally set to 3, while the number of base classifiers n preferably chose 2q.


### 3.4.4. GLOCAL (Multilabel Learning with GLObal and loCAL Correlation)

In practical applications of MLL, more complex situations may occur. For example, partial labels of some instances are complete, while others may be missing. Since the given data distribution may be different from the ground truth distribution, learning the correlation among labels on such datasets is challenging [17]. In addition, global and local label correlation may exist simultaneously in the same application. For the two cases discussed above, the GLOCAL algorithm transforms the ground truth matrix Y~ into a product of two matrices by the low-rank matrix decomposition, i.e., Y~=UV [18], where the matrix V represents a latent label matrix that is more concise and semantically more abstract than the original label matrix Y~, while the matrix U is used to project Y~ into the latent label space. Let Y denote the given label matric (possibly missing some labels) in training dataset D. The local correlations of labels can be obtained by dividing training dataset D into g-related subsets by domain knowledge or clustering. The GLOCAL algorithm alternately solves the missing labels, learns the linear classifier, and adopts both global and local label correlations by optimizing the following formula:
(14)minU,V,WПΩY−UVF2+λ1V−WTXF2+λ2RU,V,W+λ3trF0TL0F0+∑m=1gλ4trFmTLmFm,where λ1,λ2,λ3,λ4 are tradeoff parameters; when the corresponding position of Y is a non-0 element, ПΩY−UV=Y−UV; otherwise, ПΩY−UV=0. Matrix W is used to implement mapping instance matric X onto the latent label matrix V, which can be achieved by minimizing V−WTXF2. RU,V,W is the regular term part, used to regularize the model using label correlation; that is, the more the two labels are positively correlated, the closer the output value of the model is. Let F0=UWTX. Suppose the global correlation matrix is marked as S0, L0 is the Laplacian matrix of S0. For any training subset Dm, assuming that the local correlation matrix on it is Sm, then Fm=UWTXm, and Lm is the Laplacian matrix of Sm. The alternating optimization ofU,V,W is performed by fixing two of them and optimizing the last one.


## 3.4.1. Classifier Chain Algorithm

The basic idea of classifier chain algorithm is to converse MLL to a chain composed of some binary classifiers in which the precursor must be dependent on the successor to be established. First, set a sorting functionπY to arrange all the labels in the label space in an ordered sequence yπ1≺yπ2≺⋯≺yπq: in which yπ1≺yπ2≺⋯≺yπq represents yπi is prior to yπjand does not indicate the size relation between them. For a label yπj in an ordered sequence, a dichotomous classification training set corresponding to it is constructed as follows:
(3)Dπj=xi,Preπji,φYi,yπj1≤i≤m.Preπji represents the relevance between all the precursor labels of yπj in an ordered sequence and xi, that is,
(4)Preπji=φYi,yπ1,⋯φYi,yπj−1T.AfterDπj is constructed, you can choose a traditional supervised learning algorithm B. to train binary classifiers hπj⟵BDπj. For a testing instance x, it traversal recursively the binary classifiers chain to determine whether a label yπj is assigned to x or not, and the predicted label set of x can be written as
(5)Y=yπjhπjx=1,1≤j≤q.The flowchart of the algorithm classifier chains is shown in Figure4. If the output of binary classifiers hπjx is a real value, we need to symbol for it to judge whether the class labels corresponding to the value are the related labels of x or not.Figure 4
The flow chart of algorithm classifier chains.The successor binary classifier of classifier chain algorithm relies on the precursor classifier, so the sort functionπY is extremely critical. The ECC (ensemble of classifier chains) algorithm gives an efficient sorting method. Firstly, ECC constructs n sort functions π1Y,π2Y,⋯,πnY on class label space, and then for any sort function πjY, it generates a new dataset Dj by sampling from the original dataset D. Finally, for any πjY, a binary classifier chain is produced in corresponding Dj to integrate. For sampling without replacement, the size is generally 67% of the original dataset, while for sampling with replacement, it retains the same size as the original dataset. The algorithm is a high-order strategy, which has the advantage of taking into account about all the relations among labels; the disadvantage is that it is not suitable for parallel training on large-scale datasets due to the successive relation in the chain. Additionally, the dimension of the data is also increasing with constantly iterating.


## 3.4.2. Calibrated Label Ranking

The idea of this algorithm is to convert MLL problems into label ranking problems by comparing each pair wise among labels. For the label space which scale isq, we need qq−1/2 label pairs in total to describe the one-one relationship among labels. For each label pair yj,yk, construct a training set corresponding to it:
(6)Djk=xi,θYi,yj,ykφYi,yj≠φYi,yk,1≤i≤m,in which
(7)θYi,,yk=1,yj∈Yi⋀yk∉Yi,−1,yk∈Yi⋀yj∉Yi.Thus, for each instancexi, it would be resampled Yi∗Y¯i times for training binary classifiers. And then, the algorithm selects a traditional binary classification algorithm B. to train a binary classifier hjk⟵BDjk. For instance, x the learning system will vote to yj if hjkx>0; otherwise, vote to yk. For a testing instance x, the algorithm calls qq−1/2 classifiers to vote for each label as follows:
(8)Vx,yj=∑k=1j−1hkjx≤0+∑k=j+1qhjkx≥0.In order to divide labels into two types of related and irrelated labels by voting, the algorithm set a virtual labelyv (do not care about its value) as a threshold and constructed q training sets corresponding to the label pair of yv and yjj∈1,q:
(9)Djv=xi,φYi,yj∣1≤i≤m.Ibid.,q binary classifiers were trained on Djv. Let yv and yj join the vote process, if the hjvx≥0 that indicated yj was at the front of the threshold, that is, relevant label. New voting function is updated to
(10)V∗x,yj=Vx,yj+hjvx>0.The flowchart of the algorithm Calibrated Label Ranking is shown in Figure5. The algorithm takes into account the relationship between each label pair and therefore belongs to the second-order strategy. Compared with the one-vs.-rest relationship, the one-vs.-one relationship that the algorithm considered to construct training set could alleviate the imbalance problem among labels. In addition, the number of constructed binary classifiers is upgraded to the secondary from the linear scale, so the algorithm could be improved by using the Pruning branch method in the testing phase [15].Figure 5
The flow chart of algorithm Calibrated Label Ranking.


## 3.4.3. Randomk Label Sets

The idea of the method is to convert MLL into an ensemble learning problem based on multiclass. The basic classifiers in the ensemble learning randomly selectedn label space subsets contained k labels by using LP (Label Powerset) technology (each subset as a class). Thus, it converted MLL to multiclass problems [16].Assume the multiclass training set isDM=xi,σYi1≤i≤m. A multiclassifier h.⟵MDM could be obtained by using a conventional multiclass learning algorithm M. When the label space Y is very large, there would be too many label subsets in D, which would lead to high complexity. Random k label sets specified the scale of label subsets to be k, and randomly selected n subsets from q/k for learning. So the scale of label space in multiclass tasks is reduced from q to kk<q. For any label subset Yjk, construct a multiple class training set:
(11)DMYjk=xi,σYi∩Yjk1≤i≤m.Ibid., multiclassifierhYjk.⟵MDMYjk can be obtained. The algorithm randomly selected n multiclassifiers for ensemble learning. For any label yrr∈1,q of a testing instance x, the max value maxyr that the ensemble learning system might vote for it and the actual value actyr that the ensemble learning system actually voted for it were calculated as follows:
(12)maxx,yr=∑j=1nyr∈Yjk,actx.yr=∑j=1nyr∈σ−1hYjkx.Whenactyr reached half of maxyr, yr could be considered to be related to x, that is,
(13)Yx=>0.5.Randomk label set is a high-order strategy. The value of k in the algorithm controls the relevant range among labels, so there is a critical impact on the performance of the algorithm; the experience value of k is generally set to 3, while the number of base classifiers n preferably chose 2q.


## 3.4.4. GLOCAL (Multilabel Learning with GLObal and loCAL Correlation)

In practical applications of MLL, more complex situations may occur. For example, partial labels of some instances are complete, while others may be missing. Since the given data distribution may be different from the ground truth distribution, learning the correlation among labels on such datasets is challenging [17]. In addition, global and local label correlation may exist simultaneously in the same application. For the two cases discussed above, the GLOCAL algorithm transforms the ground truth matrix Y~ into a product of two matrices by the low-rank matrix decomposition, i.e., Y~=UV [18], where the matrix V represents a latent label matrix that is more concise and semantically more abstract than the original label matrix Y~, while the matrix U is used to project Y~ into the latent label space. Let Y denote the given label matric (possibly missing some labels) in training dataset D. The local correlations of labels can be obtained by dividing training dataset D into g-related subsets by domain knowledge or clustering. The GLOCAL algorithm alternately solves the missing labels, learns the linear classifier, and adopts both global and local label correlations by optimizing the following formula:
(14)minU,V,WПΩY−UVF2+λ1V−WTXF2+λ2RU,V,W+λ3trF0TL0F0+∑m=1gλ4trFmTLmFm,where λ1,λ2,λ3,λ4 are tradeoff parameters; when the corresponding position of Y is a non-0 element, ПΩY−UV=Y−UV; otherwise, ПΩY−UV=0. Matrix W is used to implement mapping instance matric X onto the latent label matrix V, which can be achieved by minimizing V−WTXF2. RU,V,W is the regular term part, used to regularize the model using label correlation; that is, the more the two labels are positively correlated, the closer the output value of the model is. Let F0=UWTX. Suppose the global correlation matrix is marked as S0, L0 is the Laplacian matrix of S0. For any training subset Dm, assuming that the local correlation matrix on it is Sm, then Fm=UWTXm, and Lm is the Laplacian matrix of Sm. The alternating optimization ofU,V,W is performed by fixing two of them and optimizing the last one.


## 3.5. Challenging Issues about Label Correlation

Although the correlation among labels has attracted the interest of scholars in recent years, at least the following challenging issues need to be further explored. First of all, the correlation among labels has been approved, but the study on formal characterization on the concept or principled mechanism on appropriate usage of the concept is not yet sufficient so far. Some researches indicate that the correlation among labels might be asymmetric; i.e., the influence of labelyi to label yj might not be valid on label yj to label yi. Furthermore, the correlation among labels might be local; i.e., there are seldom global correlations for all examples on the whole training dataset Secondly, the applicable conditions of the correlation among labels are not given enough consideration. How to use label correlation to improve the performance of MLL algorithm in specific fields still needs a lot of further exploration in experimental comparison. Thirdly, why label correlation can improve the performance of MLL and how it works have not been fully understood. The last but not the least, for large scale label space, how to reduce the computational complexity of the algorithm when the correlation among labels is complex (especially for high order strategy model). In other words, how to trade-off between expressing ability of label correlation and computational complexity. In addition, for all MLL algorithms (not just for that based on label correlation), the nature of training dataset (e.g., the completeness of label or noise data) has a great influence on the performance of MLL algorithms; and the class imbalance in MLL is another challenging topic [19].


## 4. Evaluation Metric

### 4.1. Common Evaluation Metrics and Related Theories

Since each instance is associated with multiple labels in MLL, the metrics for performance evaluation in MLL are more complex than those in binary classification [20]. In general, the common metrics for performance evaluation in MLL are subset accuracy, hamming loss, accuracy, one-error, coverage, ranking loss, average precision, macroaveraging, microaveraging, AUC-macro, AUC-micro, and so on.To the best of our knowledge, existing MLL evaluation metrics often only reflect the generalization performance of MLL classifiers in some aspects, and no universal MLL evaluation metric has been found. Generally speaking, adopting metrics based on example is a good choice for classification tasks, while adopting metrics based on labels is a better choice for retrieval tasks. Cheng et al. showed that the Hamming loss and the subset could not be optimized simultaneously in 2010. When evaluating the performance of the algorithm on the test set, more metrics are chosen, and the evaluation effect should be fairer.


### 4.2. MLL Classification Algorithms Based on Evaluation Metrics

The MLL classification task is more complex, and the MLL evaluation metric is more challenging, so more recent studies have focused on this work. Different metrics often take care of algorithm performance from different aspects and reflect different natures. However, most MLL algorithms often only optimize one metric [21]. It should be said that different metrics are adopted for different MLL algorithms, and their generalization performances are also different. Gao et al. study the Bayes coherence of substitution loss in MLL and demonstrates that neither any convex substitution loss nor rank loss are coherent, proposing an alternative loss function for Hamming loss in specific context conditions [22].Wu et al. analyzed the common properties of 11 MLL metrics mentioned above, proposed the concepts of instance-wise and label-wise based on margin, and gave a unified understanding about MLL:(15)instancewise=mina,bfjxa−fjxba∈Y∙j,b∈Y∙j¯,where Y∙j is the set of the positive instance index of yj and Y∙j¯ is the set of the negative instance index of yj.
(16)labelwise=minu,vfuxi−fvxiu∈Yi∙,v∈Yi∙¯,where Yi∙ is the set of the relevant label index of xi and Yi∙ is the set of the irrelevant label index of xi.It was shown that the concepts based on margin can be used to optimize certain MLL metrics. The metrics that can be optimized were analyzed for ranking and classification, respectively, and the details are shown in Table2.Table 2
The details about MLL metrics optimized.
Metricsinstance_wiselabel_wisedouble_wiseRanking lossNoYesYesAverage precisionNoYesYesOne-errorNoYesYesCoverageNoYesYesInstance-AUCNoYesYesMacro-AUCYesNoYesMicro-AUCNoNoYesMacro-F1YesNoYesInstance-F1NoYesYesMicro-F1NoYesYesHamming lossYesYesYesBecause double wise has the advantages of caring 11 metrics simultaneously, an algorithm for optimizing both instance-wise and label-wise is proposed, called the LIMO algorithm. AssumingF=W, the LIMO algorithm randomly assigns the weight matrix W an initial value of W0 that follows a normal distribution (0,d), and the optimization model is solved by SGD (stochastic gradient descent):
(17)argminw,ξ∑i=1qwi2+λ1∑i=1m∑u,vξiuv+λ2∑j=1q∑a,bξabjs.t.wuTxi−wvTxi>1−ξiuv,ξiuv≥0,for i=1,⋯,m and u∈Yi∙,v∈Yi∙¯(18)wjTxa−wjTxb>1−ξabj,,ξabj≥0,for j=1,⋯,q and a∈Y∙j,v∈Y∙j¯whereξi and ξj are two relaxation variables and λ1 and λ2 are two harmonic parameters used to adjust the instance-wise and label-wise; i.e., when λ1=0, the LIMO algorithm optimizes instance-wise; when λ2=0, the LIMO algorithm optimizes label-wise; when λ1>0 and λ2>0, the LIMO algorithm optimizes both instance-wise and label-wise. However, it is difficult to optimize both instance-wise and label-wise simultaneously in practice. An important contribution of LIMO algorithm is that it provides some reference for how to tradeoff between instance-wise and label-wise when they cannot be optimized at the same time.


## 4.1. Common Evaluation Metrics and Related Theories

Since each instance is associated with multiple labels in MLL, the metrics for performance evaluation in MLL are more complex than those in binary classification [20]. In general, the common metrics for performance evaluation in MLL are subset accuracy, hamming loss, accuracy, one-error, coverage, ranking loss, average precision, macroaveraging, microaveraging, AUC-macro, AUC-micro, and so on.To the best of our knowledge, existing MLL evaluation metrics often only reflect the generalization performance of MLL classifiers in some aspects, and no universal MLL evaluation metric has been found. Generally speaking, adopting metrics based on example is a good choice for classification tasks, while adopting metrics based on labels is a better choice for retrieval tasks. Cheng et al. showed that the Hamming loss and the subset could not be optimized simultaneously in 2010. When evaluating the performance of the algorithm on the test set, more metrics are chosen, and the evaluation effect should be fairer.


## 4.2. MLL Classification Algorithms Based on Evaluation Metrics

The MLL classification task is more complex, and the MLL evaluation metric is more challenging, so more recent studies have focused on this work. Different metrics often take care of algorithm performance from different aspects and reflect different natures. However, most MLL algorithms often only optimize one metric [21]. It should be said that different metrics are adopted for different MLL algorithms, and their generalization performances are also different. Gao et al. study the Bayes coherence of substitution loss in MLL and demonstrates that neither any convex substitution loss nor rank loss are coherent, proposing an alternative loss function for Hamming loss in specific context conditions [22].Wu et al. analyzed the common properties of 11 MLL metrics mentioned above, proposed the concepts of instance-wise and label-wise based on margin, and gave a unified understanding about MLL:(15)instancewise=mina,bfjxa−fjxba∈Y∙j,b∈Y∙j¯,where Y∙j is the set of the positive instance index of yj and Y∙j¯ is the set of the negative instance index of yj.
(16)labelwise=minu,vfuxi−fvxiu∈Yi∙,v∈Yi∙¯,where Yi∙ is the set of the relevant label index of xi and Yi∙ is the set of the irrelevant label index of xi.It was shown that the concepts based on margin can be used to optimize certain MLL metrics. The metrics that can be optimized were analyzed for ranking and classification, respectively, and the details are shown in Table2.Table 2
The details about MLL metrics optimized.
Metricsinstance_wiselabel_wisedouble_wiseRanking lossNoYesYesAverage precisionNoYesYesOne-errorNoYesYesCoverageNoYesYesInstance-AUCNoYesYesMacro-AUCYesNoYesMicro-AUCNoNoYesMacro-F1YesNoYesInstance-F1NoYesYesMicro-F1NoYesYesHamming lossYesYesYesBecause double wise has the advantages of caring 11 metrics simultaneously, an algorithm for optimizing both instance-wise and label-wise is proposed, called the LIMO algorithm. AssumingF=W, the LIMO algorithm randomly assigns the weight matrix W an initial value of W0 that follows a normal distribution (0,d), and the optimization model is solved by SGD (stochastic gradient descent):
(17)argminw,ξ∑i=1qwi2+λ1∑i=1m∑u,vξiuv+λ2∑j=1q∑a,bξabjs.t.wuTxi−wvTxi>1−ξiuv,ξiuv≥0,for i=1,⋯,m and u∈Yi∙,v∈Yi∙¯(18)wjTxa−wjTxb>1−ξabj,,ξabj≥0,for j=1,⋯,q and a∈Y∙j,v∈Y∙j¯whereξi and ξj are two relaxation variables and λ1 and λ2 are two harmonic parameters used to adjust the instance-wise and label-wise; i.e., when λ1=0, the LIMO algorithm optimizes instance-wise; when λ2=0, the LIMO algorithm optimizes label-wise; when λ1>0 and λ2>0, the LIMO algorithm optimizes both instance-wise and label-wise. However, it is difficult to optimize both instance-wise and label-wise simultaneously in practice. An important contribution of LIMO algorithm is that it provides some reference for how to tradeoff between instance-wise and label-wise when they cannot be optimized at the same time.


## 5. Multilabel Semisupervised Learning

Traditional MLL is based on two fundamental assumptions: First, the sample in the training set has complete labels; second, the training set provides sufficient examples for the training process. However, in the practical application, annotating for multiple labels cost more than that for a single label. The correlation among unlabeled instances contains a wealth of useful information, which may contribute to reducing of the cost caused by multilabel classification and improving the classification performance [23, 24].Multilabel semisupervised learning is an effective method that can make full use of these useful information. The training sets in multilabel semisupervised learning can be described as(19)D=x1,Y1,x2,Y2,⋯,xl,Yl,xl+1,Yl+1,⋯,xp,Yp,xp+1,Yp+1,⋯,xu,Yu,in which Dlx1,Y1,x2,Y2,⋯,xl,Yl represents data with complete labels; Dp=xl+1,Yl+1,⋯,xp,Yp indicate data with partial labels; and Du=xp+1,Yp+1,⋯,xu,Yu say the data with no label. The numbers of the elements which they contain are, respectively, l=Dl,p=Dp,u=Du and l+p+u=m=D. For easy description herein, Dp and Du collectively refer to Du.The goal of the multilabel semisupervised learning is to model on a given training set and to predict the labels assigned to an unknown instancex by learning. If x∈Du, that is, the testing instance is closed for the training set, this learning strategy is called transductive semisupervised learning; otherwise, known as inductive semisupervised learning. The typical transductive semisupervised learning includes Tram (Transductive multilabel classification) and DMMS (normalized dependence maximization multilabel semisupervised learning method). Tram is built on the following assumption: the labels related to an instance are smooth for the aspect of attribute manifold, and then, a MLL model like random walk can be obtained. While DMMS is built on the basis of the dependence of the statistical theory, take the labels inDlas constraint. It estimates the normalized dependence to attribute set and label set on the entire dataset, and the optimization target is to maximum the estimated value of dependence. DMMS learning outcomes remained significant when the data Dl is sparse [25, 26].It is worth mentioning that in the learning frameworks with unlabeled information to improve learning performance, active learning is an effective way, resulting in a set of learning frameworks called MLAL (multilabel active learning). Active learning submits some unlabeled data to the field experts for annotating in iteration ways according to some kind of inquiry criterion and then submits the labeled data to the training model to improve its generalization performance. The study focuses on how to filter the typical instances to experts to annotate and, as much as possible, to reduce the number of labeling. Currently, active learning query criteria can be divided into two types, which are information content and representation. Information content (such as uncertainty and the degree of unity) describes the performance of the selected unlabeled instances in terms of reducing the uncertainty of learning model. Representation (such as density and cluster centers) describes the ability that the selected instances represent the overall data distribution. Huang et al. proposed AUDI (Active query driven by Uncertainty and Diversity for Incremental multilabel learning), QUIRE (Querying Informative and Representative Examples) which are a certain breakthrough on reducing the labeling cost by active learning using relationships between labels [27, 28].AUDI constructs a classification model for any labelyjj∈1,q in the label space:
(20)fjx=ωjTW0x,in which W0 is the q∗dmatrix, with the role of mapping the feature vectors (d dimension) in training set Dl to a low-dimensional (q dimensional) shared subspace, and ωjT is a q-dimensional weight vector, which corresponds to a linear model based on a shared subspace. For a xi in Dl and a label ykyk∈Yi assigned to xi, define an error of ranking:
(21)ϵxi,yk=∑j=1Rxi,yk1j,in which Rxi,yk indicates the number of the misarranged labels with yk as a center, that is, the number of the unrelated labels before yk. The purpose of learning is to minimize ϵxi,yk on the entire training set. However, this objective function is a nonconvex function. In order to facilitate optimization, AUDI selected the hamming loss as an approximate alternative loss function:
(22)ϵxi,yk≤∑y¯∈Y¯ϵxi,ykmax0,1+fy¯xi−fyxiRxi,yk.In fact, the wrong order onxi may also be considered as the sum of the irrelevant labels before the relevant label yk. So it can be decomposed into each y¯∈Y¯ to get
(23)Lxi,yk,y¯w=ϵxi,ykmax0,1+fy¯wxi−fykxi.Using the stochastic gradient descent method to solve the objective function, we can obtain classification model.After the model being obtained, it predicted for all instances inDu, and AUDI wants to select the most valuable instances from them to give the experts in the fields to annotate. The most valuable points are reflected in two aspects: First, the instance contains most information which is used to distinguish uncertainty whether or not being related; second, the diversity is the biggest between the selected instance and the previously queried instances. It is the typical representative of the unselected instances. That is,
(24)C1xi=∑k=1qIy^ik>0−1/l∑j=1l∑k=1qIyjk>0max0.5,q−Uxi,in which ∑k=1qIy^ik>0−1/l∑j=1l∑k=1qIyjk>0 describes the disunity of label set cardinality (LCI) and represents the difference between the number of related labels that the model output and the average number of ground truth-related labels in Dl. I∙ represents a indicator function. Uxi represents the label set with no query assigned to xi.Suppose the most valuable instances selected by (24) are x∗, and AUDI queried the most valuable label once for every time to the labels of x∗; AUDI screens the most valuable label of x∗ using the following formula:
(25)C2xi=fyx∗−fyvx∗.Here,yv stands for the virtual label between relevant and irrelevant label. y∗ which makes C2xi minimum is the most valuable label.AUDI obtains a predicting model with the labeled training set firstly, and each round filters a most valuable instance-label pair based on the predicated value of the model to the experts of field to annotate. The model filters out redundant labels in the maximum extent using the relationship between the labels, and therefore, it belongs to using the relationship between the labels indirectly. When screening instance-label pair, it takes overall consideration of the two factors: amount of information and representation, which reduces the query cost substantially and enhances the classification performance. But the amount of information and representation is connected with each other in a fixed way, and this way may be less flexible in certain applications.QUIRE trains a classifierfj,j∈1,q for each label on the labeled dataset Dl, and the predicted value that fj output for each instance consists of a predicted vector fj on the label, and predicted vectors for all labels form a predicted matrix F=fj∣1≤j≤q. Calculating nuclear matrix Kon the entire dataset, entering the relation matrix between labels R, and objective function could be defined as
(26)minF∈Rm∗qλtrR−1FTK−1F+F−Y22,in which tr· is the matrix trace function and Y is a ground-truth label matrix of all examples. Based on min–max view framework, the optimal solution is obtained. On this basis, QUIRE defines a matrix L based on R,K, which is used to select guidelines which contributes to selecting the most valuable example-label pair:
(27)L=λR⨂K+λI−1.⨂ is the tensor product of the matrix.BecauseL is defined on Dl and Du (the entire training set), the predicted confidence for the selected instances to be queried using Dl cloud reflect the factor of amount of information; for Du, if the selected instance is very representative it should be highly similar to other instances, and if labels conform to uniform distribution, lots of unlabeled instances in Du will result in a lower degree of confidence. And therefore QUIRE can choose the most valuable instance-label pair by minimizing both the confidences. The matrix L constructed on R and K contains two relationships: the relationship between labels and the relationship between instances, and the two factors, the amount of information and co-ordinate representation, are overall planed.The QUIRE method makes use of the label relations directly in the algorithm, and reduces the number of computing inverse matrix when solving unlabeled instance–label and is suitable for processing massive tasks with more unlabeled instances. However, the QUIRE method requires the relationship between the labels inDl as the known knowledge to input to algorithm, and regards the labels in Du lines with uniform distribution.Relations between the labels play a key role in multilabel active learning tasks. When submitting a query to experts in the field, the type of query and the exploit of the relationship between the labels inDl are equally important. Huang et al. firstly proposed a new multilabel active learning framework AURO to query correlation order between the label pair, which requires experts in the field to mark the importance of the correlation between labels [29]. Different with the traditional multilabel active learning, AURO submits the query information to unlabeled instances to the staff in the form alternative versions. Suppose yi,yj correspond to the two labels to be queried of the instance xu, and design the options as follows: (1) for instance xu, yi is more relevant than yj; (2) for instance xu, yi is not more relevant than yj; and (3) for instance xu, yi and yj are not relevant. With the simple selection strategy and sequence label model, the framework helps annotator with less professional knowledge to obtain more label information. The framework opens up a new perspective of multilabel active learning, which gives the researchers a good way to design and explore more extensive query options to exploit the relationship between the labels, or in conjunction with a better selection strategy to achieve better classification performance. Compared with the traditional multilabel active learning algorithm, the time cost on label annotation is reasonable, but the original frame on option design is simpler; for example, the similar relevant cases of the two labels are not considered.The notable feature of the multilabel active learning requires human-computer interaction. In multilabel semisupervised learning methods which do not require human-computer interaction, the inductive semisupervised learning method has better generalization performance. Compared with a transductive method, it can naturally predict unknown instances outside the testing set. Currently, the amount of researches on inductive semisupervised learning is relatively small. Taking traditional empirical risk minimization principle as theoretical guarantee, Li et al. first proposed inductive semisupervised learning method MASS (multilabel semisupervised learning) aimed at MLL. Similar with a traditional multilabel learning algorithm, MASS assumes that decision function is resolved to each labelF=f1,f2,⋯,fq and assumes that the decision function fj on each label is a linear model, namely, fjx=<ωj,ϕx>, in which ϕx stands for the attribute mapping function derived by the kernel function and <∙,∙> stands for the inner product in reproducing kernel Hilbert space H spanned by the kernel function. It is need to guarantee theoretically the vector F combined of fj belongs to the reproducing kernel Hilbert space which is signed as Hv. The objective function is solved by MASS:
(28)F∗=argminF∈Hv1l∗q∑i=1lVxi,Yi,F+rsqΩF+ral+m2q2IF.l is the labeled data scale; m is the total size of the training set; q is the size of labeled space; Vxi,Yi,F represents empirical risk on datasets. Similar with classic MLL algorithms, MASS chosen hamming loss function to measure it, namely,
(29)Vxi,Yi,F=∑j=1qlxi,Yij,fj.l∙ was the hinge loss function in SVM; ΩF was a regular item used to control the complexity of F; IF was a manifold regular item used to constrain that “similar instances have similar multilabels with structure”; rs and ra were two coefficients used to make a trade-off between the importance of the two regular items, respectively. MASS defined the regular item ΩF as follows:
(30)ΩF=μω02+∑j=1qωj2q,in which ω0=1/q∑j=1qωj, μ was a regularization coefficient in −1,0 used to adjust the force of the before and after items. ω02 reflected the common property, while ∑j=1qωj2 reflected the unique properties of the jth label. When μ=−1 minimizing the formula (30) would drive ωj of all the labels to be consistent. Instead, when μ=0, minimizing the formula (30) would drive ωj of all the labels to be independent.MASS defined the regular itemIF as follows:
(31)IF=∑i,j=1mFxi−FxjTB−1Fxi−FxjWij,in which B=PT∗P, P was a q∗q projection matrix which projected label space into a new space that could describe the difference among multi labels. And W was a m∗m similarity matrix which described the similarity among the instances. As for the matrix B used to describe the relation among labels, MASS gave two solving ways: one was given by the domain knowledge; the other was learned from Dl and Du by alternating optimization techniques.Wu et al. used the relation among the labels inDl and the accuracy degree inferring unlabeled instances in Du to model the learning progress and provided a novel inductive multilabel semisupervised learning algorithm iMLCU (inductive Multilabel Classification with Unlabeled data) [30]. iMLCU assumed multilabel classification model was combined by q linear classifiers; each label yjj∈1,q in the label space corresponded to a linear classifier fjx,yj=ωjTx+bj, in which ωj was is a d dimensional real valued weight vector, bj was a real valued bias, and marked W=ωj,bj∣1≤j≤q. For an unknown instance x, the classifier predicted its label was
(32)Y^=signf1x,y1,⋯,fqx,yq=signω1Tx+b1,⋯,ωqTx+bq.And then we utilized the relation between the data inDl and Du to obtain an optimal W that made the formula (32) to predicate a more accurate value for the new unknown instance. Firstly, let us consider the labeled data, for any example xi,Yi in Dl,yj∈Yi was a related label assigned to xi, and yk∈Y¯i was an irrelated label assigned to xi. Considering the relevance ranking among the labels, the decision boundary between related and irrelated label of xi could be defined by the hyperplane between yj and yk, that was ωj−ωkTxi+bj−bk. Taking maximum metric hypothesis as the theoretical guarantee in the labeled dataset Dl, the objective function can be obtained:
(33)minW,Ξ∑j=1qωj2+C∑i=1l1YiY¯i∑yj∈Yi,yk∈Y¯iξijk(34)s.t.ωj−ωkTxi+bj−bk≥1−ξijk,(35)ξijk≥0i∈1,l,yj,yk∈Yi×Y¯i,in which Ξ=ξijk∣i∈1,l,yj,yk∈Yi×Y¯i. The two items in formula (35) were used to control model complexity and empirical loss in Dl respectively, and the constant term C was used to make a trade-off between them.And then think about unlabeled data. For the unlabeled data inDu, we still expect the predicted labels by using classification model can be farther away from the boundary and the misclassified instances should be punished. The difficulty for achieving this expectation lies in how to know the ground-truth labels of the data in learning process. Therefore, we cannot directly give the predicted labels some reward or punishment. For this goal, S3VM provides an idea for reference: borrowing hinge loss function.For any unlabeled instance, the predicted labels through the previous way just only were considered putative labels but not official predicted labels. In addition, we use hinge loss function to punish the loss for putative labels.(36)cjx,fjx,yj=max1−signωjTx+bjωjTx+bj,0=max1−ωjTx+bj,0.And then minimized penalty function in formula (36) on all labels of all the instances in Du, combing with formula (35), the optimization function can be obtained:
(37)minW,Ξ∑j=1qωj2+C1∑i=1l1YiY¯i∑yj∈Yi,yk∈Y¯iξijk+C2∑i=l+1l+u∑j=1qmax1−ωjTxi+bj,0(38)s.t.ωj−ωkTxi+bj−bk≥1−ξijk,(39)ξijk≥0i∈1,l,yj,yk∈Yi×Y¯i,(40)1u∑i=l+1l+uωjTxi+bj=1l∑i=1lyij.Comparing formula (40) with formula (35), there is an additional regular item in formula (40), that is, the total loss function used to constrain all the labels of all instances in Du. In addition, compared with formula (35), the formula (40) also contains another constraint, that is, 1/u∑i=l+1l+uωjTxi+bj=1/l∑i=1lyij which is used to ensure that the predicted label diversity in Du is consistent with those in Dl. iMLCU takes two parameters C1 and C2 to weigh the loss over Du and Dl. It will encounter a problem for direct optimize the formula (34): it is nonconvex function. Hence, iMLCU uses ConCave Convex Procedure (CCCP) to solve the globally optimal solution of the nonconvex function.iMLCU tries to maximize the metric between relevant label and irrelevant label, so it belongs to the second order learning strategies.For multilabel semisupervised learning, some researchers proposed S3VM (Semisupervised Support Vector Machine) and graph-based semisupervised learning methods. S3VM was based on the basic assumption of low-density separation; try to learn a classification hyperplane which can separate two kinds of examples and be able to pass through the low-density regions [31]. There are a series of S3VMs achievements on reducing the computational complexity, but many of these approaches do not take full advantage of the correlation among labels. TSVM (Transductive Support Vector Machine) is the most famous one among them. For the problem that there are some harmful unlabeled instances in S3VMs training set which would reduce instead of improve the performance of the classifier, Li et al. proposed a more secure S4VMs that used a plurality of low-density slicer to approximate ground-truth boundary. It maximized the performance of the algorithm in the protection of algorithm safety. Semisupervised learning algorithms based on graph once attracted the interest of many researchers. The basic idea of them is to construct a graph by taking a labeled data in Dl and an unlabeled data in Du as a node in the graph; then estimate a function on the basis of this. This function must meet two conditions: First, the dataset has been labeled with the existing labels coincide; the second is that it should be smooth enough in the entire graph. The difference between the various algorithms based on graph is the defining on the estimated function. Graph-based concept is very clear, but its large storage is overhead and difficult to use on large-scale data [32, 33].


## 6. Label Distribution Learning

Traditional multilabel learning assumes that the importance of all the related (or irrelated) labels to the instance is similar; however, label distribution learning is to dispose of the learning task in which the importance of the labels to the instance is different from each other. For example, facial expressions might contain a lot of basic expressions such as “joy” and “emotional,” but the description degree of each basic expression is very different. These learning tasks could not be finished based on the traditional MLL framework [34].LDL definesdxy∈0,1 that represents the description degree of the label y to instance x and assumes that the description degree of all the labels is complete, that is, ∑ydxy=1. The description degree of all the labels assigned to x is composed of a data formation in the form of probability distributions, so it is called label distribution; the learning process by the label distribution on the given dataset is called label distribution learning. In many applications, the description degree or correlation of the labels assigned to an instance x might not be same; however, the traditional MLL could only to express related relation (marked 1) or irrelated relation (marked 0); therefore, LDL is superior to MLL in general in many practical applications.Compared with MLL, each instance in LDL datasets is assigned to one distribution about a label, instead of one label (or one label set). And the label distribution comes from nature feature of initial data in the application. Many MLL algorithms divide labels into two parts: related and irrelated labels, by label ranking based on certain threshold value. This method is only concerned with label sequence that can be distinguished but does not care about value as long as it is a specific predicted value. Instead, LDL cares for the overall distribution, each predicted value to the description degree is very important. Due to the different learning process, LDL performance assessment criteria are different from MLL. LDL measures performance of its algorithms by calculating the similarity between predicted distribution and ground-truth distribution on labels [34].SupposeD=x1,dx1,x2,dx2,⋯,xm,dxm represents the training set, in which dxi=dxiyj∣1≤j≤q represents the distribution of labels assigned to xi, the goal of LDL is to learn (or train) a conditional probability mass function py∣x;θ in which θ is a parameter, so that py∣x;θ is as similar as possible to the ground-truth distribution of labels dx. LDL using KL divergence as a similarity criterion between predicted distribution and ground-truth distribution on labels, the goal of LDL can be transformed into the following optimization problem:
(41)θ∗=argminθ∑i∑jdxiyjlndxiyjpyj∣xi;θ=argmaxθ∑i∑jpyj∣xi;θ.A variety of learning algorithms can solve the above optimization problem. For example,xi,dxi can be split into q single-labels xi,yji∈1,m,j∈1,q whose weight is Dxiyj, so PT-Bayes used posterior probability which is calculated based on Bayes theorem on the resampled standard single-label datasets as a predicted distribution of an unknown instance; PT-SVM used SVM to solve a single label learning task. It calculated output probability of SVM on each label, through Platt posterior probability [35–36]. The framework of these two algorithms is shown in Figure 6.Figure 6
The framework of PT-Bayes algorithm and PT-SVM algorithm.In addition to resampling on datasets, directly improved traditional algorithms can also handle the above optimization problem, typical algorithms such as AA-kNN and AA-BP. AA-kNN was a lazy learning algorithm, it did not find itsk-nearest neighbors in the training set until an unknown instance x arrived and used the mean of label distribution of its k neighbors as the label distribution of x, that is,
(42)pyj∣x=1k∑xi∈Nkxdxiyj,in which Nkx represents the k neighbor set of x and j∈1,q.The AA-BP algorithm used the feature ofx as the input of BP neural network and used the distribution of each label as output. The output value of AA-BP was adjusted to the real value belonged to [0,1] and satisfied the constraint that the sum of all the label distribution equaled 1. And then minimizing the sum of squared errors between output values and the ground-truth distribution of labels was used as the optimization goal to train neural network.Both resampling on datasets and improved strategies on traditional algorithms transform LDL into MLL or SLL learning task; some researchers attempt to directly solve the optimization problem in formula (41). The representative algorithms are IIS-LLD and SA-BFGS [37].ISS-LLD supposedpyX;θ model was the maximum entropy model y∣x;θ=1/Zexp∑kθy,kgkx, in which Z was a normalization factor, θy,k was a element of vector θ, and gkx was the kth feature of x. Thereby, the optimization problem in formula (41) was transformed to
(43)Tθ=∑i,jdxiyj∑kgkxi−∑iln∑jexp∑kθyj,kgkxi.The optimization process in formula (43) used the thought (or idea, formulation) of IIS (Improved Iterative Scanning) that was θ which would be updated to +Δ, Tθ would be updated to Tθ+Δ in each round; until Tθ+Δ−Tθ would be stabilized in a smaller range.A literature confirmed that the optimize process of IIS-LLD algorithm was ineffective. SA-BFGS improved the aforementioned optimization process by BFGS Quasi-Newton method [38]. SA-BFGS expanded formula (43) into second-order Taylor expansion at θl of lth round, obtaining
(44)T′θl+1≈T′θl+∇T′θlT∆+12∆THθl∆,in which ∆=θl+1−θl. ∇T′θl and Hθl were gradient and Hansen matrix of T′θ at θl, respectively.Therefore, the minimum value of formula (44) can be obtained as follows:
(45)∆l=−H−1θl∇T′θl.SA-BFGS took∆l as a linear search direction by Newton method:
(46)θl+1=θl+λ∆l,in which λ was step length. Due to the large computational cost when solving inverse Hansen matrix, SA-BFGS selected its approximate matrix B as a substitution. B was initialized to a random value, with each iteration as follows:
(47)Bl+1=I−ρlslulTBlρlulslT+ρlslslT,in which ∇T′θl+1 could be obtained by solving the partial derivatives of θyj,k in formula (43).The parameter vectorθl+1 in next round can be obtained by bringing ∇T′θl+1 and Bl+1 into formula (45) and (46). Repeated the above-described process until ∇T′θl was convergent.There are some other novel LDL algorithms in real application recently. COS-LDL uses a distance mapping function during training to exploit the correlation between labels and then yields the objective function. Similarly, LDL-SCL is another LDL algorithm that utilizes label correlations locally. LDL-SCL designs a distance-mapping function to map the label correlation to a distance, and then measures the similarity between labels using the distance [39]. LDL-LRR adapts the ranking loss function applying the cross-entropy and uses two metrics—Spearman’s rank and Kendall tau correlation coefficient as the similarity metrics, to obtain the objective function. The improved LDL-LRR algorithm reflects the correlation distribution of either label yi assigned to instance x; meanwhile, it reflects the relevance intensities of each related label-pairs yi,yj and enriches the expression abilities of the LDL model. ENN-LDL calculates the dominant labels in the training set D through hyperparameters δ and then divides the training set into k training subsets according to the dominant labels [40]. A weak classifier is trained on each training subsets based on the neural network rather than the maximum information entropy. Finally, these weak classifiers are combined with weight to become an integrated classifier using ensemble learning. ENN-LDL uses local correlation between labels in the proceeding of dividing the training set with the dominant labels. On the other hand, the division changes the original distribution of the training set, so the weak classifiers trained on the subset will be bias for unknown test examples. LDLFS consists of a set of differentiable decision trees, each one consisting of a series of split nodes and leaf nodes. The split nodes are used to distinguish whether current instance should be divided into left or right subtree, and the leaf nodes are used to represent labels distribution of current instance. Each decision tree is obtained by defining a distribution-based loss function, which uses the Kullback-Leibler divergence (K-L) between ground-truth label distribution and the label distribution predicted by decision trees. The mean of loss function in all decision trees is taken as the loss function value of forest, and the split nodes from different decision trees are allowed to be connected to the same output node in a fully connected form, so that the parameters in the split nodes can be obtained by joint-learning in the form of backpropagation. In the optimization phase, minimizing the loss function of the forest is converted to iteratively reduce its upper bound. It is worth mentioning that although LDLFS is built based on traditional machine learning models, it can still be used in deep learning models with its fully-connected architecture [41].Since the type of output in LDL is different from those of SLL and MLL, the evaluation criteria between them is also different correspondingly. The evaluation criteria of LDL algorithms are mainly based on distance or similarity. Currently, the mainstream method is to calculate the mean of distance or similarity between ground-truth distribution and predicted distribution. Thus, the criteria of distance or similarity in probability distribution could be introduced to LDL, such as Chebyshev distance, Clark distance, KL divergence, and cosine coefficients. 41 kinds of distance (or similarity) criterion are compared by computing in 30 independent experiments.LDL provides a universal learning framework for classification, which could meet more demand in practical applications. For example, when some labeling experts have different views on the same instance, LDL could easily solve these problems by setting different description degree on the label assigned to the instance. In addition, LDL could generate a label distribution by utilizing the correlation among labels. Consequently, LDL has opened up a new way to enrich the MLL learning theory.


## 7. Conclusions and Discussion

Multilabel learning has attracted great interests among researchers in the fields of machine learning and data mining because it can describe richer class information in the output space and brings new challenges as the dimension of the label space increases. In recent years, many outstanding achievements have been made in supporting theories and improving algorithms in top international conferences and journals. Many mature algorithms or learning frameworks are applied to practical applications. This paper briefly discusses four major research hotspots in MLL: correlation among labels, evaluation metric, multilabel semisupervised learning, and label distribution learning (LDL) from a theoretical and algorithmic perspective, which might be useful in conducting further research by scholars interested in MLL.The contribution of this paper is mainly reflected in four aspects. Firstly, although the current working principle of label association and how to find it in practical applications still lacks sufficient theoretical support, many scholars have done a lot of work on it. Based on this work, this paper discusses the categories of label correlations, analyzes why label correlations work, gives four methods on how to obtain the interlabel correlations, reviews some classic MLL algorithms, and points out several challenging issues about label correlations. Secondly, the evaluation metrics of MLL is more complex than that of single-label classification. Different MLL algorithms using different metrics have different generalization performance. This paper analyzes theories and representative algorithms related to MLL evaluation metrics. Thirdly, in practical MLL applications, there are many unlabeled instances due to their labeling cost. Multilabel semisupervised learning provides a solution for such problems. A summary of its advanced algorithms is given according to transductive and inductive categories, respectively. Fourthly, the LDL framework can describe the importance of each label to an instance in output space. The paper discusses the relationship between LDL and traditional MLL framework as well as formulaic paradigm of LDL.Due to space constraints, this paper does not cover all areas of research in multilabel learning (which is not possible). For example, semisupervised learning is not fully discussed, and many representative algorithms are not discussed. It is empirical that the problem of missing labels or incorrect labels in MLL can greatly affect its classification performance and such related issues can be more sufficiently discussed in the future. In contrast to binary classification, the imbalance in MLL is reflected in at least two aspects: (1) the imbalance in the number of instances contained within different classes and (2) the imbalance between class labels. The class imbalance problem in MLL is more difficult to address, especially for extreme imbalance. Therefore, we hope that more research work will emerge in this area in the future. In addition, combining the MLL framework with other techniques may achieve better results, such as using deep learning techniques to solve some MLL problems, or using MLL methods in knowledge graph.Although the algorithms covered in this article all attempt to design the original algorithms as general-purpose algorithms that can be broadly applied, each tends to be biased towards the data according to the No Free Lunch (NFL) principle. Where do these MLL algorithms, including representative algorithms mentioned above, play the best performance? There are still many experiments to be done in a future work, which is also a work worthy of further exploration.



---

*Source: 7737166-2022-07-04.xml*