The causal relationship between gut microbiota and lymphoma: a two-sample Mendelian randomization study.

Background: Previous studies have indicated a potential link between the gut microbiota and lymphoma. However, the exact causal interplay between the two remains an area of ambiguity. Methods: We performed a two-sample Mendelian randomization (MR) analysis to elucidate the causal relationship between gut microbiota and five types of lymphoma. The research drew upon microbiome data from a research project of 14,306 participants and lymphoma data encompassing 324,650 cases. Single-nucleotide polymorphisms were meticulously chosen as instrumental variables according to multiple stringent criteria. Five MR methodologies, including the inverse variance weighted approach, were utilized to assess the direct causal impact between the microbial exposures and lymphoma outcomes. Moreover, sensitivity analyses were carried out to robustly scrutinize and validate the potential presence of heterogeneity and pleiotropy, thereby ensuring the reliability and accuracy. Results: We discerned 38 potential causal associations linking genetic predispositions within the gut microbiome to the development of lymphoma. A few of the more significant results are as follows: Genus Coprobacter (OR = 0.619, 95% CI 0.438-0.873, P = 0.006) demonstrated a potentially protective effect against Hodgkin's lymphoma (HL). Genus Alistipes (OR = 0.473, 95% CI 0.278-0.807, P = 0.006) was a protective factor for diffuse large B-cell lymphoma. Genus Ruminococcaceae (OR = 0.541, 95% CI 0.341-0.857, P = 0.009) exhibited suggestive protective effects against follicular lymphoma. Genus LachnospiraceaeUCG001 (OR = 0.354, 95% CI 0.198-0.631, P = 0.0004) showed protective properties against T/NK cell lymphoma. The Q test indicated an absence of heterogeneity, and the MR-Egger test did not show significant horizontal polytropy. Furthermore, the leave-one-out analysis failed to identify any SNP that exerted a substantial influence on the overall results. Conclusion: Our study elucidates a definitive causal link between gut microbiota and lymphoma development, pinpointing specific microbial taxa with potential causative roles in lymphomagenesis, as well as identifying probiotic candidates that may impact disease progression, which provide new ideas for possible therapeutic approaches to lymphoma and clues to the pathogenesis of lymphoma.

Graph Clustering with High-Order Contrastive Learning.

Graph clustering is a fundamental and challenging task in unsupervised learning. It has achieved great progress due to contrastive learning. However, we find that there are two problems that need to be addressed: (1) The augmentations in most graph contrastive clustering methods are manual, which can result in semantic drift. (2) Contrastive learning is usually implemented on the feature level, ignoring the structure level, which can lead to sub-optimal performance. In this work, we propose a method termed Graph Clustering with High-Order Contrastive Learning (GCHCL) to solve these problems. First, we construct two views by Laplacian smoothing raw features with different normalizations and design a structure alignment loss to force these two views to be mapped into the same space. Second, we build a contrastive similarity matrix with two structure-based similarity matrices and force it to align with an identity matrix. In this way, our designed contrastive learning encompasses a larger neighborhood, enabling our model to learn clustering-friendly embeddings without the need for an extra clustering module. In addition, our model can be trained on a large dataset. Extensive experiments on five datasets validate the effectiveness of our model. For example, compared to the second-best baselines on four small and medium datasets, our model achieved an average improvement of 3% in accuracy. For the largest dataset, our model achieved an accuracy score of 81.92%, whereas the compared baselines encountered out-of-memory issues.

Multiview Subspace Clustering via Co-Training Robust Data Representation.

Taking the assumption that data samples are able to be reconstructed with the dictionary formed by themselves, recent multiview subspace clustering (MSC) algorithms aim to find a consensus reconstruction matrix via exploring complementary information across multiple views. Most of them directly operate on the original data observations without preprocessing, while others operate on the corresponding kernel matrices. However, they both ignore that the collected features may be designed arbitrarily and hard guaranteed to be independent and nonoverlapping. As a result, original data observations and kernel matrices would contain a large number of redundant details. To address this issue, we propose an MSC algorithm that groups samples and removes data redundancy concurrently. In specific, eigendecomposition is employed to obtain the robust data representation of low redundancy for later clustering. By utilizing the two processes into a unified model, clustering results will guide eigendecomposition to generate more discriminative data representation, which, as feedback, helps obtain better clustering results. In addition, an alternate and convergent algorithm is designed to solve the optimization problem. Extensive experiments are conducted on eight benchmarks, and the proposed algorithm outperforms comparative ones in recent literature by a large margin, verifying its superiority. At the same time, its effectiveness, computational efficiency, and robustness to noise are validated experimentally.

Auxiliary Graph for Attribute Graph Clustering.

Attribute graph clustering algorithms that include topological structural information into node characteristics for building robust representations have proven to have promising efficacy in a variety of applications. However, the presented topological structure emphasizes local links between linked nodes but fails to convey relationships between nodes that are not directly linked, limiting the potential for future clustering performance improvement. To solve this issue, we offer the Auxiliary Graph for Attribute Graph Clustering technique (AGAGC). Specifically, we construct an additional graph as a supervisor based on the node attribute. The additional graph can serve as an auxiliary supervisor that aids the present one. To generate a trustworthy auxiliary graph, we offer a noise-filtering approach. Under the supervision of both the pre-defined graph and an auxiliary graph, a more effective clustering model is trained. Additionally, the embeddings of multiple layers are merged to improve the discriminative power of representations. We offer a clustering module for a self-supervisor to make the learned representation more clustering-aware. Finally, our model is trained using a triplet loss. Experiments are done on four available benchmark datasets, and the findings demonstrate that the proposed model outperforms or is comparable to state-of-the-art graph clustering models.

Adaptive Weighted Graph Fusion Incomplete Multi-View Subspace Clustering.

With the enormous amount of multi-source data produced by various sensors and feature extraction approaches, multi-view clustering (MVC) has attracted developing research attention and is widely exploited in data analysis. Most of the existing multi-view clustering methods hold on the assumption that all of the views are complete. However, in many real scenarios, multi-view data are often incomplete for many reasons, e.g., hardware failure or incomplete data collection. In this paper, we propose an adaptive weighted graph fusion incomplete multi-view subspace clustering (AWGF-IMSC) method to solve the incomplete multi-view clustering problem. Firstly, to eliminate the noise existing in the original space, we transform complete original data into latent representations which contribute to better graph construction for each view. Then, we incorporate feature extraction and incomplete graph fusion into a unified framework, whereas two processes can negotiate with each other, serving for graph learning tasks. A sparse regularization is imposed on the complete graph to make it more robust to the view-inconsistency. Besides, the importance of different views is automatically learned, further guiding the construction of the complete graph. An effective iterative algorithm is proposed to solve the resulting optimization problem with convergence. Compared with the existing state-of-the-art methods, the experiment results on several real-world datasets demonstrate the effectiveness and advancement of our proposed method.

An Efficient and Robust Unsupervised Anomaly Detection Method Using Ensemble Random Projection in Surveillance Videos.

Video anomaly detection is widely applied in modern society, which is achieved by sensors such as surveillance cameras. This paper learns anomalies by exploiting videos under the fully unsupervised setting. To avoid massive computation caused by back-prorogation in existing methods, we propose a novel efficient three-stage unsupervised anomaly detection method. In the first stage, we adopt random projection instead of autoencoder or its variants in previous works. Then we formulate the optimization goal as a least-square regression problem which has a closed-form solution, leading to less computational cost. The discriminative reconstruction losses of normal and abnormal events encourage us to roughly estimate normality that can be further sifted in the second stage with one-class support vector machine. In the third stage, to eliminate the instability caused by random parameter initializations, ensemble technology is performed to combine multiple anomaly detectors' scores. To the best of our knowledge, it is the first time that unsupervised ensemble technology is introduced to video anomaly detection research. As demonstrated by the experimental results on several video anomaly detection benchmark datasets, our algorithm robustly surpasses the recent unsupervised methods and performs even better than some supervised approaches. In addition, we achieve comparable performance contrast with the state-of-the-art unsupervised method with much less running time, indicating the effectiveness, efficiency, and robustness of our proposed approach.

Incomplete Multiview Clustering via Late Fusion.

In real-world applications of multiview clustering, some views may be incomplete due to noise, sensor failure, etc. Most existing studies in the field of incomplete multiview clustering have focused on early fusion strategies, for example, learning subspace from multiple views. However, these studies overlook the fact that clustering results with the visible instances in each view could be reliable under the random missing assumption; accordingly, it seems that learning a final clustering decision via late fusion of the clustering results from incomplete views would be more natural. To this end, we propose a late fusion method for incomplete multiview clustering. More specifically, the proposed method performs kernel k-means clustering on the visible instances in each view and then performs a late fusion of the clustering results from different views. In the late fusion step of the proposed method, we encode each view's clustering result as a zero-one matrix, of which each row serves as a compressed representation of the corresponding instance. We then design an alternate updating algorithm to learn a unified clustering decision that can best group the visible compressed representations in each view according to the k-means clustering objective. We compare the proposed method with several commonly used imputation methods and a representative early fusion method on six benchmark datasets. The superior clustering performance observed validates the effectiveness of the proposed method.

A Depth-Based Weighted Point Cloud Registration for Indoor Scene.

Point cloud registration plays a key role in three-dimensional scene reconstruction, and determines the effect of reconstruction. The iterative closest point algorithm is widely used for point cloud registration. To improve the accuracy of point cloud registration and the convergence speed of registration error, point pairs with smaller Euclidean distances are used as the points to be registered, and the depth measurement error model and weight function are analyzed. The measurement error is taken into account in the registration process. The experimental results of different indoor scenes demonstrate that the proposed method effectively improves the registration accuracy and the convergence speed of registration error.

Cross-Coupling Reactions of Alkenyl Halides with 4-Benzyl-1,4- Dihydropyridines Associated with E to Z Isomerization under Nickel and Photoredox Catalysis.

Cross-coupling reactions of alkenyl halides with 4-alkyl-1,4-dihydropyridines as alkylation reagents have been achieved by combination of nickel and photoredox catalysts. Alkenyl halides bearing alkyl and aryl substituents are available. Particularly, in the use of aryl-substituted alkenyl halides, cross-coupling reactions are associated with E to Z isomerization of alkenes. Thus, Z-isomers of the products are obtained as major products. The present strategy provides a novel synthetic method to control the stereochemistry around alkenes.

Separation and determination of nitroaniline isomers by capillary zone electrophoresis with amperometric detection.

In this paper, capillary zone electrophoresis with amperometric detection (CZE-AD) was firstly applied to the simultaneous separation and determination of nitroaniline positional isomers. The three analytes could be perfectly analyzed by using the buffer of extreme pH. The effects of several important factors were investigated to find optimum conditions. A carbon-disk electrode was used as working electrode. The optimal conditions were 40 mmol/L tartaric acid-sodium tartrate (pH 1.2) as running buffer, 17kV as separation voltage and 1.10V (versus saturated calomel reference electrode, SCE) as detection potential. Under the optimum conditions, o-, m- and p-nitroaniline were separated successfully and good linearity, reproducibility and recovery results were obtained. The detection limit for m-nitroaniline was as low as at 9.06 x 10(-9)mol/L. This proposed method demonstrated long-term stability and reproducibility with relative standard deviations of less than 1.8% for migration time and 1.1% for peak areas. The utility of this method was demonstrated by monitoring dyestuff wastewater and the assay results were satisfactory.

The separation and determination of nitrophenol isomers by high-performance capillary zone electrophoresis.

o-Nitrophenol, m-nitrophenol, and p-nitrophenol could well be separated by capillary zone electrophoresis (CZE) by only adjusting the run buffer with methanol. Efficiency up to 10(5) theoretical plates per meter was achieved. The effects of several important factors were investigated to find optimum conditions. The linear range, regression equation, and the recovery were given. This method possessed the advantages of simplicity, rapidity, and good reproducibility; it can be developed for the separation of practical samples in environment analysis.