EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Insider Threat Prediction Using Graph Analysis

Muhammad Irshad, Muhammad Faisal Shafiq, Muhammad Naveed Sajjad

American Journal of Data Science and Artificial Intelligence · 2026

DOI: 10.54536/ajdsai.v2i2.8088 ↗

Kurz gefasst

Fachartikel in der Zeitschrift American Journal of Data Science and Artificial Intelligence, 2026. Verfasst von Muhammad Irshad und 2 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The insider threat is still among the most difficult cybersecurity risks because of the access and capabilities of insiders to hide malicious or careless actions in the ordinary operations. The rules-based system, statistical anomaly detection and traditional machine learning tools are not always efficient in identifying the relational and contextual dependence in an enterprise setting which limits predictive capability as well as high false-positive. This paper presents a graph-baseds model of active preemptive insider threat detection. The Insider Threat Dataset of Multi-source behavioral logs of Classified Environments are converted to a heterogeneous interaction graph, where the nodes represent users, devices, and resources, and the edges indicate the frequency of interaction, sensitivity, and time patterns. Normative measures such as degree, between, eigenvector centrality, community membership, motif patterns and PageRank are derived to display aberrant relational activity. Empirical analysis has shown that a higher number of off-hours of printing/burning, larger volumes of data being exfiltrated, longer occupancy duration, and high-risk travel occur in malicious insiders occupying more influential network positions (much higher PageRank). The full prediction accuracy (FNNs classify every sample correctly) of Graph Neural Networks (GNNs) is high (F1 = 1.0, AUC = 1.0), which is significantly higher than that of the traditional baselines (Random Forest: F1 = 0.7576; XGBoost: F1 = 0.6753). The findings demonstrate the effectiveness of the graph-based methods in providing high-quality behavioral dependencies, with better accuracy and fewer false alarms and greater explainability in real-life insider risk monitoring.

Zitieren

APA

Irshad, M., Shafiq, M. F., & Sajjad, M. N. (2026). Insider Threat Prediction Using Graph Analysis. American Journal of Data Science and Artificial Intelligence. https://doi.org/10.54536/ajdsai.v2i2.8088

Vancouver

Irshad M, Shafiq MF, Sajjad MN. Insider Threat Prediction Using Graph Analysis. American Journal of Data Science and Artificial Intelligence. 2026. doi:10.54536/ajdsai.v2i2.8088

BibTeX
@article{Irshad2026,
  author = {Irshad, Muhammad and Shafiq, Muhammad Faisal and Sajjad, Muhammad Naveed},
  title = {Insider Threat Prediction Using Graph Analysis},
  journal = {American Journal of Data Science and Artificial Intelligence},
  year = {2026},
  doi = {10.54536/ajdsai.v2i2.8088}
}
Kostenlos starten →