CoChat

Detecting insider threats in a real corporate database of computer usage activity

Senator, Ted E., Goldberg, Henry G., Memory, Alex, Young, William T., Rees, Brad, Pierce, Robert, Huang, Daniel, Reardon, Matthew, Bader, David A., Chow, Edmond, Essa, Irfan, Jones, Joshua, Bettadapura, Vinay, Chau, Duen Horng, Green, Oded, Kaya, Oguz, Zakrzewska, Anita, Briscoe, Erica, Mappus, Rudolph IV L., McColl, Robert, Weiss, Lora, Dietterich, Thomas G., Fern, Alan, Wong, Weng--Keen, Das, Shubhomoy, Emmott, Andrew, Irvine, Jed, Lee, Jay-Yoon, Koutra, Danai, Faloutsos, Christos, Corkill, Daniel, Friedland, Lisa, Gentzel, Amanda, Jensen, David · 2013 · Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Cited by 130

The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.

Abstract

This paper reports on methods and results of an applied research project by a team consisting of SAIC and four universities to develop, integrate, and evaluate new approaches to detect the weak signals characteristic of insider threats on organizations' information systems. Our system combines structural and semantic information from a real corporate database of monitored activity on their users' computers to detect independently developed red team inserts of malicious insider activities. We have developed and applied multiple algorithms for anomaly detection based on suspected scenarios of malicious insider behavior, indicators of unusual activities, high-dimensional statistical patterns, temporal sequences, and normal graph evolution. Algorithms and representations for dynamic graph processing provide the ability to scale as needed for enterprise-level deployments on real-time data streams. We have also developed a visual language for specifying combinations of features, baselines, peer groups, time periods, and algorithms to detect anomalies suggestive of instances of insider threat behavior. We defined over 100 data features in seven categories based on approximately 5.5 million actions per day from approximately 5,500 users. We have achieved area under the ROC curve values of up to 0.979 and lift values of 65 on the top 50 user-days identified on two months of real data.

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.

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

Integrity signals

Registry

Crossref · 10.1145/2487575.2488213

Cites

4 of 4 references verified0 citation errors · 0 not checkable

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.

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.

Citations

Cites

Show all 4 references

Cited by

See all 130

Metadata

Authors
Senator, T. E., Goldberg, H. G., Memory, A., Young, W. T., Rees, B., Pierce, R., Huang, D., Reardon, M., Bader, D. A., Chow, E., Essa, I., Jones, J., Bettadapura, V., Chau, D. H., Green, O., Kaya, O., Zakrzewska, A., Briscoe, E., Mappus, R. I. L., McColl, R., Weiss, L., Dietterich, T. G., Fern, A., Wong, W.-K., Das, S., Emmott, A., Irvine, J., Lee, J.-Y., Koutra, D., Faloutsos, C., Corkill, D., Friedland, L., Gentzel, A., & Jensen, D.
Venue
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Publisher
ACM
Published
2013-08-11
Pages
1393-1401
OpenAlex
W1995976200
Cited by
130
References
4
FWCI
7.70
Type
conference paper
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: Detecting insider threats in a real corporate database of computer usage activity. https://app.cochat.ai/papers/10.1145/2487575.2488213
The paper
Senator, T. E., Goldberg, H. G., Memory, A., Young, W. T., Rees, B., Pierce, R., Huang, D., Reardon, M., Bader, D. A., Chow, E., Essa, I., Jones, J., Bettadapura, V., Chau, D. H., Green, O., Kaya, O., Zakrzewska, A., Briscoe, E., Mappus, R. I. L., . . . Jensen, D. (2013). Detecting insider threats in a real corporate database of computer usage activity. Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining. https://doi.org/10.1145/2487575.2488213

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.