Optimized Graph Neural Network Framework for Intelligent Cyber Threat Identification and Security Monitoring in Cloud Platforms
Keywords:
Graph Neural Networks, Cloud Security, Cyber Threat Detection, Deep LearningAbstract
The increasing interconnectivity, virtualization, and dynamic resource allocation of cloud platforms have created complex cybersecurity environments in which conventional security monitoring approaches may struggle to represent relationships among users, virtual machines, services, network flows, and attack behaviors. This research proposes an Optimized Graph Neural Network (OGNN) Framework for intelligent cyber threat identification and security monitoring in cloud platforms. The framework models cloud infrastructures as heterogeneous interaction graphs and applies graph-based representation learning to capture structural and behavioral dependencies among interconnected entities. Graph normalization, feature aggregation, uncertainty estimation, and optimization-oriented decision mechanisms are incorporated to improve detection robustness and operational effectiveness. The theoretical foundation combines graph neural network reasoning with machine-learning-assisted optimization, particularly insights from graph-based combinatorial reasoning and mathematical optimization. The proposed framework uses node, edge, and graph-level representations to classify suspicious activities and generate security-risk indicators while accounting for prediction uncertainty. The conceptual findings indicate that graph-based modeling can improve contextual threat identification compared with isolated event analysis, while optimization mechanisms can support efficient monitoring under computational constraints. The framework further emphasizes uncertainty-aware decisions because high-confidence and low-confidence alerts should not receive identical security responses. The research contributes an integrated architecture for cloud threat monitoring that connects relational deep learning, optimization, and uncertainty quantification. The study also identifies limitations associated with dynamic graph construction, computational scalability, heterogeneous cloud telemetry, and the absence of universally representative benchmark conditions. The proposed architecture provides a research foundation for adaptive, explainable, and optimization-driven cloud cybersecurity systems.
Downloads
References
1. Abdar, M., Pourpanah, F., Hussain, S., Rezazadegan, D., Liu, L., Ghavamzadeh, M., Fieguth, P., Cao, X., Khosravi, A., Acharya, U. R., Makarenkov, V., & Nahavandi, S. (2021). A review of uncertainty quantification in deep learning: Techniques, applications and challenges. Information Fusion, 76, 243–297.
2. Achterberg, T. (2007). Conflict analysis in mixed integer programming. Discrete Optimization, 4(1), 4–20. Mixed Integer Programming.
3. Achterberg, T., Berthold, T., Koch, T., & Wolter, K. (2008). Constraint integer programming: A new approach to integrate CP and MIP. In Perron, L., & Trick, M. A. (Eds.), Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pp. 6–20, Berlin, Heidelberg. Springer.
4. Achterberg, T., & Wunderling, R. (2013). Mixed Integer Programming: Analyzing 12 Years of Progress, pp. 449–481. Springer, Berlin, Heidelberg.
5. Bengio, Y., Lodi, A., & Prouvost, A. (2021). Machine learning for combinatorial optimization: A methodological tour d’horizon. European Journal of Operational Research, 290(2), 405–421.
6. Berthold, T. (2013). Measuring the impact of primal heuristics. Operations Research Letters, 41(6), 611–614.
7. Berthold, T. (2018). A computational study of primal heuristics inside an mi(nl)p solver. Journal of Global Optimization, 70(1), 189–206.
8. Böther, M., Kißig, O., Taraz, M., Cohen, S., Seidel, K., & Friedrich, T. (2022). What’s wrong with deep learning in tree search for combinatorial optimization. In The Tenth International Conference on Learning Representations.
9. Cai, T., Luo, S., Xu, K., He, D., Liu, T., & Wang, L. (2021). GraphNorm: A principled approach to accelerating graph neural network training. In Meila, M., & Zhang, T. (Eds.), Proceedings of the 38th International Conference on Machine Learning, Vol. 139, pp. 1204–1215. PMLR.
10. Cappart, Q., Chételat, D., Khalil, E. B., Lodi, A., Morris, C., & Veličković, P. (2021). Combinatorial optimization and reasoning with graph neural networks. In Zhou, Z.-H. (Ed.), Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI-21, pp. 4348–4355. Survey Track.
11. Chen, Z., Liu, J., Wang, X., Lu, J., & Yin, W. (2023). On representing mixed-integer linear programs by graph neural networks. In International Conference on Learning Representations.
12. M. R. Marri, S. B. Kurada, S. Gupta, S. Dey, S. Kumar and R. Chauhan, "Graph-Based Deep Learning Model for Identifying Cyber Threats in Cloud Platforms," 2025 International Conference on Computational Intelligence, Security, and Artificial Intelligence (IntelliSecAI), Al-Khobar, Saudi Arabia, 2025, pp. 1-7, doi: 10.1109/IntelliSecAI66368.2025.11472831.
Downloads
Published
Issue
Section
License
Copyright (c) 2026 Azizbek Karimov

This work is licensed under a Creative Commons Attribution 4.0 International License.
Articles published in this journal are licensed under the Creative Commons Attribution 4.0 International License (CC-BY 4.0). Under this license:
- Share: Copy and redistribute the material in any medium or format
- Adapt: Remix, transform, and build upon the material for any purpose, including commercially
Attribution required: You must give appropriate credit, provide a link to the license, and indicate if changes were made.
License URL: https://creativecommons.org/licenses/by/4.0/
Authors retain copyright of their work while granting the journal first publication rights.