Cited by 6Network Security and Intrusion DetectionInformation and Cyber SecurityPrivacy-Preserving Technologies in Data

Using Dirichlet Marked Hawkes Processes for Insider Threat Detection

Open access
Zheng, Panpan, Yuan, Shuhan, Wu, Xintao·2022·Digital Threats: Research and Practice

Abstract

Malicious insiders cause significant loss to organizations. Due to an extremely small number of malicious activities from insiders, insider threat is hard to detect. In this article, we present a Dirichlet Marked Hawkes Process (DMHP) to detect malicious activities from insiders in real-time. DMHP combines the Dirichlet process and marked Hawkes processes to model the sequence of user activities. The Dirichlet process is capable of detecting unbounded user modes (patterns) of infinite user activities, while, for each detected user mode, one set of marked Hawkes processes is adopted to model user activities from time and activity type (e.g., WWW visit or send email) information so that different user modes are modeled by different sets of marked Hawkes processes. To achieve real-time malicious insider activity detection, the likelihood of the most recent activity calculated by DMHP is adopted as a score to measure the maliciousness of the activity. Since the majority of user activities are benign, those activities with low likelihoods are labeled as malicious activities. Experimental results on two datasets show the effectiveness of DMHP.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/3457908

Cites

32 of 32 references verified0 citation errors · 0 not checkable

Statistics

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.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 7

  1. [14]14. Hans-Peter Kriegel, Peer Kröger, Erich Schubert, and Arthur Zimek. 2009. LoOP: Local outlier probabilities. In 18th ACM Conference on Information and Knowledge Management. ACM, 1649-1652.
  2. [15]15. Srijan Kumar, Francesca Spezzano, and V. S. Subrahmanian. 2015. Vews: A Wikipedia vandal early warning system. In 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.
  3. [19]19. Fei Tony Liu, Kai Ming Ting, and Zhi-Hua Zhou. 2008. Isolation forest. In 2008 8th IEEE International Conference on Data Mining. IEEE, 413-422.
  4. [31]31. L. Spitzner. 2003. Honeypots: Catching the insider threat. In 19th Annual Computer Security Applications Conference.
  5. [33]33. Yee W. Teh, Michael I. Jordan, Matthew J. Beal, and David M. Blei. 2005. Sharing clusters among related groups: Hierarchical Dirichlet processes. In Advances in Neural Information Processing Systems. 1385-1392.
  6. [34]34. Aaron Tuor, Samuel Kaplan, Brian Hutchinson, Nicole Nichols, and Sean Robinson. 2017. Deep learning for unsupervised insider threat detection in structured cybersecurity data streams. In AI for Cyber Security Workshop.
  7. [35]35. Hongteng Xu and Hongyuan Zha. 2017. A Dirichlet mixture model of Hawkes processes for event sequence clustering. In Advances in Neural Information Processing Systems. 1354-1363.

Cited by

Sorted by citations

Authors
Zheng, P., Yuan, S., & Wu, X.
Affiliations
  • Amazon (United States) (US)
  • Utah State University (US)
  • University of Arkansas at Fayetteville (US)
Venue
Digital Threats: Research and Practice
Published
2021-10-22
Volume
3
Issue
1
Pages
1-19
ISSN
  • 2576-5337 (ISSN-L)
  • 2692-1626
OpenAlex
W3156711466
Cited by
6
References
31
Citations by year
2026: 2 · 2024: 1 · 2023: 3
FWCI
0.45
Type
journal article
Language
en
Open access
Locations
Digital Threats Research and Practice (publishedVersion)
Funders
NSF (1564250 and 2103829)
Topics
  • Physical Sciences › Computer Science › Computer Networks and Communications › Network Security and Intrusion Detection
  • Physical Sciences › Computer Science › Information Systems › Information and Cyber Security
  • Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
Keywords
insider threat detection, Dirichlet process, marked Hawkes process, user activity modeling, malicious activity detection, real-time anomaly detection, network security

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