Results 111 to 120 of about 720,784 (299)
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
Unsupervised vocabulary discovery using non-negative matrix factorizationwith graph regularization [PDF]
, 2011 In this paper, we present a model for unsupervised pattern discovery using non-negative matrix factorization (NMF) with graph regularization. Though the regularization can be applied to many applications, we illustrate its effectiveness in a task of ...
Sun, Meng +3 more
core +1 more source
Advanced Science, EarlyView.An MTJ‐based probabilistic processing‐in‐memory architecture unites nonvolatile storage, local entropy generation, and stochastic computation within each memory cell. Stored multi‐bit weights are converted directly into programmable stochastic bitstreams, enabling neural‐network inference, adaptive Ising optimization, and uncertainty‐aware Bayesian ...
Qiuyuan Wang +6 more
wiley +1 more source
An Overview of Co-Clustering via Matrix Factorization
IEEE Access, 2019 Co-clustering algorithms have been widely used for text clustering and gene expression through matrix factorization. In recent years, diverse co-clustering algorithms which group data points and features synchronously have shown their advantages over ...
Renjie Lin, Shiping Wang, Wenzhong Guo
doaj +1 more source
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 +2 more sources
An Integrated Artificial Intelligence Framework for Nanomedicine Engineering
Advanced Science, EarlyView.This review outlines a closed‐loop AI ecosystem for nanomedicine engineering. By synergizing multimodal data harmonization, objective‐driven AI architectures, and automated high‐throughput validation, this “Design‐Make‐Test‐Analyze” (DMTA) workflow transforms traditional heuristic formulation into a predictive, self‐optimizing paradigm, accelerating ...
Meichen Dong +10 more
wiley +1 more source
Electronic Notes in Discrete Mathematics, 2001 Abstract Abstract A graph G , is λ-regular-stable if it has at least a maximum independent set I , such that for ∀ v ∈ V(G)\I , the number of vertices in NG(V) , ⨆ I , is constant, and equal to λ. Here we give some results for this class of graphs.
Barbosa, R., Cardoso, D.M.
openaire +3 more sources
Enhancing Specific Stiffness of Nano‐Architected Materials Through Generative AI and Active Learning
Advanced Science, EarlyView.A structure‐centric generative framework searches voxelated design space directly, coupling a variational autoencoder with multi‐objective optimization and active learning to progressively expand the validated design domain. The discovered nano‐architectures, realized as pyrolytic carbon by two‐photon lithography, deliver 18–23% higher stiffness and 26–
Jinwook Yeo +4 more
wiley +1 more source
Complexity, 2020 The explosion of multiomics data poses new challenges to existing data mining methods. Joint analysis of multiomics data can make the best of the complementary information that is provided by different types of data.
Ling-Yun Dai, Rong Zhu, Juan Wang
doaj +1 more source
, 2003 We address in this paper the question of how the knowledge of the marginal distribution P (x) can be incorporated in a learning algorithm. We suggest three theoretical methods for taking into account this distribution for regularization and provide ...
Hein, Matthias +8 more
core