Identification of two novel HIV-1 unique recombinant forms (CRF01_AE/CRF07_BC) and genomic characterization in Tongzhou district of Beijing, China.

Continuous recombination and variation during replication could lead to rapid evolution and genetic diversity of HIV-1. Some studies had identified that it was easy to develop new recombinant strains of HIV-1 among the populations of men who have sex with men (MSM). Surveillance of genetic variants of HIV-1 in key populations was crucial for comprehending the development of regional HIV-1 epidemics. The finding was reported the identification of two new unique recombinant forms (URF 20110561 and 21110743) from individuals infected with HIV-1 in Tongzhou, Beijing in 2020-2022. Sequences of near full-length genome (NFLG) were amplified, then identification of amplification products used phylogenetic analyses. The result showed that CRF01_AE was the main backbone of 20110561 and 21110743. In the gag region of the virus, 20110561 was inserted two fragments from CRF07_BC, while in the pol and tat regions of the virus, 21110743 was inserted four fragments from CRF07_BC. The CRF01_AE parental origin in the genomes of the two URFs was derived from the CRF01_AE Cluster 4. In the phylogenetic tree, the CRF07_BC parental origin of 20110561 clustered with 07BC_N and the CRF07_BC parental origin of 21110743 clustered with 07BC_O. In summary, the prevalence of novel second-generation URFs of HIV-1 was monitored in Tongzhou, Beijing. The emergence of the novel CRF01_AE/CRF07_BC recombination demonstrated that there was a great significance of continuous monitoring of new URFs in MSM populations to prevent and control the spreading of new HIV-1 URFs.

Fine-Grained Learning Behavior-Oriented Knowledge Distillation for Graph Neural Networks.

Knowledge distillation (KD), as an effective compression technology, is used to reduce the resource consumption of graph neural networks (GNNs) and facilitate their deployment on resource-constrained devices. Numerous studies exist on GNN distillation, and however, the impacts of knowledge complexity and differences in learning behavior between teachers and students on distillation efficiency remain underexplored. We propose a KD method for fine-grained learning behavior (FLB), comprising two main components: feature knowledge decoupling (FKD) and teacher learning behavior guidance (TLBG). Specifically, FKD decouples the intermediate-layer features of the student network into two types: teacher-related features (TRFs) and downstream features (DFs), enhancing knowledge comprehension and learning efficiency by guiding the student to simultaneously focus on these features. TLBG maps the teacher model's learning behaviors to provide reliable guidance for correcting deviations in student learning. Extensive experiments across eight datasets and 12 baseline frameworks demonstrate that FLB significantly enhances the performance and robustness of student GNNs within the original framework.

Tensorized Incomplete Multi-view Kernel Subspace Clustering.

Recently considerable advances have been achieved in the incomplete multi-view clustering (IMC) research. However, the current IMC works are often faced with three challenging issues. First, they mostly lack the ability to recover the nonlinear subspace structures in the multiple kernel spaces. Second, they usually neglect the high-order relationship in multiple representations. Third, they often have two or even more hyper-parameters and may not be practical for some real-world applications. To tackle these issues, we present a Tensorized Incomplete Multi-view Kernel Subspace Clustering (TIMKSC) approach. Specifically, by incorporating the kernel learning technique into an incomplete subspace clustering framework, our approach can robustly explore the latent subspace structure hidden in multiple views. Furthermore, we impute the incomplete kernel matrices and learn the low-rank tensor representations in a mutual enhancement manner. Notably, our approach can discover the underlying relationship among the observed and missing samples while capturing the high-order correlation to assist subspace clustering. To solve the proposed optimization model, we design a three-step algorithm to efficiently minimize the unified objective function, which only involves one hyper-parameter that requires tuning. Experiments on various benchmark datasets demonstrate the superiority of our approach. The source code and datasets are available at: https://www.researchgate.net/publication/381828300_TIMKSC_20240629.

ER-GET: Emotion Recognition Based on Global ECG Trajectory.

In recent years, the recognition of human emotions based on electrocardiogram (ECG) signals has been considered a novel area of study among researchers. Despite the challenge of extracting latent emotion information from ECG signals, existing methods are able to recognize emotions by calculating the heart rate variability (HRV) features. However, such local features have drawbacks, as they do not provide a comprehensive description of ECG signals, leading to suboptimal recognition performance. For the first time, we propose a new strategy to extract hidden emotional information from the global ECG trajectory for emotion recognition. Specifically, a period of ECG signals is decomposed into sub-signals of different frequency bands through ensemble empirical mode decomposition (EEMD), and a series of multi-sequence trajectory graphs is constructed by orthogonally combining these sub-signals to extract latent emotional information. Additionally, to better utilize these graph features, a network has been designed that includes self-supervised graph representation learning and ensemble learning for classification. This approach surpasses recent notable works, achieving outstanding results, with an accuracy of 95.08% in arousal and 95.90% in valence detection. Additionally, this global feature is compared and discussed in relation to HRV features, with the intention of providing inspiration for subsequent research.

Dual Information Enhanced Multiview Attributed Graph Clustering.

Multiview attributed graph clustering is an important approach to partition multiview data based on the attribute characteristics and adjacent matrices from different views. Some attempts have been made in using graph neural network (GNN), which have achieved promising clustering performance. Despite this, few of them pay attention to the inherent specific information embedded in multiple views. Meanwhile, they are incapable of recovering the latent high-level representation from the low-level ones, greatly limiting the downstream clustering performance. To fill these gaps, a novel dual information enhanced multiview attributed graph clustering (DIAGC) method is proposed in this article. Specifically, the proposed method introduces the specific information reconstruction (SIR) module to disentangle the explorations of the consensus and specific information from multiple views, which enables graph convolutional network (GCN) to capture the more essential low-level representations. Besides, the contrastive learning (CL) module maximizes the agreement between the latent high-level representation and low-level ones and enables the high-level representation to satisfy the desired clustering structure with the help of the self-supervised clustering (SC) module. Extensive experiments on several real-world benchmarks demonstrate the effectiveness of the proposed DIAGC method compared with the state-of-the-art baselines.

Contrastive Multiview Attribute Graph Clustering With Adaptive Encoders.

Multiview attribute graph clustering aims to cluster nodes into disjoint categories by taking advantage of the multiview topological structures and the node attribute values. However, the existing works fail to explicitly discover the inherent relationships in multiview topological graph matrices while considering different properties between the graphs. Besides, they cannot well handle the sparse structure of some graphs in the learning procedure of graph embeddings. Therefore, in this article, we propose a novel contrastive multiview attribute graph clustering (CMAGC) with adaptive encoders method. Within this framework, the adaptive encoders concerning different properties of distinct topological graphs are chosen to integrate multiview attribute graph information by checking whether there exists high-order neighbor information or not. Meanwhile, the number of layers of the GCN encoders is selected according to the prior knowledge related to the characteristics of different topological graphs. In particular, the feature-level and cluster-level contrastive learning are conducted on the multiview soft assignment representations, where the union of the first-order neighbors from the corresponding graph pairs is regarded as the positive pairs for data augmentation and the sparse neighbor information problem in some graphs can be well dealt with. To the best of our knowledge, it is the first time to explicitly deal with the inherent relationships from the interview and intraview perspectives. Extensive experiments are conducted on several datasets to verify the superiority of the proposed CMAGC method compared with the state-of-the-art methods.

Motif-Based Contrastive Learning for Community Detection.

Community detection has become a prominent task in complex network analysis. However, most of the existing methods for community detection only focus on the lower order structure at the level of individual nodes and edges and ignore the higher order connectivity patterns that characterize the fundamental building blocks within the network. In recent years, researchers have shown interest in motifs and their role in network analysis. However, most of the existing higher order approaches are based on shallow methods, failing to capture the intricate nonlinear relationships between nodes. In order to better fuse higher order and lower order structural information, a novel deep learning framework called motif-based contrastive learning for community detection (MotifCC) is proposed. First, a higher order network is constructed based on motifs. Subnetworks are then obtained by removing isolated nodes, addressing the fragmentation issue in the higher order network. Next, the concept of contrastive learning is applied to effectively fuse various kinds of information from nodes, edges, and higher order and lower order structures. This aims to maximize the similarity of corresponding node information, while distinguishing different nodes and different communities. Finally, based on the community structure of subnetworks, the community labels of all nodes are obtained by using the idea of label propagation. Extensive experiments on real-world datasets validate the effectiveness of MotifCC.

CRP inhibits the osteoblastic differentiation of OPCs via the up-regulation of primary cilia and repression of the Hedgehog signaling pathway.

Inflammation disrupts bone metabolism and leads to bone damage. C-reactive protein (CRP) is a typical inflammation marker. Although CRP measurement has been conducted for many decades, how osteoblastic differentiation influences molecular mechanisms remains largely unknown. The present study attempted to investigate the effects of CRP on primary cultured osteoblast precursor cells (OPCs) while elucidating the underlying molecular mechanisms. OPCs were isolated from suckling Sprague-Dawleyrats. Fewer OPCs were observed after recombinant C-reactive protein treatment. In a series of experiments, CRP inhibited OPC proliferation, osteoblastic differentiation, and the OPC gene expression of the hedgehog (Hh) signaling pathway. The inhibitory effect of CRP on OPC proliferation occurred via blockade of the G1-S transition of the cell cycle. In addition, the regulation effect of proto cilium on osteoblastic differentiation was analyzed using the bioinformatics p. This revealed the primary cilia activation of recombinant CRP effect on OPCs through in vitro experiments. A specific Sonic Hedgehog signaling agonist (SAG) rescued osteoblastic differentiation inhibited by recombinant CRP. Moreover, chloral hydrate, which removes primary cilia, inhibited the Suppressor of Fused (SUFU) formation and blocked Gli2 degradation. This counteracted osteogenesis inhibition caused by CRP. Therefore, these data depict that CRP can inhibit the proliferation and osteoblastic differentiation of OPCs. The underlying mechanism could be associated with primary cilia activation and Hh pathway repression.

Gray Learning From Non-IID Data With Out-of-Distribution Samples.

The integrity of training data, even when annotated by experts, is far from guaranteed, especially for non-independent and identically distributed (non-IID) datasets comprising both in-and out-of-distribution samples. In an ideal scenario, the majority of samples would be in-distribution, while samples that deviate semantically would be identified as out-of-distribution and excluded during the annotation process. However, experts may erroneously classify these out-of-distribution samples as in-distribution, assigning them labels that are inherently unreliable. This mixture of unreliable labels and varied data types makes the task of learning robust neural networks notably challenging. We observe that both in-and out-of-distribution samples can almost invariably be ruled out from belonging to certain classes, aside from those corresponding to unreliable ground-truth labels. This opens the possibility of utilizing reliable complementary labels that indicate the classes to which a sample does not belong. Guided by this insight, we introduce a novel approach, termed gray learning (GL), which leverages both ground-truth and complementary labels. Crucially, GL adaptively adjusts the loss weights for these two label types based on prediction confidence levels. By grounding our approach in statistical learning theory, we derive bounds for the generalization error, demonstrating that GL achieves tight constraints even in non-IID settings. Extensive experimental evaluations reveal that our method significantly outperforms alternative approaches grounded in robust statistics.

Bifidobacterium infantis-Mediated Herpes Simplex Virus-TK/Ganciclovir Treatment Inhibits Cancer Metastasis in Mouse Model.

Previous studies have found that Bifidobacterium infantis-mediated herpes simplex virus-TK/ganciclovir (BF-TK/GCV) reduces the expression of VEGF and CD146, implying tumor metastasis inhibition. However, the mechanism by which BF-TK/GCV inhibits tumor metastasis is not fully studied. Here, we comprehensively identified and quantified protein expression profiling for the first time in gastric cancer (GC) cells MKN-45 upon BF-TK/GCV treatment using quantitative proteomics. A total of 159 and 72 differential expression proteins (DEPs) were significantly changed in the BF-TK/GCV/BF-TK and BF-TK/GCV/BF/GCV comparative analysis. Kyoto encyclopedia of genes and genomes (KEGG) pathway analysis enriched some metastasis-related pathways such as gap junction and cell adhesion molecules pathways. Moreover, the transwell assay proved that BF-TK/GCV inhibited the invasion and migration of tumor cells. Furthermore, immunohistochemistry (IHC) demonstrated that BF-TK/GCV reduced the expression of HIF-1α, mTOR, NF-κB1-p105, VCAM1, MMP13, CXCL12, ATG16, and CEBPB, which were associated with tumor metastasis. In summary, BF-TK/GCV inhibited tumor metastasis, which deepened and expanded the understanding of the antitumor mechanism of BF-TK/GCV.

PDGF-BB/PDGFRß induces tumour angiogenesis via enhancing PKM2 mediated by the PI3K/AKT pathway in Wilms' tumour.

Platelet-derived growth factor receptor-ß (PDGFRß) is a critical type III receptor tyrosine kinase family member, which is involved in Wilms' tumour (WT) metastasis and aerobic glycolysis. The role of PDGFRß in tumour angiogenesis has not been fully elucidated. Here, we examined the effect of PDGFRß on angiogenesis in WT. First, the NCBI database integrated three datasets, GSE2712, GSE11151, and GSE73209, to screen differentially expressed genes. The R language was used to analyse the correlation between PDGFRB and vascular endothelial growth factor (VEGF). The results showed that PDGFRB, encoding PDGFRß, was upregulated in WT, and its level was correlated with VEGFA expression. Next, PDGFRß expression was inhibited by small interfering RNA (siRNA) or activated with the exogenous ligand PDGF-BB. The expression and secretion of the angiogenesis elated factor VEGFA in WT G401 cells were detected using Western blotting and ELISA, respectively. The effects of conditioned medium from G401 cells on endothelial cell viability, migration, invasion, the total length of the tube, and the number of fulcrums were investigated. To further explore the mechanism of PDGFRß in the angiogenesis of WT, the expression of VEGFA was detected after blocking the phosphatidylinositol-3-kinase (PI3K) pathway and inhibiting the expression of PKM2, a key enzyme of glycolysis. The results indicated that PDGFRß regulated the process of tumour angiogenesis through the PI3K/AKT/PKM2 pathway. Therefore, this study provides a novel therapeutic strategy to target PDGFRß and PKM2 to inhibit glycolysis and anti-angiogenesis, thus, developing a new anti-vascular therapy.

Consensus Seeking in Large-Scale Multiagent Systems With Hierarchical Switching-Backbone Topology.

Recent developments in multiagent consensus problems have heightened the role of network topology when the agent number increases largely. The existing works assume that the convergence evolution typically proceeds over a peer-to-peer architecture where agents are treated equally and communicate directly with perceived one-hop neighbors, thus resulting in slower convergence speed. In this article, we first extract the backbone network topology to provide a hierarchical organization over the original multiagent system (MAS). Second, we introduce a geometric convergence method based on the constraint set (CS) under periodically extracted switching-backbone topologies. Finally, we derive a fully decentralized framework named hierarchical switching-backbone MAS (HSBMAS) that is designed to conduct agents converge to a common stable equilibrium. Provable connectivity and convergence guarantees of the framework are provided when the initial topology is connected. Extensive simulation results on different-type and varying-density topologies have shown the superiority of the proposed framework.

Efficient Multi-View Clustering via Unified and Discrete Bipartite Graph Learning.

Although previous graph-based multi-view clustering (MVC) algorithms have gained significant progress, most of them are still faced with three limitations. First, they often suffer from high computational complexity, which restricts their applications in large-scale scenarios. Second, they usually perform graph learning either at the single-view level or at the view-consensus level, but often neglect the possibility of the joint learning of single-view and consensus graphs. Third, many of them rely on the k -means for discretization of the spectral embeddings, which lack the ability to directly learn the graph with discrete cluster structure. In light of this, this article presents an efficient MVC approach via unified and discrete bipartite graph learning (UDBGL). Specifically, the anchor-based subspace learning is incorporated to learn the view-specific bipartite graphs from multiple views, upon which the bipartite graph fusion is leveraged to learn a view-consensus bipartite graph with adaptive weight learning. Furthermore, the Laplacian rank constraint is imposed to ensure that the fused bipartite graph has discrete cluster structures (with a specific number of connected components). By simultaneously formulating the view-specific bipartite graph learning, the view-consensus bipartite graph learning, and the discrete cluster structure learning into a unified objective function, an efficient minimization algorithm is then designed to tackle this optimization problem and directly achieve a discrete clustering solution without requiring additional partitioning, which notably has linear time complexity in data size. Experiments on a variety of multi-view datasets demonstrate the robustness and efficiency of our UDBGL approach. The code is available at https://github.com/huangdonghere/UDBGL.

Cross-Subject Tinnitus Diagnosis Based on Multi-Band EEG Contrastive Representation Learning.

Electroencephalogram (EEG) is an important technology to explore the central nervous mechanism of tinnitus. However, it is hard to obtain consistent results in many previous studies for the high heterogeneity of tinnitus. In order to identify tinnitus and provide theoretical guidance for the diagnosis and treatment, we propose a robust, data-efficient multi-task learning framework called Multi-band EEG Contrastive Representation Learning (MECRL). In this study, we collect resting-state EEG data from 187 tinnitus patients and 80 healthy subjects to generate a high-quality large-scale EEG dataset on tinnitus diagnosis, and then apply the MECRL framework on the generated dataset to obtain a deep neural network model which can distinguish tinnitus patients from the healthy controls accurately. Subject-independent tinnitus diagnosis experiments are conducted and the result shows that the proposed MECRL method is significantly superior to other state-of-the-art baselines and can be well generalized to unseen topics. Meanwhile, visual experiments on key parameters of the model indicate that the high-classification weight electrodes of tinnitus' EEG signals are mainly distributed in the frontal, parietal and temporal regions. In conclusion, this study facilitates our understanding of the relationship between electrophysiology and pathophysiology changes of tinnitus and provides a new deep learning method (MECRL) to identify the neuronal biomarkers in tinnitus.

Multiparty Secure Broad Learning System for Privacy Preserving.

Multiparty learning is an indispensable technique to improve the learning performance via integrating data from multiple parties. Unfortunately, directly integrating multiparty data could not meet the privacy-preserving requirements, which then induces the development of privacy-preserving machine learning (PPML), a key research task in multiparty learning. Despite this, the existing PPML methods generally cannot simultaneously meet multiple requirements, such as security, accuracy, efficiency, and application scope. To deal with the aforementioned problems, in this article, we present a new PPML method based on the secure multiparty interactive protocol, namely, the multiparty secure broad learning system (MSBLS) and derive its security analysis. To be specific, the proposed method employs the interactive protocol and random mapping to generate the mapped features of data, and then uses efficient broad learning to train the neural network classifier. To the best of our knowledge, this is the first attempt for privacy computing method that jointly combines secure multiparty computing and neural network. Theoretically, this method can ensure that the accuracy of the model will not be reduced due to encryption, and the calculation speed is very fast. Three classical datasets are adopted to verify our conclusion.

Higher Order Connection Enhanced Community Detection in Adversarial Multiview Networks.

Community detection in multiview networks has drawn an increasing amount of attention in recent years. Many approaches have been developed from different perspectives. Despite the success, the problem of community detection in adversarial multiview networks remains largely unsolved. An adversarial multiview network is a multiview network that suffers an adversarial attack on community detection in which the attackers may deliberately remove some critical edges so as to hide the underlying community structure, leading to the performance degeneration of the existing approaches. To address this problem, we propose a novel approach, called higher order connection enhanced multiview modularity (HCEMM). The main idea lies in enhancing the intracommunity connection of each view by means of utilizing the higher order connection structure. The first step is to discover the view-specific higher order Microcommunities (VHM-communities) from the higher order connection structure. Then, for each view of the original multiview network, additional edges are added to make the nodes in each of its VHM-communities fully connected like a clique, by which the intracommunity connection of the multiview network can be enhanced. Therefore, the proposed approach is able to discover the underlying community structure in a multiview network while recovering the missing edges. Extensive experiments conducted on 16 real-world datasets confirm the effectiveness of the proposed approach.

Multiview Clustering via Proximity Learning in Latent Representation Space.

Most existing multiview clustering methods are based on the original feature space. However, the feature redundancy and noise in the original feature space limit their clustering performance. Aiming at addressing this problem, some multiview clustering methods learn the latent data representation linearly, while performance may decline if the relation between the latent data representation and the original data is nonlinear. The other methods which nonlinearly learn the latent data representation usually conduct the latent representation learning and clustering separately, resulting in that the latent data representation might be not well adapted to clustering. Furthermore, none of them model the intercluster relation and intracluster correlation of data points, which limits the quality of the learned latent data representation and therefore influences the clustering performance. To solve these problems, this article proposes a novel multiview clustering method via proximity learning in latent representation space, named multiview latent proximity learning (MLPL). For one thing, MLPL learns the latent data representation in a nonlinear manner which takes the intercluster relation and intracluster correlation into consideration simultaneously. For another, through conducting the latent representation learning and consensus proximity learning simultaneously, MLPL learns a consensus proximity matrix with k connected components to output the clustering result directly. Extensive experiments are conducted on seven real-world datasets to demonstrate the effectiveness and superiority of the MLPL method compared with the state-of-the-art multiview clustering methods.

HB-DSBM: Modeling the Dynamic Complex Networks From Community Level to Node Level.

A variety of methods have been proposed for modeling and mining dynamic complex networks, in which the topological structure varies with time. As the most popular and successful network model, the stochastic block model (SBM) has been extended and applied to community detection, link prediction, anomaly detection, and evolution analysis of dynamic networks. However, all current models based on the SBM for modeling dynamic networks are designed at the community level, assuming that nodes in each community have the same dynamic behavior, which usually results in poor performance on temporal community detection and loses the modeling of node abnormal behavior. To solve the above-mentioned problem, this article proposes a hierarchical Bayesian dynamic SBM (HB-DSBM) for modeling the node-level and community-level dynamic behavior in a dynamic network synchronously. Based on the SBM, we introduce a hierarchical Dirichlet generative mechanism to associate the global community evolution with the microscopic transition behavior of nodes near-perfectly and generate the observed links across the dynamic networks. Meanwhile, an effective variational inference algorithm is developed and we can easy to infer the communities and dynamic behaviors of the nodes. Furthermore, with the two-level evolution behaviors, it can identify nodes or communities with abnormal behavior. Experiments on simulated and real-world networks demonstrate that HB-DSBM has achieved state-of-the-art performance on community detection and evolution. In addition, abnormal evolutionary behavior and events on dynamic networks can be effectively identified by our model.

G3SR: Global Graph Guided Session-Based Recommendation.

Session-based recommendation tries to make use of anonymous session data to deliver high-quality recommendations under the condition that user profiles and the complete historical behavioral data of a target user are unavailable. Previous works consider each session individually and try to capture user interests within a session. Despite their encouraging results, these models can only perceive intra-session items and cannot draw upon the massive historical relational information. To solve this problem, we propose a novel method named global graph guided session-based recommendation (G3SR). G3SR decomposes the session-based recommendation workflow into two steps. First, a global graph is built upon all session data, from which the global item representations are learned in an unsupervised manner. Then, these representations are refined on session graphs under the graph networks, and a readout function is used to generate session representations for each session. Extensive experiments on two real-world benchmark datasets show remarkable and consistent improvements of the G3SR method over the state-of-the-art methods, especially for cold items.

Incomplete Data Meets Uncoupled Case: A Challenging Task of Multiview Clustering.

Incomplete multiview clustering (IMC) methods have achieved remarkable progress by exploring the complementary information and consensus representation of incomplete multiview data. However, to our best knowledge, none of the existing methods attempts to handle the uncoupled and incomplete data simultaneously, which affects their generalization ability in real-world scenarios. For uncoupled incomplete data, the unclear and partial cross-view correlation introduces the difficulty to explore the complementary information between views, which results in the unpromising clustering performance for the existing multiview clustering methods. Besides, the presence of hyperparameters limits their applications. To fill these gaps, a novel uncoupled IMC (UIMC) method is proposed in this article. Specifically, UIMC develops a joint framework for feature inferring and recoupling. The high-order correlations of all views are explored by performing a tensor singular value decomposition (t-SVD)-based tensor nuclear norm (TNN) on recoupled and inferred self-representation matrices. Moreover, all hyperparameters of the UIMC method are updated in an exploratory manner. Extensive experiments on six widely used real-world datasets have confirmed the superiority of the proposed method in handling the uncoupled incomplete multiview data compared with the state-of-the-art methods.