Exact Polynomial-Degree Decomposition of a Network Intrusion Detector: Higher-Order Structure and the Reliability of Degree-Level Explanations
IEEE Access · 2026 · 1-1
DOI: 10.1109/access.2026.3753637 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Access, 2026. Verfasst von Eunmok Yang und 2 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Institute of Information & communications Technology Planning & Evaluation, Korea government.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- Institute of Information & communications Technology Planning & Evaluation
- Korea government
Zitieren
APA
Yang, E., Jeong, Y., & Seo, C. (2026). Exact Polynomial-Degree Decomposition of a Network Intrusion Detector: Higher-Order Structure and the Reliability of Degree-Level Explanations. IEEE Access, 1-1. https://doi.org/10.1109/access.2026.3753637
Vancouver
Yang E, Jeong Y, Seo C. Exact Polynomial-Degree Decomposition of a Network Intrusion Detector: Higher-Order Structure and the Reliability of Degree-Level Explanations. IEEE Access. 2026:1-1. doi:10.1109/access.2026.3753637
BibTeX
@article{Yang2026,
author = {Yang, Eunmok and Jeong, Yujin and Seo, Changho},
title = {Exact Polynomial-Degree Decomposition of a Network Intrusion Detector: Higher-Order Structure and the Reliability of Degree-Level Explanations},
journal = {IEEE Access},
year = {2026},
pages = {1--1},
doi = {10.1109/access.2026.3753637}
}
EUVIMED