MétaCan
Menu
Back to cohort
Record W4404055757 · doi:10.2196/57715

Identifying Complex Scheduling Patterns Among Patients With Cancer With Transportation and Housing Needs: Feasibility Pilot Study

2024· article· en· W4404055757 on OpenAlexvenueno aff
Allan Fong, Christian Boxley, Laura Schubel, Christopher Gallagher, Katarina E. AuBuchon, Hannah Arem

Bibliographic record

VenueJMIR Cancer · 2024
Typearticle
Languageen
FieldHealth Professions
TopicHealthcare Operations and Scheduling Optimization
Canadian institutionsnot available
FundersNational Cancer Institute
KeywordsPreprintGerontologyComputer scienceMedicineWorld Wide Web

Abstract

fetched live from OpenAlex

Background: Patients with cancer frequently encounter complex treatment pathways, often characterized by challenges with coordinating and scheduling appointments at various specialty services and locations. Identifying patients who might benefit from scheduling and social support from community health workers or patient navigators is largely determined on a case-by-case basis and is resource intensive. Objective: This study aims to propose a novel algorithm to use scheduling data to identify complex scheduling patterns among patients with transportation and housing needs. Methods: We present a novel algorithm to calculate scheduling complexity from patient scheduling data. We define patient scheduling complexity as an aggregation of sequence, resolution, and facility components. Schedule sequence complexity is the degree to which appointments are scheduled and arrived to in a nonchronological order. Resolution complexity is the degree of no shows or canceled appointments. Location complexity reflects the proportion of appointment dates at 2 or more different locations. Schedule complexity captures deviations from chronological order, unresolved appointments, and coordination across multiple locations. We apply the scheduling complexity algorithm to scheduling data from 38 patients with breast cancer enrolled in a 6-month comorbidity management intervention at an urban hospital in the Washington, DC area that serves low-income patients. We compare the scheduling complexity metric with count-based metrics: arrived ratio, rescheduled ratio, canceled ratio, and no-show ratio. We defined an aggregate count-based adjustment metric as the harmonic mean of rescheduled ratio, canceled ratio, and no-show ratio. A low count-based adjustment metric would indicate that a patient has fewer disruptions or changes in their appointment scheduling. Results: The patients had a median of 88 unique appointments (IQR 60.3), 62 arrived appointments (IQR 47.8), 13 rescheduled appointments (IQR 13.5), 9 canceled appointments (IQR 10), and 1.5 missed appointments (IQR 5). There was no statistically significant difference in count-based adjustments and scheduling complexity bins (χ24=6.296, P=.18). In total, 5 patients exhibited high scheduling complexity with low count-based adjustments. A total of 2 patients exhibited high count-based adjustments with low scheduling complexity. Out of the 15 patients that indicated transportation or housing insecurity issues in conversations with community health workers, 86.7% (13/15) patients were identified as medium or high scheduling complexity while 60% (9/15) were identified as medium or high count-based adjustments. Conclusions: Scheduling complexity identifies patients with complex but nonchronological scheduling behaviors who would be missed by traditional count-based metrics. This study shows a potential link between transportation and housing needs with schedule complexity. Scheduling complexity can complement count-based metrics when identifying patients who might need additional care coordination support especially as it relates to transportation and housing needs.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Observational · Consensus signal: Observational
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.064
Threshold uncertainty score0.995

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0010.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.137
GPT teacher head0.445
Teacher spread0.308 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designObservational
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2024
Admission routes1
Has abstractyes

Explore more

Same venueJMIR CancerSame topicHealthcare Operations and Scheduling OptimizationFrench-language works237,207