The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Online Adaboost-Based Parameterized Methods for Dynamic Distributed Network Intrusion Detection
Abstract
Current network intrusion detection systems lack adaptability to the frequently changing network environments. Furthermore, intrusion detection in the new distributed architectures is now a major requirement. In this paper, we propose two online Adaboost-based intrusion detection algorithms. In the first algorithm, a traditional online Adaboost process is used where decision stumps are used as weak classifiers. In the second algorithm, an improved online Adaboost process is proposed, and online Gaussian mixture models (GMMs) are used as weak classifiers. We further propose a distributed intrusion detection framework, in which a local parameterized detection model is constructed in each node using the online Adaboost algorithm. A global detection model is constructed in each node by combining the local parametric models using a small number of samples in the node. This combination is achieved using an algorithm based on particle swarm optimization (PSO) and support vector machines. The global model in each node is used to detect intrusions. Experimental results show that the improved online Adaboost process with GMMs obtains a higher detection rate and a lower false alarm rate than the traditional online Adaboost process that uses decision stumps. Both the algorithms outperform existing intrusion detection algorithms. It is also shown that our PSO, and SVM-based algorithm effectively combines the local detection models into the global model in each node; the global model in a node can handle the intrusion types that are found in other nodes, without sharing the samples of these intrusion types.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A decision-theoretic generalization of on-line learning and an application to boosting
Freund, Y., & Schapire, R. E. (1997) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1504 · Cited by 20,466
A clustering-based method for unsupervised intrusion detections
Jiang, S., Song, X., Wang, H., Han, J.-J., & Li, Q.-H. (2006) · Pattern Recognition Letters · doi:10.1016/j.patrec.2005.11.007 · Cited by 164
Cited by
Survey of intrusion detection systems: Techniques, datasets and challenges
Khraisat, A., Gondal, I., Vamplew, P., & Kamruzzaman, J. (2019) · Cybersecurity · doi:10.1186/s42400-019-0038-7 · Cited by 2,024
A systematic literature review of methods and datasets for anomaly-based network intrusion detection
Yang, Z., Liu, X., Li, T., Wu, D., Wang, J., Zhao, Y., & Han, H. (2022) · Computers & Security · doi:10.1016/j.cose.2022.102675 · Cited by 355
Moustafa, N., Slay, J., & Creech, G. (2019) · IEEE Transactions on Big Data · doi:10.1109/tbdata.2017.2715166 · Cited by 314
Blockchain and Machine Learning for Communications and Networking Systems
Liu, Y., Yu, F. R., Li, X., Ji, H., & Leung, V. C. M. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2975911 · Cited by 313
Firefly algorithm based feature selection for network intrusion detection
B, S., & K, M. (2019) · Computers & Security · doi:10.1016/j.cose.2018.11.005 · Cited by 296
Metadata
- Authors
- Hu, W., Gao, J., Wang, Y., Wu, O., & Maybank, S.
- Venue
- IEEE Transactions on Cybernetics
- Published
- 2014-01
- Volume
- 44
- Issue
- 1
- Pages
- 66-82
- ISSN
- 2168-2267 (ISSN-L)
- 2168-2275
- OpenAlex
- W2112086364
- Cited by
- 164
- References
- 2
- FWCI
- 15.42
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Online Adaboost-Based Parameterized Methods for Dynamic Distributed Network Intrusion Detection. https://app.cochat.ai/papers/10.1109/tcyb.2013.2247592
- The paper
- Hu, W., Gao, J., Wang, Y., Wu, O., & Maybank, S. (2014). Online Adaboost-Based Parameterized Methods for Dynamic Distributed Network Intrusion Detection. IEEE Transactions on Cybernetics. https://doi.org/10.1109/tcyb.2013.2247592
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.