Answers are grounded in this paper and cite their sources.
Boundary Peeling (BP) is a distribution-free framework for unsupervised outlier detection based on successive one-class support vector machine (OCSVM) boundaries. Although BP and its ensemble extension, Ensemble Boundary Peeling (EBP), have shown promising performance, their effectiveness may depend on implementation choices and data characteristics. This study systematically investigates the BP framework’s robustness and tuning through three complementary analyses. First, BP, EBP, and a robustified configuration, Robustified Boundary Peeling (RBP), are evaluated using controlled synthetic datasets covering contamination, dimensionality, correlation, distributional shape, multimodality, and p>n settings, along with semantic benchmark datasets. Second, an ablation study examines the effects of removing BP’s weighting scheme, replacing mean with median aggregation, and adopting a double-MAD-based threshold. Third, the sensitivity of EBP and RBP to stopping rules, OCSVM parameters, ensemble size, and sampled-feature size is assessed. Results show that implementation choices materially affect performance. For EBP, the sampled-feature size matters more than the ensemble size, and a smaller kernel bandwidth improves all average measures. For RBP, the stopping rule and kernel bandwidth affect the thresholded measures, while AUC remains comparatively stable. RBP provides competitive performance, but its advantages are metric- and data-dependent. Overall, the findings emphasize that BP implementation should be treated as a multi-criteria tuning problem rather than a universally optimal fixed configuration.
No takes yet. Share an insight, caveat, or question.
Jawabreh et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: