CMC: A consensus multi-view clustering model for predicting Alzheimer's disease progression

Machine learning has been used in the past for the auxiliary diagnosis of Alzheimer's Disease (AD). However, most existing technologies only explore single-view data, require manual parameter setting and focus on two-class (i.e., dementia or not) classification problems. Unlike single-view data, multi-view data provide more powerful feature representation capability. Learning with multi-view data is referred to as multi-view learning, which has received certain attention in recent years. In this paper, we propose a new multi-view clustering model called Consensus Multi-view Clustering (CMC) based on nonnegative matrix factorization for predicting the multiple stages of AD progression. The proposed CMC performs multi-view learning idea to fully capture data features with limited medical images, approaches similarity relations between different entities, addresses the shortcoming from multi-view fusion that requires manual setting parameters, and further acquires a consensus representation containing shared features and complementary knowledge of multiple view data. It not only can improve the predication performance of AD, but also can screen and classify the symptoms of different AD's phases. Experimental results using data with twelve views constructed by brain Magnetic Resonance Imaging (MRI) database from Alzheimer's Disease Neuroimaging Initiative expound and prove the effectiveness of the proposed model.

Integration of Imaging Genomics Data for the Study of Alzheimer's Disease Using Joint-Connectivity-Based Sparse Nonnegative Matrix Factorization

Imaging genetics reveals the connection between microscopic genetics and macroscopic imaging, enabling the identification of disease biomarkers. In this work, we make full use of prior knowledge that has significant reference value for investigating the correlation between the brain and genetics to explore more biologically substantial biomarkers. In this paper, we propose joint-connectivity-based sparse nonnegative matrix factorization (JCB-SNMF). The algorithm simultaneously projects structural magnetic resonance imaging (sMRI), single-nucleotide polymorphism sites (SNPs), and gene expression data onto a common feature space, where heterogeneous variables with large coefficients in the same projection direction form a common module. In addition, the connectivity information for each region of the brain and genetic data are added as prior knowledge to identify regions of interest (ROIs), SNPs, and gene-related risks related to Alzheimer's disease (AD) patients. GraphNet regularization increases the anti-noise performance of the algorithm and the biological interpretability of the results. The simulation results show that compared with other NMF-based algorithms (JNMF, JSNMNMF), JCB-SNMF has better anti-noise performance and can identify and predict biomarkers closely related to AD from significant modules. By constructing a protein-protein interaction (PPI) network, we identified SF3B1, RPS20, and RBM14 as potential biomarkers of AD. We also found some significant SNP-ROI and gene-ROI pairs. Among them, two SNPs rs4472239 and rs11918049 and three genes KLHL8, ZC3H11A, and OSGEPL1 may have effects on the gray matter volume of multiple brain regions. This model provides a new way to further integrate multimodal impact genetic data to identify complex disease association patterns.

A novel nomogram model for lung adenocarcinoma subtypes based on RNA-modification regulatory genes

Background

In non-small cell lung cancer (NSCLC), lung adenocarcinoma (LUAD) is the most common subtype. RNA modification has become the frontier and hotspot of current tumor research.

Results

In this study, 109 genes that regulate RNA modifications were identified according to The Cancer Genome Atlas (TCGA). A differential gene expression analysis identified 46 differentially expressed RNA modification regulatory genes (DERRGs). LUAD samples were stratified into two distinct clusters based on the expression of these DERRGs. A significant correlation was observed between these clusters and patient survival rates, as well as clinical features. Furthermore, a four-DERRG signature (EIF3B, HNRNPC, IGF2BP1, and METTL3) developed using LASSO regression. According to the calculated risk scores from this signature, LUAD patients were categorized into high-risk and low-risk groups. Patients in the low-risk group exhibited a more favorable prognosis. A prognostic nomogram was crafted, integrating the four-DERRGs signature with clinical parameters. The nomogram was revealed that OS, age, clinical stage, immune cell infiltration, and immune checkpoint molecule expression were significantly linked to the OS of LUAD. GSEA analysis found that the DERRGs were primarily regulated immune pathways.

Conclusions

This study developed four DERRGs signatures and formulated a nomogram model for precise prognosis estimation in LUAD patients. The study's insights are instrumental for advancing diagnosis, prognosis, and therapeutic strategies for LUAD.

THz spectral data analysis and components unmixing based on non-negative matrix factorization methods

In many situations the THz spectroscopic data observed from complex samples represent the integrated result of several interrelated variables or feature components acting together. The actual information contained in the original data might be overlapping and there is a necessity to investigate various approaches for model reduction and data unmixing. The development and use of low-rank approximate nonnegative matrix factorization (NMF) and smooth constraint NMF (CNMF) algorithms for feature components extraction and identification in the fields of terahertz time domain spectroscopy (THz-TDS) data analysis are presented. The evolution and convergence properties of NMF and CNMF methods based on sparseness, independence and smoothness constraints for the resulting nonnegative matrix factors are discussed. For general NMF, its cost function is nonconvex and the result is usually susceptible to initialization and noise corruption, and may fall into local minima and lead to unstable decomposition. To reduce these drawbacks, smoothness constraint is introduced to enhance the performance of NMF. The proposed algorithms are evaluated by several THz-TDS data decomposition experiments including a binary system and a ternary system simulating some applications such as medicine tablet inspection. Results show that CNMF is more capable of finding optimal solutions and more robust for random initialization in contrast to NMF. The investigated method is promising for THz data resolution contributing to unknown mixture identification.

Dual-learning Multi-hop Nonnegative Matrix Factorization for community detection

As an important branch of network science, community detection has garnered significant attention. Among various community detection methods, nonnegative matrix factorization (NMF)-based community detection approaches have become a popular research topic. However, most NMF-based methods overlook the network's multi-hop information, let alone the community detection results specific to each hop of the network. In this paper, we propose Dual-learning Multi-hop NMF (DL-MHNMF), a method that considers not only the multi-hop connectivity between two nodes but also factors in the shared results across multiple hops and the impact of differences in the specific results at each hop on the shared outcomes. An efficient iterative optimization algorithm with guaranteed theoretical convergence is proposed for solving DL-MHNMF. Methodologically, by iteratively removing the specific results during the optimization process of DL-MHNMF, we achieve enhanced detection accuracy, which is also verified by subsequent experiments. Specifically, we compare fourteen algorithms on eleven publicly available datasets, and experimental results show that our algorithm outperforms most state-of-the-art methods. The source code is availiable at https://github.com/bx20000827/DL-MHNMF.git.