Results 81 to 90 of about 4,703 (164)

Developing a novel causal inference algorithm for personalized biomedical causal graph learning using meta machine learning

BMC Medical Informatics and Decision Making
Background Modeling causality through graphs, referred to as causal graph learning, offers an appropriate description of the dynamics of causality.
Hang Wu, Wenqi Shi, May D. Wang
doaj   +1 more source

Multi-Attribute Graph Estimation With Sparse-Group Non-Convex Penalties

IEEE Access
We consider the problem of inferring the conditional independence graph (CIG) of high-dimensional Gaussian vectors from multi-attribute data. Most existing methods for graph estimation are based on single-attribute models where one associates a scalar ...
Jitendra K. Tugnait
doaj   +1 more source

A method for quantifying the generalization capabilities of generative models for solving Ising models

Machine Learning: Science and Technology
For Ising models with complex energy landscapes, whether the ground state can be found by neural networks depends heavily on the Hamming distance between the training datasets and the ground state.
Qunlong Ma, Zhi Ma, Ming Gao
doaj   +1 more source

NAPE: Numbering as a Position Encoding in Graphs

IEEE Access
Deep learning has been instrumental in feature extraction from various data types, such as images and sequences, which inherently possess oriented structures.
Olayinka Ajayi, Hongkai Wen, Tanaya Guha
doaj   +1 more source

Correcting a Graph Into a Linegraph Minimizing Hamming Distance Edition Is NP-Complete and FPT by Treewidth

Journal of Graph Algorithms and Applications
Since Beineke's work in 1968 on linegraphs, attention has focused on the classification of graphs as linegraphs. It is known that every graph $G$ is the linegraph of an hypergraph, and the question is to characterize that root graph.
Dominique Barth, Dimitri Watel, Marc-Antoine Weisser   +2 more
doaj   +1 more source

Endomorphisms of The Hamming Graph and Related Graphs

, 2016
In this paper we determine all singular endomorphisms of the Hamming graph and other related graphs. The Hamming graph has vertices $\mathbb{Z}^{m}_n$ where two vertices are adjacent, if their Hamming distance is $1$. We show that its singular endomorphisms are uniform (each kernel has the same size) and that they are induced by Latin hypercubes (which
openaire   +2 more sources

CARGO: A Cytometry Analysis framework via Regularized Graph Optimal-transport. [PDF]

PLoS Comput Biol
Shemonti AS, Gmyrek GB, Quintelier KLA, Van Gassen S, Saeys Y, Willemsen M, Aerts JGJV, Madsen EVE, Robinson JP, Pothen A, Rajwa B.   +10 more
europepmc   +1 more source

Builder-Blocker Mutual-Visibility Game. [PDF]

Bull Malays Math Sci Soc
Chenoweth VI, Klavžar S, Rus G, Tan E, Tian J.   +4 more
europepmc   +1 more source

From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem. [PDF]

Algorithmica
Eiben E, Ganian R, Kanj I, Ordyniak S, Szeider S.   +4 more
europepmc   +1 more source

Sierpiński graphs as spanning subgraphs of Hanoi graphs

Open Mathematics, 2013
Hinz Andreas, Klavžar Sandi, Zemljič Sara   +2 more
doaj   +1 more source