Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Karel Bartos

dblp:99/5377 · DBLP profile ↗
← Back
9ranked-venue papers
5as first author
0since 2021 · last 2018
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 2 first-authorSecurity and privacy · 4 · 2 first-authorDatabases, data management, data science and information retrieval · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Malware analysis · 77% Network security · 23%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Malware analysis › malware detection
malware variant detection
0.212016
Optimized Invariant Representation of Network Traffic for Detecting Unseen Malware Variants · USENIX Security Symposium 2016
Network security
traffic analysis
0.112016
Optimized Invariant Representation of Network Traffic for Detecting Unseen Malware Variants · USENIX Security Symposium 2016
YearPublicationVenuePosition
2018 Learning data discretization via convex optimization
Vojtech Franc, Ondrej Fikar, Karel Bartos, Michal Sofka
Mach. Learn.3
2016 Learning Invariant Representation for Malicious Network Traffic Detection
abstract
Statistical learning theory relies on an assumption that the joint distributions of observations and labels are the same in training and testing data. However, this assumption is violated in many real world problems, such as training a detector of malicious network traffic that can change over time as a result of attacker's detection evasion efforts. We propose to address this problem by creating an optimized representation, which significantly increases the robustness of detectors or classifiers trained under this distributional shift. The representation is created from bags of samples (e.g. network traffic logs) and is designed to be invariant under shifting and scaling of the feature values extracted from the logs and under permutation and size changes of the bags. The invariance is achieved by combining feature histograms with feature self-similarity matrices computed for each bag and significantly reduces the difference between the training and testing data. The parameters of the representation, such as histogram bin boundaries, are learned jointly with the classifier. We show that the representation is effective for training a detector of malicious traffic, achieving 90% precision and 67% recall on samples of previously unseen malware variants.
Karel Bartos, Michal Sofka, Vojtech Franc
ECAI1
2016 Optimized Invariant Representation of Network Traffic for Detecting Unseen Malware Variants
Karel Bartos, Michal Sofka, Vojtech Franc
USENIX Security Symposium1
2015 Robust Representation for Domain Adaptation in Network Security
Karel Bartos, Michal Sofka
ECML/PKDD (3)1
2015 Learning Detector of Malicious Network Traffic from Weak Labels
Vojtech Franc, Michal Sofka, Karel Bartos
ECML/PKDD (3)3
2012 Self-organized Collaboration of Distributed IDS Sensors
Karel Bartos, Martin Rehák, Michal Svoboda
DIMVA1
2011 Optimizing flow sampling for network anomaly detection
abstract
Sampling techniques are widely employed in high-speed network traffic monitoring to allow the analysis of high traffic volumes with limited resources. Sampling has measurable negative impact on the accuracy of network anomaly detection methods. In our work, we build an integrated model which puts the sampling into the context of the anomaly detection used in the subsequent processing. Using this model, we show that it is possible to perform very efficient sampling with limited impact on traffic feature distributions, thus minimizing the decrease of anomaly detection efficiency. Specifically, we propose an adaptive, feature-aware statistical sampling technique and compare it both formally and empirically with other known sampling techniques - random flow sampling and selective sampling. We study the impact of these sampling techniques on particular anomaly detection methods used in a network behavior analysis system.
Karel Bartos, Martin Rehák, Vojtech Krmicek
IWCMC1
2009 Runtime Monitoring and Dynamic Reconfiguration for Intrusion Detection Systems
Martin Rehák, Eugen Staab, Volker Fusenig, Michal Pechoucek, Martin Grill, Jan Stiborek, Karel Bartos, Thomas Engel 0001
RAID7
2008 Improving Anomaly Detection Error Rate by Collective Trust Modeling
Martin Rehák, Michal Pechoucek, Karel Bartos, Martin Grill, Pavel Celeda, Vojtech Krmicek
RAID3