OpenResearchAlpha

Frontiers in Big Data · 11 Nov 2026

Reliability diagnostics for post-hoc explanations in network intrusion detection: a SHAP–LIME agreement study

Burak Aggul

0
Citations
no database records one yet
0
Citations in 2026
so far
–
Leading author's h-index
no author has a profile yet
19
References
works it cites, from open citation data

Citations by database

Each database indexes a different set of journals, preprints and books, so they are shown side by side rather than blended.

  • OpenCitations0
  • Crossref0

Citations per year

The current year is still counting.

  • 2026 so far0

Abstract

Introduction High classification performance does not establish the reliability of post-hoc explanations in network intrusion detection. Methods This study evaluates SHAP and LIME by separating agreement between methods from within-method repeatability and prediction changes under feature replacement. Four classifiers are compared on CIC-IDS2017, UNSW-NB15, and NSL-KDD using five training seeds per task. Local explanation analyses focus on five fitted Transformers, with an additional NSL-KDD checkpoint to examine model-seed sensitivity. Shared-reference comparisons, sampling-budget tests, global and different-flow ranking controls, and matched random-feature replacements are used to assess the results. Results Mean top-five Jaccard agreement ranges from 0.15 to 0.40, while rank-biased overlap ranges from 0.24 to 0.55. However, much of this overlap also occurs between different flows with the same predicted class, limiting evidence of flow-specific agreement. Larger SHAP budgets improve within-method repeatability but do not ensure closer agreement with LIME. Under conditional-donor replacement, removing top-ranked features does not consistently reduce predicted-class probabilities more than random removal. Retaining these features better preserves the probabilities, although weak or unchanged replacements limit the interpretation. Discussion These findings show that agreement alone is insufficient to establish explanation reliability. For practical use, feature rankings should be evaluated alongside within-method repeatability and perturbation controls that measure actual input changes.

What the data shows

  • No database records a citation yet, as is usual for a paper this new.

Graph

This paper in the middle, its authors and their most-cited papers below, the papers it cites to the left and the papers citing it to the right. The timeline lays every paper out by year.

Citing paper shares an authorAuthor without a profileSize shows citations, or h-index for authors

Select a node for its details. Drag to pan, scroll to zoom, drag a node to move it.

Start with

Authors (1)

Each author's standing in QAI's scholar index: the works their ORCID iD is attached to, and for anyone whose ORCID record names a lab OpenResearch follows, their arXiv preprints matched by name and a shared co-author. Names are as printed on the paper.

ProfileMost-cited paper

Cited by 0 papers

Who cites this paper, from open citation data, with Crossref's record of each; the 100 newest when there are more.

0 shown
No citing papers for this filter.

References (19)

What it cites, from open citation data, with Crossref's record of each.