mlsanityData to 7 Oct 2026

Towards Automated Classification of Attackers' TTPs by combining NLP with ML Techniques

arXiv 2207.08478 ↗First posted 18 Jul 2022cs.CR cs.CLcited by 5

Not on the map. Why?

Abstract (arXiv)

The increasingly sophisticated and growing number of threat actors along with the sheer speed at which cyber attacks unfold, make timely identification of attacks imperative to an organisations' security. Consequently, persons responsible for security employ a large variety of information sources concerning emerging attacks, attackers' course of actions or indicators of compromise. However, a vast amount of the needed security information is available in unstructured textual form, which complicates the automated and timely extraction of attackers' Tactics, Techniques and Procedures (TTPs). In order to address this problem we systematically evaluate and compare different Natural Language Processing (NLP) and machine learning techniques used for security information extraction in research. Based on our investigations we propose a data processing pipeline that automatically classifies unstructured text according to attackers' tactics and techniques derived from a knowledge base of adversary tactics, techniques and procedures.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 5 of its 54 references that are in the map. First posted on arXiv 18 Jul 2022.

Builds on

5 of 54 references.

References · 5

  1. 2018Spectre Attacks: Exploiting Speculative Executioncited by 47
  2. 2020Automated Retrieval of ATT&CK Tactics and Techniques for Cyber Threat Reportscited by 16
  3. 2015Towards a relation extraction framework for cyber-security conceptscited by 9
  4. 2016Darknet and Deepnet Mining for Proactive Cybersecurity Threat Intelligencecited by 8
  5. 2018Mining Threat Intelligence about Open-Source Projects and Libraries from Code Repository Issues and Bug Reportscited by 6

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 3; 2024: 1; 2025: 0; 2026: 1.

5 papers.