Search

AbstractGeophysical data are often integrated into geological data for 3D modeling of underground spaces. However, the existing single-view approach means it is difficult to adequately fuse the valid information between the two types of data, and the complexity of lithological decoding and classification is high. To address this issue, a multi-view ensemble machine learning (ML) framework is proposed. Initially, the original dataset of lithology prediction is constructed by aligning geological and geophysical data with different spatial scales. Next, the dataset is divided into three datasets of structural strength, density, and moisture content according to the lithology properties of the geophysical data. The proposed framework is then used to capture the lithologic characteristics under different views to achieve the prediction of lithologic labels. In this process, a self-attentive mechanism is used to adaptively fuse the valid information under each view. To validate the proposed framework, it is applied to a project in Jiaxing, Zhejiang Province, China. Compared with existing ML methods, the proposed multi-view ensemble ML framework improves modeling accuracy and constructs models with low uncertainty. The framework can be extended to other multi-source data fusion tasks across geoscience domains. [ABSTRACT FROM AUTHOR]

Due to the heterogeneity gap in multi-view data, researchers have been attempting to apply these data to learn a co-latent representation to bridge this gap. However, multi-view representation learning still confronts two challenges: (1) it is hard to simultaneously consider the performance of downstream tasks and the interpretability and transparency of the network; (2) it fails to learn representations that accurately describe the class boundaries of downstream tasks. To overcome these limitations, we propose an interpretable representation learning framework, named interpretable multi-view proximity representation learning network. On the one hand, the proposed network is customized by an explicitly designed optimization objective that enables it to learn semantic co-latent representations while maintaining the interpretability and transparency of the network from the design level. On the other hand, the designed multi-view proximity representation learning objective function encourages its learned co-latent representations to form intuitive class boundaries by increasing the inter-class distance and decreasing the intra-class distance. Driven by a flexible downstream task loss, the learned co-latent representation can adapt to various multi-view scenarios and has been shown to be effective in experiments. As a result, this work provides a feasible solution to a generalized multi-view representation learning framework and is expected to accelerate the research and exploration in this field. [ABSTRACT FROM AUTHOR]

Mendelian randomization (MR) provides valuable assessments of the causal effect of exposure on outcome, yet the application of conventional MR methods for mapping risk genes encounters new challenges. One of the issues is the limited availability of expression quantitative trait loci (eQTLs) as instrumental variables (IVs), hampering the estimation of sparse causal effects. Additionally, the often context- or tissue-specific eQTL effects challenge the MR assumption of consistent IV effects across eQTL and GWAS data. To address these challenges, we propose a multi-context multivariable integrative MR framework, mintMR, for mapping expression and molecular traits as joint exposures. It models the effects of molecular exposures across multiple tissues in each gene region, while simultaneously estimating across multiple gene regions. It uses eQTLs with consistent effects across more than one tissue type as IVs, improving IV consistency. A major innovation of mintMR involves employing multi-view learning methods to collectively model latent indicators of disease relevance across multiple tissues, molecular traits, and gene regions. The multi-view learning captures the major patterns of disease relevance and uses these patterns to update the estimated tissue relevance probabilities. The proposed mintMR iterates between performing a multi-tissue MR for each gene region and joint learning the disease-relevant tissue probabilities across gene regions, improving the estimation of sparse effects across genes. We apply mintMR to evaluate the causal effects of gene expression and DNA methylation for 35 complex traits using multi-tissue QTLs as IVs. The proposed mintMR controls genome-wide inflation and offers insights into disease mechanisms. Mendelian randomization (MR) faces challenges in mapping risk genes due to limited and tissue-specific instrumental variables. We propose mintMR, a multi-context multivariable integrative MR framework, that models molecular exposure effects across multiple tissues for each gene region and estimates multiple gene regions simultaneously, improving causal gene identification. [ABSTRACT FROM AUTHOR]

Unsupervised representation learning for 3D shapes has become a critical problem for large-scale 3D shape management. Recent model-based methods for this task require additional information for training, while popular view-based methods often overlook viewpoint variance in view prediction, leading to uninformative 3D features that limit their practical applications. To address these issues, we propose an unsupervised 3D shape representation learning method called View Sequence Prediction GAN (VSP-GAN), which decomposes view content and viewpoint variance. VSP-GAN takes several adjacent views of a 3D shape as input and outputs the subsequent views. The key idea is to split the multi-view sequence into two available perceptible parts, view content and viewpoint variance, and independently encode them with separate encoders. With the information, we design a decoder implemented by the mirrored architecture of the content encoder to predict the view sequence by multi-steps. Besides, to improve the quality of the reconstructed views, we propose a novel hierarchical view prediction loss to enhance view realism, semantic consistency, and details retainment. We evaluate the proposed VSP-GAN on two popular 3D CAD datasets, ModelNet10 and ModelNet40, for 3D shape classification and retrieval. The experimental results demonstrate that our VSP-GAN can learn more discriminative features than the state-of-the-art methods. [ABSTRACT FROM AUTHOR]

Multi-view learning consistently outperforms traditional single-view learning by leveraging multiple perspectives of data. However, the effectiveness of multi-view learning heavily relies on how the data are partitioned into feature sets. In many cases, different datasets may require different partitioning methods to capture their unique characteristics, making a single partitioning method insufficient. Finding an optimal feature set partitioning (FSP) for each dataset may be a time-consuming process, and the optimal FSP may still not be sufficient for all types of datasets. Therefore, the paper presents a novel approach called ensemble multi-view feature set partitioning (EMvFSP) to improve the performance of multi-view learning, a technique that uses multiple data sources to make predictions. The proposed EMvFSP method combines the different views produced by multiple partitioning methods to achieve better classification performance than any single partitioning method alone. The experiments were conducted on 15 structured datasets with varying ratios of samples, features, and labels, and the results showed that the proposed EMvFSP method effectively improved classification performance. The paper also includes statistical analyses using Friedman ranking and Holms procedure to demonstrate the effectiveness of the proposed method. This approach provides a robust solution for multi-view learning that can adapt to different types of datasets and partitioning methods, making it suitable for a wide range of applications. [ABSTRACT FROM AUTHOR]

The missing readings in various sensors of air pollution monitoring stations is a common issue. Those missing sensor readings may greatly influence the performance of monitoring and analysis of air pollution data. To address this problem, in this paper, a multi-view based missing value (MV) imputation method called MVDI (Multi-View Data Imputation) is proposed for air pollution related time series data. MVDI combines four models namely LSTM (Long-Short Term Memory), IDS (Inverse Distance Squared), SVR (Support Vector Regressor), and KNN (K-Nearest Neighbors) to estimate MVs. These four models are mainly employed to capture the variations in data from different views of the dataset. Here, different views represent different portions (subsets) of the actual dataset. The estimates of MVs from all the views are combined using a kernel function to get an overall result. The proposed model MVDI is evaluated on real-world air pollution dataset in terms of RMSE, MAE, MAPE, and R2. The experimental results show that MVDI dominates over the baseline methods namely AR (AutoRegressive), ARIMA (AutoRegressive Integrated Moving Average), RFR (Random Forest Regressor), ANN (Artificial Neural Network), LI (Linear Interpolation), NN (Nearest Neighbors), MI (Mean Imputation), CNN (Convolutional Neural Network), ConvLSTM (Convolutional LSTM). [ABSTRACT FROM AUTHOR]

Effective molecular representation learning is very important for Artificial Intelligence-driven Drug Design because it affects the accuracy and efficiency of molecular property prediction and other molecular modeling relevant tasks. However, previous molecular representation learning studies often suffer from limitations, such as over-reliance on a single molecular representation, failure to fully capture both local and global information in molecular structure, and ineffective integration of multiscale features from different molecular representations. These limitations restrict the complete and accurate representation of molecular structure and properties, ultimately impacting the accuracy of predicting molecular properties. To this end, we propose a novel multi-view molecular representation learning method called MvMRL, which can incorporate feature information from multiple molecular representations and capture both local and global information from different views well, thus improving molecular property prediction. Specifically, MvMRL consists of four parts: a multiscale CNN-SE Simplified Molecular Input Line Entry System (SMILES) learning component and a multiscale Graph Neural Network encoder to extract local feature information and global feature information from the SMILES view and the molecular graph view, respectively; a Multi-Layer Perceptron network to capture complex non-linear relationship features from the molecular fingerprint view; and a dual cross-attention component to fuse feature information on the multi-views deeply for predicting molecular properties. We evaluate the performance of MvMRL on 11 benchmark datasets, and experimental results show that MvMRL outperforms state-of-the-art methods, indicating its rationality and effectiveness in molecular property prediction. The source code of MvMRL was released in https://github.com/jedison-github/MvMRL. [ABSTRACT FROM AUTHOR]

Weakly supervised learning plays a pivotal role in the field of object detection, i.e. Weakly supervised object detection (WSOD), significantly reducing annotation costs relying on image-level labels. However, WSOD exhibits certain limitations. Typically, they tend to identify the most easily recognizable local regions within targets, posing challenges in accurately delineating the boundaries of targets. Moreover, the presence of multiple instances of the same class in adjacent locations complicates the effective distinction between multiple objects within the same category. On the other hand, the complex backgrounds and dense distribution of targets in remote sensing images (RSI) further exacerbate the difficulty of weakly supervised detection. To address the above issues, we propose a model termed the Multi-View Contextual Adaptation Network (VCANet). Building on the classic Online Instance Classifier Refinement (OICR) framework, we propose to incorporate an contextual adaptation perception, within a multi-view learning framework, and integrate a pseudo-label filtering process. The contextual adaptation perception utilizes the surrounding environment information to enhance localization capabilities, guiding the model to prioritize target objects by referring to their spatially neighbouring pixels. Multi-view learning manufactures additional constraints from diverse perspectives, thereby revealing objects that might be overlooked due to the weak supervision in a single view. The pseudo-label filtering process eliminates inaccurate pseudo-labels by identifying reliable foregrounds to mitigate overlapping proposals during the label propagation. On challenging datasets NWPU VHR-10.v2 and DIOR, we achieve promising results with mAP of 62.3% and 28.2%, respectively, surpassing existing benchmarks. [ABSTRACT FROM AUTHOR]

In the last decade, graph embedding-based dimensionality reduction for multi-view data has been extensively studied. However, constructing a high-quality graph for dimensionality reduction is still a significant challenge. Herein, we propose a new algorithm, named multi-view low-rank graph optimization for dimensionality reduction (MvLRGO), which integrates graph optimization with dimensionality reduction into one objective function in order to simultaneously determine the optimal subspace and graph. The subspace learning of each view is conducted independently by the general graph embedding framework. For graph construction, we exploit low-rank representation (LRR) to obtain reconstruction relationships as the affinity weight of the graph. Subsequently, the learned graph of each view is further optimized throughout the learning process to obtain the ideal assignment of relations. Moreover, to integrate information from multiple views, MvLRGO regularizes each of the view-specific optimal graphs such that they align with one another. Benefiting from this term, MvLRGO can achieve flexible multi-view communication without constraining the subspaces of all views to be the same. Various experimental results obtained with different datasets show that the proposed method outperforms many state-of-the-art multi-view and single-view dimensionality reduction algorithms. [ABSTRACT FROM AUTHOR]

This research paper explores the implementation of machine learning (ML) techniques in weather and climate forecasting, with a specific focus on predicting monthly precipitation. The study analyzes the efficacy of six multivariate machine learning models: Decision Tree, Random Forest, K-Nearest Neighbors (KNN), AdaBoost, XGBoost, and Long Short-Term Memory (LSTM). Multivariate time series models incorporating lagged meteorological variables were employed to capture the dynamics of monthly rainfall in Rabat, Morocco, from 1993 to 2018. The models were evaluated based on various metrics, including root mean square error (RMSE), mean absolute error (MAE), and coefficient of determination (R2). XGBoost showed the highest performance among the six individual models, with an RMSE of 40.8 (mm). In contrast, Decision Tree, AdaBoost, Random Forest, LSTM, and KNN showed relatively lower performances, with specific RMSEs ranging from 47.5 (mm) to 51 (mm). A novel multi-view stacking learning approach is introduced, offering a new perspective on various ML strategies. This integrated algorithm is designed to leverage the strengths of each individual model, aiming to substantially improve the precision of precipitation forecasts. The best results were achieved by combining Decision Tree, KNN, and LSTM to build the meta-base while using XGBoost as the second-level learner. This approach yielded a RMSE of 17.5 millimeters. The results show the potential of the proposed multi-view stacking learning algorithm to refine predictive results and improve the accuracy of monthly precipitation forecasts, setting a benchmark for future research in this field. [ABSTRACT FROM AUTHOR]

The challenge of inaccurate information containment in synthetic images during the process of cross-domain medical image translation could be resolved by using a common strategy of integrating the loss of the feature consistency of the real/synthetic image as a penalty factor into the loss function of the translator. However, the existing methods are capable of using only the "domain-independent" feature of the image when the aligned images are scarcity, which results in the under-utilization of the image information. In the present study, a novel feature consistency loss computing and integration method based on the "domain-dependent" features was proposed, and a multi-category feature consistency–cross-domain image translation (MFC-CIT) model was constructed. The present study is the first to utilize the image feature information related to image domain in the process of cross-domain medical image translation. In the proposed method, the MFC module was first trained on the basis of supervised learning on a limited number of paired real images. Next, cross-domain image translation training based on unsupervised learning was performed on unpaired datasets by the CIT module, and this process was constrained by the loss of feature consistency of the real/synthetic image obtained in the MFC module. The experimental results on two datasets demonstrate that the proposed method effectively improves the translation accuracy of synthetic images. [ABSTRACT FROM AUTHOR]

Both structured market data and unstructured financial news data can significantly affect stock price fluctuations. Therefore, relying only on a single data source for stock price trend prediction may produce information bias. This article combines these two types of heterogeneous data and systematically compares the effectiveness of different data fusion technologies to establish the optimal data integration strategy, thereby improving the accuracy of stock price prediction. Specifically, this paper innovatively proposes a stock price trend prediction model named MVL-SVM. The model successfully combines multi-perspective learning with support vector machine, and realizes the effective fusion of stock market data and financial news data. It is worth mentioning that the prediction accuracy of MVL-SVM model using direct fusion method is more than 30% higher than that of index modeling method, which indicates that direct fusion method can fully learn effective information from multiple information sources, thus significantly improving the prediction effect. [ABSTRACT FROM AUTHOR]

Electroencephalogram (EEG)-based emotion recognition plays an important role in brain-computer interface and mental health monitoring. The large amount of EEG data but the lacks of labeling, multi-feature attribute, and data uncertainty are the difficulties in its recognition problem. A multi-view semi-supervised Takagi–Sugeno–Kang (MV-SS-TSK) fuzzy system is developed for EEG emotion classification in this paper. In the learning of fuzzy system consequent, firstly, a novel joint learning of semi-supervised learning, sparse representation, and low-rank coding is developed for semi-supervised sparse consequent factor learning, which makes the consequent parameter learning as a pseudo-label-only optimization problem. In particular, to simplify fuzzy rules, the sparse constraint term ensures the consequent parameters to be sparse in rows. Secondly, the consequent factor learning in a single feature view is extended into the multi-view learning model. In particular, low-rank coding is considered in multi-view semi-supervised consequent parameter learning. The low-rank constraint on view-shared component of consequent factor is implemented to exploit global data structure. The sparse constraint on view-dependent component of consequent factor is implemented to retain the feature diversity representation. By minimizing the intersection between view-shared component and view-specific components for different views, MV-SS-TSK can take advantage of the intrinsic relationship between various features and capture the consistency from multi-view features. Experiments on the SEED dataset show the superior performance of the proposed fuzzy system. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

This research presents an innovative technique for semantic segmentation of Hyperspectral Image (HSI) while focusing on its dimensionality reduction. A unique technique is applied to three distinct HSI landcover datasets, Indian Pines, Pavia University, and Salinas Valley, acquired from diverse sensors. HSIs are inherently multi-view structures, causing redundancy and computation overload due to their high dimensionality. The technique utilizes Canonical Correlation Analysis (CCA) variants, Pairwise CCA (PCCA) and Multiple Set CCA (MCCA), to extract features from multiple views of the input image simultaneously. The performance of PCCA and MCCA is compared with the traditional Principal Component Analysis (PCA) on all datasets. The superior performance of CCA variants, particularly MCCA, is demonstrated in achieving higher Overall Accuracy (OA) for semantic segmentation compared to PCA. The research extends the analysis by integrating machine learning classifiers for per pixel prediction, demonstrating the effectiveness of the proposed techniques i.e., PCCA-SVM and MCCA-SVM. [ABSTRACT FROM AUTHOR]

Abstract Background Microbiome dysbiosis has recently been associated with different diseases and disorders. In this context, machine learning (ML) approaches can be useful either to identify new patterns or learn predictive models. However, data to be fed to ML methods can be subject to different sampling, sequencing and preprocessing techniques. Each different choice in the pipeline can lead to a different view (i.e., feature set) of the same individuals, that classical (single-view) ML approaches may fail to simultaneously consider. Moreover, some views may be incomplete, i.e., some individuals may be missing in some views, possibly due to the absence of some measurements or to the fact that some features are not available/applicable for all the individuals. Multi-view learning methods can represent a possible solution to consider multiple feature sets for the same individuals, but most existing multi-view learning methods are limited to binary classification tasks or cannot work with incomplete views. Results We propose irBoost.SH, an extension of the multi-view boosting algorithm rBoost.SH, based on multi-armed bandits. irBoost.SH solves multi-class classification tasks and can analyze incomplete views. At each iteration, it identifies one winning view using adversarial multi-armed bandits and uses its predictions to update a shared instance weight distribution in a learning process based on boosting. In our experiments, performed on 5 multi-view microbiome datasets, the model learned by irBoost.SH always outperforms the best model learned from a single view, its closest competitor rBoost.SH, and the model learned by a multi-view approach based on feature concatenation, reaching an improvement of 11.8% of the F1-score in the prediction of the Autism Spectrum disorder and of 114% in the prediction of the Colorectal Cancer disease. Conclusions The proposed method irBoost.SH exhibited outstanding performances in our experiments, also compared to competitor approaches. The obtained results confirm that irBoost.SH can fruitfully be adopted for the analysis of microbiome data, due to its capability to simultaneously exploit multiple feature sets obtained through different sequencing and preprocessing pipelines.

Incomplete multi-view clustering is a challenging and non-trivial task to provide effective data analysis for large amounts of unlabeled data in the real world. All incomplete multi-view clustering methods need to address the problem of how to reduce the impact of missing views. To address this issue, we propose diffusion completion to recover the missing views integrated into an incomplete multi-view clustering framework. Based on the observable views information, the diffusion model is used to recover the missing views, and then the consistency information of the multi-view data is learned by contrastive learning to improve the performance of multi-view clustering. To the best of our knowledge, this may be the first work to incorporate diffusion models into an incomplete multi-view clustering framework. Experimental results show that the proposed method performs well in recovering the missing views while achieving superior clustering performance compared to state-of-the-art methods. [ABSTRACT FROM AUTHOR]

Background: Microbiome dysbiosis has recently been associated with different diseases and disorders. In this context, machine learning (ML) approaches can be useful either to identify new patterns or learn predictive models. However, data to be fed to ML methods can be subject to different sampling, sequencing and preprocessing techniques. Each different choice in the pipeline can lead to a different view (i.e., feature set) of the same individuals, that classical (single-view) ML approaches may fail to simultaneously consider. Moreover, some views may be incomplete, i.e., some individuals may be missing in some views, possibly due to the absence of some measurements or to the fact that some features are not available/applicable for all the individuals. Multi-view learning methods can represent a possible solution to consider multiple feature sets for the same individuals, but most existing multi-view learning methods are limited to binary classification tasks or cannot work with incomplete views. Results: We propose irBoost.SH, an extension of the multi-view boosting algorithm rBoost.SH, based on multi-armed bandits. irBoost.SH solves multi-class classification tasks and can analyze incomplete views. At each iteration, it identifies one winning view using adversarial multi-armed bandits and uses its predictions to update a shared instance weight distribution in a learning process based on boosting. In our experiments, performed on 5 multi-view microbiome datasets, the model learned by irBoost.SH always outperforms the best model learned from a single view, its closest competitor rBoost.SH, and the model learned by a multi-view approach based on feature concatenation, reaching an improvement of 11.8% of the F1-score in the prediction of the Autism Spectrum disorder and of 114% in the prediction of the Colorectal Cancer disease. Conclusions: The proposed method irBoost.SH exhibited outstanding performances in our experiments, also compared to competitor approaches. The obtained results confirm that irBoost.SH can fruitfully be adopted for the analysis of microbiome data, due to its capability to simultaneously exploit multiple feature sets obtained through different sequencing and preprocessing pipelines. [ABSTRACT FROM AUTHOR]

MicroRNAs (miRNAs) synergize with various biomolecules in human cells resulting in diverse functions in regulating a wide range of biological processes. Predicting potential disease-associated miRNAs as valuable biomarkers contributes to the treatment of human diseases. However, few previous methods take a holistic perspective and only concentrate on isolated miRNA and disease objects, thereby ignoring that human cells are responsible for multiple relationships. In this work, we first constructed a multi-view graph based on the relationships between miRNAs and various biomolecules, and then utilized graph attention neural network to learn the graph topology features of miRNAs and diseases for each view. Next, we added an attention mechanism again, and developed a multi-scale feature fusion module, aiming to determine the optimal fusion results for the multi-view topology features of miRNAs and diseases. In addition, the prior attribute knowledge of miRNAs and diseases was simultaneously added to achieve better prediction results and solve the cold start problem. Finally, the learned miRNA and disease representations were then concatenated and fed into a multi-layer perceptron for end-to-end training and predicting potential miRNA–disease associations. To assess the efficacy of our model (called MUSCLE), we performed 5- and 10-fold cross-validation (CV), which got average the Area under ROC curves of 0.966 |${\pm }$| 0.0102 and 0.973 |${\pm }$| 0.0135, respectively, outperforming most current state-of-the-art models. We then examined the impact of crucial parameters on prediction performance and performed ablation experiments on the feature combination and model architecture. Furthermore, the case studies about colon cancer, lung cancer and breast cancer also fully demonstrate the good inductive capability of MUSCLE. Our data and code are free available at a public GitHub repository: https://github.com/zht-code/MUSCLE.git. [ABSTRACT FROM AUTHOR]

The article focuses on proposing a Contrastive learning-enhanced Multi-View interest learning model (CMVCDR) for cross-domain sequential recommendation, addressing challenges in modeling users' general and current interests within and across domains. Topics include cross-domain recommendation, sequential recommendation, and multi-view learning for enhancing predictive accuracy in recommender systems.

With the surge of deep learning framework, various studies have attempted to address the challenges of sentiment analysis of tweets (data sparsity, under-specificity, noise, and multilingual content) through text and network-based representation learning approaches. However, limited studies on combining the benefits of textual and structural (graph) representations for sentiment analysis of tweets have been carried out. This study proposes a multi-view learning framework (end-to-end and ensemble-based) that leverages both text-based and graph-based representation learning approaches to enrich the tweet representation for sentiment classification. The efficacy of the proposed framework is evaluated over three datasets using suitable baseline counterparts. From various experimental studies, it is observed that combining both textual and structural views can achieve better performance of sentiment classification tasks than its counterparts. [ABSTRACT FROM AUTHOR]

With the development of multi-view learning, multi-view outlier detection has received increasing attention in recent years. However, the current research still faces two challenges: (1) The current research lacks theoretical analysis tools for multi-view outliers. (2) Most current multi-view outlier detection algorithms are based on shallow structural assumptions of the data, such as cluster assumptions and subspace assumptions, thus they are not suitable for more complex data distributions. In addressing these two issues, this article proposes three occurrence mechanisms of multi-view outlier, which serve as foundational theoretical analysis tools for multi-view outliers. Utilizing proposed mechanisms, we analyze the impact of multi-view outliers and the information structure of multi-view data and validate our findings through experiments. Finally, we propose a novel algorithm referred to as Information-Aware Multi-View Outlier Detection (IAMOD). In contrast to other methods, IAMOD focuses on the information structure of multi-view data without relying on shallow structural assumptions. By learning a compact representation of the sample that is semantically rich and non-redundant, IAMOD can accurately identify multi-view outliers by comparing the consistency of the representations' neighbors and views. Extensive experimental results demonstrate that our approach outperforms several state-of-the-art multi-view outlier detection methods. [ABSTRACT FROM AUTHOR]

In recent years, multi-view graph clustering algorithms based on representations learning have received extensive attention. However, existing algorithms are still limited in two main aspects, first, most algorithms employ graph convolution networks to learn the local representations, but the presence of high-frequency noise in these representations limits the clustering performance. Second, in the process of constructing a global representation based on the local representations, most algorithms focus on the consistency of each view while ignoring complementarity, resulting in lower representation quality. To address the aforementioned issues, a local-global representation enhancement for multi-view graph clustering algorithm is proposed in this paper. First, the low-frequency signals in the local representations are enhanced by a low-pass graph encoder, which yields smoother and more suitable local representations for clustering. Second, by introducing an attention mechanism, the local embedded representations of each view can be weighted and fused to obtain a global representation. Finally, to enhance the quality of the global representation, it is jointly optimized using the neighborhood contrastive loss and reconstruction loss. The final clustering results are obtained by applying the k-means algorithm to the global representation. A wealth of experiments have validated the effectiveness and robustness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Existing POI recommendation methods often fail to capture the fine-grained preferences of users and face the challenge of modeling multiple relationships. Moreover, knowledge graph-based recommendation methods are limited in storing dynamic user trajectories, making them unsuitable for POI recommendation scenarios. In this paper, we propose a Multi-View Heterogeneous Knowledge learning model that utilizes techniques for heterogeneous knowledge representation learning and multi-view context modeling. Our model comprehensively models user preferences and the relationships between users and POIs by utilizing information from users' visiting sequences and POI attributes knowledge graph. Specifically, we design a heterogeneous knowledge embedding method to learn the representation of users and POIs using POI attribute knowledge and users' visiting sequences. Additionally, we constructed a user trajectory similarity graph and a POI attribute similarity graph to explore potential relations between users and between POIs. The former measures the similarity of user behaviors based on user visit sequences, and the latter quantifies the similarity between different POIs through a novel feature mapping method. Finally, we propose a multi-view hybrid learning method that combines unsupervised and supervised learning paradigms to model complex relationships, improving the overall recommendation performance. Extensive experiments on real-world datasets validate the effectiveness of our method. [ABSTRACT FROM AUTHOR]

Predicting cardiovascular disease has been a challenging task, as assessing samples based on a single view of information may be insufficient. Therefore, in this paper, we focus on the challenge of predicting cardiovascular disease using multi-view cardiac data. However, multi-view cardiac data is usually difficult to collect and label. Based on this motivation, learning an effective predictive model on sample-efficient and label-efficient multi-view cardiac data is urgently needed. To address the aforementioned issues, we propose a multi-view learning method: (i) our method utilizes graph learning to establish and extract relationships between data, enabling learning from a small number of labeled data and a small number of samples; (ii) our method integrates features from multiple views to utilize complementary information in the data; (iii) for data without a provided graph of relationships between samples, we utilize the mechanism of transformers to learn the relationships between samples in a data-driven manner. We validate the effectiveness of our method on real heart disease datasets. • Our method considers multi-view cardiac data to provide comprehensive and accurate information for diagnosis. • Our method overcomes the limitations of sample-efficient and label-efficient data. • Our method captures global relationships between subjects and achieves high diagnostic accuracy. [ABSTRACT FROM AUTHOR]

With the rapid advancements of sensor technologies and mobile computing, Mobile Crowd Sensing (MCS) has emerged as a new paradigm to collect massive-scale rich trajectory data. Nomadic sensors empower people and objects with the capability of reporting and sharing observations on their state, their behavior and/or their surrounding environments. Processing and mining multi-source sensor data in MCS raise several challenges due to their multi-dimensional nature where the measured parameters (i.e., dimensions) may differ in terms of quality, variability, and time scale. We consider the context of air quality MCS and focus on the task of mining the micro-environment from the MCS data. Relating the measures to their micro-environment is crucial to interpret them and analyse the participant's exposure properly. In this paper, we focus on the problem of investigating the feasibility of recognizing the human's micro-environment in an environmental MCS scenario. We propose a novel approach for learning and predicting the micro-environment of users from their trajectories enriched with environmental data represented as multidimensional time series plus GPS tracks. We put forward a multi-view learning approach that we adapt to our context, and implement it along with other time series classification approaches. We extend the proposed approach to a hybrid method that employs trajectory segmentation to bring the best of both methods. We optimise the proposed approaches either by analysing the exact geolocation (which is privacy invasive), or simply applying some a priori rules (which is privacy friendly). The experimental results, applied to real MCS data, not only confirm the power of MCS and air quality (AQ) data in characterizing the micro-environment, but also show a moderate impact of the integration of mobility data in this recognition. Furthermore, and during the training phase, multi-view learning shows similar performance as the reference deep learning algorithm, without requiring specific hardware. However, during the application of models on new data, the deep learning algorithm fails to outperform our proposed models. [ABSTRACT FROM AUTHOR]

Many multi-agent scenarios require message sharing among agents to promote coordination, hastening the robustness of multi-agent communication when policies are deployed in a message perturbation environment. Major relevant studies tackle this issue under specific assumptions, like a limited number of message channels would sustain perturbations, limiting the efficiency in complex scenarios. In this paper, we take a further step in addressing this issue by learning a robust cooperative multi-agent reinforcement learning via multi-view message certification, dubbed CroMAC. Agents trained under CroMAC can obtain guaranteed lower bounds on state-action values to identify and choose the optimal action under a worst-case deviation when the received messages are perturbed. Concretely, we first model multi-agent communication as a multi-view problem, where every message stands for a view of the state. Then we extract a certificated joint message representation by a multi-view variational autoencoder (MVAE) that uses a product-of-experts inference network. For the optimization phase, we do perturbations in the latent space of the state for a certificate guarantee. Then the learned joint message representation is used to approximate the certificated state representation during training. Extensive experiments in several cooperative multi-agent benchmarks validate the effectiveness of the proposed CroMAC. [ABSTRACT FROM AUTHOR]

Epilepsy is a chronic, non-communicable disease caused by paroxysmal abnormal synchronized electrical activity of brain neurons, and is one of the most common neurological diseases worldwide. Electroencephalography (EEG) is currently a crucial tool for epilepsy diagnosis. With the development of artificial intelligence, multi-view learning-based EEG analysis has become an important method for automatic epilepsy recognition because EEG contains difficult types of features such as time-frequency features, frequency-domain features and time-domain features. However, current multi-view learning still faces some challenges, such as the difference between samples of the same class from different views is greater than the difference between samples of different classes from the same view. In view of this, in this study, we propose a shared hidden space-driven multi-view learning algorithm. The algorithm uses kernel density estimation to construct a shared hidden space and combines the shared hidden space with the original space to obtain an expanded space for multi-view learning. By constructing the expanded space and utilizing the information of both the shared hidden space and the original space for learning, the relevant information of samples within and across views can thereby be fully utilized. Experimental results on a dataset of epilepsy provided by the University of Bonn show that the proposed algorithm has promising performance, with an average classification accuracy value of 0.9787, which achieves at least 4% improvement compared to single-view methods. [ABSTRACT FROM AUTHOR]

Abstract Literature shows that both market data and financial media impact stock prices; however, using only one kind of data may lead to information bias. Therefore, this study uses market data and news to investigate their joint impact on stock price trends. However, combining these two types of information is difficult because of their completely different characteristics. This study develops a hybrid model called MVL-SVM for stock price trend prediction by integrating multi-view learning with a support vector machine (SVM). It works by simply inputting heterogeneous multi-view data simultaneously, which may reduce information loss. Compared with the ARIMA and classic SVM models based on single- and multi-view data, our hybrid model shows statistically significant advantages. In the robustness test, our model outperforms the others by at least 10% accuracy when the sliding windows of news and market data are set to 1–5 days, which confirms our model’s effectiveness. Finally, trading strategies based on single stock and investment portfolios are constructed separately, and the simulations show that MVL-SVM has better profitability and risk control performance than the benchmarks.

Cross-domain Consultation Systems have become essential in numerous critical applications, for instance, an online citizen complaint system. However, addressing complaints with distinct orality characteristics often necessitates retrieving and integrating knowledge from diverse professional domains. This scenario represents a typical cross-domain problem. Nevertheless, the prevailing approach of utilizing generative large language models to tackle this problem presents challenges including model scale and drawbacks like hallucination and limited interpretability. To address these challenges, we proposed a novel approach called the Core-View Contrastive Learning (CVCL) network. Leveraging contrastive learning techniques with an integrated core-adaptive augmentation module, the CVCL network achieves accuracy in cross-domain information matching. Our objective is to construct a lightweight, precise, and interpretable cross-domain consultation system, overcoming the limitations encountered with large language models in addressing such challenges. Empirical validation of our proposed method using real-world datasets demonstrates its effectiveness. Our experiments show that the proposed method achieves comparable performance to large language models in terms of accuracy in text-matching tasks and surpasses the best baseline model by over 24 percentage points in F1-score for classification tasks. Additionally, our lightweight model achieved a performance level of 96% compared to the full model, while utilizing only 6% of the parameters.

Musculoskeletal abnormality is routinely presented in tissues and organs of the human locomotor system across the life course, and it is essential to detect musculoskeletal abnormality in X-rays. However, it is difficult to diagnose musculoskeletal abnormality from Radiographs due to the following issues: 1) There are other interfering organ tissues in the complicated backgrounds; 2)The MURA dataset contains seven different musculoskeletal radiographs, which makes general convolution neural networks unable to model the weird relationship between them. To address such problems, a Lesion-Guided Adaptive Graph Network (LGAG-Net) is proposed for bone abnormality detection from musculoskeletal radiograph, where the Lesion-guided Recurrent Feature Sampling (LRFS) module is first designed to localize the corresponding musculoskeletal abnormality regions, and then the Adaptive Graphsage Attention (AGA) module is developed to perform bone abnormality detection on the located musculoskeletal abnormality regions. Experiments on MURA dataset show that the proposed LGAG-Net can achieve an accuracy of 87.81% and Cohen Kappa statistic of 0.868, which outperforms the state-of-the-art methods, assisting the radiologists to rapidly estimate the physical development in patients.

Aiming to address the problem of low classification accuracy caused by the different shapes of meniscus tears in the computer-aided diagnosis (CAD) system for meniscus, a multidimensional information fusion network (MDIFNet) model for menissus tear classification was proposed. Firstly, a convolutional neural network (CNN) architecture consisting of four sub-networks was used to obtain meniscus feature information from different perspectives and dimensions. Simultaneously, multi-scale attention mechanism was proposed to enrich fine-grained features. Finally, a multi kernel model based on support vector machines (SVM) was constructed as the final classifier. The experimental results on the MRNet dataset show that the proposed method has a meniscal tear classification accuracy of 0.782, which has promotion compared to the existing state-of-the-art meniscus tear classification methods based on deep learning.

Multispectral remote sensing image-based sea fog detection (SFD) is both important and challenging. Deep learning methods for SFD have become mainstream due to their powerful nonlinear learning capabilities and flexibility. However, existing methods have not fully utilized the physical difference priors in multispectral images (MSI) for SFD, making it difficult to skillfully capture the shape and appearance characteristics of sea fog, thus leading to uncertainties in SFD. We propose the spatial–spectral difference network (S2DNet), a deep encoding–decoding framework that merges inter-spectral and intra-spectral heterogeneous difference features. Specifically, inspired by physics-based difference threshold methods, we developed a physics-inspired inter-spectral difference module (PIDM) that combines feature-level difference with deep neural networks to capture the shape characteristics of sea fog. We designed the intra-spectral difference module (ISDM) using difference convolution to represent sea fog’s fine-grained and dynamic appearance information. Furthermore, inspired by multi-view learning, we propose heterogeneous feature mutual learning (HFML) that seeks robust representations by focusing on semantically invariant aspects within heterogeneous difference features, adapting to the dynamic nature of sea fog. HFML is achieved through global feature mutual learning using an adversarial procedure and local feature mutual learning supported by a novel information-theoretic objective function that links maximizing statistical correlation with expectation maximization. Experiments on two SFD datasets show that integrating physical difference priors into deep learning improves SFD. In both continuous temporal and high spatial resolution SFD tasks, S2DNet outperforms existing advanced deep learning methods. Moreover, S2DNet demonstrates stronger robustness under degraded remote sensing image conditions, highlighting its potential usefulness and practicality in real-world applications.

Literature shows that both market data and financial media impact stock prices; however, using only one kind of data may lead to information bias. Therefore, this study uses market data and news to investigate their joint impact on stock price trends. However, combining these two types of information is difficult because of their completely different characteristics. This study develops a hybrid model called MVL-SVM for stock price trend prediction by integrating multi-view learning with a support vector machine (SVM). It works by simply inputting heterogeneous multi-view data simultaneously, which may reduce information loss. Compared with the ARIMA and classic SVM models based on single- and multi-view data, our hybrid model shows statistically significant advantages. In the robustness test, our model outperforms the others by at least 10% accuracy when the sliding windows of news and market data are set to 1–5 days, which confirms our model's effectiveness. Finally, trading strategies based on single stock and investment portfolios are constructed separately, and the simulations show that MVL-SVM has better profitability and risk control performance than the benchmarks. [ABSTRACT FROM AUTHOR]

Incomplete multi-view clustering, which aims to divide different groups into incomplete views produced by various sensors, has attracted research attention. In this article, we propose a local structure learning for incomplete multi-view clustering (LS-IMC) algorithm. The algorithm jointly learns a consensus of incomplete views and a clustering result. Specifically, by fusing consistent representation and local structure learning into one optimization term, we can adequately capture the intrinsic geometric structure from missing and available data. In addition, the weight of incomplete views is learned adaptively to balance the importance of different views. Furthermore, we integrate representation learning and clustering processes into a unified framework so that the clustering result can be obtained directly and without the need for post-processing. Experiments performed on eight incomplete multi-view datasets demonstrate the effectiveness of the proposed LS-IMC compared to other current approaches. [ABSTRACT FROM AUTHOR]

Federated learning (FL) is a privacy-preserving collective machine learning paradigm. Vertical federated learning (VFL) deals with the case where participants share the same sample ID space but have different feature spaces, while label information is owned by one participant. Early studies of VFL supported two participants and focused on binary-class logistic regression problems, while recent studies have put more attention on specific aspects such as communication efficiency and data security. In this paper, we propose the multi-participant multi-class vertical federated learning (MMVFL) framework for multi-class VFL problems involving multiple parties. By extending the idea of multi-view learning (MVL), MMVFL enables label sharing from its owner to other VFL participants in a privacy-preserving manner. To demonstrate the effectiveness of MMVFL, a feature selection scheme is incorporated into MMVFL to compare its performance against supervised feature selection and MVL-based approaches. The proposed framework is capable of quantifying feature importance and measuring participant contributions. It is also simple and easy to combine with other communication and security techniques. The experiment results on feature selection for classification tasks on real-world datasets show that MMVFL can effectively share label information among multiple VFL participants and match the multi-class classification performance of existing approaches. [ABSTRACT FROM AUTHOR]

As an energizing direction in machine learning, multi-view learning (MVL) is aimed at exploiting the information among different views for improving the generalization performance. Thus far, various support vector machines for multi-view learning (MvSVMs) have been developed. Despite showing effectiveness, existing methods have failed tonalysis of parameter sensitiv consider the fact that real-world data often contain noise and outliers. Besides, it has been demonstrated that the use of the Universum data can improve the performance of classifiers. Therefore, we propose two novel intuitionistic fuzzy multi-view support vector machines with Universum data. The proposed methods can not only reduce the effect of noise and outliers on classifiers but also improve the model performance. Specifically, intuitionistic fuzzy membership scores are integrated to mitigate the negative impact of the noise and outliers. Then, Universum data is incorporated to exploit the priori information about the data distribution for assisting in the generation of decision hyperplanes. Two proposed convex optimization problems are solved by introducing the dual forms of the models separately to obtain the classifiers. We conduct classification experiments on relevant multi-view datasets, and the proposed convex models are shown to outperform several state-of-the-art models. [ABSTRACT FROM AUTHOR]

Graph Convolutional Network (GCN) has become a hotspot in graph-based machine learning due to its powerful graph processing capability. Most of the existing GCN-based approaches are designed for single-view data. In numerous practical scenarios, data is expressed through multiple views, rather than a single view. The ability of GCN to model homogeneous graphs is indisputable, while it is insufficient in facing the heterophily property of multi-view data. In this paper, we revisit multi-view learning to propose an implicit heterogeneous graph convolutional network that efficiently captures the heterogeneity of multi-view data while exploiting the powerful feature aggregation capability of GCN. We automatically assign optimal importance to each view when constructing the meta-path graph. High-order cross-view meta-paths are explored based on the obtained graph, and a series of graph matrices are generated. Combining graph matrices with learnable global feature representation to obtain heterogeneous graph embeddings at various levels. Finally, in order to effectively utilize both local and global information, we introduce a graph-level attention mechanism at the meta-path level that allocates private information to each node individually. Extensive experimental results convincingly support the superior performance of the proposed method compared to other state-of-the-art approaches. • Explore the heterogeneity of multi-view data by introducing meta-paths. • Enable construction of meta-paths on multi-view data. • Design an attention mechanism to learn the importance of meta-path graph embeddings. [ABSTRACT FROM AUTHOR]

After several waves of COVID-19 led to a massive loss of human life worldwide due to the changes in its variants and the vast explosion. Several researchers proposed neural network-based drug discovery techniques to fight against the pandemic; utilizing neural networks has limitations (Exponential time complexity, Non-Convergence, Mode Collapse, and Diminished Gradient). To overcome those difficulties, this paper proposed a hybrid architecture that will help to repurpose the most appropriate medicines for the treatment of COVID-19. A brief investigation of the sequences has been made to discover the gene density and noncoding proportion through the next gene sequencing. The paper tracks the exceptional locales in the virus DNA sequence as a Drug Target Region (DTR). Then the variable DNA neighborhood search is applied to this DTR to obtain the DNA interaction network to show how the genes are correlated. A drug database has been obtained based on the ontological property of the genomes with advanced D3Similarity so that all the chemical components of the drug database have been identified. Other methods obtained hydroxychloroquine as an effective drug which was rejected by WHO. However, The experimental results show that Remdesivir and Dexamethasone are the most effective drugs, with 97.41 and 97.93%, respectively. [ABSTRACT FROM AUTHOR]

Multi-view data containing complementary and consensus information can facilitate representation learning by exploiting the intact integration of multi-view features. Because most objects in the real world often have underlying connections, organizing multi-view data as heterogeneous graphs is beneficial to extracting latent information among different objects. Due to the powerful capability to gather information of neighborhood nodes, in this article, we apply Graph Convolutional Network (GCN) to cope with heterogeneous graph data originating from multi-view data, which is still under-explored in the field of GCN. In order to improve the quality of network topology and alleviate the interference of noises yielded by graph fusion, some methods undertake sorting operations before the graph convolution procedure. These GCN-based methods generally sort and select the most confident neighborhood nodes for each vertex, such as picking the top-k nodes according to pre-defined confidence values. Nonetheless, this is problematic due to the non-differentiable sorting operators and inflexible graph embedding learning, which may result in blocked gradient computations and undesired performance. To cope with these issues, we propose a joint framework dubbed Multi-view Graph Convolutional Network with Differentiable Node Selection (MGCN-DNS), which is constituted of an adaptive graph fusion layer, a graph learning module, and a differentiable node selection schema. MGCN-DNS accepts multi-channel graph-structural data as inputs and aims to learn more robust graph fusion through a differentiable neural network. The effectiveness of the proposed method is verified by rigorous comparisons with considerable state-of-the-art approaches in terms of multi-view semi-supervised classification tasks, and the experimental results indicate that MGCN-DNS achieves pleasurable performance on several benchmark multi-view datasets. [ABSTRACT FROM AUTHOR]

3D object representation learning is a fundamental challenge in computer vision to infer about the 3D world. Recent advances in deep learning have shown their efficiency in 3D object recognition, among which viewbased methods have performed best so far. However, feature learning of multiple views in existing methods is mostly performed in a supervised fashion, which often requires a large amount of data labels with high costs. In contrast, self-supervised learning aims to learnmulti-view feature representations without involving labeled data. To this end, we propose a novel self-supervised framework to learn Multi-View Transformation Equivariant Representations (MV-TER), exploring the equivariant transformations of a 3D object and its projected multiple views that we derive. Specifically, we perform a 3D transformation on a 3D object and obtain multiple views before and after the transformation via projection. Then, we train a representation encoding module to capture the intrinsic 3D object representation by decoding 3D transformation parameters from the fused feature representations of multiple views before and after the transformation. Experimental results demonstrate that the proposedMV-TER significantly outperforms the state-of-the-art view-based approaches in 3D object classification and retrieval tasks and show the generalization to real-world datasets. [ABSTRACT FROM AUTHOR]

Multi-view clustering is a rapidly evolving research topic that exploits cross-view data obtained from different domains or modalities to describe the target object more comprehensively. Currently, many multi-view deep clustering algorithms are capable of extracting valuable information from miscellaneous multi-view data, thanks to their efficient learning from nonlinear data. However, no algorithm has extended fuzzy K-means (FKM) to simultaneously utilize deep networks for feature extraction and solve multi-view problems. This limitation hinders the performance of FKM and the scalability of practical applications. Therefore, we propose a novel deep multi-view fuzzy K-means with weight allocation and entropy regularization (DMFKM) algorithm for deep multi-view clustering. DMFKM flexibly integrates cross-view information by employing learnable view weights and utilizes a common membership matrix and centroid matrix for each view to capture consistent and complementary information, respectively. Additionally, DMFKM embeds deep networks, making it have a powerful and flexible learning capability of linear indivisible data, negotiating with the fuzzy clustering task and optimizing simultaneously. Finally, DMFKM applies an adaptive loss function to objectives with adaptive weights and entropy regularization to the membership matrix for enhancing the robustness of the model and avoid trivial solutions. We perform optimization of the model using an alternating optimization approach. Experimental results on several benchmark datasets demonstrate that DMFKM outperforms existing state-of-the-art clustering algorithms. [ABSTRACT FROM AUTHOR]

This research paper explores the implementation of machine learning (ML) techniques in weather and climate forecasting, with a specific focus on predicting monthly precipitation. The study analyzes the efficacy of six multivariate machine learning models: Decision Tree, Random Forest, K-Nearest Neighbors (KNN), AdaBoost, XGBoost, and Long Short-Term Memory (LSTM). Multivariate time series models incorporating lagged meteorological variables were employed to capture the dynamics of monthly rainfall in Rabat, Morocco, from 1993 to 2018. The models were evaluated based on various metrics, including root mean square error (RMSE), mean absolute error (MAE), and coefficient of determination (R2). XGBoost showed the highest performance among the six individual models, with an RMSE of 40.8 (mm). In contrast, Decision Tree, AdaBoost, Random Forest, LSTM, and KNN showed relatively lower performances, with specific RMSEs ranging from 47.5 (mm) to 51 (mm). A novel multi-view stacking learning approach is introduced, offering a new perspective on various ML strategies. This integrated algorithm is designed to leverage the strengths of each individual model, aiming to substantially improve the precision of precipitation forecasts. The best results were achieved by combining Decision Tree, KNN, and LSTM to build the meta-base while using XGBoost as the second-level learner. This approach yielded a RMSE of 17.5 millimeters. The results show the potential of the proposed multi-view stacking learning algorithm to refine predictive results and improve the accuracy of monthly precipitation forecasts, setting a benchmark for future research in this field.

Automatic road extraction from satellite images is a popular research hotspot topic in the field of remote sensing. However, the complexity of road features and structures hinders their precise extraction. Road features have different saliency due to the occlusion of other objects and diverse road types. Road structures are scattered across various locations and affected by geographical conditions, population distribution, and transportation demands. These issues render current methods based on convolutional neural networks prone to fragmented and incomplete road extraction results. To address these issues, a Road Extraction Network with Dual-View Information Perception Based on GCN (RDPGNet) is proposed, where the GCN-based dual-view perceptron (GDVP) uses the superior information interaction capability of the GCN to explore road information under a dual view. In the GDVP, we first design the road feature saliency graph reasoning module (RFSG) and road structure homogeneous space graph reasoning module (RSHS) based on the features and structures. The RFSG obtains the similarity of road feature information in different regions as a similarity matrix to participate in the graph reasoning process, ensuring that equal treatment is given to regions with varying saliency levels. The RSHS projects the road structure onto a corresponding homogeneous space while aggregating and interacting with information through graph convolution, thereby enhancing the network’s perception of roads in diverse locations. Second, because multi-view information usually shares a potential common representation, a multi-view information fusion and alignment strategy (MVFA) is designed to comprehensively model road information. Experimental results obtained from two public datasets indicate that RDPGNet outperforms other state-of-the-art networks.

This research presents an innovative technique for semantic segmentation of Hyperspectral Image (HSI) while focusing on its dimensionality reduction. A unique technique is applied to three distinct HSI landcover datasets, Indian Pines, Pavia University, and Salinas Valley, acquired from diverse sensors. HSIs are inherently multi-view structures, causing redundancy and computation overload due to their high dimensionality. The technique utilizes Canonical Correlation Analysis (CCA) variants, Pairwise CCA (PCCA) and Multiple Set CCA (MCCA), to extract features from multiple views of the input image simultaneously. The performance of PCCA and MCCA is compared with the traditional Principal Component Analysis (PCA) on all datasets. The superior performance of CCA variants, particularly MCCA, is demonstrated in achieving higher Overall Accuracy (OA) for semantic segmentation compared to PCA. The research extends the analysis by integrating machine learning classifiers for per pixel prediction, demonstrating the effectiveness of the proposed techniques i.e., PCCA-SVM and MCCA-SVM.