Tomás Komárek

dblp:186/1639 · DBLP profile ↗
← Back
5ranked-venue papers in the field
3as first author
3since 2021 · last 2022
—ORCID · none

Domains — venue-derived; a paper can count in several

Data Mining & Knowledge Discovery · 2 (2 first)Big Data, Cloud & Distributed Data Systems · 2 (1 first)Database Systems & Data Management · 1
YearPublicationVenuePosition
2022 Benchmark of Data Preprocessing Methods for Imbalanced Classification
abstract
Severe class imbalance is one of the main conditions that make machine learning in cybersecurity difficult. A variety of dataset preprocessing methods have been introduced over the years. These methods modify the training dataset by oversampling, undersampling or a combination of both to improve the predictive performance of classifiers trained on this dataset. Although these methods are used in cybersecurity occasionally, a comprehensive, unbiased benchmark comparing their performance over a variety of cybersecurity problems is missing. This paper presents a benchmark of 16 preprocessing methods on six cybersecurity datasets together with 17 public imbalanced datasets from other domains. We test the methods under multiple hyperparameter configurations and use an AutoML system to train classifiers on the preprocessed datasets, which reduces potential bias from specific hyperparameter or classifier choices. Special consideration is also given to evaluating the methods using appropriate performance measures that are good proxies for practical performance in real-world cybersecurity systems. The main findings of our study are: 1) Most of the time, a data preprocessing method that improves classification performance exists. 2) Baseline approach of doing nothing outperformed a large portion of methods in the benchmark. 3) Oversampling methods generally outperform undersampling methods. 4) The most significant performance gains are brought by the standard SMOTE algorithm and more complicated methods provide mainly incremental improvements at the cost of often worse computational performance.
Radovan Haluska, Jan Brabec, Tomás Komárek
IEEE Big Data3
2021 Threat Hunting as a Similarity Search Problem on Multi-positive and Unlabeled Data
abstract
We present a new similarity search method (called Random Separations) that helps threat analysts with identification of unknown variants of known malware in network traffic. The method assumes that for each hunted malware family, few samples of network communication are available to analysts (multi-positive) and others are hidden in abundant (unlabeled) network data. We demonstrate the method on large-scale real-world data, where it outperforms the unsupervised approach (Isolation Forest and Lightweight Online Detector of Anomalies), the supervised approach (Random Forest) and the traditional similarity search algorithm (kNN). The evaluation involves eight high-risk malware families under various known/unknown ratios.
Tomás Komárek, Jan Brabec, Cenek Skarda, Petr Somol
IEEE BigData1
2021 Explainable Multiple Instance Learning with Instance Selection Randomized Trees
Tomás Komárek, Jan Brabec, Petr Somol
ECML/PKDD (2)1
2018 Multiple Instance Learning with Bag-Level Randomized Trees
Tomás Komárek, Petr Somol
ECML/PKDD (1)1
2016 Feature Extraction and Malware Detection on Large HTTPS Data Using MapReduce
Premysl Cech, Jan Kohout, Jakub Lokoc, Tomás Komárek, Jakub Marousek, Tomás Pevný
SISAP4