About
I am Joel Okore, a cybersecurity and machine learning researcher with a growing interest in graph-based learning, combinatorics, and trustworthy AI. My work focuses on building intelligent security systems that are practical and useful in real-world environments, particularly for detecting and responding to emerging security threats.
I hold an MSc in Security and Network Engineering from Innopolis University and am currently pursuing an MSc in Advanced Combinatorics at the Moscow Institute of Physics and Technology (MIPT), with a focus on strengthening the mathematical foundations that support my work. Beyond research, I enjoy teaching and mentoring students, particularly in computer networks, cybersecurity, and distributed systems.
I’m especially interested in problems that sit between theory and practice, bringing together graph and network theory, machine learning, and secure systems engineering to build technologies we can understand and trust.
Research interests
- Machine Learning
- Cybersecurity
- Graph Representation Learning
- Graph Neural Networks
- Temporal and Random Graphs
- Network Anomaly Detection
- Explainable Artificial Intelligence (XAI)
- Distributed Systems
Skills
Programming languages
- Python
- Bash
- C / C++
- JavaScript
- SQL
Machine learning & data science
- PyTorch
- Scikit-learn
- Pandas
- NumPy
- Matplotlib
- SHAP
- LIME
Cybersecurity & systems
- Network security
- Malware analysis
- Intrusion detection
- Reverse engineering
- Distributed systems
- Linux systems programming
Infrastructure & observability
- Docker
- Kubernetes
- Kafka
- Git
- CI/CD
- Prometheus
- Grafana
- ELK Stack
Projects
Experience
MSc, Advanced Combinatorics
Moscow Institute of Physics and Technology
2025 – 2027 (expected)
MSc, Security and Network Engineering
Innopolis University
2024 – 2026
BSc, Computer Science and Engineering
Kazan National Research Technological University
2020 – 2024
Junior Researcher & Teaching Assistant
Laboratory of Information Security, Innopolis University
Jan 2026 – Present
Practical and laboratory sessions across cybersecurity, network engineering and digital forensics, and student mentoring.
DevOps Engineer Intern
Innopolis University
May – Sep 2025
GitOps CI/CD for Kubernetes with ArgoCD and Kustomize, plus SAST, DAST and Prometheus/Grafana observability.
Penetration Tester Intern
CFSS Cyber Forensic Security Solutions
Feb – May 2024
Web and API security testing with Burp Suite and ZAP, Linux privilege escalation, and remediation reporting.
Machine Learning Research Intern
Laboratory of the Faculty of Control and Automation, KNRTU
Jan – Apr 2024
Anomaly detection models on the KDD Cup ’99 dataset, benchmarked against Zeek, Snort and Suricata.
Publications
IEEE USBEREIT 2026
Explainable Machine Learning for Effective Malware Detection in Encrypted Network Traffic
An explainable ML framework for detecting malicious encrypted traffic from flow-level metadata alone, and what feature selection costs and buys in the trade-off between detection performance and interpretability.
What the paper found
A two-tier explainability pipeline. Tier 1 is fast and always on, suited to real-time SOC triage: Explainable Boosting Machine term contributions and XGBoost feature contributions, read straight out of the model rather than approximated after the fact. Tier 2 is a high-fidelity, on-demand module using SHAP and LIME for forensic investigation.
Models were trained on the Composed Encrypted Malicious Traffic Dataset, which integrates five public sources, using metadata-derived flow statistics and temporal patterns. Nothing is decrypted.
Feature selection compared ANOVA statistical filtering against SHAP importance ranking on tree-based models. Random Forest, XGBoost and the glass-box EBM all reached F1 of at least 0.9989, so on this data interpretability cost nothing in detection performance.
EBM was the fastest explainer at 3.5 ms p50 and 285 explanations per second, roughly 3.7× faster than SHAP and 1.8× faster than LIME. A nine-feature consensus subset preserved detection performance while improving explanation consistency.

