CliqueFluxNet: Unveiling EHR Insights with Stochastic Edge Fluxing and Maximal Clique Utilisation Using Graph Neural Networks

CliqueFluxNet: Unveiling EHR Insights with Stochastic Edge Fluxing and Maximal Clique Utilisation Using Graph Neural Networks

Electronic Health Records (EHRs) play a crucial role in shaping predictive are models, yet they encounter challenges such as significant data gaps and class imbalances. Traditional Graph Neural Network (GNN) approaches have limitations in fully leveraging neighbourhood data or demanding intensive co...

Descripció completa

Dades bibliogràfiques
Autors principals:	Molaei, S, Bousejin, NG, Ghosheh, GO, Thakur, A, Chauhan, VK, Zhu, T, Clifton, DA
Format:	Journal article
Idioma:	English
Publicat:	Springer 2024

Ítems similars

Learning graph representations with maximal cliques
per: Molaei, S, et al.
Publicat: (2021)

Incarnation in Ludics and maximal cliques of paths
per: Myriam Quatrini, et al.
Publicat: (2013-10-01)

Broadcasting in Stars of Cliques and Path-Connected Cliques
per: Akash Ambashankar, et al.
Publicat: (2025-02-01)

Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques
per: Dalirrooyfard, Mina, et al.
Publicat: (2024)

Cliques and Clique Covers in Interval-Valued Fuzzy Graphs
per: Napur Patra, et al.
Publicat: (2021-06-01)

Clique percolation
per: Bollobas, B, et al.
Publicat: (2008)

Brokerage Roles between Cliques: A Secondary Clique Analysis
per: Elisa Bellotti
Publicat: (2009-04-01)

Fast algorithms for maximal clique enumeration with limited memory
per: Cheng, James, et al.
Publicat: (2013)

Viral quasispecies assembly via maximal clique enumeration.
per: Armin Töpfer, et al.
Publicat: (2014-03-01)

On clique convergence of graphs
per: S.M. Hegde, et al.
Publicat: (2016-12-01)

Computing a Clique Tree with the Algorithm Maximal Label Search
per: Anne Berry, et al.
Publicat: (2017-01-01)

An Efficient Influence Maximization Algorithm Based on Clique in Social Networks
per: Huan Li, et al.
Publicat: (2019-01-01)

Algorithmic Aspects of Some Variations of Clique Transversal and Clique Independent Sets on Graphs
per: Chuan-Min Lee
Publicat: (2021-01-01)

Young Children’s cliques: a study on processes of peer acceptance and cliques aggregation
per: Antonella Brighi, et al.
Publicat: (2015-04-01)

Edge-regular graphs with regular cliques
per: Greaves, Gary Royden Watson, et al.
Publicat: (2019)

CLIMP: Clustering Motifs via Maximal Cliques with Parallel Computing Design.
per: Shaoqiang Zhang, et al.
Publicat: (2016-01-01)

A note on simplicial cliques
per: Chudnovsky, M, et al.
Publicat: (2021)

on the number of cliques and cycles in graphs
per: Mojgan Emami, et al.
Publicat: (2013-06-01)

Inverse Clique Domination in Graphs
per: Carmelita Loquias, et al.
Publicat: (2016-12-01)

Computing cliques and cavities in networks
per: Dinghua Shi, et al.
Publicat: (2021-11-01)

Covering the Edges of a Random Hypergraph by Cliques
per: Rödl Vojtěch, et al.
Publicat: (2022-11-01)

Sufficient Conditions for Maximally Edge-Connected and Super-Edge-Connected Graphs Depending on The Clique Number
per: Volkmann Lutz
Publicat: (2019-05-01)

NK-MaxClique and MMCQ: Tow New Exact Branch and Bound Algorithms for the Maximum Clique Problem
per: Neda Mohammadi, et al.
Publicat: (2020-01-01)

On the maximal cliques in <it>c</it>-max-tolerance graphs and their application in clustering molecular sequences
per: Steigele Stephan, et al.
Publicat: (2006-05-01)

Ramsey numbers of cubes versus cliques
per: Conlon, David, et al.
Publicat: (2015)

Average-case complexity of detecting cliques
per: Rossman, Benjamin (Benjamin E.)
Publicat: (2011)

What is Ramsey-equivalent to a clique?
per: Liebenau, Anita, et al.
Publicat: (2017)

Finding cliques using few probes
per: Feige, Uriel, et al.
Publicat: (2021)

Clique covers of H-free graphs
per: Nguyen, T, et al.
Publicat: (2023)

Clique colouring of binomial random graphs
per: McDiarmid, C, et al.
Publicat: (2018)

A result on interated clique graphs /
per: 295030 Lim, Chong-Keong
Publicat: (1978)

Asymptotic Structure for the Clique Density Theorem
per: Jaehoon Kim, et al.
Publicat: (2020-12-01)

Plataformas de Fazendas de Clique:
per: Rafael Grohmann, et al.
Publicat: (2022-12-01)

Cliques of Graph Convolutional Networks for Recommendation
per: Zhenye Pan, et al.
Publicat: (2024-01-01)

Complexity results on graphs with few cliques
per: Bill Rosgen, et al.
Publicat: (2007-01-01)

Largest cliques in connected supermagic graphs
per: Anna Lladó
Publicat: (2005-01-01)

Cliques Are Bricks for k-CT Graphs
per: Václav Snášel, et al.
Publicat: (2021-05-01)

Graph Planarity by Replacing Cliques with Paths
per: Patrizio Angelini, et al.
Publicat: (2020-08-01)

Domination, Eternal Domination, and Clique Covering
per: Klostermeyer William F., et al.
Publicat: (2015-05-01)

An Introduction to Clique Minimal Separator Decomposition
per: Anne Berry, et al.
Publicat: (2010-05-01)