Search

High-accuracy GNSS positioning in urban environments is important for applications like safe autonomous driving, however, dynamic errors in complex urban environments limit positioning performances. Recently, deep learning-based (DL) approaches can obtain better GNSS positioning solutions in complex urban environments than model-based ones. However, DL-based approaches simply concentrate one-view GNSS observations as inputs, which are insufficient to model vehicle states accurately, and temporally continuous observations are highly correlated, leading to inaccurate positioning correction results. To solve the challenge, we propose a Sparse Representation-based Multiview Deep Reinforcement Learning model for positioning correction, which employs attention-based multiview fusion to process multiview observations, and uses sparse representation to alleviate disturbances from highly correlated observations. To represent the vehicle state sufficiently, we build a multiview positioning correction environment, and develop an attention-weighted multiview fusion module to fuse temporal features as belief states based on adaptively learned attention weights. To effectively process redundant and correlated multiview features, we impose the ℓ1 norm regularizer to learn sparse hidden representations and improve the precision of value estimation. Finally, we construct a sparse representation-driven multiview actor-critic positioning correction model to achieve high-accuracy GNSS positioning in complex urban environments. We validate performances in both Google Smartphone Decimeter Challenge (GSDC) datasets and our collected GNSS datasets in the Guangzhou area (GZGNSS). Experimental results show that our algorithm can improve localization performances with 27% improvements from WLS+KF in GSDC trajectories, 16% from RTK, and 6% from DL-based methods in GZGNSS trajectories. [ABSTRACT FROM AUTHOR]

In recent years, self-supervised learning-based models have been widely used for electrocardiogram (ECG) representation learning. However, most of the models utilize contrastive learning that strongly depend on data augmentation. In this paper, we propose a masked self-supervised learning model based on multiview information bottleneck principle. Our method masks the ECG signal instances in the time and frequency domains at a high ratio and then uses the autoencoder to reconstruct the original input. Not only the intra-view relations within each view but also the inter-view relations between two views are exploited in ECG representation learning. Furthermore, we use the multiview information bottleneck principle to remove redundant information in the time and frequency domains, so that the representations of both views contain more task-relevant information. Our model is pre-trained on three larger ECG datasets at once and fine-tuned on each classification task. Experimental results show that our model not only outperforms state-of-the-art models with self-supervised learning, but also outperforms models with supervised learning. [ABSTRACT FROM AUTHOR]

Image‐based scheme has attracted wide attention in the fault detection of high‐voltage permanent magnet motors, but it often suffers from the shooting conditions. Multiview feature selection allows multisource information to be fused, which can improve the accuracy and robustness of image detection. Therefore, we propose multiview unsupervised consistency via soft‐label feature selection (MUCSFS). This method constructs consistent pseudo labels through soft labels from clustering affinity of each view sample and builds the model by integrating selection constraints into the graph model. This model filters the fault data set to obtain the feature subset, which is used for clustering. We verify the method's effectiveness by simulating multiview data. The fault clustering experiment on the high‐voltage motors' magnetic tile fault data set confirm that our method can effectively cluster the fault categories. [ABSTRACT FROM AUTHOR]

This paper addresses the problem of predicting population density leveraging cellular station data. As wireless communication devices are commonly used, cellular station data has become integral for estimating population figures and studying their movement, thereby implying significant contributions to urban planning. However, existing research grapples with issues pertinent to preprocessing base station data and the modeling of population prediction. To address this, we propose methodologies for preprocessing cellular station data to eliminate any irregular or redundant data. The preprocessing reveals a distinct cyclical characteristic and high-frequency variation in population shift. Further, we devise a multi-view enhancement model grounded on the Transformer (MVformer), targeting the improvement of the accuracy of extended time-series population predictions. Comparative experiments, conducted on the above-mentioned population dataset using four alternate Transformer-based models, indicate that our proposedMVformer model enhances prediction accuracy by approximately 30% for both univariate and multivariate time-series prediction assignments. The performance of this model in tasks pertaining to population prediction exhibits commendable results. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

We present a new restricted SVD-based CUR (RSVD-CUR) factorization for matrix triplets (A, B, G) that aims to extract meaningful information by providing a low-rank approximation of the three matrices using a subset of their rows and columns. The proposed method utilizes the discrete empirical interpolation method (DEIM) to select the subset of rows and columns from the orthogonal and nonsingular matrices obtained through an RSVD of the matrix triplet. We explore the relationships between a DEIM type RSVD-CUR factorization, a DEIM type CUR factorization, and a DEIM type generalized CUR decomposition and provide an error analysis that establishes the accuracy of the RSVD-CUR decomposition within a factor of the approximation error of the RSVD of the given matrices. The RSVD-CUR factorization can be used in applications that require approximating one data matrix relative to two other given matrices. We discuss two such applications, namely multiview dimension reduction and data perturbation problems where a correlated noise matrix is added to the input data matrix. Our numerical experiments demonstrate the advantages of the proposed method over the standard CUR approximation in these scenarios. [ABSTRACT FROM AUTHOR]

The correct prediction of disease-associated miRNAs plays an essential role in disease prevention and treatment. Current computational methods to predict disease-associated miRNAs construct different miRNA views and disease views based on various miRNA properties and disease properties and then integrate the multiviews to predict the relationship between miRNAs and diseases. However, most existing methods ignore the information interaction among the views and the consistency of miRNA features (disease features) across multiple views. This study proposes a computational method based on multiple hypergraph contrastive learning (MHCLMDA) to predict miRNA–disease associations. MHCLMDA first constructs multiple miRNA hypergraphs and disease hypergraphs based on various miRNA similarities and disease similarities and performs hypergraph convolution on each hypergraph to capture higher order interactions between nodes, followed by hypergraph contrastive learning to learn the consistent miRNA feature representation and disease feature representation under different views. Then, a variational auto-encoder is employed to extract the miRNA and disease features in known miRNA–disease association relationships. Finally, MHCLMDA fuses the miRNA and disease features from different views to predict miRNA–disease associations. The parameters of the model are optimized in an end-to-end way. We applied MHCLMDA to the prediction of human miRNA–disease association. The experimental results show that our method performs better than several other state-of-the-art methods in terms of the area under the receiver operating characteristic curve and the area under the precision-recall curve. [ABSTRACT FROM AUTHOR]

With the diversification of data representations, the field of multiview learning has attracted the attention of many researchers. However, multiview data is stored in different devices in practical applications, and existing multiview learning methods fail to apply directly. Moreover, the data transmission process is often accompanied by the risk of privacy leakage. Therefore, this paper proposes a multiview learning method based on a vertical federated learning framework called partially shared federated multiview learning method (PSFedML) to handle this issue. Our proposed method uses a partial sharing approach that can simultaneously utilize consistent and complementary information between views to learn latent representations. In addition, the transmission of common latent representations between local clients and the central server avoids the risk of privacy leakage. We also give a corresponding iterative optimization algorithm. Experiments on real-world datasets demonstrate the efficiency and superiority of PSFedML. • The learned latent factor reflects the consistent and complementary information among the different views. • A novel multiview learning method based on the vertical federated framework. • Proposed ADMM based optimization algorithm under the vertical federation framework. [ABSTRACT FROM AUTHOR]

Multiview learning (MVL) seeks to leverage the benefits of diverse perspectives to complement each other, effectively extracting and utilizing the latent information within the dataset. Several twin support vector machine-based MVL (MvTSVM) models have been introduced and demonstrated outstanding performance in various learning tasks. However, MvTSVM-based models face significant challenges in the form of computational complexity due to four matrix inversions, the need to reformulate optimization problems in order to employ kernel-generated surfaces for handling non-linear cases, and the constraint of uniform noise assumption in the training data. Particularly in cases where the data possesses a heteroscedastic error structure, these challenges become even more pronounced. In view of the aforementioned challenges, we propose multiview twin parametric margin support vector machine (MvTPMSVM). MvTPMSVM constructs parametric margin hyperplanes corresponding to both classes, aiming to regulate and manage the impact of the heteroscedastic noise structure existing within the data. The proposed MvTPMSVM model avoids the explicit computation of matrix inversions in the dual formulation, leading to enhanced computational efficiency. We perform an extensive assessment of the MvTPMSVM model using benchmark datasets such as UCI, KEEL, synthetic, and Animals with Attributes (AwA). Our experimental results, coupled with rigorous statistical analyses, confirm the superior generalization capabilities of the proposed MvTPMSVM model compared to the baseline models. The source code of the proposed MvTPMSVM model is available at https://github.com/mtanveer1/MvTPMSVM., Competing Interests: Declaration of competing interest The authors of this work have no competing interests., (Copyright © 2024 Elsevier Ltd. All rights reserved.)

Significant advances in graph-oriented clustering methods can be attributed to their effectiveness in leveraging relationships and complex structures within multiview data. However, several limitations persist in most existing graph-based multiview clustering approaches. First, quadratic or cubic complexity is required for graph construction or eigendecomposition of the Laplacian matrix in many existing methods. Second, certain methods overlook the differences between views and employ an identical indicator matrix, which can lead to over-learning in practical scenarios. Third, existing methods often neglect spatial structure and complementary information, focusing primarily on calculating error feature-by-feature using different norms. In order to tackle these drawbacks, we propose a new multiview spectral clustering model called A nchor G raph-based M ultiview S pectral C lustering(AG-MSC). AG-MSC incorporates an adaptive weighting mechanism that assigns weights to each view, enhancing the robustness of the algorithm. Using a tensor Schatten p -norm constraint minimizes the discrepancy between indicator matrices obtained from different views, thereby preserving high-order information and spatial structure. To improve computational efficiency, we replace the full adjacency matrices of the corresponding views with anchor graphs. AG-MSC offers a distinct advantage over conventional spectral clustering by directly obtaining all sample categories without additional post-processing steps. We have validated the efficiency of our method through extensive experimental evaluations. [ABSTRACT FROM AUTHOR]

Appendicitis is among the most frequent reasons for pediatric abdominal surgeries. Previous decision support systems for appendicitis have focused on clinical, laboratory, scoring, and computed tomography data and have ignored abdominal ultrasound, despite its noninvasive nature and widespread availability. In this work, we present interpretable machine learning models for predicting the diagnosis, management and severity of suspected appendicitis using ultrasound images. Our approach utilizes concept bottleneck models (CBM) that facilitate interpretation and interaction with high-level concepts understandable to clinicians. Furthermore, we extend CBMs to prediction problems with multiple views and incomplete concept sets. Our models were trained on a dataset comprising 579 pediatric patients with 1709 ultrasound images accompanied by clinical and laboratory data. Results show that our proposed method enables clinicians to utilize a human-understandable and intervenable predictive model without compromising performance or requiring time-consuming image annotation when deployed. For predicting the diagnosis, the extended multiview CBM attained an AUROC of 0.80 and an AUPR of 0.92, performing comparably to similar black-box neural networks trained and tested on the same dataset. • Concept bottleneck models are generalized to multiview learning and incomplete concepts. • Proposed models retain predictive performance, interpretability and interactivity. • Models are tested on B-mode ultrasound from children with suspected appendicitis. • We publish clinical, laboratory and ultrasound data from more than 500 patients. [ABSTRACT FROM AUTHOR]