Multi-view Multi-label Learning Research Articles

Embedded feature fusion for multi-view multi-label feature selection

With the explosive growth of data sources, multi-view multi-label learning (MVML) has garnered significant attention. However, the task of selecting informative features in MVML becomes more challenging as the dimensionality increase. Existing methods often extract information separately from the consensus part and the complementary part, potentially leading to noise attributed to ambiguous segmentation. In this paper, we propose an embedded feature selection model that combines with two aspects, which are the feature fusion between views and feature enhancement. Firstly, we calculate the adaptive weight of each view based on the local structure relations, and integrate it into one unified feature matrix. Subsequently, the mapping between unified feature matrix and ground-truth label matrix is established. Furthermore, a regularizer for the feature weight of each view is constructed to emphasize its characteristic, respectively. As a result, the relationship for inter-view and intra-view has been simultaneously considered, preserving comprehensive information of features by minimizing the difference between two types of feature weight. Experimental results demonstrate the superior performance of our method in coping with feature selection.

Consistent and specific multi-view multi-label learning with correlation information

In multi-view multi-label (MVML) learning, each sample is represented by several heterogeneous distinct feature representations while associated with a set of class labels simultaneously. To achieve MVML learning, most of the existing methods contribute to the recovery of a consistent subspace, i.e., a shared feature representation, among multiple views. Nevertheless, each view has its inherent specific properties used in the discrimination process of labels. These methods lose sight in the specific information exploitation, and therefore are easily trapped in a sub-optimal result. In this study, we present an optimization framework CSVL to solve the learning problem. The main technical contribution in CSVL is a formulation for MVML learning while consistent subspace across views, specific subspace for each view, and the correlations among labels are taken into account. Specifically, consistent subspace is recovered by imposing a low-rank constraint among multiple views, and specific subspace of each view is extra generated with Frobenius norm. To further improve model generalization capability, we preserve both feature manifolds from multiple views and label correlations from multiple labels. Extensive experiments on 7 benchmark datasets show that our proposal CSVL has the advantages in MVML learning.

Deep dual incomplete multi-view multi-label classification via label semantic-guided contrastive learning

Multi-view multi-label learning (MVML) aims to train a model that can explore the multi-view information of the input sample to obtain its accurate predictions of multiple labels. Unfortunately, a majority of existing MVML methods are based on the assumption of data completeness, making them useless in practical applications with partially missing views or some uncertain labels. Recently, many approaches have been proposed for incomplete data, but few of them can handle the case of both missing views and labels. Moreover, these few existing works commonly ignore potentially valuable information about unknown labels or do not sufficiently explore latent label information. Therefore, in this paper, we propose a label semantic-guided contrastive learning method named LSGC for the dual incomplete multi-view multi-label classification problem. Concretely, LSGC employs deep neural networks to extract high-level features of samples. Inspired by the observation of exploiting label correlations to improve the feature discriminability, we introduce a graph convolutional network to effectively capture label semantics. Furthermore, we introduce a new sample-label contrastive loss to explore the label semantic information and enhance the feature representation learning. For missing labels, we adopt a pseudo-label filling strategy and develop a weighting mechanism to explore the confidently recovered label information. We validate the framework on five standard datasets and the experimental results show that our method achieves superior performance in comparison with the state-of-the-art methods.

Deep Double Incomplete Multi-View Multi-Label Learning With Incomplete Labels and Missing Views.

View missing and label missing are two challenging problems in the applications of multi-view multi-label classification scenery. In the past years, many efforts have been made to address the incomplete multi-view learning or incomplete multi-label learning problem. However, few works can simultaneously handle the challenging case with both the incomplete issues. In this article, we propose a new incomplete multi-view multi-label learning network to address this challenging issue. The proposed method is composed of four major parts: view-specific deep feature extraction network, weighted representation fusion module, classification module, and view-specific deep decoder network. By, respectively, integrating the view missing information and label missing information into the weighted fusion module and classification module, the proposed method can effectively reduce the negative influence caused by two such incomplete issues and sufficiently explore the available data and label information to obtain the most discriminative feature extractor and classifier. Furthermore, our method can be trained in both supervised and semi-supervised manners, which has important implications for flexible deployment. Experimental results on five benchmarks in supervised and semi-supervised cases demonstrate that the proposed method can greatly enhance the classification performance on the difficult incomplete multi-view multi-label classification tasks with missing labels and missing views.

Exploring view-specific label relationships for multi-view multi-label feature selection

In the domain of multi-view multi-label (MVML) learning, features are distributed across various views, each offering multiple semantic representations. While existing approaches aim to balance commonality and complementarity within the view space, the inconsistency in label space has been underexplored, revealing the inadequacy of assuming uniform labels. Thus, there is a pressing need to explore the relationship among view-specific labels. Our method diverges from previous approaches by focusing on imposing constraints tailored to learning view-specific labels. We aim to preserve common characteristics through inter-view relationships while retaining specific traits inherent to each view's instances. By employing these strategies, we establish a clear mapping between labels and feature representations, enabling precise feature weighting. Convergence to the optimal feature set is achieved through multiplicative updating rules. Our method demonstrates superiority across most of cases through comprehensive experimental analysis compared to existing state-of-the art alternatives.

Anchor-guided global view reconstruction for multi-view multi-label feature selection

In multi-view multi-label learning (MVML), the accuracy of feature weights is pivotal for establishing feature order. However, conventional MVML methods often struggle with integrating distinct information from multiple views effectively, leading to unclear segmentation and potential noise introduction. To address this challenge, this paper proposes an anchor-based latent representation method for global view learning in MVML. Specifically, we encode inherent information from each view to derive a candidate multi-view representation. Anchors extracted from both the candidate view and the global view are then constrained to approximate equality in the latent space. Furthermore, a carefully designed view matrix serves as supplement, seamlessly integrated into the reconstruction process to augment information. The convergence of results is subsequently validated using multiplicative update rules. Experimental findings showcase the superior performance of our proposed method across various multi-view datasets.

Multi-view Multi-label Learning with Shared Features Inconsistency

Multi-view multi-label (MVML) learning is a framework for solving the problem of associating a single instance with a set of class labels in the presence of multiple types of data features. The extraction of shared features among multiple views for label prediction is a common MVML learning method. However, previous approaches assumed that the number and association degree of shared features were the same across views. In fact, they differ in the number and degree of association. The above assumption can lead to a poor communicability of the views. Therefore, this paper proposes an MVML learning method based on the inconsistent shared features extracted by the graph attention model. The first step is to extract the shared and private features of multiple views. Next, the graph attention mechanism is adopted to learn the association degree of shared features of different views and calculate the adjacency matrix and attention coefficient. The number of associations is determined by taking the obtained adjacency matrix as a mask matrix, while the association degree of shared features is measured by the attention weight matrix. Finally, the new shared features are obtained for multi-label prediction. We conducted experiments on seven MVML datasets to compare the proposed algorithm with seven advanced algorithms. The experimental results demonstrate the advantages of our algorithm.

A new multi-view multi-label model with privileged information learning

In multi-view multi-label learning (MVML), the data is described by multiple feature views and annotated by a number of categorical labels. At present, most of the existing MVML methods are proposed based on subspace learning, neural networks and so on. There is little work done on support vector machine (SVM)-based MVML. In this paper, we propose a novel SVM-based multi-view multi-label learning method with privileged information learning (MVMLP). By introducing the idea of privileged information learning, MVMLP implements both the consensus principle and complementarity principle in MVML. Specifically, we enforce similarity between the outputs of different views to explore the consensus information. Moreover, we allow different views to serve as privileged information for each other, such that the complementary information among distinct views can be introduced into the training process. MVMLP constructs an SVM-based model for each view and trains the models of multiple views jointly. The derived learning problem can be efficiently solved by adapting the Franke-Wolfe algorithm. Experimental results on real-life datasets show that MVMLP delivers explicitly better classification performance than state-of-the-art MVML methods.

MVML-MPI: Multi-View Multi-Label Learning for Metabolic Pathway Inference.

Development of robust and effective strategies for synthesizing new compounds, drug targeting and constructing GEnome-scale Metabolic models (GEMs) requires a deep understanding of the underlying biological processes. A critical step in achieving this goal is accurately identifying the categories of pathways in which a compound participated. However, current machine learning-based methods often overlook the multifaceted nature of compounds, resulting in inaccurate pathway predictions. Therefore, we present a novel framework on Multi-View Multi-Label Learning for Metabolic Pathway Inference, hereby named MVML-MPI. First, MVML-MPI learns the distinct compound representations in parallel with corresponding compound encoders to fully extract features. Subsequently, we propose an attention-based mechanism that offers a fusion module to complement these multi-view representations. As a result, MVML-MPI accurately represents and effectively captures the complex relationship between compounds and metabolic pathways and distinguishes itself from current machine learning-based methods. In experiments conducted on the Kyoto Encyclopedia of Genes and Genomes pathways dataset, MVML-MPI outperformed state-of-the-art methods, demonstrating the superiority of MVML-MPI and its potential to utilize the field of metabolic pathway design, which can aid in optimizing drug-like compounds and facilitating the development of GEMs. The code and data underlying this article are freely available at https://github.com/guofei-tju/MVML-MPI. Contact: jtang@cse.sc.edu, guofei@csu.edu.com or wuxi_dyj@csj.uestc.edu.cn.

Within- cross- consensus-view representation-based multi-view multi-label learning with incomplete data

This article develops a multi-view multi-label learning for incomplete data which are ubiquitous with the usage of three kinds of representations including within-view representation, cross-view representation, and consensus-view representation. Different from the recent learning machines, the proposed learning machine takes the feature-oriented information, label-oriented information, and associated information between features and labels in multiple representations together and exploits the hidden useful information of available instances with the usage of instance–instance correlations, feature–feature correlations, label-label correlations, and feature–label correlations. The developed learning machine is named as within- cross- consensus-view representation-based multi-view multi-label learning with incomplete data (WCC-MVML-ID). Extensive experiments on multiple multi-view and multi-label data sets with incomplete data validate the effectiveness of WCC-MVML-ID and it can be concluded that (1) WCC-MVML-ID outperforms other compared learning machines and its performances are more stable even though the missing rates of features and labels being larger; (2) compared with within-view information and consensus-view information, cross-view information is more useful for the processing problem about incomplete data; (3) WCC-MVML-ID can converge within 45 iterations.

Incomplete Multi-View Multi-Label Learning via Label-Guided Masked View- and Category-Aware Transformers

As we all know, multi-view data is more expressive than single-view data and multi-label annotation enjoys richer supervision information than single-label, which makes multi-view multi-label learning widely applicable for various pattern recognition tasks. In this complex representation learning problem, three main challenges can be characterized as follows: i) How to learn consistent representations of samples across all views? ii) How to exploit and utilize category correlations of multi-label to guide inference? iii) How to avoid the negative impact resulting from the incompleteness of views or labels? To cope with these problems, we propose a general multi-view multi-label learning framework named label-guided masked view- and category-aware transformers in this paper. First, we design two transformer-style based modules for cross-view features aggregation and multi-label classification, respectively. The former aggregates information from different views in the process of extracting view-specific features, and the latter learns subcategory embedding to improve classification performance. Second, considering the imbalance of expressive power among views, an adaptively weighted view fusion module is proposed to obtain view-consistent embedding features. Third, we impose a label manifold constraint in sample-level representation learning to maximize the utilization of supervised information. Last but not least, all the modules are designed under the premise of incomplete views and labels, which makes our method adaptable to arbitrary multi-view and multi-label data. Extensive experiments on five datasets confirm that our method has clear advantages over other state-of-the-art methods.

DICNet: Deep Instance-Level Contrastive Network for Double Incomplete Multi-View Multi-Label Classification

In recent years, multi-view multi-label learning has aroused extensive research enthusiasm. However, multi-view multi-label data in the real world is commonly incomplete due to the uncertain factors of data collection and manual annotation, which means that not only multi-view features are often missing, and label completeness is also difficult to be satisfied. To deal with the double incomplete multi-view multi-label classification problem, we propose a deep instance-level contrastive network, namely DICNet. Different from conventional methods, our DICNet focuses on leveraging deep neural network to exploit the high-level semantic representations of samples rather than shallow-level features. First, we utilize the stacked autoencoders to build an end-to-end multi-view feature extraction framework to learn the view-specific representations of samples. Furthermore, in order to improve the consensus representation ability, we introduce an incomplete instance-level contrastive learning scheme to guide the encoders to better extract the consensus information of multiple views and use a multi-view weighted fusion module to enhance the discrimination of semantic features. Overall, our DICNet is adept in capturing consistent discriminative representations of multi-view multi-label data and avoiding the negative effects of missing views and missing labels. Extensive experiments performed on five datasets validate that our method outperforms other state-of-the-art methods.

A simple multiple-fold correlation-based multi-view multi-label learning

A simple multiple-fold correlation-based multi-view multi-label learning

Non-Aligned Multi-View Multi-Label Classification via Learning View-Specific Labels

In the multi-view multi-label (MVML) classification problem, multiple views are simultaneously associated with multiple semantic representations. Multi-view multi-label learning inevitably has the problems of consistency, diversity, and non-alignment among views and the correlation among labels. Most of the existing multi-view multi-label methods for non-aligned views assume that each view has a common or shared label set, but because a single view cannot contain the entire label information, they often learn suboptimal results. Based on this, this paper proposes a non-aligned multi-view multi-label classification method that learns view-specific labels (LVSL), aiming to explicitly mine the information of view-specific labels and low-rank label structures in non-aligned views in a unified model framework. Furthermore, to alleviate insufficient available label information, we thoroughly explored the global and local structural information among labels. Specifically, first, we assume that there is structural consistency between the view and the label space and then construct the view-specific label model in turn. Second, to enrich the original label space information, we mine the consistent information of multiple views and the low-rank correlation information hidden among multiple labels. Finally, the contribution weight of each view is combined with learning the complementary information among the views in the decision-making stage, and extend the model to handle nonlinear data. The results of the proposed method compared with existing state-of-the-art algorithms on several datasets validate its effectiveness.

Multi-view multi-label learning with high-order label correlation

Multi-label learning deals with a kind of problem that the given samples areassociated with multiple labels simultaneously. Recently, multi-label learning has become a populartopic in the literatures of machine learning and has attracted lots of researches. In this paper, we propose a new multi-view multi-label learning method by considering the label correlation, which is called ELSMML. Based on the high-order strategy, we construct a crafted label correlation matrix to describe the relationships among labels. We further utilize multi-view learning and dimension reduction to exploit the high-level latent semantic label information and the latent feature information, so as to build a classifier in the low dimensional space. In addition, we apply manifold regularization terms to make the data samples in the low dimensional space have the same intrinsic structure as the original data. After that, we put forward the accelerated proximal gradient method to optimize the ELSMML model and obtain thepredictive classifier. Besides, we conduct convergence analysis and computational complexity analysis for ELSMML method. In the experiments, the ELSMML method can achieve better performance on the evaluation metrics compared with other baselines.

Multi-view multi-label learning with double orders manifold preserving

Multi-view multi-label learning with double orders manifold preserving

Identification of Essential Proteins Based on Local Random Walk and Adaptive Multi-View Multi-Label Learning.

Accumulating evidences have indicated that essential proteins play vital roles in human physiological process. In recent years, although researches on prediction of essential proteins have been developing rapidly, there are as well various limitations such as unsatisfactory data suitability, low accuracy of predictive results and so on. In this manuscript, a novel method called RWAMVL was proposed to predict essential proteins based on the Random Walk and the Adaptive Multi-View multi-label Learning. In RWAMVL, considering that the inherent noise is ubiquitous in existing datasets of known protein-protein interactions (PPIs), a variety of different features including biological features of proteins and topological features of PPI networks were obtained by adopting adaptive multi-view multi-label learning first. And then, an improved random walk method was designed to detect essential proteins based on these different features. Finally, in order to verify the predictive performance of RWAMVL, intensive experiments were done to compare it with multiple state-of-the-art predictive methods under different expeditionary frameworks. And as a result, RWAMVL was proven that it can achieve better prediction accuracy than all those competitive methods, which demonstrated as well that RWAMVL may be a potential tool for prediction of key proteins in the future.

Label recovery and label correlation co-learning for multi-view multi-label classification with incomplete labels.

Multi-view multi-label learning (MVML) is an important paradigm in machine learning, where each instance is represented by several heterogeneous views and associated with a set of class labels. However, label incompleteness and the ignorance of both the relationships among views and the correlations among labels will cause performance degradation in MVML algorithms. Accordingly, a novel method, label recovery and label correlation co-learning for Multi-View Multi-Label classification with incoMplete Labels (MV2ML), is proposed in this paper. First, a label correlation-guided binary classifier kernel-based is constructed for each label. Then, we adopt the multi-kernel fusion method to effectively fuse the multi-view data by utilizing the individual and complementary information among multiple views and distinguishing the contribution difference of each view. Finally, we propose a collaborative learning strategy that considers the exploitation of asymmetric label correlations, the fusion of multi-view data, the recovery of incomplete label matrix and the construction of the classification model simultaneously. In such a way, the recovery of incomplete label matrix and the learning of label correlations interact and boost each other to guide the training of classifiers. Extensive experimental results demonstrate that MV2ML achieves highly competitive classification performance against state-of-the-art approaches on various real-world multi-view multi-label datasets in terms of six evaluation criteria.

Beyond Shared Subspace: A View-Specific Fusion for Multi-View Multi-Label Learning

In multi-view multi-label learning (MVML), each instance is described by several heterogeneous feature representations and associated with multiple valid labels simultaneously. Although diverse MVML methods have been proposed over the last decade, most previous studies focus on leveraging the shared subspace across different views to represent the multi-view consensus information, while it is still an open issue whether such shared subspace representation is necessary when formulating the desired MVML model. In this paper, we propose a DeepGCN based View-Specific MVML method (D-VSM) which can bypass seeking for the shared subspace representation, and instead directly encoding the feature representation of each individual view through the deep GCN to couple with the information derived from the other views. Specifically, we first construct all instances under different feature representations into the corresponding feature graphs respectively, and then integrate them into a unified graph by integrating the different feature representations of each instance. Afterwards, the graph attention mechanism is adopted to aggregate and update all nodes on the unified graph to form structural representation for each instance, where both intra-view correlations and inter-view alignments have been jointly encoded to discover the underlying semantic relations. Finally, we derive a label confidence score for each instance by averaging the label confidence of its different feature representations with the multi-label soft margin loss. Extensive experiments have demonstrated that our proposed method significantly outperforms state-of-the-art methods.

Multi-view multi-label learning with view feature attention allocation

In multi-view multi-label learning, instances can be described by a variety of view features, and they are also associated with a set of labels. Most of the existing multi-view multi-label learning methods extract common and private features from views. However, these methods ignore the fact that the extracted features have different importance for multi-label prediction. To address this issue, this paper proposes a multi-view multi-label learning framework with view feature attention allocation. First, the common and private features between different views are obtained. Then, the original features are compared with the common features to obtain the similarity. Next, the attention weight matrix can be obtained by multiplying the similarity with the synergistic feature matrix. Finally, the acquired attention is used to reconstruct the synergistic feature matrix that indicates the semantic information of the view for multi-label prediction. To verify the effectiveness of the proposed algorithm, experiments are conducted on seven multi-view multi-label datasets, and five advanced algorithms are taken for performance comparison. The extensive experimental results demonstrate the superiority of our algorithm.