Results 121 to 130 of about 24,126 (306)

Classification of graphs by regularity

Journal of Combinatorial Theory, Series B, 1981
AbstractWe give a classification of graphs by two parameters s and t such that a graph is regular iff t ≥ 2, edge-regular iff t ≥ 3, and distance regular of diameter δ iff s = δ, t ≥ 2δ − 2. We investigate the algebra of polynomials in the adjacency matrix and relate to every graph a family of orthogonal polynomials. This generalizes various results on
openaire   +2 more sources

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

On End-regular graphs

Discrete Mathematics, 1996
A monoid which is von Neumann regular is called orthodox if its idempotents form a submonoid. A graph is called (End)-regular or (End)-orthodox if its monoid of graph endomorphisms is a (von Neumann) regular or orthodox monoid. Here graph endomorphisms are mappings of the vertex set which preserve edges.
openaire   +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

Graphs with regular monoids

Discrete Mathematics, 2003
The author proves that the endomorphism monoid of \(\overline{C_n}\) \((n\geq 3)\) is regular where \(\overline{C_n}\) denotes the complement graph of a undirected cycle of \(n\) vertices. It is noted that \(\text{End}(\overline{C_6})\) is not an orthodox monoid.
openaire   +1 more source

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

Uniform convergence of adaptive graph-based regularization

, 2006
The regularization functional induced by the graph Laplacian of a random neighborhood graph based on the data is adaptive in two ways. First it adapts to an underlying manifold structure and second to the density of the data-generating probability ...
Hein, Matthias, Matthias Hein, Hein, M.
core   +1 more source

Fitting Graphs: A Visual Framework for Transparent and Robust Machine Learning Model Selection

Applied Artificial Intelligence
Model developers often rely on cross-validation (CV) to estimate model performance, yet CV – even when repeated multiple times – can produce highly variable results that are difficult to interpret.
Robbie T. Nakatsu
doaj   +1 more source

Multi‐Property Machine Learning Models to Accelerate the Transition Toward Bio‐Based Emulsion Polymers

Advanced Intelligent Discovery, EarlyView.
A machine learning framework simultaneously predicts four critical properties of monomers for emulsion polymerization: propagation rate constant, reactivity ratios, glass transition temperature, and water solubility. These tools can be used to systematically identify viable bio‐based monomer pairs as replacements for conventional formulations, with ...
Kiarash Farajzadehahary, Nicholas Ballard   +1 more
wiley   +1 more source

Low-rank matrix and tensor completion using graph-based regularization

, 2021
Matrix and tensor completion arise in many different real-world applications related to the inference or acquisition of data. In this thesis, we investigate matrix and tensor completion in the aspects of models, algorithms and regularization.
Dong, Shuyu
core