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

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.

• Publication year

  2026

• Venue

  Unknown venue

• Publication date

  2026-02-04

• Fields of study

  Computer Science

• Identifiers
  arXiv 2602.04694
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• ANUBIS: a provenance graph-based framework for advanced persistent threat detection

  2021cited by this paper
• Artificial Benchmark for Community Detection (ABCD)—Fast random graph model with community structure

  2020cited by this paper
• A Survey on Representation Learning Efforts in Cybersecurity Domain

  2019cited by this paper
• UMAP: Uniform Manifold Approximation and Projection for Dimension Reduction

  2018cited by this paper
• hdbscan: Hierarchical density based clustering

  2017cited by this paper
• Statistical-Computational Tradeoffs in Planted Problems and Submatrix Localization with a Growing Number of Clusters and Submatrices

  2014cited by this paper
• MAFFT Multiple Sequence Alignment Software Version 7: Improvements in Performance and Usability

  2013cited by this paper
• An Introduction to Information Retrieval

  2013cited by this paper
• Random Features for Large-Scale Kernel Machines

  2007cited by this paper
• ProbCons: Probabilistic consistency-based multiple sequence alignment.

  2005cited by this paper
• Generating Consensus Sequences from Partial Order Multiple Sequence Alignment Graphs

  2003cited by this paper
• Multiple sequence alignment: algorithms and applications.

  1999cited by this paper
• Large Cliques Elude the Metropolis Process

  1992cited by this paper
• An evolutionary model for maximum likelihood alignment of DNA sequences

  1991cited by this paper
• Stochastic blockmodels: First steps

  1983cited by this paper
• Identification of common molecular subsequences.

  1981cited by this paper

• No citing papers are available for this paper.