Home Latest Articles
Latest Articles
  • Xiaohui Zhang, Jiangyan Yi, Jianhua Tao, Junzuo Zhou
    Journal of Computer Research and Development. 2025, 62(2): 336-345.

    Currently, deep learning has achieved significant success in the field of synthetic speech detection. However, deep models commonly attain high accuracy on test sets that closely match their training distribution but exhibit a substantial drop in accuracy in cross-dataset scenarios. To enhance the generalization capability of models on new datasets, they are often fine-tuned with new data, but this leads to catastrophic forgetting, where the model’s knowledge learned from old data is impaired, resulting in deteriorated performance on the old data. Continuous learning is a prevalent approach to mitigate catastrophic forgetting. In this paper, we propose a continuous learning algorithm called elastic orthogonal weight modification (EOWM) to address catastrophic forgetting for synthetic speech detection. EOWM mitigates knowledge degradation by adjusting the direction and magnitude of parameter updates when the model learns new knowledge. Specifically, it enforces the updates’ direction to be orthogonal to the data distribution of the old tasks while constraining the magnitude of updates for important parameters in the old tasks. Our proposed algorithm demonstrates promising results in cross-dataset experiments within the domain of synthetic speech detection. Compared with fine-tuning, EOWM reduces the equal error rate (EER) on the old dataset from 7.334% to 0.821%, representing a relative improvement of 90%, and on the new dataset, it decreases EER from 0.513% to 0.315%, corresponding to a relative improvement of 40%.

  • Le Liu, Shengnan Guo, Xiyuan Jin, Miaomiao Zhao, Ran Chen, Youfang Lin, Huaiyu Wan
    Journal of Computer Research and Development. 2025, 62(2): 346-363.

    Traffic data missing is one of the unavoidable problems in intelligent transportation systems. Completing and quantifying the uncertainty of missing values can improve the performance and reliability of traffic data mining tasks in intelligent transportation systems. However, most existing traffic data imputation models mainly focus on point estimation without quantifying the uncertainty, so they cannot meet the need for traffic data reliability in the transportation field. Besides, these methods only focus on modeling spatial-temporal correlation of traffic data, failing to consider the impact of missing values on spatial-temporal correlation. In addition, the uncertainty of traffic data is affected by time, spatial location, and the state of the data, but existing methods cannot comprehensively consider these factors. To address these challenges, we propose a spatial-temporal uncertainty guided traffic data imputation network (STUIN), which simultaneously realizes the imputation of spatial-temporal traffic data and the uncertainty quantification of the imputation results by self-supervised training. Specifically, we innovatively model the hidden states of the neural network as random variables subject to Gaussian distributions, use the variances of Gaussian distributions to model the uncertainty of the hidden states, and introduce a variance-based attention mechanism to characterize the effect of uncertainty on modeling spatio-temporal correlations. In addition, we design a novel spatial-temporal uncertainty initialization module, which incorporates the influence of time, space and missing values when initializing the means and variances of the Gaussian distributions. Experiments on two traffic flow datasets show that STUIN achieves state-of-the-art performance on both the data imputation and uncertainty quantification tasks.

  • Rui Jia, Yongquan Dong, Yuan Liu, Cheng Chen
    Journal of Computer Research and Development. 2025, 62(2): 364-373.

    Knowledge tracing is a pivotal technique for modeling students’ knowledge level, and typically relies on their past learning interactions to predict their future performance on exercises. These interactions represent a student’s process of answering a sequence of questions. Current knowledge tracing methods ignore times a skill has been practiced when modeling student’s forgetting behaviors. Also, few models consider the relation between skills and its influence on performance prediction. To address these questions, we propose a deep knowledge tracing model with the integration of skills relation and forgetting degree. Firstly, a relation matrix is constructed using statistical methods to capture the relation between skills. Secondly, the time intervals between interactions and the times a student practices the same skill are used to compute the forgetting degree of each skill for better modeling of students’ forgetting behaviors. Finally, skills relation and forgetting degrees are integrated into an attention module to obtain the influence of each past interaction on future performance prediction. Based on new attention weights, students’ performance on future exercises and knowledge level can be predicted. Experiments on two real-world online education datasets, algebra2005-2006 and ASSISTment2012, demonstrate that the proposed model achieves better prediction results compared with existing mainstream methods.

  • Yuanyi Luo, Rui Wu, Jiafeng Liu, Xianglong Tang
    Journal of Computer Research and Development. 2025, 62(2): 374-382.

    Multimodal sentiment analysis is a multimodal task that uses multiple modalities of subjective information to analyze sentiment. In some scenarios, the sentimental expression in different modalities is inconsistent, even contradictory, which will weaken the effect of multimodal collaborative decision-making. In this paper, a multimodal learning method is proposed to learn the modal feature representations with consistent sentimental semantics. In order to improve the common feature representation of different modalities and learn the dynamic interaction between modalities without affecting the original information, we first learn the common feature representation of each modality, and then use cross attention to enable one modality to effectively obtain auxiliary information from the common feature representations of other modalities. In multimodal fusion, we propose a multimodal attention, which is used to weighted concatenate modal feature representations, in order to increase the expression of contributed modalities and suppress the influence of weak modalities. The experimental results of the proposed method on the sentiment analysis datasets MOSI, MOSEI, CH-SIMS are better than those of the compared models, indicating the necessity and rationality of considering the problem of sentimental semantic inconsistency in multimodal sentiment analysis.

  • Doudou Guo, Weihua Xu
    Journal of Computer Research and Development. 2025, 62(2): 383-396.

    With the rapid development of global informationization, data mining and knowledge discovery of high-dimensional data have been a hotspot in the field of artificial intelligence and data science. However, the sparse sample and redundant feature issues of high-dimensional data make it challenging to ensure the generalization and interpretability of traditional statistical models and machine learning methods. Hence, we present fuzzy-based concept-cognitive learning with robustness for the imbalance problem between high-dimensional data and weak knowledge evolution ability. The main idea is to explore the knowledge structure and cognitive learning mechanism of high-dimensional data from the concept perspective. We propose a high-dimensional data classification method based on the concept-cognitive learning mechanism in the fuzzy formal context. Furthermore, the cognitive learning process of fuzzy concepts is described from two different perspectives by the positive and negative cognitive learning operators of fuzzy three-way concepts. Finally, the fusion of fuzzy three-way concepts completes the task of concept identification and data classification. Extensive experiments performed on 12 real data sets compared with 12 state-of-the-art classification methods also verify the robustness and effectiveness of the proposed method. The considered framework can provide a convenient novel tool for high-dimensional data knowledge discovery research and fuzzy-based concept-cognitive learning.

  • Xiuzai Zhang, Ye Qiu, Tao Shen
    Journal of Computer Research and Development. 2025, 62(2): 397-407.

    In the subway scene, small pedestrian targets contain less feature information due to their low resolution, and it is still challenging for object detectors to detect such objects at this stage. SSD target detection algorithm uses the multi-scale detection head of the pyramid network, which can improve the pedestrian target detection performance to a certain extent, but it still has certain limitations in small pedestrian target detection application in complex environments such as subways. In view of the above problems, we propose an improved SSD algorithm to enhance the detection effect of small pedestrian targets in subway scenes, construct a dataset of pedestrian targets in subway scenes, mark the corresponding labels, and perform data preprocessing operations at the same time. In this study, a pyramid feature enhancement module is added to the feature extraction network, and the multi-branch residual unit, sub-pixel convolution and feature pyramid are combined to obtain image multi-scale and multi-receptive field fusion features. We use the context information fusion module to fuse the low-level features of the image with the context features to generate an extended feature layer for detecting small pedestrian targets, and design an Anchor-free dynamic positive and negative sample allocation strategy to generate optimal positive samples for small pedestrian targets. A dynamic positive and negative sample allocation strategy based on Anchor-free is designed to generate optimal positive samples for small pedestrian targets. The experimental results show that the proposed improved SSD algorithm can effectively improve the performance of small pedestrian target detection in subway scenes, and the effect of small pedestrian target detection with severe occlusion is more obvious.

  • Yang Qing, Dantong Ouyang, Huisi Zhou, Liming Zhang
    Journal of Computer Research and Development. 2025, 62(2): 408-417.

    Model-based diagnosis (MBD) finds a growing number of uses in different settings. It includes software fault localization, debugging of spread sheets, Web services, and hardware designs, and also the analysis of biological systems, among many others. Motivated by these different uses, there have been significant improvements made to MBD algorithms in recent years. Nevertheless, the analysis of larger and more complex systems motivates further improvements to existing approaches. Since computing diagnosis is computationally challenging, some MBD algorithms by compacting the model are presented successively, such as dominated-based compacted model with multiple observations (D-CMMO) approach. In this paper, we propose one new diagnosis model, namely, cardinality-constrained compacted (CCM) model, to solve the problem in which a considerable amount of time is needed when multiple observations are given and more than one fault is injected. CCM uses two methods to optimize the process of solving MBD. Firstly, we propose to utilize relationship of faulty system-outs and faulty components to limit the scope of target solution. Secondly, the performance of the MaxSAT (maximum satisfiability) solver is effectively improved by enqueueing all assumptions at once. Furthermore, experiment evaluations on ISCAS85 and ITC99 benchmarks show that compared with D-CMMO, the latest encoding algorithms for MBD, the above two optimization methods effectively reduce the scope of MBD problem, reduce the difficulty of searching for the target solution by the MaxSAT solver, and thus return diagnostic solution in a shorter time. On average, the solving efficiency of CCM method is improved by 64.5% and 92.8% compared with D-CMMO method respectively.

  • Lei Qi, Zihao Ren, Junxi Liu, Xin Geng
    Journal of Computer Research and Development. 2025, 62(2): 418-431.

    In recent years, the rapid urbanization and development of the social economy have led to a growing focus on public safety issues. Governments across the world are increasingly promoting the construction of smart cities and intelligent security systems to safeguard the lives and property of citizens and maintain social stability. Person re-identification (ReID) is an essential technology for building smart cities, with significant implications for security monitoring and criminal investigation applications. The goal of person re-identification is to accurately identify specific individuals captured under different cameras. However, due to intra-class differences resulting from various factors such as illumination, viewpoint, occlusion, and pose, person re-identification remains a challenging task in the field of computer vision. Although existing fully supervised person re-identification methods have made significant progress, the scarcity of data and labels poses a bottleneck for further improving model performance. To address this challenge, we introduce a more complex and diverse synthetic dataset with easy-to-obtain labels for auxiliary training, and propose a novel camera-aware asymmetric adversarial learning (CAAL) method that overcomes intra-class variation among multiple cameras and the domain-shift between real data and synthetic data, enabling the learning of camera-invariant feature representations from diverse data sources. Furthermore, to mitigate the impact of misleading information carried by synthetic datasets and prevent the model from overfitting to synthetic data during adversarial training, we propose using an auxiliary network trained on real-world data to constrain the training of the backbone network. Finally, we conduct extensive experiments on two public datasets to demonstrate the effectiveness of the proposed method.

  • Zhongnian Li, Zhiyu Huangfu, Kaijie Yang, Peng Ying, Tongfeng Sun, Xinzheng Xu
    Journal of Computer Research and Development. 2025, 62(2): 432-442.

    Semi-supervised multi-label learning employs labeled and unlabeled data to train a model, which effectively achieves good results and reduces the labeling cost of multi-label data. Therefore, semi-supervised multi-label learning has attracted many researchers dedicated to this field. However, in the semi-supervised annotation process, due to the large number of labels, it is a common situation that some labels lack of samples, and these labels are called open vocabulary. It is difficult for the model to learn the label information of the open vocabulary, which leads to the degradation of its performance. To address the above problem, we propose a semi-supervised open vocabulary multi-label learning method based on graph prompting. Specifically, this method uses a graph neural network via prompt to fine-tune the pre-trained model and explore the relationship between open vocabulary and supervised samples. By using images and text, we construct a graph neural network as the input of text for the pre-trained model. Furthermore, by leveraging the generalization ability of the pre-trained model on open vocabulary, pseudo-labels are generated for unsupervised samples. Then we use pseudo-labels to train the classification layer and to enable the model to achieve better performance in classifying open vocabulary. Experimental results on multiple benchmark datasets, including VOC, COCO, CUB, and NUS, consistently demonstrate that the proposed method outperforms existing methods and achieves state-of-the-art performance.

  • Liansheng Lin, Huanqin Zheng, Shen Su, Kai Lei, Xiaofeng Chen, Zhihong Tian
    Journal of Computer Research and Development. 2025, 62(2): 443-457.

    Price manipulation attacks manipulate the on-chain prices of decentralized financial (DeFi) projects by altering the digital asset stock, thereby attacking their liquidation mechanisms to achieve improper profits. Nowadays, price manipulation attacks have emerged as the most significant security threats to the current decentralized financial ecosystem. To defend from the price manipulation attacks, the oracle obtains the exchange prices from the real world, which are difficult to manipulate. However, the maintenance expense of the oracle is very high due to frequent on-chain data update, making it challenging to meet industrial demand. To address these issues, we propose a defense mechanism against price manipulation attacks. This mechanism utilizes off-chain prices to guide the identification of on-chain price manipulation behaviors and intercepts price manipulative transactions through a contract proxy. The mechanism reduces the frequency of price submissions and the cost of updating off-chain data on-chain through low-frequency price feeding. This compromise aims to balance the cost of defense against price manipulation attacks with the precision of identification. Based on the experimental findings, we have conclusively demonstrated that our innovative method substantially diminishes the overall maintenance cost by over 30%, concurrently achieving an outstanding success rate of 97.5% in effectively safeguarding against price manipulation attacks.