Host-based intrusion detection using dynamic and static behavioral models
The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Abstract
Intrusion detection has emerged as an important approach to network security. In this paper, we adopt an anomaly detection approach by detecting possible intrusions based on program or user profiles built from normal usage data. In particular, program profiles based on Unix system calls and user profiles based on Unix shell commands are modeled using two different types of behavioral models for data mining. The dynamic modeling approach is based on hidden Markov models (HMM) and the principle of maximum likelihood, while the static modeling approach is based on event occurrence frequency distributions and the principle of minimum cross entropy. The novelty detection approach is adopted to estimate the model parameters using normal training data only, as opposed to the classification approach which has to use both normal and intrusion data for training. To determine whether or not a certain behavior is similar enough to the normal model and hence should be classified as normal, we use a scheme that can be justified from the perspective of hypothesis testing. Our experimental results show that the dynamic modeling approach is better than the static modeling approach for the system call datasets, while the dynamic modeling approach is worse for the shell command datasets. Moreover, the static modeling approach is similar in performance to instance-based learning reported previously by others for the same shell command database but with much higher computational and storage requirements than our method.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
A tutorial on hidden Markov models and selected applications in speech recognition
Rabiner, L. R. (1989) · Proceedings of the IEEE · doi:10.1109/5.18626 · Cited by 22,743
On Information and Sufficiency
Kullback, S., & Leibler, R. A. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729694 · Cited by 20,193
(2012) · Encyclopedia of the Sciences of Learning · doi:10.1007/978-1-4419-1428-6_5195 · Cited by 19,370
Russell, E. L., Chiang, L. H., & Braatz, R. D. (2000) · Advances in Industrial Control · doi:10.1007/978-1-4471-0409-4_3 · Cited by 7,862
Baum, L. E., Petrie, T., Soules, G., & Weiss, N. (1970) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177697196 · Cited by 4,297
Denning, D. E. (1987) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1987.232894 · Cited by 3,427
Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy
Shore, J., & Johnson, R. (1980) · IEEE Transactions on Information Theory · doi:10.1109/tit.1980.1056144 · Cited by 1,774
Data Mining Approaches for Intrusion Detection
Lee, W., & Stolfo, S. J. (2000) · doi:10.21236/ada401496 · Cited by 1,179
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
Detecting intrusions using system calls: alternative data models
Warrender, C., Forrest, S., & Pearlmutter, B. (2003) · Proceedings of the 1999 IEEE Symposium on Security and Privacy (Cat. No.99CB36344) · doi:10.1109/secpri.1999.766910 · Cited by 1,106
A sense of self for Unix processes
Forrest, S., Hofmeyr, S. A., Somayaji, A., & Longstaff, T. A. (2002) · Proceedings 1996 IEEE Symposium on Security and Privacy · doi:10.1109/secpri.1996.502675 · Cited by 874
Towards a taxonomy of intrusion-detection systems
Debar, H., Dacier, M., & Wespi, A. (1999) · Computer Networks · doi:10.1016/s1389-1286(98)00017-6 · Cited by 829
Empirical methods for artificial intelligence
(1996) · Choice Reviews Online · doi:10.5860/choice.33-5144 · Cited by 625
Novelty Detection and Neural Network Validation
Bishop, C. M. (1993) · ICANN ’93 · doi:10.1007/978-1-4471-2063-6_225 · Cited by 436
Intrusion Detection with Neural Networks
Ryan, J., Lin, M.-J., & Miikkulainen, R. P. (1997) · Cited by 416
A novelty detection approach to classification
Japkowicz, N., Myers, C. E., & Gluck, M. A. (1995) · Cited by 412
Novelty detection and neural network validation
Bishop, C. M. (1994) · IEE Proceedings - Vision, Image, and Signal Processing · doi:10.1049/ip-vis:19941330 · Cited by 394
Temporal sequence learning and data reduction for anomaly detection
Lane, T., & Brodley, C. E. (1999) · ACM Transactions on Information and System Security · doi:10.1145/322510.322526 · Cited by 386
Empirical methods for artificial intelligence
(1996) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(96)90087-5 · Cited by 238
Temporal sequence learning and data reduction for anomaly detection
Lane, T. D. R., & Brodley, C. E. (1998) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/288090.288122 · Cited by 151
Intelligent agents for intrusion detection
Helmer, G., Wong, J. S. K., Honavar, V., & Miller, L. L. (2002) · IEEE Information Technology Conference: Information Environment for the Future · doi:10.1109/it.1998.713396 · Cited by 144
Intrusion detection. Applying machine learning to Solaris audit data
Endler, D. (2002) · Annual Computer Security Applications Conference · doi:10.1109/csac.1998.738647 · Cited by 109
Johnson, R., & Shore, J. E. (1983) · IEEE Transactions on Information Theory · doi:10.1109/tit.1983.1056747 · Cited by 102
Detecting masquerades in intrusion detection based on unpopular commands
Schonlau, M., & Theus, M. (2000) · Information Processing Letters · doi:10.1016/s0020-0190(00)00122-8 · Cited by 96
Autoassociation and Novelty Detection by Neuromechanics
Daunicht, W. J. (1991) · Science · doi:10.1126/science.1891718 · Cited by 13
Cited by
Anomaly-based network intrusion detection: Techniques, systems and challenges
García-Teodoro, P., Díaz-Verdejo, J., Maciá-Fernández, G., & Vázquez, E. (2009) · Computers & Security · doi:10.1016/j.cose.2008.08.003 · Cited by 2,085
Pimentel, M. A. F., Clifton, D. A., Clifton, L., & Tarassenko, L. (2014) · Signal Processing · doi:10.1016/j.sigpro.2013.12.026 · Cited by 1,649
An overview of anomaly detection techniques: Existing solutions and latest technological trends
Patcha, A., & Park, J.-M. (2007) · Computer Networks · doi:10.1016/j.comnet.2007.02.001 · Cited by 1,561
Novelty detection: a review—part 1: statistical approaches
Markou, M., & Singh, S. (2003) · Signal Processing · doi:10.1016/j.sigpro.2003.07.018 · Cited by 1,432
A Comparative Evaluation of Unsupervised Anomaly Detection Algorithms for Multivariate Data
Goldstein, M., & Uchida, S. (2016) · PLOS ONE · doi:10.1371/journal.pone.0152173 · Cited by 1,032
Metadata
- Authors
- Yeung, D.-Y., & Ding, Y.
- Venue
- Pattern Recognition
- Publisher
- Elsevier BV
- Published
- 2003-01
- Volume
- 36
- Issue
- 1
- Pages
- 229-243
- ISSN
- 0031-3203 (ISSN-L)
- OpenAlex
- W2093488494
- Cited by
- 349
- References
- 26
- FWCI
- 7.59
- 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
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.