Results 121 to 130 of about 117,362 (280)

Accelerating Primary Screening of USP8 Inhibitors from Drug Repurposing Databases with Tree‐Based Machine Learning

Advanced Intelligent Discovery, EarlyView.
This study introduces a tree‐based machine learning approach to accelerate USP8 inhibitor discovery. The best‐performing model identified 100 high‐confidence repurposable compounds, half already approved or in clinical trials, and uncovered novel scaffolds not previously studied. These findings offer a solid foundation for rapid experimental follow‐up,
Yik Kwong Ng, Sharon Ai Er Lam, Wei Chun Lim, Hannah Hui Min Toh, Shi Jun Ang   +4 more
wiley   +1 more source

Computer Vision Pipeline for Image Analysis for Freeze‐Fracture Electron Microscopy: Rosette Cellulose Synthase Complexes Case

Advanced Intelligent Discovery, EarlyView.
This paper presents a computer vision (deep learning) pipeline integrating YOLOv8 and YOLOv9 for automated detection, segmentation, and analysis of rosette cellulose synthase complexes in freeze‐fracture electron microscopy images. The study explores curated dataset expansion for model improvement and highlights pipeline accuracy, speed ...
Siri Mudunuri, Leala Carbonneau, Eric M. Roberts, Alison W. Roberts, Candace H. Haigler, Alexey V. Gulyuk, Yaroslava G. Yingling   +6 more
wiley   +1 more source

GReAT: A Graph Regularized Adversarial Training Method

IEEE Access
This paper presents GReAT (Graph Regularized Adversarial Training), a novel regularization method designed to enhance the robust classification performance of deep learning models.
Samet Bayram, Kenneth Barner
doaj   +1 more source

EC-PGMGR: Ensemble Clustering Based on Probability Graphical Model With Graph Regularization for Single-Cell RNA-seq Data. [PDF]

Front Genet, 2020
Zhu Y, Zhang DX, Zhang XF, Yi M, Ou-Yang L, Wu M.   +5 more
europepmc   +1 more source

Cycle-regular graphs

Discrete Mathematics, 1991
AbstractH.M. Mulder introduced (0,λ)-graphs and proved that maximum (0,λ)-graphs are hypercubes. One way of generalization of this concept is to consider cycle-regular graphs. We prove that these graphs have also some regularity properties and that maximum [3, 1, 6]-cycle regular graphs are also related to hypercubes.
openaire   +1 more source

Data‐Guided Photocatalysis: Supervised Machine Learning in Water Splitting and CO2 Conversion

Advanced Intelligent Discovery, EarlyView.
This review highlights recent advances in supervised machine learning (ML) for photocatalysis, emphasizing methods to optimize photocatalyst properties and design materials for solar‐driven water splitting and CO2 reduction. Key applications, challenges, and future directions are discussed, offering a practical framework for integrating ML into the ...
Paul Rossener Regonia, Christian Mark Pelicano   +1 more
wiley   +1 more source

Blind Remote Sensing Image Deblurring Based on Local Maximum High-Frequency Coefficient Prior and Graph Regularization

IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
In satellite remote sensing imaging, factors such as optical axis shift, image plane jitter, movement of the target object, and Earth's rotation can induce image blur.
Zhidan Cai, Ming Fang, Zhe Li, Jinyi Ming, Huimin Wang   +4 more
doaj   +1 more source

Composition‐Aware Cross‐Sectional Integration for Spatial Transcriptomics

Advanced Intelligent Discovery, EarlyView.
Multi‐section spatial transcriptomics demands coherent cell‐type deconvolution, domain detection, and batch correction, yet existing pipelines treat these tasks separately. FUSION unifies them within a composition‐aware latent framework, modeling reads as cell‐type–specific topics and clustering in embedding space.
Qishi Dong, Zijian Huang, Xuanwu Wang, Zhenghui Feng, Wei Liu, Bingding Huang   +5 more
wiley   +1 more source

Factors of regular graphs

Journal of Combinatorial Theory, Series B, 1986
A spanning subgraph F of a graph G is called a [k-1,k]-factor if \(k-1\leq d_ F(x)\leq k\) for all vertices of x of G, where \(d_ F(x)\) denotes the degree of x in F. \textit{W. T. Tutte} [The subgraph problem, Ann. Discrete Math. 3, 289-295 (1978; Zbl 0377.05034)] proved that if r is an odd integer, then every r-regular graph has a [k-1,k]-factor for ...
openaire   +3 more sources

Harnessing Machine Learning to Understand and Design Disordered Solids

Advanced Intelligent Discovery, EarlyView.
This review maps the dynamic evolution of machine learning in disordered solids, from structural representations to generative modeling. It explores how deep learning and model explainability transform property prediction into profound physical insight.
Muchen Wang, Yue Fan
wiley   +1 more source