Scholarlink

Motivated by applications in cybersecurity such as finding meaningful sequences of malware-related events buried inside large amounts of computer log data, we introduce the “planted path” problem and propose an algorithm to find fuzzy matchings between two trees. This algorithm can be used as a “building block” for more complicated workflows. We demonstrate usefulness of a few of such workflows in mining synthetically generated data as well as real-world ACME cybersecurity datasets.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

The Needle is a Thread: Finding Planted Paths in Noisy Process Trees

  • 会议论文

  • 发表日期：

    2026年

查看全文
  • Maya Le,
  • Paweł Prałat,
  • Aaron Smith,
  • François Théberge

摘要

Motivated by applications in cybersecurity such as finding meaningful sequences of malware-related events buried inside large amounts of computer log data, we introduce the “planted path” problem and propose an algorithm to find fuzzy matchings between two trees. This algorithm can be used as a “building block” for more complicated workflows. We demonstrate usefulness of a few of such workflows in mining synthetically generated data as well as real-world ACME cybersecurity datasets.