Jämförelse av anomaly detection tekniker på offline och onlinelog data

Generated log data contains valuable insight into potential security threats. However, these logs are of large quantities, and handling it manually is quite a challenge. The need for high-scoring automated anomaly detection is large, specifically within the context of offline and online anomaly detection. Detecting anomalies offline creates opportunity to debug, error trace and analyze root causes. An online setting, on the other hand, enables the opportunity to detect anomalous behavior and prevent threats before they escalate into actual security incidents. In this study a method consisting of four steps was applied. First already collected log datasets were downloaded, HDFS-v1 and BGL from Loghub. Followed by log parsing, the BGL dataset was already structured and there was no need for log parsing but for the HDFS dataset drain was applied to retrieve event templates. The next step was to extract features from the data, which was done by a session window approach for the HDFS dataset and a sliding window method for the BGL dataset. Lastly, the anomaly detection techniques were executed with the processed data. Three algorithms were implemented in offline scenarios, Isolation Forest, PCA and LogClustering. Two algorithms, Half-Space Trees and One-Class SVM, were implemented in online scenarios. The algorithm SVM was also applied and used as a benchmark for the offline algorithms. In addition, an iterative approach was used to record the best possible results. By comparing three offline and two online anomaly detection techniques, this thesis concludes the best anomaly detection technique within each use case. LogClustering achieved the best performance in the offline scenario. Among the two online methods, Half-Space Trees performed better on the HDFS dataset, while One-Class SVM showed better results on the BGL dataset. Additionally, a comparison is done between offline and online anomaly detection, where the offline algorithms performed the best. The results are then discussed and reasoned about before proposing interesting topics for future research.

Publication Details

Journal
KTH Publication Database DiVA (KTH Royal Institute of Technology)
Published
2025-01-01
Primary Topic
Historical Geopolitical and Social Dynamics
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Jämförelse av anomaly detection tekniker på offline och onlinelog data

KTH Publication Database DiVA (KTH Royal Institute of Technology)
Historical Geopolitical and Social Dynamics
article

Jämförelse av anomaly detection tekniker på offline och onlinelog data

article en

Abstract

Generated log data contains valuable insight into potential security threats. However, these logs are of large quantities, and handling it manually is quite a challenge. The need for high-scoring automated anomaly detection is large, specifically within the context of offline and online anomaly detection. Detecting anomalies offline creates opportunity to debug, error trace and analyze root causes. An online setting, on the other hand, enables the opportunity to detect anomalous behavior and prevent threats before they escalate into actual security incidents. In this study a method consisting of four steps was applied. First already collected log datasets were downloaded, HDFS-v1 and BGL from Loghub. Followed by log parsing, the BGL dataset was already structured and there was no need for log parsing but for the HDFS dataset drain was applied to retrieve event templates. The next step was to extract features from the data, which was done by a session window approach for the HDFS dataset and a sliding window method for the BGL dataset. Lastly, the anomaly detection techniques were executed with the processed data. Three algorithms were implemented in offline scenarios, Isolation Forest, PCA and LogClustering. Two algorithms, Half-Space Trees and One-Class SVM, were implemented in online scenarios. The algorithm SVM was also applied and used as a benchmark for the offline algorithms. In addition, an iterative approach was used to record the best possible results. By comparing three offline and two online anomaly detection techniques, this thesis concludes the best anomaly detection technique within each use case. LogClustering achieved the best performance in the offline scenario. Among the two online methods, Half-Space Trees performed better on the HDFS dataset, while One-Class SVM showed better results on the BGL dataset. Additionally, a comparison is done between offline and online anomaly detection, where the offline algorithms performed the best. The results are then discussed and reasoned about before proposing interesting topics for future research.

KTH Publication Database DiVA (KTH Royal Institute of Technology)
Linköpings Universitet
Openalex Percentile: Top 42%
Historical Geopolitical and Social Dynamics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Jämförelse av anomaly detection tekniker på offline och onlinelog data · KTH Publication Database DiVA (KTH Royal Institute of Technology) (2025) | TGRS Research Map | TGRS