Few-shot learning (FSL) is a core topic in the domain of machine learning (ML), in which the focus is on the use of small datasets to train the model. In recent years, there have been many important data-driven ML applications for intrusion detection. Despite these great achievements, however, gathering a large amount of reliable data remains expensive and time-consuming, or even impossible. In this regard, FSL has been shown to have advantages in terms of processing small, abnormal data samples in the huge application space of intrusion detection. FSL can improve ML for scarce data at three levels: the data, the model, and the algorithm levels. Previous knowledge plays an important role in all three approaches. Many promising methods such as data enrichment, the graph neural network model, and multitask learning have also been developed. In this paper, we present a comprehensive review of the latest research progress in the area of FSL. We first introduce the theoretical background to ML and FSL and then describe the general features, advantages, and main methods of FSL. FSL methods such as embedded learning, multitask learning, and generative models are applied to intrusion detection to improve the detection accuracy effectively. Then, the application of FSL to intrusion detection is reviewed in detail, including enriching the dataset by extracting intermediate features, using graph embedding and meta-learning methods to improve the model. Finally, the difficulties of this approach and its prospects for development in the field of intrusion detection are identified based on the previous discussion.

The mobile social network contains a large amount of information in a form of commentary. Effective analysis of the sentiment in the comments would help improve the recommendations in the mobile network. With the development of well‐performing pretrained language models, the performance of sentiment classification task based on deep learning has seen new breakthroughs in the past decade. However, deep learning models suffer from poor interpretability, making it difficult to integrate sentiment knowledge into the model. This paper proposes a sentiment classification model based on the cascade of the BERT model and the adaptive sentiment dictionary. First, the pretrained BERT model is used to fine‐tune with the training corpus, and the probability of sentiment classification in different categories is obtained through the softmax layer. Next, to allow a more effective comparison between the probabilities for the two classes, a nonlinearity is introduced in a form of positive‐negative probability ratio, using the rule method based on sentiment dictionary to deal with the probability ratio below the threshold. This method of cascading the pretrained model and the semantic rules of the sentiment dictionary allows to utilize the advantages of both models. Different sized Chnsenticorp data sets are used to train the proposed model. Experimental results show that the Dict‐BERT model is better than the BERT‐only model, especially when the training set is relatively small. The improvement is obvious with the accuracy increase of 0.8%.

Current mainstream for Chinese grammatical error correction methods rely on deep neural network models, which require a large amount of high-quality data for training. However, existing Chinese grammatical error correction corpora have a low annotation quality and high noise levels, leading to a low generalization ability of the models and difficulty in handling complex sentences. To address this issue, this paper proposes a dynamic assessment-based curriculum learning method for Chinese grammatical error correction. The proposed approach focuses on two key components: defining the difficulty of training samples and devising an effective training strategy. In the difficulty assessment phase, we enhance the accuracy of the curriculum sequence by dynamically updating the evaluation model. During the training strategy phase, a multi-stage dynamic progressive approach is employed to select training samples of varying difficulty levels, which helps prevent the model from prematurely converging to local optima and enhances the overall training effectiveness. Experimental results on the MuCGEC and NLPCC 2018 Chinese grammatical error correction datasets show that the proposed curriculum learning method significantly improves the model’s error correction performance, with F0.5 scores increasing by 0.9 and 1.05, respectively, validating the method’s effectiveness.

Hierarchical Text Classification (HTC) is a challenging task where labels are structured in a tree or Directed Acyclic Graph (DAG) format. Current approaches often struggle with data imbalance and fail to fully capture rich semantic information. This paper proposes an Adaptive Hierarchical Text Classification method, EDTPA (ERNIE and Dynamic Threshold Pruning-based Adaptive classification), which leverages Large Language Models (LLMs) for data augmentation to mitigate imbalanced datasets. The model first uses Graph Attention Networks (GAT) to capture hierarchical dependencies among labels, effectively modeling structured relationships. ERNIE enhances the semantic representation of both the text and hierarchical labels, optimizing the model’s ability to process Chinese text. An attention mechanism strengthens the alignment between text and labels, improving accuracy. The model combines global and local information flows, while dynamic threshold pruning prunes low-probability branches, improving interpretability. Results on the Chinese Scientific Literature (CSL) dataset show EDTPA significantly outperforms baseline models in both Micro-F1 and Macro-F1 scores, effectively addressing data imbalance and improving classification performance.

Open-domain question-answering systems need models capable of referencing multiple passages simultaneously to generate accurate answers. The Rational Fusion-in-Decoder (RFiD) model focuses on differentiating between causal relationships and spurious features by utilizing the encoders of the Fusion-in-Decoder model. However, RFiD reliance on partial token information limits its ability to determine whether the corresponding passage is a rationale for the question, potentially leading to inappropriate answers. To address this issue, we propose a Quantum-Inspired Fusion-in-Decoder (QFiD) model. Our approach introduces a Quantum Fusion Module (QFM) that maps single-dimensional into multi-dimensional hidden states, enabling the model to capture more comprehensive token information. Then, the classical mixture method from quantum information theory is used to fuse all information. Based on the fused information, the model can accurately predict the relationship between the question and passage. Experimental results on two prominent ODQA datasets, Natural Questions and TriviaQA, demonstrate that QFiD outperforms the strong baselines in automatic evaluations.