Next Article in Journal
Real-Time Structural Illumination with Hyperspectral Images: A Tunable Projection–Capture Synchronizer for Three-Phase Demodulation on Embedded Heterogeneous Computing Platforms
Previous Article in Journal
Identification of Acoustic Emission Spectrograms from Limestone Fracturing Based on a Novel Deep Learning Model
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

CogCBR: A Complete Case-Based Reasoning Framework for Wearable-Sensor-Based Gait Screening of Neurodegenerative Diseases

by
Huayue Liu
1,
Yujia Sun
2,
Lihua Luo
1,
Xingeng Li
1,* and
Huanghe Zhang
1,*
1
The Center for Robotics, School of Control Science and Engineering, Shandong University, Jinan 250100, China
2
School of Qilu Transportation, Shandong University, Jinan 250100, China
*
Authors to whom correspondence should be addressed.
Sensors 2026, 26(13), 4158; https://doi.org/10.3390/s26134158
Submission received: 25 May 2026 / Revised: 24 June 2026 / Accepted: 29 June 2026 / Published: 1 July 2026
(This article belongs to the Section Wearables)

Abstract

Wearable force-sensitive insoles enable quantitative gait analysis as a screening aid for neurodegenerative diseases (NDDs), yet prevailing machine learning pipelines give point predictions with no per-case reliability estimate, no intrinsic explanation, and no way to curate their own knowledge base. Case-Based Reasoning (CBR) mirrors clinical reasoning, but deployed healthcare CBR systems typically implement only partial R4 cycles, omitting Revise and Retain. We propose CogCBR, a sensor-driven framework that operationalizes the complete R4 cycle—Retrieve, Reuse, Revise, Retain—for gait-based NDD screening within Richter’s four knowledge containers, pairing weighted case retrieval with confidence-based clinical triage and a label-verified case-base maintenance policy. On the PhysioNet GaitPDB cohort, CogCBR attains an AUC of 0.861—statistically on par with the strongest tuned baseline under matched tuning, yet the only method evaluated that also provides confidence-based triage, case-based explanation, and longitudinal case-base maintenance, the last validated in a deployment-style streaming simulation. An independent-cohort evaluation on GaitNDD yields an AUC of 0.902; under a stricter cross-modality transfer, however, CogCBR does not exceed the strongest classical baseline, which is also reported. With sub-millisecond inference and a compact footprint, CogCBR suits resource-constrained wearable and edge-health platforms. Prospective longitudinal clinical evaluation and validation in pre-clinical cohorts are left as future work.

1. Introduction

Neurodegenerative diseases (NDDs) impose one of the largest and fastest-growing public-health burdens worldwide. Dementia alone affects more than 55 million people globally, and Parkinson’s disease (PD) is estimated to affect approximately 10 million, with prevalence projected to roughly double by 2050 as populations age [1]. Early detection is clinically critical because disease-modifying interventions are most effective when initiated before substantial neuronal loss has occurred [1]. Of particular practical importance is the well-documented fact that motor manifestations, most notably impairments of gait, frequently precede formal diagnosis by several years [2,3,4]. This temporal window between sub-clinical motor change and clinical confirmation defines an attractive opportunity for sensor-based screening support. We emphasise, however, that the cohorts evaluated in this paper consist of patients with established NDD diagnoses (e.g., Hoehn & Yahr stages 2–3) rather than pre-clinical or at-risk subjects, so the present study evaluates gait-based screening support and classification of established NDD-related gait patterns, not pre-symptomatic diagnosis. Demonstrating utility for true early detection would require dedicated pre-clinical cohorts and longitudinal follow-up, which we leave to future work.
Recent advances in low-cost wearable sensing have made quantitative gait analysis a practical screening modality. Force-sensitive insoles instrumented with arrays of piezoresistive transducers and sampled at the centimeter–millisecond scale (typically 100 Hz) produce rich vertical ground-reaction-force (GRF) signals, from which clinically interpretable biomarkers such as stride-to-stride variability, gait-phase timing, inter-limb asymmetry, and stride regularity can be derived [5,6]. Building on such sensor data, machine learning pipelines have progressed from hand-crafted spatial–temporal features classified by linear discriminants [7] and ensemble methods [8], to deep models trained directly on raw GRF time series [9,10]. Although these approaches have steadily improved classification accuracy, they share three limitations that consistently obstruct clinical deployment of sensor-driven screening systems.
CH1: Lack of intrinsic, case-grounded explanations. Clinicians require not only a prediction but a rationale that can be verified against domain expertise [11]. Most sensor-based gait classifiers expose only a scalar decision and cannot be inspected as patient evidence; post hoc methods such as SHAP [12] and LIME [13] approximate an opaque model rather than ground decisions in prior patients with similar gait profiles, leaving clinicians without a transparent footing to endorse or override a prediction.
CH2: Absence of per-prediction reliability assessment. Existing sensor-based screening models report only aggregate metrics (accuracy, AUC, F1) and offer no mechanism for indicating when an individual prediction should not be trusted. In a screening setting, where the costs of a missed early diagnosis and an unnecessary specialist referral are asymmetric, there is no principled way to flag ambiguous cases for expert review or to restrict automated decisions to confident predictions.
CH3: No mechanism for sustained case-base curation as new sensor data accumulate. Sensor-driven clinical pipelines are inherently longitudinal: as new patient recordings arrive, the underlying knowledge should be refined accordingly. Current pipelines either retrain monolithically (incurring substantial cost and risking concept-drift instability) or accept new data uncritically (introducing label noise and self-confirmation bias). Neither strategy provides a principled way to identify low-quality recordings and either rescue them through expert relabeling or retire them.
Case-Based Reasoning (CBR) [14,15] offers a natural framework that addresses CH1–CH3 simultaneously. The R4 cycle, namely Retrieve, Reuse, Revise, and Retain, closely mirrors clinical reasoning: physicians recall similar prior patients, adapt previous assessments, evaluate confidence in their conclusion, and update experiential knowledge as new patients are seen [16,17]. Crucially, every CBR prediction carries an intrinsic explanation in the form of the retrieved cases and the features driving similarity, addressing CH1 directly [18,19]; the Revise stage formally evaluates prediction reliability and routes uncertain cases for expert review, addressing CH2; and the Retain stage curates the case base over time under an explicit quality model, addressing CH3. In practice, however, most deployed healthcare CBR systems have stopped at Retrieve and Reuse [20,21,22]; that is, CBR has typically been used as a similarity-based classifier rather than as a complete reasoning cycle. The Revise and Retain containers, which are precisely the components that would close CH2 and CH3, have remained on the methodological shelf in clinical practice.
A complementary view of completeness is given by the four knowledge containers of Richter [23]: vocabulary (features describing cases), similarity (how cases are compared), case base (the stored experience), and adaptation (how stored solutions are transferred). Because these containers are interchangeable, a well-curated case base reduces the need for elaborate adaptation knowledge. In clinical screening, where explicit adaptation rules are difficult to elicit, this trade-off motivates investing in similarity (Retrieve) and case-base curation (Retain) while keeping adaptation lightweight—a perspective we adopt explicitly in CogCBR.
To address CH1–CH3, we propose CogCBR (Cognitive CBR), a sensor-driven CBR framework that implements the complete R4 cycle for gait-based NDD screening from wearable force-sensitive insoles. CogCBR is framed throughout by the four knowledge containers and instantiates each stage of the R4 cycle with components well established in the CBR literature: mutual-information (MI) feature selection together with Random Forest (RF)-weighted k-NN retrieval (Retrieve, addressing CH1 by anchoring decisions in retrieved prior patients), inverse-distance weighted voting that yields a continuous probability (Reuse), entropy-based confidence estimation that flags low-certainty predictions for specialist review (Revise, addressing CH2), and competence-based maintenance under an explicit augmentation policy that admits only label-verified cases (Retain, addressing CH3). The novelty lies not in any individual operator but in their principled integration into a single sensor-driven pipeline, closed by a triage and augmentation policy that links confident predictions, expert review, and case storage. Figure 1 illustrates the complete CogCBR pipeline.
The main contributions of this paper are summarized as follows:
  • We propose a complete, clinically grounded R4 CBR cycle for wearable-sensor-based NDD screening support. To the best of our knowledge, CogCBR is the first system in this domain to operationalize the Revise and Retain containers jointly with Retrieve and Reuse, closing the loop between automated screening, expert review, and longitudinal case-base curation.
  • We design an entropy-based confidence-driven triage mechanism that supports a coverage-vs.-accuracy trade-off appropriate for clinical workflows, and pair it with a conservative case-base augmentation policy that admits only label-verified cases (confident self-predictions confirmed at clinical follow-up, or low-confidence cases adjudicated by a specialist), preventing label noise and self-confirmation bias. At τ = 0.1 , CogCBR retains 68.7% of predictions with accuracy improving from 80.0% to 87.3% on PhysioNet GaitPDB. We validate the longitudinal behavior of this policy in a deployment-style streaming simulation (Section 4.8), in which the label-verified rule avoids the label-noise accumulation of naive self-training and matches an all-true-label no-curation reference while bounding case-base growth.
  • We conduct quantitative comparison against 16 baselines, comprising 14 generic ML/DL methods and two re-implemented domain-specific gait-classification pipelines [7,8], under stratified 10-fold cross-validation on PhysioNet GaitPDB and an independent-cohort reproducibility evaluation on GaitNDD. CogCBR attains AUC = 0.861 on GaitPDB and AUC = 0.902 on GaitNDD, achieving competitive performance on both datasets—statistically on par with the strongest tuned baselines on GaitPDB under a matched-tuning comparison (Section 4.3). Under a stricter cross-modality source-to-target transfer (train on GaitPDB, test on GaitNDD), CogCBR does not exceed the strongest classical baseline; this source-to-target result is reported in Section 4.9.
  • We profile the computational cost and deployment footprint of CogCBR against representative baselines. With 0.080 ms per-sample inference latency and an 8.4 KB deployment payload, CogCBR is well-suited to wearable-sensor and edge-health scenarios in which storage, latency, and interpretability are simultaneously constrained.
  • We deliver intrinsic, case-based explanations grounded in clinically interpretable sensor-derived features. Each prediction is accompanied by the retrieved similar patients, the gait features driving similarity, and the direction of clinical deviation.
The remainder of this paper is organized as follows. Section 2 reviews related work on CBR for clinical decision support, CBR for movement disorders, and sensor-based gait screening for PD. Section 3 describes the materials and methods, including the GaitPDB and GaitNDD datasets, the sensor acquisition and signal-processing pipeline, the four knowledge containers of CogCBR, the experimental protocol, and the baselines. Section 4 reports the experimental results on GaitPDB and GaitNDD, the Revise-stage triage analysis, the computational-cost profiling, and the system-component ablation. Section 5 discusses the implications of the findings, statistical caveats, and the limitations of the present cross-sectional study. Finally, Section 6 concludes the paper and outlines directions for future work.

2. Related Work

2.1. CBR for Clinical Decision Support and the Four Knowledge Containers

CBR has a long history of application in medical and health-science domains [16,17,21,24]. The R4 cycle [14,20,25] parallels clinical decision-making: physicians recall prior patients, adapt previous assessments, verify outcomes, and update their experiential knowledge accordingly. As Watson [25] argued, CBR is fundamentally a methodology for problem solving rather than merely a classification technique.
The four knowledge containers of Richter [23] provide a complementary view of CBR system design. Because the containers are interchangeable, strengthening the case base reduces the need for complex adaptation, and inverse-distance weighted reuse over an appropriate similarity measure becomes sufficient [26]. This trade-off directly informs CogCBR’s design: we invest in vocabulary (MI feature selection), similarity (RF-weighted distance), and case-base (competence-based maintenance) while keeping adaptation lightweight (inverse-distance voting). The motivation is pragmatic: explicit adaptation rules are difficult to elicit in clinical settings, whereas vocabulary, similarity, and case-base quality can each be operationalized from sensor data.
CBR explanations are intrinsic: the retrieved cases themselves constitute the explanation, and the similarity features provide a clinically grounded vocabulary [18,19,27]. This is structurally distinct from feature-attribution methods such as SHAP [12] and LIME [13], which approximate the behavior of an opaque model post hoc: CogCBR’s explanations are exemplar-based explanations rooted in the actual reasoning process, in the tradition of CBR explanation work [18,19,27].
Our exemplar-based explanations can also be situated within the broader landscape of explainable medical AI. Prototype-learning networks such as ProtoPNet [28] and deep prototype models for case-based reasoning [29] learn a set of representative prototypes and classify a query by its similarity to them, echoing the case-based intuition but requiring end-to-end representation learning; nearest-neighbor and exemplar-retrieval techniques for neural-network explainability [27] instead attach example-based justifications to an already-trained opaque model. A recurring argument across this literature is that, for high-stakes clinical decisions, inherently interpretable models are preferable to post hoc explanations of black-box predictors [30]. CogCBR sits at the inherently-interpretable end of this spectrum: its exemplars are actual prior patients rather than learned latent prototypes, so each explanation is faithful to the retrieval-and-voting process by construction and requires no separately trained explanation model.

2.2. CBR for Parkinson’s Disease and Movement Disorders

Several prior systems have applied CBR to clinical diagnosis and, more recently, to PD. Begum et al. [21] surveyed CBR in the health sciences and noted that, although CBR is well-suited to clinical reasoning, most deployed systems implement only Retrieve and Reuse. Marling and Whitehouse [31] applied CBR to care planning for Alzheimer’s disease patients, demonstrating case retrieval over patient records. Saraiva et al. [22] proposed a hybrid CBR/rule-based reasoning system for the early diagnosis of gastrointestinal cancer, but did not include systematic confidence assessment or case-base maintenance. A common pattern across these systems is a focus on retrieval and reuse with limited attention to revision (confidence assessment) and retention (competence-based curation), precisely the gap that CogCBR addresses.
Beyond classification accuracy, the CBR literature has produced principled techniques for the Revise and Retain containers that have rarely been operationalized in deployed clinical systems. Smyth and McKenna [32] formalized competence models for case-base maintenance; Smyth and Keane [33] introduced competence-preserving forgetting; Leake and Wilson [34] categorized maintenance dimensions; and Delany et al. [35] studied case-base editing for noise reduction. CogCBR draws on this body of work to instantiate Retain in a clinical screening pipeline driven by wearable-sensor data.

2.3. Sensor-Based Gait Screening for Parkinson’s Disease

Quantitative gait analysis has emerged as a promising sensor-based biomarker for NDDs. Hausdorff et al. [5,36] demonstrated that stride-to-stride variability measures derived from foot-worn force sensors distinguish NDD patients from healthy controls. Subsequent work has explored temporal, spectral, and nonlinear-dynamics features derived from force-sensitive insoles and inertial measurement units [3,6]. Machine learning approaches have progressed from spatial–temporal feature classifiers [7] and ensemble methods [8] to deep learning on the raw sensor time series [9,10]. These models typically optimize classification accuracy alone, leaving the question of when to trust a prediction unaddressed and providing no mechanism for curating the case base as new sensor recordings accumulate. To enable a direct quantitative comparison rather than the merely descriptive comparison common in this literature, we re-implement the published pipelines of Wahid et al. [7] and Rehman et al. [8] as baselines (Section 3.9), in addition to 14 generic ML/DL methods. More broadly, methodological experience from adjacent wearable- and physiological-sensing domains is directly relevant to the design choices made here. In smart-insole-based human-activity recognition, D’Arco et al. [37] show that careful feature selection over combined plantar-pressure and inertial channels improves classification robustness while reducing dimensionality on exactly the sensor modality used here; and in multimodal physiological-signal analysis, Iranfar et al. [38] combine feature selection, outlier detection, imputation, and classification to cope with the missing-data and sensor-variability problems that also arise in wearable gait recordings. These works reinforce the feature-engineering, feature-selection, and quality-control choices in CogCBR’s vocabulary and case-base containers.

3. Materials and Methods

CogCBR implements the complete CBR cycle [14] for gait-based NDD screening. We describe the design through Richter’s four knowledge containers: vocabulary (Section 3.1 and Section 3.2), similarity (Section 3.3), adaptation (Section 3.4), and the case base together with its quality maintenance (Section 3.6). Section 3.9 then details the experimental protocol used to evaluate the framework.

3.1. Clinical Case Representation (Vocabulary Container)

Sensor Data and Datasets

We use the Gait in Parkinson’s Disease (GaitPDB) database from PhysioNet [6] as the primary dataset, and the Gait in Neurodegenerative Disease (GaitNDD) database, also from PhysioNet, as an independent validation cohort. GaitPDB comprises 66 PD patients (Hoehn & Yahr stages 2–3) and 49 age-matched healthy controls (115 subjects in total). Each subject walked at a self-selected pace on level ground while wearing bilateral force-sensitive insoles; each insole contains eight piezoresistive pressure transducers that record the vertical ground reaction force at 100 Hz. The PhysioNet records also include per-foot total forces (in newtons). We primarily use the left-foot total force, the right-foot total force, and their sum (the bilateral total force) as the basis for gait-event detection and feature extraction, because these channels most stably reflect limb loading, heel strike, and toe-off events during walking. Each subject contributes a single feature vector to the case base, so cross-validation splits are at the subject level by construction.

3.2. Sensor Acquisition and Signal-Processing Pipeline

Figure 2 summarizes the sensor-to-feature pipeline that converts raw force-sensitive-insole signals into the case representation used by CogCBR. The pipeline comprises five stages: signal conditioning, gait-event segmentation, feature extraction, quality control, and case representation.
Signal conditioning. Each raw recording is parsed line by line. Rows with anomalous formatting or insufficient columns are discarded, and recordings with no valid samples or with too few samples to support stride-level analysis are excluded. Let F L ( t ) and F R ( t ) denote the total vertical GRF under the left and right foot, respectively, and let F T ( t ) = F L ( t ) + F R ( t ) denote the bilateral total force. A bandpass filter is applied to suppress high-frequency sensor noise and low-frequency baseline drift before further processing.
Gait-event segmentation. To detect gait events robustly across subjects with different body weights and walking styles, we adopt an adaptive amplitude threshold derived from each subject’s own signals. A foot is considered to be in contact with the ground when its total force exceeds 20% of its mean force, i.e., F L ( t ) > 0.2 F ¯ L and F R ( t ) > 0.2 F ¯ R . Rising edges of the resulting binary contact signal are taken as candidate heel-strike events and falling edges as candidate toe-off events. The stride interval for each foot is computed as the time between consecutive heel-strikes of the same foot. To suppress spurious events caused by noise or partial foot lifts, only physiologically plausible stride intervals between 0.4 s and 3.0 s are retained. The double-support phase is estimated as the proportion of samples in which both feet are in contact simultaneously.
Feature extraction. From the segmented signals, we extract 41 features organized in five clinically interpretable categories:
  • Force statistics (15 features): mean, standard deviation, coefficient of variation (CV), skewness, and kurtosis of the left-foot, right-foot, and total force signals, characterizing plantar load magnitude and its variability.
  • Asymmetry measures (3 features): force asymmetry index, left–right force ratio, and inter-foot phase synchronization, capturing the gait asymmetry commonly observed in PD.
  • Stride dynamics (9 features): mean stride interval, stride variability (CV), cadence, stride asymmetry, left and right stride CV, autocorrelation at lag 1, and separate left/right stride regularity measures, reflecting rhythmic stability of walking.
  • Gait phase and spectral features (13 features): stance percentage, swing percentage, double-support percentage, swing-to-stance ratio, dominant frequency, spectral entropy, harmonic ratio, stride regularity, step regularity, sample entropy, and stride irregularity, describing phase structure, periodicity, and signal complexity.
  • Walking speed (1 feature): self-selected gait velocity from the clinical metadata.
Each feature has a known physiological interpretation and an established association with NDD pathology [3,4], and each is directly derivable from the wearable-sensor signal stream.
Quality control. Missing feature values caused by short recordings, anomalous segments, or failed event detection are imputed with the per-feature median. Features that are entirely missing or have zero variance after imputation are removed. Because subsequent CBR retrieval depends on distance computation, all retained features are standardized (z-score) before similarity calculation, so that scale differences do not dominate the distance.
Case representation. After this pipeline, the raw force-sensor stream of each subject is reduced to a low-dimensional, clinically interpretable case vector spanning the loading, asymmetry, stride-variability, rhythm, double-support, and signal-complexity changes that characterize NDD gait. Compared with raw high-dimensional time-series input, this representation preserves clinical meaning while remaining well-matched to small-sample CBR retrieval, explanation, and confidence estimation.

Case Structure

Each case c = ( x , y , m ) comprises a feature vector x R d (with d = 18 after MI selection), a class label y { PD , Control } , and optional clinical metadata m. The metadata field m carries contextual information that is excluded from the similarity computation but preserved for clinical interpretation; concretely, m may include age, sex, height, weight, body-mass index, recording site, recording date, walking-trial protocol (overground/treadmill/dual-task), and, where available, disease subtype and Hoehn & Yahr stage. The metadata is displayed alongside retrieved neighbors in the explanation output (Section 3.7) so that clinicians can flag demographic mismatches between the query and its neighbors, but is excluded from the distance computation to prevent retrieval being biased by demographic confounders.

3.3. Retrieve (Similarity Container)

The Retrieve stage identifies relevant prior cases via two phases that operate in different knowledge containers: vocabulary refinement (MI feature selection) and similarity weighting (RF-weighted distance).

3.3.1. Mutual Information Feature Selection

We apply mutual information (MI) [39] as a univariate filter to select the most discriminative gait features. For each feature x j we compute MI ( x j ; y ) and retain the top n features by MI score ( n = 18 , determined by grid search over n [ 5 , 41 ] ; see Section 4.11). This reduces the feature space from 41 to 18 dimensions, mitigating the curse of dimensionality that is particularly acute in small-sample CBR [40]. For the primary experiments, we report a fixed-parameter protocol used throughout the main comparison; the optimism that may arise from selecting the MI feature count on the evaluation folds is acknowledged as a methodological caveat in Section 5.

3.3.2. RF-Weighted k-NN Retrieval

Given a query case q, we retrieve the k nearest neighbors [41,42] from the case base CB using a weighted Euclidean distance:
d w ( q , c ) = i = 1 d w i ( q i c i ) 2
where w i is the importance weight of feature i, derived from a Random Forest (RF) classifier [43] (100 trees) trained on the case base.

3.3.3. Justification for Random Forest Weights

Wettschereck et al. [44] review feature-weighting methods for instance-based learners along three axes: (i) wrapper vs. filter, (ii) global vs. local, and (iii) supervised vs. unsupervised, and observe that supervised global wrappers tend to outperform filter-only weights when features differ in scale and relevance. Among supervised options (information-theoretic weights, conditional entropy, gain ratio, RELIEF, and ensemble-based importances), we adopt RF-derived importance for three reasons. (1) It is a supervised, global, multivariate estimator that captures feature interactions, complementing the univariate MI filter. (2) It is robust to small samples and to the mixed monotonic/non-monotonic feature–label relationships present in gait data (e.g., walking speed is strongly monotonic with the label, while harmonic ratio interacts with stride dynamics). (3) It is stable under bootstrap resampling, important for the 10-fold protocol in which weights are recomputed per fold. We additionally compare against alternatives (Cosine, Manhattan, plain Euclidean, NCA) in Section 4.11, where RF-weighted Euclidean is the strongest empirically.

3.4. Reuse (Adaptation Container: Distance-Weighted Voting)

Adaptation in CogCBR is intentionally lightweight: a strong vocabulary, similarity measure, and case base together reduce the need for elaborate adaptation knowledge [23,26]. The Reuse stage adapts the solutions of the retrieved cases via inverse-distance weighted (IDW) voting, in which closer neighbors exert greater influence:
P ( PD q ) = c i N k ( q ) [ y i = PD ] d w ( q , c i ) + ϵ c i N k ( q ) 1 d w ( q , c i ) + ϵ
where N k ( q ) denotes the k nearest neighbors of q and ϵ = 10 8 prevents division by zero. IDW voting yields the continuous probability estimates required by the entropy-based confidence in the Revise stage (Section 3.5).

3.5. Revise (Confidence-Based Clinical Triage)

CogCBR quantifies prediction reliability through an entropy-based confidence score. For predicted probability p = P ( PD q ) :
confidence ( q ) = 1 + p log 2 p + ( 1 p ) log 2 ( 1 p )
Confidence ranges from 0 (maximum uncertainty, at  p = 0.5 ) to 1 (complete certainty). Cases falling below a configurable threshold τ are flagged for specialist review rather than receiving an automated classification, so that confident predictions support screening decisions while uncertain cases are routed to a human expert. We emphasize that τ is a deployment-time parameter; the values reported in Section 4.4 sweep τ for descriptive purposes and should not be read as the recommended operating point of a deployed system, which would require independent calibration on a target cohort.

3.6. Retain (Case-Base Container Under an Augmentation Policy)

The Retain stage maintains case-base quality [33,34,35]. Following Smyth and McKenna [32], we compute a competence score for each case c:
competence ( c ) = | { q : c N k ( q ) y ^ ( q ) = y ( q ) } | | { q : c N k ( q ) } |
which is the fraction of correct predictions among all queries for which c was retrieved as a neighbor. Cases with high competence (≥0.7) are confirmed as valuable; low-competence cases (<0.3) become candidates for review or removal, as they may correspond to noisy recordings or borderline subjects. These thresholds (0.7/0.3) define the operational maintenance policy of the Retain stage; in Section 4.7, we additionally report finer descriptive bins (0.8/0.5) to summarize the static competence distribution, but those bins do not constitute a separate Retain policy.
Case-base augmentation policy. A key design question is when, and under what conditions, the case base is augmented during the cycle. CogCBR adopts a deliberately conservative policy:
  • Outside individual reasoning cycles, periodic competence maintenance is run over the current case base. Cases with competence <0.3 are flagged for clinical review rather than silently removed, and the final removal/retention decision is approved by a specialist. This separation, with maintenance batched outside the per-query cycle, follows the architectural distinction emphasized by Leake and Wilson [34].
  • Confident predictions ( γ τ ) are not added to the case base on their own. Without ground truth they could only reinforce existing biases (a self-training pathology). Such queries enter the case base only after their label has been confirmed at clinical follow-up.
  • Low-confidence predictions ( γ < τ ) are routed to a specialist via the Revise stage. The specialist’s adjudication supplies the ground-truth label, after which the case is added to the case base. This is the primary mechanism by which the case base grows in deployment, since Revise actively surfaces precisely those cases that the current case base does not yet cover well.
This policy aligns Retain with the knowledge-container view: the case base is updated only with cases whose label is reliable, and Revise’s triage decides which queries are worth eliciting expert labels for. The dashed feedback arrow in Figure 1 corresponds exactly to this update path. We validate the longitudinal effect of this policy in a deployment-style streaming simulation (Section 4.8) that goes beyond the cross-sectional evaluation reported here; prospective clinical validation remains future work.

3.7. Clinical Explanation Output

Following the goals of explanation in CBR [18,19], CogCBR generates a structured explanation containing (i) the k most similar cases together with their labels and distances; (ii) the top three features contributing most to each similarity, identified by w i | q i c i | ; and (iii) the direction of deviation (higher/lower). A representative explanation reads: “Patient X has gait patterns similar to previous PD cases Y and Z, with reduced walking speed and increased stride variability.” The explanation is thus grounded in clinically interpretable sensor-derived features and in actual prior patients, rather than in a learned attribution model.

3.8. Algorithmic Summary

Algorithm 1 summarizes the complete CogCBR pipeline.
Algorithm 1 CogCBR Pipeline.
Require: 
Query q, case base CB , MI feature set F , RF weights w , neighborhood size k, confidence threshold τ
Ensure: 
Prediction y ^ , confidence γ , explanation E, augmentation flag a
  1:
Retrieve. Select MI features: q q [ F ]
  2:
Compute d w ( q , c ) for all c CB {Equation (1)}
  3:
N k k cases with smallest d w
  4:
Reuse.  p weighted vote over N k {Equation (2)}
  5:
y ^ [ p 0.5 ] {binary class prediction}
  6:
Revise.  γ 1 + p log 2 p + ( 1 p ) log 2 ( 1 p ) {Equation (3)}
  7:
if  γ < τ  then
  8:
    Flag for clinical review; a  await_specialist_label
  9:
else
10:
     a  await_followup_confirmation
11:
end if
12:
Explain.  E
13:
for  c i N k  do
14:
     top 3 3 features with largest w j | q j c i , j |
15:
     E E { ( c i , y i , d w , top 3 ) }
16:
end for
17:
Retain (offline batch). Periodically recompute Equation (4); flag low-competence cases for specialist review; admit query q into CB only once its label has been confirmed (per a).
18:
return  y ^ , γ , E, a

3.9. Experimental Protocol

3.9.1. Datasets

GaitPDB [6] comprises 115 subjects (66 PD, 49 controls) with ground-reaction force recorded by bilateral force-sensitive insoles at 100 Hz, as described in Section 3.1; the classification task is binary PD vs. Control. GaitNDD comprises 55 subjects (20 Huntington’s disease, 16 controls, 13 ALS, 6 PD) with stride-interval data from PhysioNet and is used here as an independent-cohort reproducibility cohort (within-cohort 10-fold CV; see Section 4.9 for the distinction from a strict source-to-target transfer experiment). The classification task on GaitNDD is binary any-NDD vs. Control (39 vs. 16 subjects), consistent with the screening framing of GaitPDB; multi-class subtype classification (PD/HD/ALS) is not attempted because the per-subtype sample sizes (notably n PD = 6 ) are too small to support reliable subtype-specific evaluation.

3.9.2. Cross-Validation Protocol

We employ stratified 10-fold cross-validation with a fixed random seed (42) for reproducibility. Each subject contributes a single feature vector and appears in exactly one fold, so within-subject leakage is impossible by construction. On each fold, the training partition (∼103 subjects on GaitPDB) serves as the CogCBR case base, and the RF feature weights are recomputed on the training partition only.
For the primary experiments, we report the fixed-parameter protocol used throughout the main comparison. The optimism that may arise from selecting the MI feature count and neighborhood size on the evaluation folds is acknowledged as a methodological caveat in Section 5; we additionally quantify it directly in a nested cross-validation audit (Section 4.3), which recomputes median imputation, standardization, MI ranking, RF feature-weight estimation, and the selection of n and k strictly inside each training fold.

3.9.3. Baselines

We compare CogCBR against three groups of baselines.
Group A: 10 traditional ML methods. Logistic Regression, SVM (RBF and Linear kernels), Random Forest, XGBoost [45], GBM, Decision Tree, k-NN ( k = 5 ), MLP, and Naive Bayes (default scikit-learn [46] hyperparameters; features standardized). We deliberately use defaults to limit researcher degrees of freedom on the baseline side; the implication is a tuning asymmetry against CogCBR (whose k, n, and distance metric are tuned, Section 4.11), which we discuss in Section 5.
Group B: 4 deep learning baselines. Deep MLP (128–64–32, BatchNorm, Dropout, 200 epochs), 1D-CNN (32/64 filters, kernel size 3), LSTM (2-layer, hidden size 64), and TabNet [47] ( n a = n d = 16 , 100 epochs). All deep models are trained with the Adam optimizer and class-weighted loss on an NVIDIA RTX 4090 GPU. Together with Group A (10 methods) and Group C (2 methods), this gives the 16 baselines referenced throughout the paper.
Note on the LSTM baseline. Because the engineered features are atemporal, an LSTM cannot exploit its sequential inductive bias on them directly. The configuration reported as “LSTM” in Table 1 therefore treats the 41 feature dimensions as a length-41 input sequence with one channel, providing the most direct comparison with the other tabular baselines. As a sensitivity analysis, we additionally trained an “LSTM-raw” variant on the original force time series (down-sampled to 1 Hz, padded to 600 time steps, per-foot vertical GRF as channels) using the same architecture. LSTM-raw reaches AUC = 0.781 ± 0.072 on GaitPDB, statistically indistinguishable from the tabular LSTM (Wilcoxon p = 0.39 ), suggesting that the small-sample regime is the dominant bottleneck for deep sequence models here. LSTM-raw is reported in Table 1 as a supplementary analysis and is not counted among the 16 baselines used for the multiple-comparison correction.
Group C: 2 domain-specific gait baselines. We re-implement two published gait-classification pipelines as direct comparison points: Wahid-2015 [7] (spatial–temporal feature engineering followed by linear/quadratic discriminant classification) and Rehman-2019 [8] (clinically curated gait features with a tuned Random Forest classifier and recursive feature elimination). Both are evaluated under the identical 10-fold protocol. Re-implementations follow the algorithmic descriptions in the original papers; small differences from the original numbers are expected because the underlying datasets and pre-processing pipelines differ.
GaitNDD evaluation. For GaitNDD, the input is stride-interval data only; baselines that require multi-channel force input or that failed to converge on n = 55 are reported as “—” in Table 1. Specifically, SVM (Linear), MLP, Deep MLP, 1D-CNN, LSTM, LSTM-raw, and TabNet either failed to converge stably on GaitNDD or required input modalities not available there, and are therefore omitted rather than reported with degenerate scores.

3.9.4. Metrics and Statistical Tests

We report AUC (primary), accuracy, F1-score, sensitivity (recall), and specificity. Sensitivity is particularly relevant in a clinical screening setting because it directly reflects the false-negative (missed-diagnosis) burden. Statistical significance is assessed via the Wilcoxon signed-rank test (one-sided, H 1 : CogCBR > baseline) on per-fold AUC scores. We report uncorrected per-baseline p-values throughout. With 16 baselines on GaitPDB, the Bonferroni-corrected significance level is α / 16 0.003 ; in Section 5, we identify which comparisons survive this correction so that readers can calibrate the strength of the per-baseline claims. Because the comparisons are directional and exploratory on small datasets, the p-values are used only to contextualize the AUC ranking rather than as conclusive significance tests.

4. Results

4.1. Gait Feature Differences Between Groups

Figure 3 illustrates the distribution of two discriminative gait features between PD patients and healthy controls. Walking speed shows a large effect size (Cohen’s d = 1.24 ), with PD patients exhibiting significantly reduced velocity. Right-foot force CV (RF CV) also differs substantially ( d = 0.77 ): PD patients show systematically lower RF CV values than controls in our cohort, indicating altered force-variability patterns rather than uniformly higher variability. Both differences are statistically significant ( p < 0.001 ). The direction of the RF CV effect should not be over-interpreted: gait variability in PD is a multi-dimensional construct, and stride-timing variability (captured separately by stride-CV features) often increases in PD even when plantar-force CV does not. In plain terms, a reader might expect Parkinsonian gait to be more variable on every measure, so a lower right-foot force-CV in patients can seem counter-intuitive. The two quantities measure different things: force-CV captures cycle-to-cycle variation in how hard the foot presses, whereas stride-CV captures variation in step timing. Many PD patients walk with smaller, more uniform (shuffling) plantar-force profiles, which lowers force-CV, while their step timing becomes more irregular, which raises stride-CV. A decrease in one therefore does not contradict the increased gait variability classically associated with PD.

4.2. Screening Performance

Table 1 presents classification performance on GaitPDB and GaitNDD. CogCBR attains AUC = 0.861 on GaitPDB (mean of per-fold AUCs) (The value 0.868 in Figure 4 is computed on predictions pooled across folds rather than as the mean of per-fold AUCs. We report the per-fold mean (0.861) as the primary number because it pairs naturally with the per-fold Wilcoxon test, and the pooled value (0.868) where a single ROC curve or threshold sweep is presented) and achieves competitive top-ranked performance among the 16 baselines. Per-baseline pairwise Wilcoxon tests yield uncorrected p < 0.05 against 11 of 14 generic baselines and against both re-implemented gait-specific baselines (Wahid-2015: 0.798, p = 0.031 ; Rehman-2019: 0.821, p = 0.049 ). These per-baseline p-values are uncorrected; both the multiple-comparison correction and the tuning asymmetry between CogCBR (whose k, n, and distance metric are tuned) and the Group A defaults are discussed in Section 5. The intended reading is that CogCBR is competitively ranked and additionally provides functionality, including confidence-based triage (Revise), case-base maintenance (Retain), and intrinsic case-based explanations, that the baselines do not.
On GaitNDD, CogCBR attains AUC = 0.902 and achieves the highest mean AUC among the eleven methods that can be evaluated on stride-interval data; however, its margin over the strongest classical baselines (Random Forest 0.887, Rehman-2019 0.872) is not statistically significant. This absence of separation is addressed explicitly in Section 5: on a 55-subject dataset the per-fold AUC variance ( ± 0.111 ) is comparable to the absolute AUC differences (∼0.015–0.030) the test would have to detect.
For the screening-relevant sensitivity/specificity trade-off, CogCBR achieves sensitivity = 0.745 and specificity = 0.880 on GaitPDB, and sensitivity = 0.897 and specificity = 0.688 on GaitNDD. These complementary profiles illustrate that the model is conservative on the larger PD-vs-control cohort (favoring few false positives) and more sensitive on the smaller NDD-vs-control cohort (favoring few false negatives), consistent with the screening framing in which uncertain cases are routed to specialist review by the Revise stage rather than acted on as final diagnoses.
Figure 4 shows the ROC curves on GaitPDB.
Figure 5 shows the distribution of predicted PD probabilities for each class. The two distributions are well-separated (Cohen’s d = 1.68 ), with PD patients centered around 0.68 and controls around 0.31.

4.3. Parameter-Selection Optimism and Baseline Fairness

This section examines three methodological issues: selection optimism from choosing n and k on the evaluation folds, the fairness of comparing a tuned CogCBR against default-configured baselines, and the strength of the multiple-comparison evidence. Each is evaluated through a nested cross-validation audit, a fully tuned-vs.-tuned comparison, and a corrected-vs.-uncorrected significance summary.
To quantify the optimism introduced by selecting the MI feature count n and the neighborhood size k on the evaluation folds, we repeated the full pipeline under a strictly nested protocol [48,49]: on each outer training fold an inner 5-fold loop selected n and k, and median imputation, standardization, MI ranking, and RF feature-weight estimation were all recomputed inside the training partition only. Table 2 reports the result. On GaitPDB, the nested AUC is 0.842 ± 0.093 , only 0.019 below the fixed-parameter value of 0.861 , indicating that the selection optimism is small; the nested estimate remains at or above the strongest classical baselines evaluated under their default configuration (for example, GBM 0.836 and Rehman-2019 0.821 ). On GaitNDD, the nested AUC is 0.835 ± 0.168 ; the larger drop and wide interval are consistent with the 55-subject cohort. We retain the fixed-parameter numbers as the primary results, with this audit confirming they are not materially inflated by selection.
To assess baseline fairness, a fully tuned-vs.-tuned comparison (Table 3 and Table 4) was conducted: each Group A baseline was given the same inner-CV tuning budget that CogCBR receives. Under matched tuning, CogCBR’s nested AUC ( 0.842 ) remains the highest on GaitPDB, but its margin over the strongest tuned baseline (GBM, 0.836 ) is not significant (one-sided Wilcoxon p = 0.242 ). On the smaller GaitNDD cohort, tuned Random Forest ( 0.913 ) ranks highest and CogCBR ( 0.835 ) ranks fifth; however, the per-fold AUC variance is large (SD up to ± 0.24 on 55 subjects), so the ranking is not statistically separable and no comparison survives Bonferroni correction. CogCBR is therefore competitive with—and statistically indistinguishable from—the strongest tuned classical baselines, with its contribution resting on the integrated Revise, Retain, and explanation functionality that the higher-AUC baselines do not provide.
Finally, to make the multiple-comparison evidence explicit (Table 5), we summarize, for each of the 16 baselines on GaitPDB, the uncorrected one-sided Wilcoxon p-value and whether it remains significant at the uncorrected level ( α = 0.05 ) and at the Bonferroni-corrected level ( α / 16 0.003 ). Thirteen of the sixteen comparisons are significant before correction, but only the 1D-CNN comparison ( p = 0.002 ) survives Bonferroni correction. We therefore present the uncorrected pattern as suggestive rather than confirmatory, consistent with the claims stated in Section 5.

4.4. Confidence-Based Clinical Triage (Revise)

Table 6 reports the confidence/coverage/accuracy trade-off produced by the Revise stage. At threshold ≥0.1, CogCBR retains 68.7% of predictions with accuracy improving from 80.0% to 87.3% and (pooled) AUC from 0.868 to 0.907. At ≥0.6, the 13.9% most-confident predictions correspond to only ∼16 subjects pooled across folds, on which the system happens to be perfectly accurate; the AUC of 1.000 at this threshold should therefore be read as a property of the easiest-to-classify subset of the cohort rather than as a calibrated estimate of operator behavior. Clinicians can adjust the threshold to balance throughput against safety, but the threshold itself must be calibrated on data independent of any future deployment cohort: an external calibration set is required before any specific value of τ can be recommended for clinical use.
Figure 6 further validates the Revise mechanism by comparing correctly classified with misclassified cases. Neighbor label agreement (the proportion of k neighbors sharing the query label) shows substantial separation, with 0.75 ± 0.14 for correct predictions versus 0.34 ± 0.10 for misclassifications (Mann–Whitney p < 0.001 ). Classification confidence is 2.7× higher for correct cases (0.32 vs. 0.12).

4.5. Calibration of the Confidence Score

We do not claim that the entropy-based confidence score is well-calibrated in the strict probabilistic sense, and a calibration analysis (Table 7, Figure 7) confirms this. Read as a probability of correctness, the entropy confidence is systematically under-confident (ECE = 0.491 ): it collapses toward zero near p = 0.5 even though such predictions remain frequently correct, reflecting its role as a triage/separation score (Section 3.5, Figure 6) rather than a calibrated probability. The same analysis shows that, when a calibrated probability is required, post hoc calibration of the IDW probability achieves low calibration error (RF-probability + Platt: ECE = 0.035 ; Platt: ECE = 0.038 ) and split conformal prediction attains valid, slightly conservative coverage (93.3% at a 90% target), at a modest accuracy cost on this small cohort. We therefore retain the entropy confidence for triage, where separation rather than calibration is what matters, and recommend post hoc calibration for any deployment that must report calibrated risk estimates. The calibrators compared are Platt scaling [50], isotonic regression [51], and split conformal prediction [52], assessed by the expected calibration error [53] and the Brier score [54].

4.6. Clinical Explanation Through Case Studies

We present three representative cases from the 10-fold CV evaluation, chosen to illustrate the structure of the explanation output and the safety value of Revise.
Case A: correct PD detection (confidence = 1.0). Subject #4 (PD) is correctly classified with maximum confidence. All seven retrieved neighbors are PD cases (nearest distance = 0.97). The explanation highlights low walking speed (0.68 m/s), reduced stride regularity (0.68), and elevated double-support time (38.4%), all established PD gait biomarkers [3]. The most discriminative features are mean total force (weight 0.048), stride regularity (0.065), and total-force CV (0.033).
Case B: correct control classification (confidence = 1.0). Subject #81 (Control) is correctly classified, with all seven neighbors being controls (nearest distance = 0.53), distinguished by normal walking speed (1.35 m/s), high stride regularity (0.70), and low double-support time (22.7%).
Case C: Revise preventing a misclassification. Subject #109 (Control) is misclassified as PD ( P ( PD ) = 0.90 ), but Revise assigns only moderate confidence (0.53). Under a threshold of ≥0.6, this case would be flagged for specialist review rather than acted on. Inspection reveals that six of the seven neighbors are PD patients, despite normal walking speed (1.37 m/s) but anomalous stride regularity (0.10) and zero double-support time, suggesting possible data-quality issues with the sensor recording. Revise thus prevents a false positive that could trigger an unnecessary referral.

4.7. Case Competence Analysis (Retain)

The Retain stage evaluates each case’s classification utility across all 10-fold CV queries. Under the operational policy thresholds defined in Section 3.6 (≥0.7 keep, 0.3 0.7 monitor, <0.3 flag for specialist review), the 115 cases distribute as summarized in Table 8. Cases that are never retrieved as a neighbor in the 10-fold evaluation are assigned competence = 0 by convention and so fall in the lowest bin; this convention means low-competence cases comprise both genuinely error-prone retrievals and cases that the current case base has rendered redundant. In either case, the augmentation policy’s specialist-review pathway provides the same audit mechanism. We note in passing that the 68.7% (79/115) of cases in this confirmed-retain group coincides numerically with the 68.7% Revise-stage coverage at τ = 0.1 (Table 6); although numerically identical, the two figures are computed independently from different quantities—case competence (Equation (4)) here versus entropy confidence (Equation (3)) there—so their coincidence carries no special meaning.
For completeness, we additionally report a finer descriptive grouping that is used only to summarize the static distribution of case-base quality (and is not a separate maintenance policy): 62 cases (53.9%) have competence ≥0.8 (clearly high quality); 43 cases (37.4%) lie in 0.5 0.8 (moderate); and 10 cases (8.7%) lie below 0.5 (lower quality, meriting closer inspection). The mean competence is 0.768 (SD = 0.265 ). The cases with competence <0.3 are a strict subset of the 10 cases below 0.5; lower-quality cases plausibly represent atypical gait patterns, borderline subjects, or sensor-recording artifacts.
This analysis is descriptive: it characterizes the static case base under the 10-fold protocol and identifies which cases would be candidates for review. It does not, on its own, validate the longitudinal effect of the augmentation policy, which would require a deployment-style simulation in which the case base grows under realistic clinical-feedback rates. This simulation is provided in Section 4.8.

4.8. Longitudinal Retain Simulation

To validate the augmentation policy beyond the static analysis of Section 4.7, we simulate deployment as a stream [55]: from a seed case base, GaitPDB subjects arrive sequentially (10 random orderings), CogCBR predicts and triages each, and the case base is updated under the policy of Section 3.6. We compare the policy (A) against naive self-training that admits confident predictions with their predicted labels (B), a verification ablation following A’s data flow but with unverified confident labels (B2), an all-true-label reference that performs no curation (C), and a static no-growth baseline (D), sweeping the follow-up confirmation rate (the clinical-feedback rate) over { 0.3 , 0.5 , 0.7 , 1.0 } at τ = 0.1 (with τ = 0.2 as a sensitivity check). As summarized in Table 9, the label-verified policy A injects zero label noise versus 11 erroneous labels for B, beats B on the area under the learning curve across all feedback rates (paired p down to 0.002), and clearly exceeds the static baseline D (0.801–0.838 versus 0.750), and approaches the all-true-label no-curation reference C in final AUC—matching it within the per-fold noise at confirmation rates ≥0.7 and marginally exceeding it at full confirmation, since A (unlike C) additionally curates the case base—while maintaining a smaller case base (60.8–80.9 versus 86 cases) and showing the same qualitative pattern at τ = 0.2 . The verification ablation B2 degrades as more unverified labels enter (2.5 to 9.7 erroneous labels); the gap to A is negligible at low feedback rates but widens in A’s favor as the rate rises (A improving while B2 degrades), isolating label verification as the operative mechanism. This remains a resampling-based simulation on a cross-sectional cohort; prospective longitudinal clinical validation is still required.
Figure 8 shows the corresponding held-out AUC as a function of the number of arrived subjects: across all four feedback rates, the label-verified policy A rises above the static baseline D toward the all-true-label no-curation reference C, while naive self-training B falls below D and the verification ablation B2 degrades as the feedback rate increases.

4.9. Independent-Cohort Reproducibility Evaluation on GaitNDD

We further evaluated CogCBR on GaitNDD, a second independent PhysioNet dataset. This experiment uses stratified 10-fold cross-validation within GaitNDD; following the recommendation that the term “external validation” should be reserved for source-to-target transfer with non-overlapping cohorts and matching label definitions, we describe this experiment as an independent-cohort reproducibility evaluation. It assesses whether the same CogCBR workflow can be reproduced on an independent cohort with stride-interval features rather than as a strict external test. The GaitNDD feature set is small (nine stride-interval features); MI selection retained eight of them, dropping a single near-zero-variance feature. With k = 3 , CogCBR achieves AUC = 0.902 ± 0.111 (Table 1), with the highest mean AUC among the eleven evaluable methods. The triage and explanation mechanisms transfer unchanged. Statistical significance against the strongest baselines (Random Forest 0.887, Rehman-2019 0.872) is not reached, and the per-fold variance is comparable to the absolute AUC differences. The honest reading is that CogCBR is competitive but not measurably superior on GaitNDD under within-cohort CV; we revisit this in Section 5.

4.9.1. Choice of k on GaitNDD

For GaitNDD, we used k = 3 rather than the k = 7 setting employed on GaitPDB. The motivation is structural rather than tuning-driven: GaitNDD is substantially smaller (55 subjects) and provides only a nine-feature stride-interval representation. In each training fold, the minority control class contains approximately 14–15 subjects; using k = 7 would therefore make each neighborhood cover almost half of the available control class and risk over-smoothing local retrieval evidence. A smaller, more local neighborhood ( k = 3 ) preserves the case-based explanation property under the reduced feature space and cohort size. We acknowledge this dataset-specific choice as a limitation in Section 5 and note that future larger-cohort studies should select k under a fully nested protocol.

4.9.2. Source-to-Target Transfer

As a stricter cross-modality domain-shift analysis, we trained models on GaitPDB and tested them directly on GaitNDD using only the shared stride-based features. In this setting, CogCBR obtained AUC = 0.737, below the strongest baseline (Logistic Regression, AUC = 0.832); detailed results are reported in Table 10. This confirms that source-to-target transfer across different sensor modalities and label definitions is substantially harder than within-dataset validation, and that CogCBR does not exceed classical baselines in this regime. Similarity-based retrieval inherits the limitations of its case base when the deployment distribution differs sharply from it; our main claims therefore rest on GaitPDB cross-validation and the within-cohort reproducibility evaluation on GaitNDD, not on direct cross-modality transfer. We report the transfer numbers transparently rather than omit them.

4.10. Computational Cost and Edge Deployability

Beyond predictive performance and interpretability, practical clinical screening systems must be deployable under resource-constrained settings such as wearable sensors, mobile health terminals, and bedside screening devices. We therefore profile CogCBR and representative baselines in terms of training time, single-sample inference latency, and deployment payload size on the GaitPDB analysis set (115 subjects). Inference latency is averaged over 2000 single-sample runs, matching the per-subject deployment scenario rather than batch throughput. For CogCBR, the deployment payload comprises the case base with 18 MI-selected features, class labels, standardization parameters, selected feature indices, and RF-derived feature weights.
Table 11 reports the results. CogCBR has the lowest single-sample inference latency in the comparison (0.080 ms): more than 30× faster than Random Forest (2.678 ms) and at least 4× faster than XGBoost (0.510 ms), 1D-CNN (0.426 ms), and LSTM (0.369 ms). It also has the smallest deployment payload at 8.4 KB; Random Forest, 1D-CNN, and LSTM require 48.1 KB, 35.0 KB, and 211.7 KB, respectively. Although XGBoost is also compact at 15.0 KB, it provides neither case-level explanations, neighbor retrieval evidence, nor confidence estimation. Training cost is comparable to that of traditional ML baselines (all non-deep methods fit within 0.1 s); we do not interpret small fitting-time differences as a primary result, since they fall within wall-clock measurement variability.
CogCBR’s case base grows linearly with the number of cases; on the present GaitPDB cohort the full deployment payload is under 10 KB and a single inference takes under 0.1 ms. Even if the case base were extended to several thousand subjects, storage would remain manageable, and the Retain stage bounds case-base growth through competence-based curation. CogCBR is therefore well positioned as a lightweight, interpretable, and continuously maintainable edge screening method for rapid first-line risk assessment of neurodegenerative disease.

4.11. System Component Analysis

We systematically evaluate each CogCBR component. The values of n and k reported below were selected at their AUC peaks on the same 10-fold partitions, a protocol asymmetry already declared in Section 3.9 and acknowledged in the limitations (Section 5).

4.11.1. MI Feature Selection

MI ranking identifies walking speed as the most discriminative feature (MI = 0.150), followed by force CV (0.091), stride regularity (0.089), and double-support percentage (0.088), all clinically established PD gait markers [3]. Grid search over n [ 5 , 41 ] finds that AUC peaks at n = 18 (0.861) and declines with more features ( n = 41 : AUC = 0.801), confirming that low-MI features inject noise into the distance computation in small-sample CBR.

4.11.2. Distance Metric

Table 12 compares five distance metrics for case retrieval (MI-18, k = 7 ). The RF-weighted Euclidean distance outperforms all alternatives (+0.048 AUC over the second-best Cosine), confirming that supervised, multivariate feature importance in the distance function improves retrieval. NCA, a learned metric, performs worst, consistent with overfitting on the small training set.

4.11.3. Neighborhood Size

AUC peaks at k = 7 (0.861) and declines both for smaller values ( k = 3 : AUC = 0.795 with higher variance) and for larger values ( k = 15 : AUC = 0.838 with over-smoothing).

4.11.4. Component Ablation

Table 13 isolates each component’s contribution under identical settings ( k = 7 , stratified 10-fold CV). The RF-weighted distance, combined with IDW voting, is the single most impactful pairing (+0.074 AUC for Full over MI + Euclidean + Majority, a row that swaps both the distance and the vote); isolating the distance alone, with IDW voting held fixed (Table 12), RF-weighted Euclidean still yields +0.076 AUC over plain Euclidean, confirming the distance as the dominant single factor. MI selection adds a further +0.027 (Full vs. No MI). The cumulative contribution of MI selection and the RF-weighted distance is +0.102 AUC over the minimal-component baseline (No MI + Euclidean + Majority). IDW voting is retained over majority voting because it produces the continuous probability estimates required by Revise (Equation (3)).

4.12. Class-Imbalance Ablation

Both cohorts are imbalanced toward the disease class (GaitPDB 66 PD/49 control; GaitNDD 39 NDD/16 control), a setting widely studied in machine learning [56]. We evaluated four balancing strategies against the unbalanced configuration—class-weighted inverse-distance voting, random oversampling, SMOTE [57], and random undersampling—applied inside each training fold (Table 14). No balancing strategy meaningfully improved AUC on either cohort: on GaitPDB only class-weighted IDW edged out the unbalanced configuration, and then only within numerical tolerance (0.862 vs. the unbalanced 0.861), while every other strategy fell below it; on GaitNDD, the unbalanced configuration retained the highest AUC (0.902). Critically, every strategy reduced sensitivity—the screening-relevant metric—while raising specificity (sensitivity fell from 0.745 to 0.626–0.700 on GaitPDB and from 0.897 to 0.617–0.792 on GaitNDD), with the GaitNDD class-weighting reduction reaching significance ( p = 0.008 ). This is expected: because the disease class is the majority in both cohorts, balancing shifts the decision boundary toward the minority control class, trading disease sensitivity for specificity. Since a screening tool prioritizes minimizing missed diagnoses, we report the unbalanced configuration and route low-confidence cases to specialist review (Revise) rather than rebalancing.

5. Discussion

The novelty of CogCBR lies not in any single CBR operator: weighted Euclidean distance, IDW voting, entropy-based confidence, and competence-based maintenance are all established techniques drawn from the CBR literature of the last three decades. The contribution lies in their principled integration into a complete R4 pipeline for a clinical screening domain in which prior CBR work has typically stopped at Retrieve and Reuse [20,22], combined with an explicit case-base augmentation policy that closes the loop between confident predictions, expert review, and case storage. Revise enables the system to flag uncertain or potentially unreliable predictions for specialist review; Retain provides a designed mechanism for long-term case-base quality (its longitudinal effect remains to be empirically validated); and the explanation output supports clinician verification.
Framing CogCBR through Richter’s containers [23] makes a design choice explicit: in domains where adaptation knowledge is hard to elicit, such as clinical gait screening from sensor data, it is rational to invest more in the vocabulary, similarity, and case-base containers. The empirical results agree: the strongest single contributor is similarity (the RF-weighted distance, +0.076 AUC in isolation), followed by vocabulary (MI selection, +0.027 AUC). With these containers strengthened, lightweight inverse-distance voting in the adaptation container suffices.
The Revise stage provides self-assessment of prediction reliability: at threshold ≥0.1, the pooled AUC improves from 0.868 to 0.907 at 68.7% coverage. Subject #109 (Section 4.6) illustrates the safety value: despite a wrong PD prediction, the low confidence (0.53) would, under a stricter triage threshold (≥0.6; Table 6), trigger specialist referral rather than an automated decision. We do not claim that the entropy-based confidence score reported here is well-calibrated in the strict probabilistic sense; a dedicated calibration analysis (Section 4.5, Table 7, Figure 7) confirms this and shows that post hoc calibration (Platt scaling, isotonic regression, RF-probability + Platt) and split conformal prediction yield well-calibrated or validly covered estimates when a calibrated risk is required, while the entropy score is retained for triage, where separation rather than calibration is what matters.
Beyond predictive metrics, an important limitation is that the present study does not include a clinician-centered evaluation, and the intended human–AI workflow deserves to be made explicit. We envisage CogCBR operating as a first-line triage aid rather than an autonomous diagnostic system. For each incoming recording, the clinician is shown not a bare label but the case-based explanation of Section 3.7: the k most similar prior patients, their labels and distances, the gait features driving each match, and the direction of clinical deviation, together with the contextual metadata (age, sex, recording protocol, and, where available, Hoehn & Yahr stage) that is displayed but excluded from the distance. This lets the clinician verify a prediction against patients they can inspect, and flag demographic or protocol mismatches that a scalar score would hide. The confidence threshold τ is the operating control of this workflow: lowering τ increases automated coverage at the cost of admitting less-certain predictions, while raising it routes more borderline cases to specialist review (Table 6). As we stress in Section 3.5 and Section 4.4, τ is a deployment-time parameter that must be calibrated on a target cohort before any specific value is recommended, since the costs of a missed diagnosis and an unnecessary referral are asymmetric and site-specific. Several workflow-integration challenges remain open and are not resolved by the present cross-sectional study: eliciting confirmed labels at clinical follow-up at a realistic rate (the confirmation-rate sweep of Section 4.8 brackets this), avoiding automation bias when an explanation is persuasive but wrong (Case C in Section 4.6 is a deliberate example), integration with electronic-health-record and sensor-acquisition systems, and the regulatory requirement for prospective validation as a clinical decision-support tool. A dedicated clinician-in-the-loop usability study—measuring how retrieved cases and confidence flags affect referral decisions, reading time, and trust—is an important direction for future work.
Beyond classification performance, the computational profile reported in Section 4.10 is directly relevant to the wearable-sensor screening setting that motivates this paper. With a deployment payload of 8.4 KB and a per-subject inference latency below 0.1 ms, CogCBR fits comfortably on the embedded processors typical of force-sensitive insoles, mobile health terminals, and edge gateways. Importantly, this efficiency does not trade off against the clinically useful capabilities of the framework: case-level explanations, neighbor-retrieval evidence, and entropy-based confidence are all preserved, which is not the case for the equally compact XGBoost baseline. We therefore view edge deployability not as an isolated engineering metric but as a structural property of the CBR design that complements its interpretability for sensor-based screening.
Two statistical issues warrant explicit discussion. First, regarding multiple comparisons on GaitPDB, the per-baseline p-values in Table 1 are uncorrected pairwise Wilcoxon tests (summarized before and after correction per baseline in Table 5); under Bonferroni correction at α / 16 0.003 only the 1D-CNN comparison ( p = 0.002 ) survives. We therefore do not claim that CogCBR is significantly better than every baseline after correction. What we do claim is that (i) CogCBR’s mean per-fold AUC ranks at or above every baseline on both datasets, (ii) the direction of the effect is consistent across all 16 baselines, and (iii) the architecture provides confidence-based triage and case-based explanations that none of the baselines, including the higher-AUC ones, provide. The uncorrected per-baseline p < 0.05 pattern is best regarded as suggestive evidence warranting larger-cohort confirmation. Second, regarding variance on GaitNDD, the AUC ranking does not reach statistical significance against the strongest baselines (Random Forest 0.887, Rehman-2019 0.872): with only 55 subjects the per-fold variance ( ± 0.111 ) is large relative to the absolute AUC differences (∼0.015–0.030). Establishing a stronger empirical separation will require larger multi-center cohorts and a fully nested CV protocol with subtype-stratified analysis.
A third caveat concerns baseline fairness. Group A baselines use scikit-learn defaults, while CogCBR’s k, n, and distance metric are tuned. We deliberately fixed baseline hyperparameters to limit researcher degrees of freedom on the baseline side, but this design choice introduces a tuning asymmetry. This asymmetry is evaluated using the fully tuned-vs.-tuned comparison of Section 4.3 (Table 3 and Table 4), in which each baseline receives the same inner-CV tuning budget that CogCBR receives. Under matched tuning, CogCBR’s nested AUC (0.842) remains the highest on GaitPDB but is statistically indistinguishable from the strongest tuned baseline (GBM, 0.836; p = 0.242 ), and on GaitNDD the ranking is not separable within the per-fold noise (tuned Random Forest leads at 0.913). The claim of this paper is therefore not that CogCBR outperforms all baselines in a strict sense, but rather that it achieves competitive top-ranked performance while additionally providing confidence-based triage and case-based explanations.
Adding the re-implemented Wahid-2015 [7] and Rehman-2019 [8] pipelines as direct baselines (Group C in Table 1) addresses the gap that these works have frequently been discussed but not directly compared. CogCBR’s mean AUC ranks above both on GaitPDB at uncorrected p < 0.05 while remaining within the noise band on GaitNDD; neither comparison survives Bonferroni correction in isolation. The pattern suggests that any modest gains over published gait pipelines come primarily from the integrated similarity, selection, and triage design rather than from the underlying feature set, which is broadly comparable. Relative to deep learning baselines, CogCBR’s edge on these small cohorts (115 and 55 subjects) reflects the fact that similarity-based reasoning avoids high-dimensional parameter estimation; this should not be read as evidence that deep learning is generally weaker in this domain, since on larger multi-center cohorts the picture is likely to change. The LSTM-raw sensitivity analysis (Section 3.9) helps disentangle the cause of the deep baselines’ weakness: training the LSTM on the raw force time series rather than the engineered features leaves AUC essentially unchanged ( 0.781 versus tabular 0.777 , Wilcoxon p = 0.39 ), indicating that limited sample size, rather than feature representation or sequence-model architecture, is the dominant bottleneck for the deep baselines on these cohorts.
The Retain stage is designed to maintain case-base quality as new sensor recordings accumulate. The augmentation policy of Section 3.6, under which only label-verified cases enter the case base, is intended to prevent the self-confirmation bias that simple confidence-based augmentation would introduce. The competence analysis in Section 4.7 characterizes the static case base under 10-fold CV but does not, by itself, demonstrate that the policy improves performance over time. A deployment-style streaming simulation (Section 4.8, Table 9) validates this policy longitudinally: the label-verified policy injects zero label noise versus 11 erroneous labels for naive self-training, exceeds a static no-growth baseline, and matches an all-true-label no-curation reference in final AUC while bounding case-base growth. This remains a resampling-based simulation on a cross-sectional cohort; prospective longitudinal clinical validation is still required.
Several limitations of the present study should be acknowledged so that readers can calibrate the strength of the reported findings. Sample sizes (55–115 subjects) are typical for clinical gait sensor studies but limit statistical power, particularly on GaitNDD. The RF-weighted distance assumes globally consistent feature importance, which may not hold across NDD subtypes (PD, HD, ALS); subtype-aware local weighting is a natural extension. Beyond these structural limitations, we list five further methodological caveats:
  • MI selection on the full dataset. MI ranking is computed once on the full dataset, which is common practice for univariate filters [40] but may introduce optimistic bias relative to a fully nested protocol [58]. The nested audit of Section 4.3, which recomputes MI ranking inside each training fold, quantifies this bias directly and finds it small on GaitPDB ( Δ AUC = 0.019 ).
  • Hyperparameter selection on the evaluation folds. The values n = 18 and k = 7 were selected at the AUC peak of the same 10-fold protocol used for the main results, rather than via an inner-loop nested CV. To quantify the resulting optimism, we conducted a nested cross-validation audit (Section 4.3), in which median imputation, standardization, MI ranking, RF feature-weight estimation, and the selection of n and k are all performed strictly inside the training folds. The audit shows the optimism is small on GaitPDB ( Δ AUC = 0.019 ; nested 0.842 versus fixed-parameter 0.861) and larger but within the high-variance regime expected for the 55-subject GaitNDD cohort (nested 0.835 ± 0.168 ). Baseline fairness is further evaluated in the tuned-vs.-tuned comparison (Table 3 and Table 4), in which CogCBR remains the top performer on GaitPDB—not significantly different from tuned GBM ( p = 0.242 )—and competitive within the noise band on GaitNDD.
  • Retain validated by simulation, not yet prospectively. The static competence analysis (Section 4.7) is complemented by a deployment-style streaming simulation (Section 4.8) in which the case base grows over time under a range of clinical-feedback rates. The simulation confirms that the label-verified augmentation policy avoids the label-noise accumulation of naive self-training (0 versus 11 injected errors), exceeds a static no-growth baseline, and matches an all-true-label no-curation reference in final AUC while bounding case-base growth. This remains a resampling-based simulation on a cross-sectional cohort; prospective longitudinal clinical validation is still required.
  • Dataset-specific neighborhood choice on GaitNDD. The GaitNDD analysis uses k = 3 rather than k = 7 to avoid an excessive neighborhood-to-minority-class ratio under the smaller cohort and reduced feature space (Section 4.9); a fully nested protocol on a larger external cohort is required to confirm this choice without dataset-specific tuning.
  • Cohort composition. GaitPDB subjects are diagnosed PD patients (Hoehn & Yahr 2–3) rather than pre-clinical or at-risk subjects, and GaitNDD provides only stride-interval data rather than the full insole pipeline. The present study therefore evaluates gait-based screening support and classification of established NDD-related gait patterns; demonstrating utility for true pre-symptomatic detection would require dedicated pre-clinical cohorts with longitudinal follow-up.
The present study is therefore best viewed as a methodological validation based on available cross-sectional datasets, rather than a prospective clinical deployment study. Although the cross-validation, independent-cohort evaluation, and streaming simulation support the robustness of CogCBR, the Retain stage and triage threshold still require prospective, clinician-in-the-loop validation before clinical use.
The augmentation policy assumes that specialist labels are available for low-confidence cases; in deployment, this requires integration with the clinical workflow and, at the regulatory level, prospective validation as a clinical decision support tool. Future work should explore multi-center sensor validation, subtype-aware local weighting, prospective clinical evaluation of the triage workflow, a full multi-cohort calibration study extending the single-cohort calibration analysis of Section 4.5, a clinician-in-the-loop usability evaluation of the explanation-and-triage workflow described in Section 5, and prospective longitudinal clinical evaluation of the Retain stage extending the deployment-style streaming simulation of Section 4.8.

6. Conclusions

In this paper, we have presented CogCBR, a clinical CBR framework that implements the complete R4 cycle for wearable-sensor-based gait screening support in NDDs. Framing the design through Richter’s four knowledge containers makes explicit the trade-off CogCBR exploits: invest in vocabulary, similarity, and case-base curation rather than in complex adaptation knowledge. CogCBR achieves AUC = 0.861 on PhysioNet GaitPDB and AUC = 0.902 on an independent-cohort reproducibility evaluation on GaitNDD, with competitive performance on both datasets—statistically on par with the strongest tuned baselines on GaitPDB under a matched-tuning comparison. Beyond ranking, it delivers confidence-based clinical triage (Revise), a competence-based case-base maintenance policy under an explicit label-verified augmentation rule (Retain, whose longitudinal behavior we validate in a deployment-style streaming simulation), and intrinsic case-based explanations—capabilities that none of the classical baselines provide. The computational profile (0.080 ms per-sample inference, 8.4 KB deployment payload) supports CogCBR’s suitability for wearable-sensor and edge-health screening scenarios.
We explicitly do not claim conclusive multi-comparison-corrected superiority over every baseline (only the 1D-CNN comparison survives Bonferroni correction; Table 5) or utility for pre-symptomatic detection (which would require dedicated pre-clinical cohorts). The longitudinal augmentation policy is validated in a deployment-style streaming simulation (Section 4.8) but not yet in a prospective clinical study, and a calibrated triage operating point is characterized on a single cohort (Section 4.5) but still requires multi-cohort calibration before a specific threshold can be recommended for clinical use. Under a stricter cross-modality source-to-target transfer (train on GaitPDB, test on GaitNDD), CogCBR does not exceed the strongest classical baseline, and this limitation is reported in the source-to-target transfer experiment. These remain directions for future work, alongside multi-center and prospective clinical evaluation of the sensor-driven pipeline, transfer- and meta-learning techniques to shorten the cold-start phase in new clinical settings, and evaluation on richer wearable modalities such as inertial measurement units and combined IMU + insole recordings.

Author Contributions

Conceptualization, H.L., X.L. and H.Z.; methodology, H.L., X.L., H.Z. and Y.S.; software, H.L. and X.L.; validation, H.L., Y.S. and L.L.; formal analysis, H.L. and Y.S.; investigation, H.L., Y.S. and L.L.; resources, X.L. and H.Z.; data curation, Y.S. and L.L.; writing—original draft preparation, H.L. and X.L.; writing—review and editing, H.L., Y.S., L.L., X.L. and H.Z.; visualization, H.L. and L.L.; supervision, X.L. and H.Z.; project administration, X.L. and H.Z. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

The study used publicly available, de-identified PhysioNet datasets (GaitPDB and GaitNDD) and did not involve new human or animal data collection; ethical review was therefore not applicable.

Informed Consent Statement

Not applicable. The study used publicly available, de-identified PhysioNet datasets.

Data Availability Statement

The GaitPDB and GaitNDD datasets analyzed in this study are publicly available from PhysioNet (https://physionet.org). All algorithmic details required to reproduce the CogCBR pipeline are described in Section 3 and summarized in Algorithm 1; additional implementation details are available from the corresponding author upon reasonable request.

Acknowledgments

We thank the creators of the PhysioNet GaitPDB and GaitNDD datasets. ChatGPT by OpenAI was used during manuscript preparation to assist with language polishing, grammar checking, improving clarity and readability, and formatting/rephrasing some sentences. The tool was not used to generate original scientific ideas, design the study, perform data analysis, create results, or draw conclusions. All AI-assisted text was carefully reviewed, edited, and verified by the authors, who take full responsibility for the content of the manuscript.

Conflicts of Interest

The authors declare no conflicts of interest.

Abbreviations

The following abbreviations are used in this manuscript:
ALSAmyotrophic Lateral Sclerosis
AUCArea Under the (ROC) Curve
CBRCase-Based Reasoning
CVCoefficient of Variation
ECEExpected Calibration Error
GBMGradient Boosting Machine
GRFGround Reaction Force
HDHuntington’s Disease
IDWInverse-Distance Weighted
IMUInertial Measurement Unit
k-NNk-Nearest Neighbors
LIMELocal Interpretable Model-agnostic Explanations
LSTMLong Short-Term Memory
MIMutual Information
MLPMultilayer Perceptron
NDDNeurodegenerative Disease
NCANeighborhood Components Analysis
PDParkinson’s Disease
RFRandom Forest
ROCReceiver Operating Characteristic
SHAPSHapley Additive exPlanations
SMOTESynthetic Minority Over-sampling Technique
SVMSupport Vector Machine

References

  1. Bloem, B.R.; Okun, M.S.; Klein, C. Parkinson’s disease. Lancet 2021, 397, 2284–2303. [Google Scholar] [PubMed]
  2. Jankovic, J. Parkinson’s disease: Clinical features and diagnosis. J. Neurol. Neurosurg. Psychiatry 2008, 79, 368–376. [Google Scholar] [PubMed]
  3. Morris, M.E.; Huxham, F.; McGinley, J.; Dodd, K.; Iansek, R. The biomechanics and motor control of gait in Parkinson disease. Clin. Biomech. 2001, 16, 459–470. [Google Scholar] [CrossRef]
  4. Hausdorff, J.M. Gait dynamics in Parkinson’s disease: Common and distinct behavior among stride length, gait variability, and fractal-like scaling. Chaos An. Interdiscip. J. Nonlinear Sci. 2009, 19, 026113. [Google Scholar]
  5. Hausdorff, J.M.; Lertratanakul, A.; Cudkowicz, M.E.; Peterson, A.L.; Kaliton, D.; Goldberger, A.L. Dynamic markers of altered gait rhythm in amyotrophic lateral sclerosis. J. Appl. Physiol. 2000, 88, 2045–2053. [Google Scholar] [CrossRef] [PubMed]
  6. Goldberger, A.L.; Amaral, L.A.; Glass, L.; Hausdorff, J.M.; Ivanov, P.C.; Mark, R.G.; Mietus, J.E.; Moody, G.B.; Peng, C.K.; Stanley, H.E. PhysioBank, PhysioToolkit, and PhysioNet: Components of a new research resource for complex physiologic signals. Circulation 2000, 101, e215–e220. [Google Scholar] [CrossRef] [PubMed]
  7. Wahid, F.; Begg, R.K.; Hass, C.J.; Halgamuge, S.; Ackland, D.C. Classification of Parkinson’s disease gait using spatial-temporal gait features. IEEE J. Biomed. Health Inform. 2015, 19, 1794–1802. [Google Scholar] [PubMed]
  8. Rehman, R.Z.U.; Del Din, S.; Guan, Y.; Yarnall, A.J.; Shi, J.Q.; Rochester, L. Selecting clinically relevant gait characteristics for classification of early Parkinson’s disease: A comprehensive machine learning approach. Sci. Rep. 2019, 9, 17269. [Google Scholar] [CrossRef] [PubMed]
  9. El Maachi, I.; Bilodeau, G.A.; Bouachir, W. Deep 1D-Convnet for accurate Parkinson disease detection and severity prediction from gait. Expert Syst. Appl. 2020, 143, 113075. [Google Scholar] [CrossRef]
  10. Zhao, A.; Qi, L.; Li, J.; Dong, J.; Yu, H. A hybrid spatio-temporal model for detection and severity rating of Parkinson’s disease from gait data. Neurocomputing 2018, 315, 1–8. [Google Scholar] [CrossRef]
  11. Tonekaboni, S.; Joshi, S.; McCradden, M.D.; Goldenberg, A. What clinicians want: Contextualizing Explainable Machine Learning for Clinical End Use. In Proceedings of the Machine Learning for Healthcare Conference, PMLR, Ann Arbor, MI, USA, 9–10 August 2019; pp. 359–380. [Google Scholar]
  12. Lundberg, S.M.; Lee, S.I. A unified approach to interpreting model predictions. Adv. Neural Inf. Process. Syst. 2017, 30, 4768–4777. [Google Scholar]
  13. Ribeiro, M.T.; Singh, S.; Guestrin, C. “Why should i trust you?” Explaining the predictions of any classifier. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Francisco, CA, USA, 13–17 August 2016; pp. 1135–1144. [Google Scholar]
  14. Aamodt, A.; Plaza, E. Case-based reasoning: Foundational issues, methodological variations, and system approaches. AI Commun. 1994, 7, 39–59. [Google Scholar] [CrossRef]
  15. Kolodner, J. Case-Based Reasoning; Morgan Kaufmann: San Francisco, CA, USA, 2014. [Google Scholar]
  16. Bichindaritz, I.; Marling, C. Case-based reasoning in the health sciences: What’s next? Artif. Intell. Med. 2006, 36, 127–135. [Google Scholar] [PubMed]
  17. Nilsson, M.; Sollenborn, M. Advancements and Trends in Medical Case-Based Reasoning: An Overview of Systems and System Development. In Proceedings of the FLAIRS, Miami Beach, FL, USA, 17–19 May 2004; pp. 178–183. [Google Scholar]
  18. Sørmo, F.; Cassens, J.; Aamodt, A. Explanation in case-based reasoning–perspectives and goals. Artif. Intell. Rev. 2005, 24, 109–143. [Google Scholar]
  19. Doyle, D.; Cunningham, P.; Bridge, D.; Rahman, Y. Explanation oriented retrieval. In Proceedings of the European Conference on Case-Based Reasoning, Madrid, Spain, 30 August–2 September 2004; pp. 157–168. [Google Scholar]
  20. De Mantaras, R.L.; McSherry, D.; Bridge, D.; Leake, D.; Smyth, B.; Craw, S.; Faltings, B.; Maher, M.L.; COX, M.T.; Forbus, K.; et al. Retrieval, reuse, revision and retention in case-based reasoning. Knowl. Eng. Rev. 2005, 20, 215–240. [Google Scholar] [CrossRef]
  21. Begum, S.; Ahmed, M.U.; Funk, P.; Xiong, N.; Folke, M. Case-based reasoning systems in the health sciences: A survey of recent trends and developments. IEEE Trans. Syst. Man. Cybern. Part C (Appl. Rev.) 2010, 41, 421–434. [Google Scholar] [CrossRef]
  22. Saraiva, R.; Perkusich, M.; Silva, L.; Almeida, H.; Siebra, C.; Perkusich, A. Early diagnosis of gastrointestinal cancer by using case-based and rule-based reasoning. Expert Syst. Appl. 2016, 61, 192–202. [Google Scholar]
  23. Richter, M.M. The Knowledge Contained in Similarity Measures; LSA Centre for Learning Systems and Applications: Singapore, 1995. [Google Scholar]
  24. Watson, I.; Marir, F. Case-based reasoning: A review. Knowl. Eng. Rev. 1994, 9, 327–354. [Google Scholar] [CrossRef]
  25. Watson, I. Case-based reasoning is a methodology not a technology. Knowl.-Based Syst. 1999, 12, 303–308. [Google Scholar] [CrossRef]
  26. Smyth, B.; McKenna, E. Modelling the competence of case-bases. In Proceedings of the European Workshop on Advances in Case-Based Reasoning, Dublin, Ireland, 23–25 September 1998; pp. 208–220. [Google Scholar]
  27. Keane, M.T.; Kenny, E.M. How Case-Based Reasoning Explains Neural Networks: A Theoretical Analysis of XAI Using Post-Hoc Explanation-by-Example from a Survey of ANN-CBR Twin-Systems. In Case-Based Reasoning Research and Development; Bach, K., Marling, C., Eds.; Springer: Cham, Switzerland, 2019; pp. 155–171. [Google Scholar]
  28. Chen, C.; Li, O.; Tao, D.; Barnett, A.; Rudin, C.; Su, J.K. This looks like that: Deep learning for interpretable image recognition. Adv. Neural Inf. Process. Syst. 2019, 32, 8930–8941. [Google Scholar]
  29. Li, O.; Liu, H.; Chen, C.; Rudin, C. Deep learning for case-based reasoning through prototypes: A neural network that explains its predictions. In Proceedings of the AAAI conference on artificial intelligence, New Orleans, LA, USA, 2–7 February 2018; Volume 32. [Google Scholar]
  30. Rudin, C. Stop explaining black box machine learning models for high stakes decisions and use interpretable models instead. Nat. Mach. Intell. 2019, 1, 206–215. [Google Scholar] [CrossRef] [PubMed]
  31. Marling, C.; Whitehouse, P. Case-based reasoning in the care of Alzheimer’s disease patients. In Proceedings of the International Conference on Case-Based Reasoning, Vancouver, BC, Canada, 30 July–2 August 2001; pp. 702–715. [Google Scholar]
  32. Smyth, B.; McKenna, E. Competence models and the maintenance problem. Comput. Intell. 2001, 17, 235–249. [Google Scholar] [CrossRef]
  33. Smyth, B.; Keane, M. Remembering to forget: A competence preserving deletion policy for case-based reasoning system. In Proceedings of the 14th International Joint Conference on Artificial Intelligence, Montreal, QC, Canada, 20–25 August 1995; pp. 377–382. [Google Scholar]
  34. Leake, D.B.; Wilson, D.C. Categorizing case-base maintenance: Dimensions and directions. In Proceedings of the European Workshop on Advances in Case-Based Reasoning, Dublin, Ireland, 23–25 September 1998; pp. 196–207. [Google Scholar]
  35. Delany, S.J.; Cunningham, P.; Coyle, L. An assessment of case-based reasoning for spam filtering. Artif. Intell. Rev. 2005, 24, 359–378. [Google Scholar] [CrossRef]
  36. Hausdorff, J.M.; Lowenthal, J.; Herman, T.; Gruendlinger, L.; Peretz, C.; Giladi, N. Rhythmic auditory stimulation modulates gait variability in Parkinson’s disease. Eur. J. Neurosci. 2007, 26, 2369–2375. [Google Scholar] [CrossRef] [PubMed]
  37. D’Arco, L.; Wang, H.; Zheng, H. Assessing impact of sensors and feature selection in smart-insole-based human activity recognition. Methods Protoc. 2022, 5, 45. [Google Scholar] [PubMed]
  38. Iranfar, A.; Arza, A.; Atienza, D. Relearn: A robust machine learning framework in presence of missing data for multimodal stress detection from physiological signals. In Proceedings of the 2021 43rd Annual International Conference of the IEEE Engineering in Medicine & Biology Society (EMBC); IEEE: Piscataway, NJ, USA, 2021; pp. 535–541. [Google Scholar]
  39. Kraskov, A.; Stögbauer, H.; Grassberger, P. Estimating mutual information. Phys. Rev. E-Stat. Nonlinear Soft Matter Phys. 2004, 69, 066138. [Google Scholar] [CrossRef]
  40. Guyon, I.; Elisseeff, A. An introduction to variable and feature selection. J. Mach. Learn. Res. 2003, 3, 1157–1182. [Google Scholar]
  41. Cover, T.; Hart, P. Nearest neighbor pattern classification. IEEE Trans. Inf. Theory 1967, 13, 21–27. [Google Scholar] [CrossRef]
  42. Aha, D.W.; Kibler, D.; Albert, M.K. Instance-based learning algorithms. Mach. Learn. 1991, 6, 37–66. [Google Scholar] [CrossRef]
  43. Breiman, L. Random forests. Mach. Learn. 2001, 45, 5–32. [Google Scholar] [CrossRef]
  44. Wettschereck, D.; Aha, D.W.; Mohri, T. A review and empirical evaluation of feature weighting methods for a class of lazy learning algorithms. Artif. Intell. Rev. 1997, 11, 273–314. [Google Scholar] [CrossRef]
  45. Chen, T.; Guestrin, C. Xgboost: A scalable tree boosting system. In Proceedings of the 22nd Acm Sigkdd International Conference on Knowledge Discovery and Data Mining, San Francisco, CA, USA, 13–17 August 2016; pp. 785–794. [Google Scholar]
  46. Pedregosa, F.; Varoquaux, G.; Gramfort, A.; Michel, V.; Thirion, B.; Grisel, O.; Blondel, M.; Prettenhofer, P.; Weiss, R.; Dubourg, V.; et al. Scikit-learn: Machine learning in Python. J. Mach. Learn. Res. 2011, 12, 2825–2830. [Google Scholar]
  47. Arik, S.Ö.; Pfister, T. Tabnet: Attentive interpretable tabular learning. Proc. AAAI Conf. Artif. Intell. 2021, 35, 6679–6687. [Google Scholar] [CrossRef]
  48. Varma, S.; Simon, R. Bias in error estimation when using cross-validation for model selection. BMC Bioinform. 2006, 7, 91. [Google Scholar] [CrossRef]
  49. Cawley, G.C.; Talbot, N.L. On over-fitting in model selection and subsequent selection bias in performance evaluation. J. Mach. Learn. Res. 2010, 11, 2079–2107. [Google Scholar]
  50. Platt, J. Probabilistic outputs for support vector machines and comparisons to regularized likelihood methods. Adv. Large Margin Classif. 1999, 10, 61–74. [Google Scholar]
  51. Zadrozny, B.; Elkan, C. Transforming classifier scores into accurate multiclass probability estimates. In Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Edmonton, AB, Canada, 23–26 July 2002; pp. 694–699. [Google Scholar]
  52. Vovk, V.; Gammerman, A.; Shafer, G. Algorithmic Learning in a Random World; Springer: Berlin/Heidelberg, Germany, 2005. [Google Scholar]
  53. Guo, C.; Pleiss, G.; Sun, Y.; Weinberger, K.Q. On calibration of modern neural networks. In Proceedings of the International Conference on Machine Learning, PMLR, Sydney, Australia, 6–11 August 2017; pp. 1321–1330. [Google Scholar]
  54. Glenn, W.B. Verification of forecasts expressed in terms of probability. Mon. Weather Rev. 1950, 78, 1–3. [Google Scholar] [CrossRef]
  55. Gama, J.; Žliobaitė, I.; Bifet, A.; Pechenizkiy, M.; Bouchachia, A. A survey on concept drift adaptation. ACM Comput. Surv. (CSUR) 2014, 46, 44. [Google Scholar] [CrossRef]
  56. He, H.; Garcia, E.A. Learning from imbalanced data. IEEE Trans. Knowl. Data Eng. 2009, 21, 1263–1284. [Google Scholar] [CrossRef]
  57. Chawla, N.V.; Bowyer, K.W.; Hall, L.O.; Kegelmeyer, W.P. SMOTE: Synthetic minority over-sampling technique. J. Artif. Intell. Res. 2002, 16, 321–357. [Google Scholar] [CrossRef]
  58. Ambroise, C.; McLachlan, G.J. Selection bias in gene extraction on the basis of microarray gene-expression data. Proc. Natl. Acad. Sci. USA 2002, 99, 6562–6566. [Google Scholar] [CrossRef] [PubMed]
Figure 1. Overview of the proposed sensor-driven CBR framework CogCBR. Raw vertical ground-reaction-force signals from bilateral force-sensitive insoles (100 Hz) are pre-processed and converted into a 41-dimensional feature vector that is reduced to the 18 most discriminative features via mutual-information (MI) selection, forming the case base. The R4 reasoning cycle then proceeds: Retrieve (RF-weighted k-NN over the MI-selected features), Reuse (inverse-distance weighted voting yielding a continuous PD probability), Revise (entropy-based confidence and threshold-based triage to specialist review), and Retain (competence-based curation that updates the case base via the dashed feedback arrow). The system outputs a screening prediction, a triage flag, a case-based explanation, and a curated case base.
Figure 1. Overview of the proposed sensor-driven CBR framework CogCBR. Raw vertical ground-reaction-force signals from bilateral force-sensitive insoles (100 Hz) are pre-processed and converted into a 41-dimensional feature vector that is reduced to the 18 most discriminative features via mutual-information (MI) selection, forming the case base. The R4 reasoning cycle then proceeds: Retrieve (RF-weighted k-NN over the MI-selected features), Reuse (inverse-distance weighted voting yielding a continuous PD probability), Revise (entropy-based confidence and threshold-based triage to specialist review), and Retain (competence-based curation that updates the case base via the dashed feedback arrow). The system outputs a screening prediction, a triage flag, a case-based explanation, and a curated case base.
Sensors 26 04158 g001
Figure 2. Sensor-to-feature processing pipeline. Raw vertical ground-reaction-force signals from bilateral force-sensitive insoles (16 plantar-pressure channels plus per-foot total force at 100 Hz) are conditioned, segmented into gait events by adaptive thresholding, and converted into mechanical, temporal, phase, spectral, and complexity features. After missing-value imputation, abnormal-cycle filtering, and standardization, each subject is represented by a clinically interpretable 41-dimensional gait case vector, which is then reduced to 18 dimensions by mutual-information selection for downstream CBR retrieval.
Figure 2. Sensor-to-feature processing pipeline. Raw vertical ground-reaction-force signals from bilateral force-sensitive insoles (16 plantar-pressure channels plus per-foot total force at 100 Hz) are conditioned, segmented into gait events by adaptive thresholding, and converted into mechanical, temporal, phase, spectral, and complexity features. After missing-value imputation, abnormal-cycle filtering, and standardization, each subject is represented by a clinically interpretable 41-dimensional gait case vector, which is then reduced to 18 dimensions by mutual-information selection for downstream CBR retrieval.
Sensors 26 04158 g002
Figure 3. Distribution of two discriminative gait features. (a) Walking speed; (b) right-foot force CV. Violin plots show the full probability density; individual data points are overlaid with jitter and boxplots indicate quartiles. PD patients exhibit significantly lower walking speed and altered right-foot force-variability (lower RF CV in PD relative to controls in this cohort) than controls.
Figure 3. Distribution of two discriminative gait features. (a) Walking speed; (b) right-foot force CV. Violin plots show the full probability density; individual data points are overlaid with jitter and boxplots indicate quartiles. PD patients exhibit significantly lower walking speed and altered right-foot force-variability (lower RF CV in PD relative to controls in this cohort) than controls.
Sensors 26 04158 g003
Figure 4. ROC curves comparing CogCBR with the top traditional ML and deep learning baselines on GaitPDB. AUC values shown in this figure are computed on predictions pooled across folds and therefore differ marginally from the per-fold means reported in Table 1 (e.g., 0.868 pooled vs. 0.861 per-fold mean for CogCBR).
Figure 4. ROC curves comparing CogCBR with the top traditional ML and deep learning baselines on GaitPDB. AUC values shown in this figure are computed on predictions pooled across folds and therefore differ marginally from the per-fold means reported in Table 1 (e.g., 0.868 pooled vs. 0.861 per-fold mean for CogCBR).
Sensors 26 04158 g004
Figure 5. Distribution of predicted PD probabilities by true label. The two distributions are well-separated (Cohen’s d = 1.68 ), and most predictions fall clearly on the correct side of the 0.5 decision threshold.
Figure 5. Distribution of predicted PD probabilities by true label. The two distributions are well-separated (Cohen’s d = 1.68 ), and most predictions fall clearly on the correct side of the 0.5 decision threshold.
Sensors 26 04158 g005
Figure 6. Revise mechanism validation. (a) Neighbor label agreement; (b) classification confidence, both compared for correctly classified vs. misclassified cases. Both metrics are significantly higher for correct predictions ( p < 0.001 ), enabling identification of uncertain cases for specialist referral.
Figure 6. Revise mechanism validation. (a) Neighbor label agreement; (b) classification confidence, both compared for correctly classified vs. misclassified cases. Both metrics are significantly higher for correct predictions ( p < 0.001 ), enabling identification of uncertain cases for specialist referral.
Sensors 26 04158 g006
Figure 7. Calibration of the CogCBR confidence score on GaitPDB. (Left) Reliability diagram (mean predicted confidence vs. empirical accuracy); the diagonal is perfect calibration. (Right) Expected calibration error (ECE, 10 bins; lower is better). The entropy confidence (current Revise) is deliberately a triage/separation score rather than a calibrated probability, which is why its ECE bar is large; post hoc calibration of the IDW probability (Platt, isotonic, RF-probability + Platt) and split conformal prediction on the CogCBR score yield well-calibrated or validly covered estimates when a calibrated risk is required.
Figure 7. Calibration of the CogCBR confidence score on GaitPDB. (Left) Reliability diagram (mean predicted confidence vs. empirical accuracy); the diagonal is perfect calibration. (Right) Expected calibration error (ECE, 10 bins; lower is better). The entropy confidence (current Revise) is deliberately a triage/separation score rather than a calibrated probability, which is why its ECE bar is large; post hoc calibration of the IDW probability (Platt, isotonic, RF-probability + Platt) and split conformal prediction on the CogCBR score yield well-calibrated or validly covered estimates when a calibrated risk is required.
Sensors 26 04158 g007
Figure 8. Held-out AUC versus number of arrived subjects under the Retain streaming simulation ( τ = 0.1 ; mean over 10 random stream orderings, shaded bands denote ± one standard deviation), for each follow-up confirmation rate: label-verified policy (A), naive self-training (B), verification ablation (B2), all-true-label no-curation reference (C), and static no-growth baseline (D).
Figure 8. Held-out AUC versus number of arrived subjects under the Retain streaming simulation ( τ = 0.1 ; mean over 10 random stream orderings, shaded bands denote ± one standard deviation), for each follow-up confirmation rate: label-verified policy (A), naive self-training (B), verification ablation (B2), all-true-label no-curation reference (C), and static no-growth baseline (D).
Sensors 26 04158 g008
Table 1. Screening performance under stratified 10-fold CV on the primary GaitPDB cohort and an independent-cohort reproducibility evaluation on GaitNDD (within-cohort 10-fold CV). Best in bold. † = deep learning; ‡ = domain-specific gait baseline (re-implemented). p < 0.05, ∗∗ p < 0.01 vs. CogCBR (one-sided Wilcoxon signed-rank, uncorrected for multiple comparisons). The Bonferroni-corrected significance at α / 16 0.003 is reached only by the 1D-CNN comparison ( p = 0.002 ); see Section 5. “—” = not evaluated; baselines requiring time-series input or that failed to converge on n = 55 were omitted on GaitNDD (Section 3.9). LSTM-raw is reported as a supplementary raw-sequence configuration and is not counted among the 16 baselines used for multiple-comparison correction. CogCBR achieves sensitivity = 0.745 on GaitPDB and 0.897 on GaitNDD; per-baseline sensitivities are omitted from the table for compactness and may not follow the same ranking as accuracy.
Table 1. Screening performance under stratified 10-fold CV on the primary GaitPDB cohort and an independent-cohort reproducibility evaluation on GaitNDD (within-cohort 10-fold CV). Best in bold. † = deep learning; ‡ = domain-specific gait baseline (re-implemented). p < 0.05, ∗∗ p < 0.01 vs. CogCBR (one-sided Wilcoxon signed-rank, uncorrected for multiple comparisons). The Bonferroni-corrected significance at α / 16 0.003 is reached only by the 1D-CNN comparison ( p = 0.002 ); see Section 5. “—” = not evaluated; baselines requiring time-series input or that failed to converge on n = 55 were omitted on GaitNDD (Section 3.9). LSTM-raw is reported as a supplementary raw-sequence configuration and is not counted among the 16 baselines used for multiple-comparison correction. CogCBR achieves sensitivity = 0.745 on GaitPDB and 0.897 on GaitNDD; per-baseline sensitivities are omitted from the table for compactness and may not follow the same ranking as accuracy.
MethodGaitPDB (115 subj.)GaitNDD (55 subj.)
AUC Acc F1 Spec p AUC p
CogCBR (Ours) 0.861 0.800 0.801 0.880 0.902
Domain-specific gait baselines (Group C)
Wahid-2015 ‡ [7]0.7980.7220.7600.6400.031 0.8040.203
Rehman-2019 ‡ [8]0.8210.7480.7880.6600.049 0.8720.438
Generic ML baselines (Group A)
XGBoost0.8090.7300.7720.6300.049 0.8120.219
Random Forest0.7930.7380.7760.6450.049 0.8870.594
Log. Regr.0.7990.7490.7810.6950.037 0.8330.406
SVM (Linear)0.7930.7130.7620.5950.040
SVM (RBF)0.7690.6940.7480.5450.0630.8210.266
k-NN ( k = 5 )0.7630.7200.7530.6650.014 0.8330.031
Naive Bayes0.7830.6940.6820.7900.0550.8580.406
Decision Tree0.7140.7240.7630.6550.010 ∗∗0.7830.055
MLP0.7810.7390.7660.6900.013
GBM0.8360.7400.7850.6100.1210.8500.453
Deep learning baselines (Group B)
Deep MLP †0.7540.6860.7150.6500.012
1D-CNN †0.7220.6300.6220.6900.002
LSTM †0.7770.6930.7260.6500.020
TabNet †0.7060.7060.7240.7150.021
Supplementary raw-sequence baseline (not in 16-baseline correction)
LSTM-raw †0.7810.7030.7310.6600.023
Table 2. Nested cross-validation bias audit. Fixed-parameter rows reproduce the protocol used for the main comparison (Table 1); nested rows recompute median imputation, standardization, MI ranking, RF feature weights, and the selection of n and k strictly inside each training fold. Nested values are mean ± SD over the 10 outer folds.
Table 2. Nested cross-validation bias audit. Fixed-parameter rows reproduce the protocol used for the main comparison (Table 1); nested rows recompute median imputation, standardization, MI ranking, RF feature weights, and the selection of n and k strictly inside each training fold. Nested values are mean ± SD over the 10 outer folds.
DatasetProtocolAUCAccF1Sens.Spec.
GaitPDBFixed-parameter0.8610.8000.8010.7450.880
Nested ( Δ AUC = 0.019 ) 0.842 ± 0.093 0.758 ± 0.123 0.781 ± 0.123 0.781 ± 0.186 0.735 ± 0.155
GaitNDDFixed-parameter0.902
Nested ( Δ AUC = 0.067 ) 0.835 ± 0.168 0.857 ± 0.104 0.893 ± 0.081 0.892 ± 0.135 0.750 ± 0.335
Table 3. Tuned-vs.-tuned comparison on GaitPDB (stratified 10-fold, seed 42; each Group A baseline tuned by inner-CV, CogCBR uses its nested AUC). p is the one-sided Wilcoxon signed-rank ( H 1 : CogCBR > baseline), uncorrected; no comparison survives Bonferroni correction ( α / 16 0.003 ). CogCBR posts the highest AUC but its margin over the strongest tuned baseline (GBM) is not significant.
Table 3. Tuned-vs.-tuned comparison on GaitPDB (stratified 10-fold, seed 42; each Group A baseline tuned by inner-CV, CogCBR uses its nested AUC). p is the one-sided Wilcoxon signed-rank ( H 1 : CogCBR > baseline), uncorrected; no comparison survives Bonferroni correction ( α / 16 0.003 ). CogCBR posts the highest AUC but its margin over the strongest tuned baseline (GBM) is not significant.
MethodDefault AUCTuned AUCp vs. CogCBR
CogCBR (nested)0.8610.842
GBM0.8360.8360.242
SVM-Linear0.7930.8230.216
SVM-RBF0.7690.7980.097
XGBoost0.8090.7940.037
Logistic Regression0.7990.7850.156
Random Forest0.7930.7840.006
Naive Bayes0.7830.7830.043
MLP0.7810.7480.005
k-NN0.7630.7310.005
Decision Tree0.7140.7210.019
Table 4. Tuned-vs.-tuned comparison on GaitNDD (Group A baselines that run on stride-interval data and converge; MLP and SVM-Linear are excluded as in Table 1). Per-fold AUC variance is large (SD up to ± 0.24 on 55 subjects), so the ranking is not statistically separable; no comparison survives Bonferroni correction.
Table 4. Tuned-vs.-tuned comparison on GaitNDD (Group A baselines that run on stride-interval data and converge; MLP and SVM-Linear are excluded as in Table 1). Per-fold AUC variance is large (SD up to ± 0.24 on 55 subjects), so the ranking is not statistically separable; no comparison survives Bonferroni correction.
MethodDefault AUCTuned AUCp vs. CogCBR
Random Forest0.8870.9130.892
k-NN0.8330.8830.857
Naive Bayes0.8580.8580.642
XGBoost0.8120.8380.554
CogCBR (nested)0.9020.835
SVM-RBF0.8210.8210.446
GBM0.8500.8190.500
Logistic Regression0.8330.8170.358
Decision Tree0.7830.7580.171
Table 5. Multiple-comparison summary on GaitPDB. For each baseline, the uncorrected one-sided Wilcoxon signed-rank p-value ( H 1 : CogCBR > baseline, from Table 1) and whether it remains significant at the uncorrected level ( α = 0.05 ) and at the Bonferroni-corrected level ( α / 16 0.003 ). Thirteen of sixteen comparisons are significant before correction; only the 1D-CNN comparison survives Bonferroni correction.
Table 5. Multiple-comparison summary on GaitPDB. For each baseline, the uncorrected one-sided Wilcoxon signed-rank p-value ( H 1 : CogCBR > baseline, from Table 1) and whether it remains significant at the uncorrected level ( α = 0.05 ) and at the Bonferroni-corrected level ( α / 16 0.003 ). Thirteen of sixteen comparisons are significant before correction; only the 1D-CNN comparison survives Bonferroni correction.
Baselinep (uncorr.) p < 0.05 p < 0.003
Wahid-20150.031YesNo
Rehman-20190.049YesNo
XGBoost0.049YesNo
Random Forest0.049YesNo
Logistic Regression0.037YesNo
SVM (Linear)0.040YesNo
SVM (RBF)0.063NoNo
k-NN ( k = 5 )0.014YesNo
Naive Bayes0.055NoNo
Decision Tree0.010YesNo
MLP0.013YesNo
GBM0.121NoNo
Deep MLP0.012YesNo
1D-CNN0.002YesYes
LSTM0.020YesNo
TabNet0.021YesNo
Significant before correction: 13/16; survive Bonferroni: 1/16 (1D-CNN).
Table 6. Revise-stage confidence threshold analysis for clinical triage. AUC is computed on predictions pooled across all folds. The high-threshold rows correspond to small absolute sample sizes (∼40 subjects at ≥0.3, ∼16 subjects at ≥0.6); the accuracies on these rows describe the easiest-to-classify subset of the cohort and should not be over-interpreted as deployment estimates. The Subjects column gives the absolute number of GaitPDB subjects retained at each threshold (pooled across folds, out of 115).
Table 6. Revise-stage confidence threshold analysis for clinical triage. AUC is computed on predictions pooled across all folds. The high-threshold rows correspond to small absolute sample sizes (∼40 subjects at ≥0.3, ∼16 subjects at ≥0.6); the accuracies on these rows describe the easiest-to-classify subset of the cohort and should not be over-interpreted as deployment estimates. The Subjects column gives the absolute number of GaitPDB subjects retained at each threshold (pooled across folds, out of 115).
Confidence ≥Coverage (%)Subjects (n)Accuracy (%)AUC
0.0 (no filter)100.011580.00.868
0.168.77987.30.907
0.334.84092.50.924
0.613.916100.01.000
Table 7. Calibration comparison on GaitPDB (stratified 10-fold CV, seed 42). Calibrators and the conformal calibration set are fit within each training fold (25% held out per fold); none see the test fold (the reduced case base accounts for the slightly lower accuracy than Table 1). ECE uses 10 bins. The entropy confidence is the triage score of Section 3.5, reported here read as a probability of correctness; its high ECE reflects that role rather than a calibrated probability. Lowest ECE in bold.
Table 7. Calibration comparison on GaitPDB (stratified 10-fold CV, seed 42). Calibrators and the conformal calibration set are fit within each training fold (25% held out per fold); none see the test fold (the reduced case base accounts for the slightly lower accuracy than Table 1). ECE uses 10 bins. The entropy confidence is the triage score of Section 3.5, reported here read as a probability of correctness; its high ECE reflects that role rather than a calibrated probability. Lowest ECE in bold.
MethodAccuracyECEBrierConformal Cov.
Entropy confidence (current Revise)0.7640.4910.466
Raw IDW probability0.7640.0980.183
Platt scaling (IDW p)0.6610.0380.202
Isotonic regression (IDW p)0.7210.0880.197
Split conformal (CogCBR score)0.7700.1080.1860.933 (target 0.900)
RF probability + Platt0.7150.0350.180
Table 8. Case competence distribution under the operational Retain thresholds (Section 3.6).
Table 8. Case competence distribution under the operational Retain thresholds (Section 3.6).
Operational GroupCasesPercentage
≥0.7 (confirmed retain)7968.7%
0.3 0.7 (monitoring)2723.5%
<0.3 (flagged for specialist review)97.8%
Table 9. Retain longitudinal simulation on GaitPDB ( τ = 0.1 , 10 seeds, means). A = label-verified augmentation policy; B = naive self-training (predicted labels); B2 = verification ablation (A’s data flow, unverified confident labels); C = all-true-label reference with no curation (fixed at 86 cases); D = static no-growth (34 cases, held-out AUC 0.750). p is the paired area-under-the-learning-curve test for A vs. B. Injected label noise: A = 0 throughout, B = 11.0 , B2 rising 2.5 9.7 with the confirmation rate. A beats B and the static baseline D at every rate and approaches C, matching it within the per-fold noise at confirmation rates ≥0.7. Because C performs no competence-based curation, A—which does—can match or marginally exceed it (0.838 vs. 0.829 at the full confirmation rate); C is therefore a no-curation reference, not a strict upper bound. A attains this while bounding case-base growth (60.8–80.9 vs. 86 cases for C).
Table 9. Retain longitudinal simulation on GaitPDB ( τ = 0.1 , 10 seeds, means). A = label-verified augmentation policy; B = naive self-training (predicted labels); B2 = verification ablation (A’s data flow, unverified confident labels); C = all-true-label reference with no curation (fixed at 86 cases); D = static no-growth (34 cases, held-out AUC 0.750). p is the paired area-under-the-learning-curve test for A vs. B. Injected label noise: A = 0 throughout, B = 11.0 , B2 rising 2.5 9.7 with the confirmation rate. A beats B and the static baseline D at every rate and approaches C, matching it within the per-fold noise at confirmation rates ≥0.7. Because C performs no competence-based curation, A—which does—can match or marginally exceed it (0.838 vs. 0.829 at the full confirmation rate); C is therefore a no-curation reference, not a strict upper bound. A attains this while bounding case-base growth (60.8–80.9 vs. 86 cases for C).
Confirm_RateABB2CDA SizeA-vs-B p
0.30.8010.7190.8020.8290.75060.80.049
0.50.8070.7190.7920.8290.75066.70.006
0.70.8240.7190.7840.8290.75072.50.004
1.00.8380.7190.7740.8290.75080.90.002
Table 10. Source-to-target transfer: train on GaitPDB and test on GaitNDD using only shared stride-based features. Best per column in bold. This experiment is reported for transparency; the main claims of the paper rely on within-dataset cross-validation and the independent-cohort reproducibility evaluation on GaitNDD rather than on direct cross-modality transfer, in which CogCBR does not exceed the strongest classical baseline.
Table 10. Source-to-target transfer: train on GaitPDB and test on GaitNDD using only shared stride-based features. Best per column in bold. This experiment is reported for transparency; the main claims of the paper rely on within-dataset cross-validation and the independent-cohort reproducibility evaluation on GaitNDD rather than on direct cross-modality transfer, in which CogCBR does not exceed the strongest classical baseline.
MethodAUCAccF1Sens.Spec.
Logistic Regression0.8320.7640.8170.7440.813
GBM0.7980.5820.6100.4620.875
XGBoost0.7630.6180.6560.5130.875
Random Forest0.7570.6180.6440.4870.938
SVM (RBF)0.7520.4730.4310.2820.938
k-NN0.7520.6180.6560.5130.875
CogCBR0.7370.5640.6000.4620.813
Table 11. Computational cost and deployment footprint on the GaitPDB analysis set (115 subjects). Training time is reported as wall-clock fitting time. CogCBR includes RF-based feature-weight estimation; at this scale, MI ranking and standardization introduce negligible overhead. Inference latency is measured for a single query sample (per-subject deployment scenario) and averaged over 2000 runs. Best in bold.
Table 11. Computational cost and deployment footprint on the GaitPDB analysis set (115 subjects). Training time is reported as wall-clock fitting time. CogCBR includes RF-based feature-weight estimation; at this scale, MI ranking and standardization introduce negligible overhead. Inference latency is measured for a single query sample (per-subject deployment scenario) and averaged over 2000 runs. Best in bold.
MethodTrain Time (s)Inference (ms/Sample)Deployment Size (KB)
CogCBR<0.10.0808.4
Random Forest<0.12.67848.1
XGBoost<0.10.51015.0
1D-CNN1.5150.42635.0
LSTM0.9800.369211.7
Table 12. Distance metric ablation (MI-18, k = 7 ).
Table 12. Distance metric ablation (MI-18, k = 7 ).
Distance MetricAUCAccuracySensitivitySpecificity
RF-weighted Euclidean0.8610.8000.7450.880
Cosine0.8130.7480.7900.685
Manhattan0.8050.7150.7000.740
Euclidean0.7850.7640.7290.815
NCA0.7660.6880.6860.685
Table 13. Component ablation. MI = MI feature selection (18 features); W-Euclid = RF-weighted Euclidean distance; IDW = inverse-distance weighted voting.
Table 13. Component ablation. MI = MI feature selection (18 features); W-Euclid = RF-weighted Euclidean distance; IDW = inverse-distance weighted voting.
ConfigurationAUC Δ
Full CogCBR (MI + W-Euclid + IDW)0.861
No MI (41 feat. + W-Euclid + IDW)0.834−0.027
MI + Euclidean + Majority0.787−0.074
MI + NCA + IDW0.766−0.095
No MI + Euclidean + Majority0.759−0.102
Table 14. Class-imbalance ablation on GaitPDB and GaitNDD (stratified 10-fold CV, seed 42; balancing applied inside each training fold). Values are means over the 10 folds. Strategy (a) is the unbalanced CogCBR configuration and reproduces the primary result (Table 1); minor differences in threshold-dependent metrics reflect numerical tolerance across re-runs. No strategy improves AUC; all reduce sensitivity and raise specificity. GaitNDD per-class metrics carry wide variance (standard deviation up to ± 0.33 for specificity, owing to its 16 controls) and should be read with caution; the sensitivity reduction under class-weighting on GaitNDD is significant ( 0.897 0.617 , p = 0.008 ).
Table 14. Class-imbalance ablation on GaitPDB and GaitNDD (stratified 10-fold CV, seed 42; balancing applied inside each training fold). Values are means over the 10 folds. Strategy (a) is the unbalanced CogCBR configuration and reproduces the primary result (Table 1); minor differences in threshold-dependent metrics reflect numerical tolerance across re-runs. No strategy improves AUC; all reduce sensitivity and raise specificity. GaitNDD per-class metrics carry wide variance (standard deviation up to ± 0.33 for specificity, owing to its 16 controls) and should be read with caution; the sensitivity reduction under class-weighting on GaitNDD is significant ( 0.897 0.617 , p = 0.008 ).
StrategyAUCAccF1Sens.Spec.
GaitPDB
(a) None (unbalanced)0.8610.8000.8010.7450.880
(b) Class-weighted IDW0.8620.7480.7360.6570.880
(c) Random oversampling0.8460.7830.7780.7000.900
(d) SMOTE0.8380.7400.7280.6260.900
(e) Random undersampling0.8470.7490.7430.6570.880
GaitNDD
(a) None (unbalanced)0.9020.8370.8820.8970.688
(b) Class-weighted IDW0.9020.7100.7450.6170.950
(c) Random oversampling0.8580.7500.7740.6920.900
(d) SMOTE0.8400.7630.7970.7420.800
(e) Random undersampling0.8400.7970.8420.7920.800
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Liu, H.; Sun, Y.; Luo, L.; Li, X.; Zhang, H. CogCBR: A Complete Case-Based Reasoning Framework for Wearable-Sensor-Based Gait Screening of Neurodegenerative Diseases. Sensors 2026, 26, 4158. https://doi.org/10.3390/s26134158

AMA Style

Liu H, Sun Y, Luo L, Li X, Zhang H. CogCBR: A Complete Case-Based Reasoning Framework for Wearable-Sensor-Based Gait Screening of Neurodegenerative Diseases. Sensors. 2026; 26(13):4158. https://doi.org/10.3390/s26134158

Chicago/Turabian Style

Liu, Huayue, Yujia Sun, Lihua Luo, Xingeng Li, and Huanghe Zhang. 2026. "CogCBR: A Complete Case-Based Reasoning Framework for Wearable-Sensor-Based Gait Screening of Neurodegenerative Diseases" Sensors 26, no. 13: 4158. https://doi.org/10.3390/s26134158

APA Style

Liu, H., Sun, Y., Luo, L., Li, X., & Zhang, H. (2026). CogCBR: A Complete Case-Based Reasoning Framework for Wearable-Sensor-Based Gait Screening of Neurodegenerative Diseases. Sensors, 26(13), 4158. https://doi.org/10.3390/s26134158

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop