Machine learning algorithms in SIEM systems for enhanced detection and management of security events

A.M. Nurusheva — 2024-09-30

As cyber threats become increasingly sophisticated, traditional Security Information and Event Management (SIEM) systems face challenges in effectively identifying and responding to these dangers. This research presents the development of a SIEM system integrated with machine learning (ML) to enhance threat detection, anomaly identification, and automated incident response. The integration of ML allows the SIEM system to go beyond conventional rule-based approaches, enabling the detection of previously unknown threats by learning from historical data. The system employs advanced algorithms to analyze large-scale log data and network traffic, providing real-time insights and reducing false positives. Key features of this SIEM include anomaly detection, predictive analytics, and adaptive thresholds, which allow it to adjust dynamically based on contextual data. By adapting to new and evolving cyber threats, the system provides a more resilient and proactive defense against potential attacks. The results indicate that integrating machine learning into SIEM systems can offer organizations a more effective, scalable, and adaptive security solution, ensuring the protection of critical infrastructure and data in a rapidly changing digital landscape.

Kernel of triangular derivation of the ring of polynomial of rank 3

Shynar Abutalipova — 2024-09-30

Let $k[x_1,x_2,x_3]$ be an algebra of polynomials in variables $x_1,x_2,x_3$ over an arbitrary field $k$ of characteristic $0$ In this paper we consider triangular derivations of the form $D=\alpha x_2^l x_3^m \partial_1+\beta x_3^n \partial_2+\gamma \partial_3,$ where $\alpha ,\beta ,\gamma \in k$, of the algebra $k[x_1,x_2,x_3].$ It is well known that triangular derivations of the algebra $k[x_1,x_2,x_3]$ are locally nilpotent. The algorithm of A. van den Essen for computing the kernel of locally nilpotent derivation of the polynomial algebra $k[x_1,x_2,\ldots,x_n]$ in variables $x_1,x_2,\ldots,x_n$ over a field $k$ of characteristic $0$ uses the map of J. Dixmier. M. Mayanishi’s theorem states that the kernel of locally nilpotent derivation of the algebra of polynomials in three variables over the field of characteristic 0 is the algebra of polynomials in two variables. In this paper, a completely new algorithm for computing the kernel of triangular derivation of the algebra of polynomials of rank 3 over a field of characteristic 0 is constructed.

Bulletin of L.N. Gumilyov Eurasian National University. Mathematics, computer science, mechanics series

Machine learning algorithms in SIEM systems for enhanced detection and management of security events

Kernel of triangular derivation of the ring of polynomial of rank 3