An improved feature extraction algorithm for insider threat using hidden Markov model on user behavior detection
The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Abstract
Purpose: By using a new feature extraction method on the Cert data set and using a hidden Markov model (HMM) to model and analyze the behavior of users to distinguish whether the behavior is normal within a continuous period. Design/methodology/approach: Feature extraction of five parts of the time series by rules and sorting in chronological order. Use the obtained features to calculate the probability parameters required by the HMM model and establish a behavior model for each user. When the user has abnormal behavior, the model will return a very low probability value to distinguish between normal and abnormal information. Findings: Generally, HMM parameters are obtained by supervised learning and unsupervised learning, but the hidden state cannot be clearly defined. When the hidden state is determined according to the data set, the accuracy of the model will be improved. Originality/value: This paper proposes a new feature extraction method and analysis mode, which determines the shape of the hidden state according to the situation of the data set, making subsequent HMM modeling simple and efficient and in turn improving the accuracy of user behavior detection.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Unsupervised learning approaches, including clustering algorithms like K-Means and hierarchical clustering, are adept at grouping similar behavioral patterns and flagging outliers [61], [70], [71], [72] .”
From A Review of Recent Advances, Challenges, and Opportunities in Malicious Insider Threat Detection Using Machine Learning Methods (2024) · cites this paper as [61]
In the citing paper
“However, the effectiveness of heuristic-based insider threat detection relies heavily on the careful design and fine-tuning of the heuristics themselves as demonstrated in [42], [10], [61].”
From A Review of Recent Advances, Challenges, and Opportunities in Malicious Insider Threat Detection Using Machine Learning Methods (2024) · cites this paper as [61]
In the citing paper
“Deviations from these models can trigger alerts for further investigation, making them suitable for identifying novel insider threats and subtle anomalies that rule-based approaches might miss.”
From A Review of Recent Advances, Challenges, and Opportunities in Malicious Insider Threat Detection Using Machine Learning Methods (2024) · cites this paper as [61]
Citations
Cites
Baum, L. E., Petrie, T., Soules, G., & Weiss, N. (1970) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177697196 · Cited by 4,297
AUGUSTUS: ab initio prediction of alternative transcripts
Stanke, M., Keller, O., Gunduz, I., Hayes, A., Waack, S., & Morgenstern, B. (2006) · Nucleic Acids Research · doi:10.1093/nar/gkl200 · Cited by 2,829
Statistical Inference for Probabilistic Functions of Finite State Markov Chains
Baum, L. E., & Petrie, T. (1966) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177699147 · Cited by 2,775
Baum, L. E. (1972) · Medical Entomology and Zoology · Cited by 1,405
Baum, L. E., & Eagon, J. A. (1967) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1967-11751-8 · Cited by 1,036
AN INTRODUCTION TO HIDDEN MARKOV MODELS AND BAYESIAN NETWORKS
GHAHRAMANI, Z. (2001) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001401000836 · Cited by 700
Growth transformations for functions on manifolds
Baum, L. E., & Sell, G. (1968) · Pacific Journal of Mathematics · doi:10.2140/pjm.1968.27.211 · Cited by 363
Stratonovich, R. L. (1960) · Theory of Probability & Its Applications · doi:10.1137/1105015 · Cited by 339
Big Data Meet Cyber-Physical Systems: A Panoramic Survey
Atat, R., Liu, L., Wu, J., Li, G., Ye, C., & Yang, Y. (2018) · IEEE Access · doi:10.1109/access.2018.2878681 · Cited by 247
Atat, R., Liu, L., Chen, H., Wu, J., Li, H., & Yi, Y. (2017) · IET Cyber-Physical Systems: Theory & Applications · doi:10.1049/iet-cps.2017.0010 · Cited by 162
Research works printed but not linked: 13
- 2008, Applied Probability and Queues, 7
- 2001, Hidden Markov Models: Applications in Computer Vision
- 2013, Multi-Domain Information Fusion for Insider Threat Detection, 45
- 1990, Hidden Markov Models for Speech Recognition
- 2014, A First Course in Stochastic Processes, 29
- 2003, A* parsing: fast exact Viterbi parse selection, 40
- 2012, Stochastic Processes: A Survey of the Mathematical Theory, 106
- 1999, Stochastic Processes, 188
- 1982, Markov Random Fields, 58
- 2009, Basics of Applied Stochastic Processes, 2
- 1996, Stochastic Processes, 174
- 2005, Modeling form for online following of musical performances
- 1997, Real-Time American sign language visual recognition from video using HMMs, 227
Cited by
Alzaabi, F. R., & Mehmood, A. (2024) · IEEE Access · doi:10.1109/access.2024.3369906 · Cited by 204
“Behavior-based detection methods involve the analysis of user actions and activities, employing algorithms and techniques such as user behavior analytics (UBA), time-series analysis, clustering, and sequence pattern mining to create models of normal user behavior [60], [61].”
BackgroundMethodAl-Shehari, T., & Alsowail, R. A. (2021) · Entropy · doi:10.3390/e23101258 · Cited by 193
Text mining of accident reports using semi-supervised keyword extraction and topic modeling
Ahadh, A., Binish, G. V., & Srinivasan, R. (2021) · Process Safety and Environmental Protection · doi:10.1016/j.psep.2021.09.022 · Cited by 131
LaAeb: A comprehensive log-text analysis based approach for insider threat detection
Fei, K., Zhou, J., Zhou, Y., Gu, X., Fan, H., Li, B., Wang, W., & Chen, Y. (2024) · Computers & Security · doi:10.1016/j.cose.2024.104126 · Cited by 32
Al-Shehari, T., & Alsowail, R. A. (2023) · International Journal of Information Security · doi:10.1007/s10207-022-00651-1 · Cited by 25
Metadata
- Authors
- Ye, X., & Han, M.-M.
- Affiliations
- Gachon University (KR)
- Venue
- Information & Computer Security
- Publisher
- Emerald
- Published
- 2020-07-03
- Volume
- 30
- Issue
- 1
- Pages
- 19-36
- ISSN
- 2056-4961 (ISSN-L)
- OpenAlex
- W3124014468
- Cited by
- 16
- References
- 20
- Citations by year
- 2026: 1 · 2025: 3 · 2024: 5 · 2023: 3 · 2022: 2 · 2021: 2
- FWCI
- 0.82
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.emerald.com/insight/site-policies (tdm)
- Locations
- Information and Computer Security (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Network Security and Intrusion Detection
- Physical Sciences › Computer Science › Information Systems › User Authentication and Security Systems
- Physical Sciences › Computer Science › Information Systems › Information and Cyber Security
- Keywords
- insider threats, user behavior detection, feature extraction, hidden Markov models, abnormal behavior detection, time series features
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: An improved feature extraction algorithm for insider threat using hidden Markov model on user behavior detection. https://app.cochat.ai/papers/10.1108/ics-12-2019-0142
- The paper
- Ye, X., & Han, M.-M. (2022). An improved feature extraction algorithm for insider threat using hidden Markov model on user behavior detection. Information & Computer Security. https://doi.org/10.1108/ics-12-2019-0142
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.