Peter Anthony

Peter Anthony

Auto-generated profile, based on publicly available information

Peter Anthony

Department of Applied Informatics, Faculty of Mathematics, Physics and Informatics, Comenius University in Bratislava, Bratislava, Slovakia

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
25 October 2025
Verified
Book Chapter
Closed access
PDF file
PAPeter Anthony
Peter Anthony
KGKefas Rimamnuskeb Galadima
Kefas Rimamnuskeb Galadima
ZAZekeri Adams
Zekeri Adams
MOMonday Onoja
Monday Onoja
DADaniel Arp
Daniel Arp
ŠBŠtefan Balogh
Štefan Balogh

30 September 2022 in Turkish Journal of Science and Technology
Verified
Journal Article
Closed access
PAPeter Anthony
Peter Anthony
Betül AyBetül Ay
Betül Ay
With the rising use of facial recognition systems in a range of real-world scenarios and applications, attackers are also increasing their efforts, with a number of spoofing techniques emerging. As a result, developing a reliable spoof detection mechanism is critical. Active-based techniques have been shown to be good at finding spoofs, but they have a number of problems, such as being intrusive, expensive, hard to compute, not being able to be used in many situations, and usually needing extra hardware. This research presented an active-based robust spoof detection technique capable of detecting a wide range of media or 2D attacks while being less intrusive, less expensive, low in complexity, and more generalizable than other active-based techniques. It doesn't require any additional hardware, so it can easily be integrated into current systems. The distortion variations of video frames of the user's face collected at varying distances from the camera are analyzed to detect spoofing. Both the legitimate and spoof attack datasets were created using real-world facial photo and video data. The proposed approach achieved a spoof detection accuracy of 98.18% using both machine learning classifiers and a deep learning model, with an equal error rate and a half total error rate as low as 0.023 and 0.021, respectively.

13 April 2026 in Results in Engineering
Verified
Journal Article
Open access
NGNahum Y. Godi
Nahum Y. Godi
TJTanimu Jatau
Tanimu Jatau
PAPeter Anthony
Peter Anthony

8 May 2026
Verified
Book Chapter
Closed access
PAPeter Anthony
Peter Anthony
FGFrancesco Giannini
Francesco Giannini
MDMichelangelo Diligenti
Michelangelo Diligenti
MHMartin Homola
Martin Homola
MGMarco Gori
Marco Gori
JMJán Mojžiš
Ján Mojžiš

28 June 2026 in Journal of Computer Virology and Hacking Techniques
Verified
Journal Article
Open access
PDF file
PŠPeter Švec
Peter Švec
ŠBŠtefan Balogh
Štefan Balogh
MHMartin Homola
Martin Homola
ZKZuzana Kubincová
Zuzana Kubincová
TBTomáš Bisták
Tomáš Bisták
PAPeter Anthony
Peter Anthony
Ontologies are a standard tool for creating semantic schemata in many knowledge intensive domains of human interest. They are becoming increasingly important also in the areas that have been until very recently dominated by subsymbolic knowledge representation and machine-learning-based data processing. One such area is information security, and specifically, malware detection . We thus propose PE Malware Ontology that offers a reusable semantic schema for Portable Executable (PE – the Windows binary format) malware files. This ontology is inspired by the structure of the dataset Elastic Malware Benchmark for Empowering Researchers (EMBER), which focuses on the static malware analysis of PE files. With this proposal, we hope to provide a unified semantic representation for the existing and future PE-malware datasets and facilitate the application of symbolic, neuro-symbolic, or otherwise explainable approaches in the PE-malware detection domain, which may produce interpretable results described by the terms defined in our ontology. In addition, we also publish semantically treated EMBER data, including fractional datasets, to support the reproducibility of experiments on EMBER. We supplement our work with a preliminary case study, conducted using concept learning, to show the general feasibility of our approach. While we were not able to match the precision of the state-of-the-art machine learning tools, the learned malware discriminators were interesting and highly interpretable.

18 June 2026 in SSRN Electronic Journal
Verified
Preprint
Open access
PAPeter Anthony
Peter Anthony
MHMartin Homola
Martin Homola
MOMonday Onoja
Monday Onoja
Post-hoc model-agnostic explainers are widely used to interpret black-box machine learning models, yet practitioners often face contradictory attributions for the same prediction, while prior comparative studies yield inconsistent recommendations. We address this problem through a systematic comparison of seven model-agnostic explainers (LIME, Kernel~SHAP, Permutation~Importance, Partial~Dependence, Accumulated~Local~Effects, Occlusion, Anchors) and three gradient-based methods (Integrated~Gradients, Grad-CAM, SmoothGrad) across five tabular datasets, two image datasets, six models, and five random seeds, producing 760 experimental cells. Fidelity is evaluated using eight complementary metrics spanning perturbation faithfulness, local-surrogate fit, infidelity, stability, and ground-truth feature recovery on synthetic data, with statistical significance assessed through Friedman omnibus tests and Nemenyi post-hoc Critical Difference analysis. Three findings emerge. First, inter-explainer agreement depends on what is measured: agreement on which features matter is uniformly positive across all seven tabular explainers (+0.36 to +0.82), with no outlier. Agreement on direction of influence is interpretable only among explainers that produce signed attributions; there, Kernel~SHAP and Occlusion agree (+0.70), while LIME tracks neither (-0.06, -0.03), making LIME magnitude-consistent but sign-inconsistent with other local methods. Second, fidelity metrics can reverse rankings: Occlusion and Kernel~SHAP dominate perturbation-based metrics, whereas Anchors dominates ground-truth feature recovery, with Occlusion ranking last. Third, perturbation-fidelity rankings are baseline-dependent, making Kernel~SHAP the more baseline-robust default. We synthesize these findings into a conditional decision guide and release the full reproducible pipeline.