The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
AdaBoost-Based Algorithm for Network Intrusion Detection
Abstract
Network intrusion detection aims at distinguishing the attacks on the Internet from normal use of the Internet. It is an indispensable part of the information security system. Due to the variety of network behaviors and the rapid development of attack fashions, it is necessary to develop fast machine-learning-based intrusion detection algorithms with high detection rates and low false-alarm rates. In this correspondence, we propose an intrusion detection algorithm based on the AdaBoost algorithm. In the algorithm, decision stumps are used as weak classifiers. The decision rules are provided for both categorical and continuous features. By combining the weak classifiers for continuous features and the weak classifiers for categorical features into a strong classifier, the relations between these two different types of features are handled naturally, without any forced conversions between continuous and categorical features. Adaptable initial weights and a simple strategy for avoiding overfitting are adopted to improve the performance of the algorithm. Experimental results show that our algorithm has low computational complexity and error rates, as compared with algorithms of higher computational complexity, as tested on the benchmark sample data.
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
Rapid object detection using a boosted cascade of simple features
Viola, P., & Jones, M. (2005) · Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001 · doi:10.1109/cvpr.2001.990517 · Cited by 18,300
Denning, D. E. (1987) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1987.232894 · Cited by 3,427
A Short Introduction to Boosting
Freund, Y., & Schapire, R. E. (1999) · Cited by 2,984
McHugh, J. (2000) · ACM Transactions on Information and System Security · doi:10.1145/382912.382923 · Cited by 1,309
A data mining framework for building intrusion detection models
Lee, W., Stolfo, S. J., & Mok, K. W. (2003) · Proceedings of the 1999 IEEE Symposium on Security and Privacy (Cat. No.99CB36344) · doi:10.1109/secpri.1999.766909 · Cited by 1,148
A framework for constructing features and models for intrusion detection systems
Lee, W., & Stolfo, S. J. (2000) · ACM Transactions on Information and System Security · doi:10.1145/382912.382914 · Cited by 974
The 1999 DARPA off-line intrusion detection evaluation
Lippmann, R., Haines, J. W., Fried, D. J., Korba, J., & Das, K. (2000) · Computer Networks · doi:10.1016/s1389-1286(00)00139-0 · Cited by 876
Intrusion detection using neural networks and support vector machines
Mukkamala, S., Janoski, G., & Sung, A. (2003) · Proceedings of the 2002 International Joint Conference on Neural Networks. IJCNN'02 (Cat. No.02CH37290) · doi:10.1109/ijcnn.2002.1007774 · Cited by 814
Mining distance-based outliers in near linear time with randomization and a simple pruning rule
Bay, S. D., & Schwabacher, M. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956758 · Cited by 613
Cited by
Dong, X., Yu, Z., Cao, W., Shi, Y., & Ma, Q. (2020) · Frontiers of Computer Science · doi:10.1007/s11704-019-8208-z · Cited by 1,928
Boutaba, R., Salahuddin, M. A., Limam, N., Ayoubi, S., Shahriar, N., Estrada-Solano, F., & Caicedo, O. M. (2018) · Journal of Internet Services and Applications · doi:10.1186/s13174-018-0087-2 · Cited by 1,036
Building an efficient intrusion detection system based on feature selection and ensemble classifier
Zhou, Y., Cheng, G., Jiang, S., & Dai, M. (2020) · Computer Networks · doi:10.1016/j.comnet.2020.107247 · Cited by 675
Khan, A. A., Chaudhari, O., & Chandra, R. (2024) · Expert Systems with Applications · doi:10.1016/j.eswa.2023.122778 · Cited by 530
CANN: An intrusion detection system based on combining cluster centers and nearest neighbors
Lin, W.-C., Ke, S.-W., & Tsai, C.-F. (2015) · Knowledge-Based Systems · doi:10.1016/j.knosys.2015.01.009 · Cited by 484
Metadata
- Authors
- Hu, W., Hu, W., & Maybank, S.
- Venue
- IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)
- Published
- 2008-04
- Volume
- 38
- Issue
- 2
- Pages
- 577-583
- ISSN
- 1083-4419 (ISSN-L)
- OpenAlex
- W2150755264
- Cited by
- 394
- References
- 41
- FWCI
- 16.46
- 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: AdaBoost-Based Algorithm for Network Intrusion Detection. https://app.cochat.ai/papers/10.1109/tsmcb.2007.914695
- The paper
- Hu, W., Hu, W., & Maybank, S. (2008). AdaBoost-Based Algorithm for Network Intrusion Detection. IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics). https://doi.org/10.1109/tsmcb.2007.914695
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.