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...

Fuld beskrivelse

Bibliografiske detaljer
Main Authors:	Molaei, S, Bousejin, NG, Ghosheh, GO, Thakur, A, Chauhan, VK, Zhu, T, Clifton, DA
Format:	Journal article
Sprog:	English
Udgivet:	Springer 2024

Lignende værker

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

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

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

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

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

Clique percolation
af: Bollobas, B, et al.
Udgivet: (2008)

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

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

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

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

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

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

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

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

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

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

A note on simplicial cliques
af: Chudnovsky, M, et al.
Udgivet: (2021)

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

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

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

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

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

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

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

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

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

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

Finding cliques using few probes
af: Feige, Uriel, et al.
Udgivet: (2021)

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

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

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

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

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

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

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

Largest cliques in connected supermagic graphs
af: Anna Lladó
Udgivet: (2005-01-01)

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

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

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

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