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

Szczegółowa specyfikacja

Opis bibliograficzny
Główni autorzy:	Molaei, S, Bousejin, NG, Ghosheh, GO, Thakur, A, Chauhan, VK, Zhu, T, Clifton, DA
Format:	Journal article
Język:	English
Wydane:	Springer 2024

Podobne zapisy

Learning graph representations with maximal cliques
od: Molaei, S, i wsp.
Wydane: (2021)

Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques
od: Dalirrooyfard, Mina, i wsp.
Wydane: (2024)

Clique percolation
od: Bollobas, B, i wsp.
Wydane: (2008)

Fast algorithms for maximal clique enumeration with limited memory
od: Cheng, James, i wsp.
Wydane: (2013)

Edge-regular graphs with regular cliques
od: Greaves, Gary Royden Watson, i wsp.
Wydane: (2019)

A note on simplicial cliques
od: Chudnovsky, M, i wsp.
Wydane: (2021)

Another construction of edge-regular graphs with regular cliques
od: Greaves, Gary Royden Watson, i wsp.
Wydane: (2020)

Ramsey numbers of cubes versus cliques
od: Conlon, David, i wsp.
Wydane: (2015)

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

What is Ramsey-equivalent to a clique?
od: Liebenau, Anita, i wsp.
Wydane: (2017)

Finding cliques using few probes
od: Feige, Uriel, i wsp.
Wydane: (2021)

Clique colouring of binomial random graphs
od: McDiarmid, C, i wsp.
Wydane: (2018)

Clique covers of H-free graphs
od: Nguyen, T, i wsp.
Wydane: (2023)

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

The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques
od: Pikhurko, O, i wsp.
Wydane: (2017)

A Planted Clique Perspective on Hypothesis Pruning
od: Lin, Muyuan, i wsp.
Wydane: (2022)

Deterministic Near-Optimal Distributed Listing of Cliques
od: Censor-Hillel, Keren, i wsp.
Wydane: (2022)

On the clique number of a strongly regular graph
od: Greaves, Gary Royden Watson, i wsp.
Wydane: (2021)

Number of Cliques in Graphs with a Forbidden Subdivision
od: Lee, Choongbum, i wsp.
Wydane: (2016)

Clique size and network characteristics in hyperlink cinema
od: Krems, J, i wsp.
Wydane: (2013)

Augmenting the Delsarte bound: a forbidden interval for the order of maximal cliques in strongly regular graphs
od: Greaves, Gary Royden Watson, i wsp.
Wydane: (2022)

A complete resolution of the Keller maximum clique problem
od: Debroni, Jennifer, i wsp.
Wydane: (2013)

Lower Bounds for Recognizing Small Cliques on CRCW PRAM's
od: Beame, Paul
Wydane: (2023)

If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser
od: Abboud, Amir, i wsp.
Wydane: (2021)

On complementing unambiguous automata and graphs with many cliques and cocliques
od: Indzhev, E, i wsp.
Wydane: (2022)

Multivariate central limit theorems for random clique complexes
od: Temčinas, T, i wsp.
Wydane: (2023)

On Bunjamin's algorithm for a largest clique in a graph /
od: 303533 Rathbone, C. R., i wsp.
Wydane: (1978)

Alpha Clique Sdn. Bhd. / Nurul Hidayah Mohd Kamal
od: Mohd Kamal, Nurul Hidayah
Wydane: (2020)

The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs
od: Boix-Adserà, Enric, i wsp.
Wydane: (2022)

Chromatic number, clique subdivisions, and the conjectures of Hajos and Erdos-Fajtlowicz
od: Fox, Jacob, i wsp.
Wydane: (2021)

Chromatic number, clique subdivisions, and the conjectures of Hajos and Erdos-Fajtlowicz
od: Fox, Jacob, i wsp.
Wydane: (2012)

The Average-Case Complexity of Counting Cliques in Erdős-Rényi Hypergraphs
od: Boix-Adsera, Enric, i wsp.
Wydane: (2021)

A clique graph based merging strategy for decomposable SDPs
od: Garstka, M, i wsp.
Wydane: (2021)

Look who's talking: developmental trends in the size of conversational cliques
od: Henzi, S, i wsp.
Wydane: (2007)

Look who's talking: developmental trends in the size of conversational cliques
od: Henzi, S, i wsp.
Wydane: (2007)

P3 and beyond: solving energies with higher order cliques
od: Kohli, P, i wsp.
Wydane: (2007)

Exact inference in multi-label CRFs with higher order cliques
od: Ramalingam, S, i wsp.
Wydane: (2008)

Random cliques in random graphs and sharp thresholds for F-factors
od: Riordan, O
Wydane: (2022)

Dynamic inter-treatment information sharing for individualized treatment effects estimation
od: Chauhan, VK, i wsp.
Wydane: (2024)

Temporal dynamics unleashed: elevating variational graph attention
od: Molaei, S, i wsp.
Wydane: (2024)