Proceedings Article10.1145/3319535.3363224
Log2vec: A Heterogeneous Graph Embedding Based Approach for Detecting Cyber Threats within Enterprise
Fucheng Liu,Yu Wen,Zhang Dongxue,Xihe Jiang,Xinyu Xing,Dan Meng +5 more
- 06 Nov 2019
- pp 1777-1794
258
TL;DR: This work proposes log2vec, a heterogeneous graph embedding based modularized method that remarkably outperforms state-of-the-art approaches, such as deep learning and hidden markov model (HMM), and shows its capability to detect malicious events in various attack scenarios.
read more
Abstract: Conventional attacks of insider employees and emerging APT are both major threats for the organizational information system. Existing detections mainly concentrate on users' behavior and usually analyze logs recording their operations in an information system. In general, most of these methods consider sequential relationship among log entries and model users' sequential behavior. However, they ignore other relationships, inevitably leading to an unsatisfactory performance on various attack scenarios. We propose log2vec, a heterogeneous graph embedding based modularized method. First, it involves a heuristic approach that converts log entries into a heterogeneous graph in the light of diverse relationships among them. Next, it utilizes an improved graph embedding appropriate to the above heterogeneous graph, which can automatically represent each log entry into a low-dimension vector. The third component of log2vec is a practical detection algorithm capable of separating malicious and benign log entries into different clusters and identifying malicious ones. We implement a prototype of log2vec. Our evaluation demonstrates that log2vec remarkably outperforms state-of-the-art approaches, such as deep learning and hidden markov model (HMM). Besides, log2vec shows its capability to detect malicious events in various attack scenarios.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Learning Approximate Execution Semantics From Traces for Binary Function Similarity
TL;DR: Trex as mentioned in this paper uses forced execution traces to learn approximate execution semantics of binary functions and uses the learned knowledge to detect semantically similar binary functions with different architectures and compiler optimizations or obfuscations.
A Vectorization Method to Cloud Service Instance Data for Service Compliance
Xiaojian Li,Cuiping Zhang,Haopeng Yang,Chengling Huang +3 more
TL;DR: A vectorization method is proposed to analyze cloud service instance data for compliance, achieving 98.58% accuracy with a low false rate, and demonstrating its effectiveness in detecting SLA violations and other event-related tasks.
Enterprise Threat Detection with Explainable AI for Cloud-Network Convergence
Xingkai Wang,Fudi Wu,Xingwang Huang,Qiefu Wuri,Dujuan Gu,Runzi Zhang,Shen Gao +6 more
- 22 Sep 2025
TL;DR: This study proposes ETDE, an interpretable GNN-based framework for enterprise threat detection, addressing challenges in cloud-network convergence by automatically identifying attackers from IPS alerts and providing comprehensive explanations to enhance security team efficiency and reliability.
Nip in the Bud: Forecasting and Interpreting Post-exploitation Attacks in Real-time through Cyber Threat Intelligence Reports
Tiantian Zhu,Ying Jin,Tieming Chen,Chunlin Xiong,Wenrui Cheng,Qixuan Yuan,Aihua Zheng,Mingqi Lv,Yan Chen +8 more
- 05 May 2024
TL;DR: Forecasting and interpreting post-exploitation attacks in real-time through Cyber Threat Intelligence Reports (CTI) reports can significantly reduce false positives and improve response time.
TurboLog: A Turbocharged Lossless Compression Method for System Logs via Transformer
Baoming Chang,Zhaoyang Wang,Shuai Li,Fengxi Zhou,Wen Yu,Boyang Zhang +5 more
- 30 Jun 2024
TL;DR: TurboLog, a transformer-based lossless compression method, achieves a 65.25× compression ratio and 75% faster compression time than state-of-the-art methods, utilizing parallel computation and addressing structural and numerical redundancies in system logs.
References
•Proceedings Article
Efficient Estimation of Word Representations in Vector Space
Tomas Mikolov,Kai Chen,Greg S. Corrado,Jeffrey Dean +3 more
- 16 Jan 2013
TL;DR: Two novel model architectures for computing continuous vector representations of words from very large data sets are proposed and it is shown that these vectors provide state-of-the-art performance on the authors' test set for measuring syntactic and semantic word similarities.
27.5K
•Proceedings Article
Distributed Representations of Words and Phrases and their Compositionality
Tomas Mikolov,Ilya Sutskever,Kai Chen,Greg S. Corrado,Jeffrey Dean +4 more
- 05 Dec 2013
TL;DR: This paper presents a simple method for finding phrases in text, and shows that learning good vector representations for millions of phrases is possible and describes a simple alternative to the hierarchical softmax called negative sampling.
•Posted Content
Distributed Representations of Words and Phrases and their Compositionality
TL;DR: In this paper, the Skip-gram model is used to learn high-quality distributed vector representations that capture a large number of precise syntactic and semantic word relationships and improve both the quality of the vectors and the training speed.
•Posted Content
Semi-Supervised Classification with Graph Convolutional Networks
Thomas Kipf,Max Welling +1 more
TL;DR: A scalable approach for semi-supervised learning on graph-structured data that is based on an efficient variant of convolutional neural networks which operate directly on graphs which outperforms related methods by a significant margin.
22.7K
Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
TL;DR: A new graphical display is proposed for partitioning techniques, where each cluster is represented by a so-called silhouette, which is based on the comparison of its tightness and separation, and provides an evaluation of clustering validity.
19K