Skip to main content
. Author manuscript; available in PMC: 2026 Feb 19.
Published in final edited form as: Proceedings (IEEE Int Conf Bioinformatics Biomed). 2026 Jan 19;2025:5454–5462. doi: 10.1109/bibm66473.2025.11356407

Algorithm 1:

The sampling algorithm.

Input: A longitudinal dataset D consisting of visit-level records for N participants. For each participant i, a visit set is denoted as Vi=vi1,vi2,…,viTi, where Ti indicates a number of total visits, including: participant ID and baseline demographics at T=1, and cognitive impairment status, comorbidities and NPS indicators over time
Output: Set of bootstrap samples 𝓑=B1,B2,…,B100 with each dataset Bbβˆˆβ„NΓ—d
1 Initialize β„¬β†βˆ…
2 for b=1 to 100 do
  Initialize Bbβ†βˆ…
  for i=1 to N do
   Let Vi=vijj=1Ti, sorted by time
   Partition Vi=Vn(normalcognition)βˆͺVc(cognitively impaired)
   Let status siTi∈{normalcognition,cognitivelyimpaired}
   Extract xi0← baseline demographics from vi1
   if siTi=cognitivelyimpaired then
    Random sample Siβ€²βŠ‚VnβˆͺVc,Siβ€²=3,s.t.
     Siβ€²=vit1n,vit2c,vit3cvit1n,vit2n,vit3c
    Random sample SicβŠ‚Vic,Sic=3
   else
    Random sample Siβ€²βŠ‚Vin,Siβ€²=3
   end if
   Let xiβ€² disease and NPS statuses from Siβ€²
   Let xiβˆˆβ„d←concatenatexi0andxiβ€²
   Append xi to Bb
  end for
  Append Bb to ℬ
end for
3 Return ℬ