Search

Care coordination failures include missed referrals, lost follow-ups, fragmented communication, and incomplete transitions between primary and specialty care. These failures can delay diagnosis, weaken continuity, and increase avoidable utilisation. Existing detection approaches often depend on manual review, retrospective audits, or simple rule-based flags. Such approaches are poorly suited to capture the relational complexity of patient, provider, referral, messaging, and encounter networks. This article develops a conceptual graph-based machine learning model for predicting care coordination failures. The model represents patient–provider referral networks enriched with follow-up status, patient message activity, specialty access delays, and provider communication patterns. The proposed approach uses a heterogeneous graph neural network in which patients and providers are nodes. Referral, encounter, and messaging relationships are represented as edges, while node and edge features encode follow-up adherence, message frequency, wait-time signals, and communication context. Conceptually, the model would identify high-risk referral edges that combine delayed access, incomplete follow-up, weak messaging activity, or limited provider communication. These predictions would support coordinator review before a referral becomes a documented care gap. A graph-based model could shift care coordination from reactive tracking toward predictive prevention. By identifying fragile referral relationships early, it could support more timely outreach and safer continuity of care.

Care fragmentation is a silent driver of adverse outcomes because it distributes responsibility for a patient’s care across multiple providers, settings, and transitions. It is often recognized only after duplication, missed follow-up, or contradictory management has already occurred. Fragmentation unfolds through networks of providers, referrals, encounters, and unresolved care tasks. Conventional prediction models often treat these events as independent patient-level variables rather than as relational patterns embedded in a care system. This article develops a conceptual graph neural network model for predicting the likelihood of fragmented care episodes. The proposed model uses provider networks, encounter sequences, referral patterns, cross-setting utilization, and unresolved care gap indicators as an integrated graph representation. A heterogeneous graph is constructed with patient and provider nodes, while edges represent encounters, referrals, shared patients, cross-setting transitions, and unresolved care gaps. A graph neural network learns patient embeddings from this relational structure and produces a fragmentation risk score for each patient-period. Conceptually, the model would identify patients at elevated risk of fragmentation, such as those moving across many disconnected providers, receiving repeated referrals, or accumulating open follow-up tasks. These signals could support earlier care coordination before avoidable gaps widen into adverse outcomes. The relational lens of graph neural networks could transform fragmentation prediction from a static risk scoring task into a network-aware early-warning system. Such a model would be expected to help health systems detect fragmented care episodes before they become operationally and clinically consequential.

Hospital congestion is an interconnected operational phenomenon in which local delays can cascade across emergency, inpatient, diagnostic, pharmacy, and consultative services. Prediction has often been organized around individual departments rather than the hospital as a coupled system. Current forecasting approaches do not sufficiently represent dynamic dependencies among units, including patient transfers, service requests, staffing availability, and real-time capacity. This limits their ability to anticipate how pressure in one department could propagate into another. This article proposes a temporal graph transformer for forecasting interdepartmental workflow congestion across a hospital network. The model is designed to learn from time-varying departmental relationships and produce forward-looking congestion estimates for operational decision support. The proposed framework represents hospital units as graph nodes annotated with capacity, queue, and staffing signals. Directed edges are weighted by patient movement and service request dependencies, and a temporal graph transformer processes graph sequences to estimate future congestion probabilities for each unit. Conceptually, the model would be expected to identify building pressure before it appears as visible delay. Such forecasts could support proactive coordination, including staff redeployment, transfer prioritization, and service sequencing. A graph-based temporal perspective could shift hospital congestion management from reactive firefighting toward coordinated, predictive flow control. The proposed model provides a conceptual foundation for future prospective evaluation in real-time operational settings.