Home Archive
Archive
2025 Volume 62 Issue 2  Published: 2025-02-01
    Artificial Intelligence
  • Yingtao Peng , Xiaofeng Meng , Zhijuan Du
    doi: 10.7544/issn1000-1239.202330600

    The recommender system has a significant role in alleviating information overload, allowing users to conveniently obtain products and services on various application platforms like Tmall, TikTok, and Xiaohongshu. However, most of the recommendation systems focus on the accuracy rate as the center, which leads to adverse effects such as the limitation of users’ vision, fewer display opportunities for some merchants, a single content ecosystem of the platform, and an unbalanced allocation of resources and information, such as triggering the filter bubble and the Matthew effect. As a result, strengthening the diversity of the recommendation system has become a key research point to fulfill the increasingly diversified material demands in people’s lives. In recent years, research on diversified recommendations has developed rapidly. However, this aspect needs to be more systematic in organization and summarization. This paper systematically reviews the issue of diversified recommendations within recommendation systems. Firstly, we put forward the problem definition, technical framework, classification, and application scenarios of diversified recommendations. Secondly, we make comparisons and analyses of models and algorithms from four perspectives. Subsequently, we summarize the commonly used datasets and metrics for diversified recommendations. Finally, we deliberate on the problems and challenges in this field to inspire future innovation and promote development.

  • Artificial Intelligence
  • Xuan Tian , Zhichao Wu
    doi: 10.7544/issn1000-1239.202331013

    Knowledge base question answering is aimed to retrieval relevant information from the knowledge base for model inference, and return accurate answers. In recent years, with the development of deep learning and large language models, knowledge base question answering based on information retrieval has become the research focus, and many novel research methods have emerged. We summarize and analyze the methods of knowledge base question answering based on information retrieval from different aspects such as model methods and datasets. Firstly, we introduce the research significance and related definitions of knowledge base question answering. Then, according to the model processing stages, we explain the key problems and typical solutions faced in each stage from four stages: question parsing, information retrieval, model inference, and answer generation, and summarize the common network modules used in each stage. Then we analyze and sort out the inexplicability of knowledge base question answering based on information retrieval methods. In addition, relevant datasets with different characteristics and baseline models at different stages are classified and summarized. Finally, the summary and outlook are provided on each stage of knowledge base question answering based on information retrieval, as well as the overall development direction of the field.

  • Artificial Intelligence
  • Xiaohui Zhang , Jiangyan Yi , Jianhua Tao , Junzuo Zhou
    doi: 10.7544/issn1000-1239.202330311

    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%.

  • Artificial Intelligence
  • Le Liu , Shengnan Guo , Xiyuan Jin , Miaomiao Zhao , Ran Chen , Youfang Lin , Huaiyu Wan
    doi: 10.7544/issn1000-1239.202330455

    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.

  • Artificial Intelligence
  • Rui Jia , Yongquan Dong , Yuan Liu , Cheng Chen
    doi: 10.7544/issn1000-1239.202330697

    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.

  • Artificial Intelligence
  • Yuanyi Luo , Rui Wu , Jiafeng Liu , Xianglong Tang
    doi: 10.7544/issn1000-1239.202330199

    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.

  • Artificial Intelligence
  • Doudou Guo , Weihua Xu
    doi: 10.7544/issn1000-1239.202330428

    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.

  • Artificial Intelligence
  • Xiuzai Zhang , Ye Qiu , Tao Shen
    doi: 10.7544/issn1000-1239.202330069

    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.

  • Artificial Intelligence
  • Yang Qing , Dantong Ouyang , Huisi Zhou , Liming Zhang
    doi: 10.7544/issn1000-1239.202330546

    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.

  • Artificial Intelligence
  • Lei Qi , Zihao Ren , Junxi Liu , Xin Geng
    doi: 10.7544/issn1000-1239.202330718

    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.

  • Artificial Intelligence
  • Zhongnian Li , Zhiyu Huangfu , Kaijie Yang , Peng Ying , Tongfeng Sun , Xinzheng Xu
    doi: 10.7544/issn1000-1239.202440123

    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.

  • Network and Information Security
  • Liansheng Lin , Huanqin Zheng , Shen Su , Kai Lei , Xiaofeng Chen , Zhihong Tian
    doi: 10.7544/issn1000-1239.202330291

    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.

  • Network and Information Security
  • Yupeng Wu , Hong Qian , Weiye Wang , Yangwenhui Zhang , Aimin Zhou
    doi: 10.7544/issn1000-1239.202330463

    Multi-objective security games (MOSGs) aim to simultaneously optimize the defender’s payoff against multiple heterogeneous attackers, which is of great importance in practical applications. Recently, the space discretization based evolutionary search (SDES) framework has been proposed to transform the constrained high-dimensional step function optimization problem in MOSG into a low-dimensional combinatorial optimization problem and to solve the combinatorial optimization task using a greedy strategy. Although SDES can address large-scale MOSG tasks in time, it is difficult for SDES to converge to the optimal Pareto front, especially in the large-scale scenario. On the one hand, the convergence assumption of the greedy strategy of SDES becomes difficult to be satisfied with the scale of MOSG tasks. On the other hand, SDES uses multiple number of stage components, including spatial discretization, evolutionary optimization, evaluation, and refinement components. This poses a risk of stage coupling, where upstream components’ optimization quality directly affects downstream components’ performance. To address these issues, we exploit and utilize the priority prior of the protected targets in MOSG task to improve the quality of solutions and simplify the SDES framework, resulting in the SDES-P framework. SDES-P redesigns the evaluation component, which is the core component of SDES, and removes the refinement component. Specifically, SDES-P starts from the infeasible solution with the maximum resources. Then, SDES-P divides the protected targets into two groups based on the priority prior, and the higher-priority group gradually releases resources to find feasible solutions. Finally, SDES-P contains an evolutionary local search strategy combined with priority prior knowledge to enhance the quality of the final Pareto front. We reveal that SDES-P can maintain the advantages of low sample complexity and strong scalability of SDES, and the experimental results show that regardless of whether the convergence assumption is satisfied, SDES-P can find high-quality Pareto fronts with better convergence and diversity compared with SDES.

  • Network and Information Security
  • Xiaojian Zhang , Leilei Zhang , Zhizheng Zhang
    doi: 10.7544/issn1000-1239.202330167

    Federated learning with user-level local differential privacy (ULDP) has attracted considerable research attention in recent years. The trade-off among federated data types, the mechanism of clipping local updates, the allocation of privacy budget, and user dropout directly constrain the accuracy of the global learning model. All existing federated learning methods are vulnerable to handling these problems. To remedy the deficiency caused by the current methods, we employ ULDP to propose an efficient algorithm, called ULDP-FED, to achieve global federated optimization. ULDP-FED can simultaneously handle IID and non-IID federated data types. Compared with those methods with fixed clipping thresholds, ULDP-FED uses a threshold dynamic decay strategy to balance the noise error caused by the Gauss mechanism and the bias caused by update clipping. To allocate the privacy budget of each user carefully, in each round, ULDP-FED relies on the similarity to replace the current local update with the historical noise updates. If the historical updates are obtainted, the user only sends the index of the historical update to the server, which can reduce the communication cost. ULDP-FED is compared with existing methods over MNIST and CIFAR 10 datasets. The experimental results show that our algorithm outperforms its competitors, and achieves the accurate results of federated learning.

  • Network and Information Security
  • Naizheng Jia , Can Xue , Liu Yang , Zhi Wang
    doi: 10.7544/issn1000-1239.202330882

    Recent economic advancements have significantly supported the popularity of indoor positioning systems (IPS) and indoor localization-based services (ILBS). This trend is particularly obvious as global navigation satellite systems (GNSS) are ineffective in indoor environments. Traditional IPS, such as WIFI and Bluetooth positioning, face challenges like low accuracy and are prone to non-line-of-sight (NLOS) and noise interference. In response to this issue, we propose a novel near-ultrasonic robust indoor localization method based on the stacking ensemble model. Initially, the method employs an optimized enhanced cross-correlation technique to effectively mitigate multipath interference in acoustic ranging. Compared with the conventional methods based on peak extraction or fixed thresholding, this approach significantly improves ranging accuracy in reverberant environments. Subsequently, time difference of arrival (TDOA) is extracted as a feature. Finally, we utilize a stacking ensemble learning model, incorporating optimized machine learning models, to train a pre-set dataset. This method, integrating the extracted feature, enables to achieve correct localization results in NLOS and large ranging error. Numerical simulations, ray-tracing acoustic analyses, and empirical validations suggest that our approach notably mitigates errors prevalent in NLOS and acoustically noisy indoor environments and yielding localization accuracy significantly exceeds current methods by 50%−90%. The core dataset available at https://github.com/ChirsJia/JSJYF.

  • High Performance Computing
  • Wei Li , Guanghui Li , Qinglin Zhao , Chenglong Dai , Si Chen
    doi: 10.7544/issn1000-1239.202330191

    Serverless computing provides developers a cloud computing paradigm, which does not require that developers focus on the server operation and hardware resource management in the context of the popularity of container technology and micro-service framework. At the same time, serverless computing can adapt to dynamic load changes in real time through elastic expansion and contraction, which can effectively reduce the request response delay and the service cost, and meet the customer’s demand for pay-as-you-go cloud service expense. However, serverless computing faces the issue of cold start delay caused by the demand for elastic expansion and contraction. Creating the instances of warm-up function in advance can reduce the frequency and delay of cold start effectively. Nevertheless, the traffic burst problem in the cloud environment greatly increases the difficulty of predicting the number of warm-up function instances. To solve the above-mentioned challenges, a probability distribution based auto-scaling algorithm (PDBAA) is proposed. By using the historical data of monitoring indicators to predict the probability distribution of future requests, the optimal number of warm-up function instances is calculated for minimizing the request response delay. PDBAA can effectively combine the powerful prediction capability of deep learning technology to further improve performance. Under the Knative framework, the performance of PDBAA is verified by NASA and WSAL datasets. The simulation results show that, compared with the Knative auto-scaling algorithm and other prediction algorithms, PDBAA improves the elastic performance by over 31%, and reduces the average response time by over 16%, which can better solve the traffic burst problem, and effectively reduce the response delay of serverless computing requests.

  • High Performance Computing
  • Rongyuan Guo , Haipeng Jia , Yunquan Zhang , Cunyang Wei , Mingsen Deng , Jingrui Chen , Zhenya Zhou
    doi: 10.7544/issn1000-1239.202330864

    TRSM (triangular matrix equation solver) is a commonly used algorithm for solving systems of linear equations, and is the core algorithm of various scientific computing libraries and mathematical software, which is widely used in the fields of scientific computing, engineering computing and machine learning. The small-scale irregular TRSM algorithm limits the scope of problem-solving and is an algorithm for efficiently handling smaller-scale, irregular data inputs. With the development of personalization and refinement in the field of high-performance computing, the demand for small-scale irregular TRSM computation in the scientific and industrial communities is becoming more and more obvious. While traditional algorithms are better suited for large-scale and regular TRSM computation, there is still room for improvement in the computational efficiency of small-scale and irregular TRSM. In this paper, we propose a small-scale irregular TRSM optimization scheme by combining hardware architecture and application scenario characteristics, designing a high-performance kernel from the perspectives of register chunking, boundary processing, and vectorization computation, and constructing an algorithmic library of small-scale irregular SI_TRSM (small-scale irregular TRSM) covering double-precision real numbers and double-precision complex numbers based on which the performance of this algorithm is greatly improved. Based on experimental results, the double-precision small-scale irregular TRSM algorithm library developed in this paper has shown to enhance the average performance of double-precision small-scale irregular real numbers by 29.4 times, and double-precision small-scale irregular complex numbers by 24.6 times in comparison with similar algorithms available in the MKL (Intel math kernel library).

  • High Performance Computing
  • Guilin Chen , Guanwu Wang , Kang Wang , Minhui Hu , Junquan Deng
    doi: 10.7544/issn1000-1239.202330409

    Convolutional neural network (CNN) has become one of the most important machine learning technologies in the field of image recognition. In recent years, with the increasing demand for CNN deployment at the mobile edge, the lightweight of CNN has become a research hotspot. The mainstream CNN lightweight methods include pruning and quantization, both of which can effectively reduce the calculation and storage overhead for CNN inference. However, none of these methods fully exploits the bilateral sparsity (weight sparsity and activation sparsity) and potential data-reuse in CNN. Therefore, in order to solve these problems, we propose a new neural network lightweight method, and the k-means algorithm is used to cluster the non-zero values of convolution kernel and feature map, and the CNN inference only uses limited cluster values as multipliers to complete all convolutional calculations. Compared with the computational complexity of original convolutional layer $ O({n}^{3}) $, the computational complexity of the convolutional layer after lightweight is $ O({n}^{2}) $, effectively reducing the amount of computation. Similarly, the non-zero weights of the fully connected layer are also clustered, and only the cluster values and corresponding index vectors are stored on chip, which significantly reduces the storage overhead. Finally, a customized architecture KCNN is designed for this lightweight method. The architecture modularizes the different processes of the CNN, and compared with the previous accelerator, a non-zero clustering module is added. In addition, some caches are added to make use of the data-reuse in the CNN after clustering. The experiment results show that without losing the derivation accuracy, the overall calculation of AlexNet network is reduced by 66%, and the storage expense is reduced by 85%.