In recent years, significant progress has been made in the application of federated learning (FL) in various aspects of cyberspace security, such as intrusion detection, privacy protection, and anomaly detection. However, the robustness of federated learning in the face of malicious attacks (such us adversarial attacks, backdoor attacks, and poisoning attacks) is weak, and the unfair allocation of resources leads to slow convergence and inefficient communication efficiency regarding FL models. Additionally, the scarcity of malicious samples during FL model training and the heterogeneity of data result in a lack of personalization in FL models. These challenges pose significant obstacles to the application of federated learning in the field of cyberspace security. To address these issues, the introduction of meta-learning into federated learning has been proposed, resulting in the development of federated meta-learning models. These models aim to train personalized models for each client, reducing performance discrepancies across different clients and enhancing model fairness. In order to advance research on federated meta-learning and its applications in the field of cyberspace security, this paper first introduces the algorithms of federated meta-learning. Based on different usage principles, these algorithms are categorized into client-level personalization algorithms, network algorithms, prediction algorithms, and recommendation algorithms, and are thoroughly presented and analyzed. Subsequently, the paper divides current cyberspace security issues in the network domain into three branches: information content security, network security, and information system security. For each branch, the application research methods and achievements of federated meta-learning are elucidated and compared, highlighting the advantages and disadvantages of federated meta-learning in addressing different cyberspace security issues. Finally, the paper concludes with an outlook on the deep application of federated meta-learning in the field of cyberspace security.

Traditional image steganography techniques complete the steganography process by embedding secret information into cover images, but steganalysis tools can easily detect detectable pixel changes that lead to the leakage of confidential information. The use of a generative adversarial network (GAN) makes it possible to embed information using a combination of information and noise in generating images to achieve steganography. However, this approach is usually accompanied by issues such as poor image quality and low steganography capacity. To address these challenges, we propose a steganography model based on a novel information-driven generative adversarial network (IDGAN), which fuses a GAN, attention mechanisms, and image interpolation techniques. We introduced an attention mechanism on top of the original GAN model to improve image accuracy. In the generation model, we replaced some transposed convolution operations with image interpolation for better quality of dense images. In contrast to traditional steganographic methods, the IDGAN generates images containing confidential information without using cover images and utilizes GANs for information embedding, thus having better anti-detection capability. Moreover, the IDGAN uses an attention mechanism to improve the image details and clarity and optimizes the steganography effect through an image interpolation algorithm. Experimental results demonstrate that the IDGAN achieves an accuracy of 99.4%, 95.4%, 93.2%, and 100% on the MNIST, Intel Image Classification, Flowers, and Face datasets, respectively, with an embedding rate of 0.17 bpp. The model effectively protects confidential information while maintaining high image quality.

With the application and development of Internet technology, network traffic is growing rapidly, and the situation of network security is becoming more and more serious. As an important way to protect network security, abnormal traffic detection has been paid more and more attention. In this paper, the uncertainty of the samples in the abnormal traffic detection dataset is studied. Combining the three-way decision idea with the random forest algorithm, a three-way selection random forest optimization model for abnormal traffic detection is proposed. Firstly, the three-way decision idea is integrated into the random selection process of feature attributes, and the attribute importance based on decision boundary entropy is calculated. The feature attributes are divided into the normal domain, abnormal domain, and uncertain domain, and the three-way attribute random selection rules are designed to randomly select the feature attributes that conform to the rules from different domains. Secondly, the classifier evaluation function is constructed by combining pure accuracy and diversity, and the anomaly traffic detection base classifier with a high evaluation value is selected for integration to eliminate the unstable factors caused by randomness in the process of base classifier generation. Thirdly, the optimal node weight combination of the base classifier is obtained by iterative calculation of the gray wolf optimization algorithm to further improve the prediction effect and robustness of the model. Finally, the model is applied to the abnormal traffic detection dataset. The experimental results show that the prediction accuracy of the three-way selection random forest optimization model on CIC-IDS2017, KDDCUP99, and NSLKDD datasets is 96.1%, 95.2%, and 95.3%, respectively, which has a better detection effect than other machine learning algorithms.

The prediction model with the sinter drum strength as the evaluation index was established based on the index data and historical sintering data generated during the sintering process. The regression prediction model in the algorithm of machine learning was applied to the prediction of the strength of the sinter drum. After verifying the feasibility of drum strength prediction, different data preprocessing methods were used to preprocess the data. Ten regression prediction algorithms such as linear regression, ridge regression, regression tree, support vector regression, and nearest neighbor regression were used for predicting the sinter drum strength to obtain preliminary prediction results. By comparing the prediction results, the most suitable combinations of data preprocessing algorithms and prediction algorithms for sinter drum strength prediction is obtained. The prediction results show that, for the drum strength of the sinter, using the function data standardization algorithm for data preprocessing has the best effect. Then, using gradient boosting regression, random forest regression, and extra tree regression prediction algorithms resulted in higher prediction accuracy. On this basis, the regression prediction model algorithm parameters are optimized and improved. The parameters of the regression prediction algorithm that are most suitable for the prediction of sinter drum strength are obtained.

In actual sinter production, batching is a complex metallurgical and mathematical problem. Aiming at the problem of the precising batching of iron ore in the process of sintering batching, an automatic batching algorithm based on a Cartesian product to batch sinter was proposed for the first time. When the algorithm is applied to the sintering batching process, a complete batching scheme can be obtained, which can realize the organic combination with other calculation processes, can effectively save the manpower and material cost of sintering batching, and is of great significance to the comprehensive use of iron ore resources. Taking the actual sintering production batching of a domestic iron and steel plant as an example, according to the batching requirements compared with various ore batching schemes, combined with the actual production situation, the automatic batching optimization algorithm based on a Cartesian product is applied to build a mathematical model of sintering batching. Through the algorithm test, the practicability of the automatic batching algorithm is verified. In addition, the automatic batching algorithm based on a Cartesian product has good performance in other batching fields.