Home Latest Articles
Latest Articles
  • Yue Shen, Jie Zhang, Yuan Zhang, Huawei Cao, Xuejun An, Xiaochun Ye
    Journal of Computer Research and Development. 2026, 63(3): 798-811.

    Streaming graphs can effectively model rapidly changing data in real life, and have been widely used in social network analysis, content recommendation, anomaly detection, and other fields. Based on the fact that the two graph snapshots before and after the graph update have a large amount of the same data, incremental computation reduces the amount of memory accesses and computation in the iterations by storing and reusing the historical results, which effectively improves the performance of streaming graph processing. However, the existing solutions for incremental computation optimization of graph algorithms are often limited by graph algorithms that satisfy specific properties, thus it is difficult to apply them to general graph algorithms. In this paper, the incremental computation is further divided into two modes of refinement and recomputation. The similarities and differences between the two modes are analyzed theoretically, and the performance differences between them are tested experimentally with different datasets, algorithms, and update settings. Based on the two modes, the hybrid incremental computation mode is designed to ensure the correctness of switching, and the switching time is predicted accurately by random forest classifiers. Through performance evaluation and switching effect analysis, it is proved that the general graph algorithms can effectively switch under the hybrid mode. Compared with the state-of-the-art solution DZIG, the average speedup is 1.25.

  • Qinghua Zhang, Xiong Zhou, Wei Liao, Shuaishuai Huang, Xuting Qin
    Journal of Computer Research and Development. 2026, 63(3): 812-823.

    Joint entity and relation extraction is a foundational task for knowledge graph construction, which aims at extracting relational triples from unstructured text. To address the issues of the redundant annotations in corresponding matrix and insufficient interactions between subjects and objects, a joint model based on biaffine entity pairing and cascade tagging scheme is proposed. First, the potential relations in the sentence are predicted by performing a multi-label classification task, which eliminates the redundant relations in the relation-specific entity identification module. Then, the integrated candidate entity representations are passed through a biaffine network to enhance the interactions between subjects and objects, resulting in an entity pairing matrix that contains only candidate entities and reduces redundant annotations in the entity pairing phase. Next, a cascade tagging scheme is applied to identify relation-specific entities, and the identified entities are combined with the entity pairing matrix to form relational triples. Finally, the effectiveness of the proposed model is validated by comparative experiments and ablation study conducted on four public datasets. The experimental results demonstrate the proposed model achieves significant performance improvements over current baseline methods in terms of standard evaluation metrics, while effectively mitigating both the redundant annotation problem and the issue of insufficient entity interactions.

  • Peizhuang Cong, Feiyu Wang, Guo’an Wang, Yanshu Wang, Ce Zheng, Tong Yang
    Journal of Computer Research and Development. 2026, 63(2): 276-293.

    With the exponential growth in the parameter scale of large language models (LLMs), model deployment and inference face severe challenges in terms of memory and computational resources. Quantization, as a core compression technique, significantly reduces storage requirements and computational overhead by lowering the numerical precision of weights and activations. We first review the development of quantization techniques, from classic Int8/4 methods to cutting-edge extreme-low bit algorithms. Then we summarize the technical characteristics and performance evolution of typical methods, identifying a key challenge: traditional real-domain quantization is limited by discretization errors at extreme-low bitrates, making it difficult to break its performance ceiling. To address this limitation, we systematically review the complex-domain quantization series of work. This series introduces a quantization paradigm based on the complex domain, which significantly expands the model’s expressive space by utilizing amplitude and phase as two degrees of freedom in the parameter representation. Moreover, drawing on the classic paradigm in signal processing where stable representations are achieved by applying the Fourier transform and low-pass filtering to time-domain signals, we further propose a technical path that proceeds from real-valued models through complex-domain transformation and complex-domain quantization, ultimately achieving multiplier-free stable inference. Experimental results demonstrate that iFairy outperforms existing extreme-low-bit methods on multiple benchmark datasets and effectively breaks the real-domain performance ceiling. This showcases the potential value of complex-domain quantization in achieving both efficient modeling and performance preservation. Through a systematic analysis of quantization’s evolution and the case study on complex-domain quantization, we reveal development patterns and future trends, providing a reference for the theoretical research and engineering implementation of efficient LLMs.

  • MingHai Jiao, Benhang Fan, Jing Wang, Yuhuai Peng
    Journal of Computer Research and Development. 2026, 63(2): 294-304.

    The core objective of the named entity recognition (NER) is to identify entities with specific semantic categories and types in unstructured text. With the rapid growth of social media, textual information is often accompanied by visual content, forming multimodal data. To improve the accuracy of entity recognition, multimodal NER (MNER) methods exploit semantic information from different modalities fully to achieve the complementary and deep fusion of cross-modal features. However, differences in the representation of modalities may introduce visual noise that interferes with entity recognition. Issues such as entity ambiguity or contextual semantic vagueness within the textual modality complicate recognition. To address these challenges, we propose a multimodal NER method based on a reinforcement strategy feedback with adaptive loss mechanism. First, the method adopts a three-stage chain of thought (COT) reasoning process based on GPT-4o to form a progressive reasoning framework that incorporates the adaptive feedback mechanism in reinforcement learning. The degree of matching between images and text is scored, and the interference of visual noise is effectively filtered using an adaptive decision function. Second, four task-specific loss functions are designed and jointly optimized through an adaptive weighted fusion strategy to alleviate the uncertainty caused by contextual ambiguity. Experiments on two representative public datasets (Twitter-2015 and Twitter-2017) show that the overall F1 scores of our proposed method are 86.45% and 93.80%, respectively, representing a significant improvement on current state-of-the-art baseline models.

  • Shunjie Wang, Guoyong Cai, Guangrui Lü
    Journal of Computer Research and Development. 2026, 63(2): 305-323.

    Multimodal emotion recognition in conversations (MERC) has emerged as a prominent research focus in the domain of human-computer intelligent interaction. It demonstrates extensive applicability across diverse scenarios, including affective dialogue systems and conversational recommendation systems, thereby substantially improving user’s experience through enhanced emotional engagement. Identifying abstract emotional semantics in multimodal conversation scenarios poses a significant challenge. Current research predominantly relies on contrastive learning frameworks to extract discriminative feature. Although these approaches effectively enforce intra-class feature consistency, they inherently constrain fine-grained feature diversity. This limitation consequently impairs the model’s generalization capacity, particularly when processing samples from minority classes. In addition, current dialogue context graph learning only captures the dependence with a fixed window, neglecting the dynamic cross-correlation of the conversation flow, which can lead to either redundancy or insufficient of extracted context information. To address the aforementioned limitations, the adversarial soft-contrast modulated dynamic graph learning is proposed for MERC. Specifically, a dynamic discourse graph is firstly constructed according to the number of utterances emitted by the speaker in the conversation, which allows for dynamically modeling the conversational dependency range of the utterance in each modality to extract rich contextual information more precisely. Secondly, the adversarial soft-contrast training mechanism is designed to enhance the discrimination and robustness of the network learning. Among them, the class sample space is expanded by adding perturbations to the hidden layers of different modal feature extractors to generate adversarial samples, and the soft-contrast learning is exploited to maximize label semantic consistency of the original samples and the adversarial samples. Finally, a bi-stream graph learning strategy for different modalities is constructed, which not only explores the cross-modal consistent feature interaction guided by text semantics, but also learns the context dynamic dependencies within multimodal dialogue flow to collaboratively facilitates the complementary fusion of multimodal conversations data. Extensive experiments conducted on the IEMOCAP and MELD benchmark datasets have demonstrated that our proposed model achieves competitive results in terms of effectiveness for MERC, compared with current state-of-the-art methods.

  • Meilin Liu, Hua Li, Wenping Zheng
    Journal of Computer Research and Development. 2026, 63(2): 324-337.

    Graph neural networks (GNNs) learn graph embeddings by iteratively aggregating neighborhood features and have been widely applied in graph data analysis. Existing methods primarily focus on low-order node-edge interactions while overlooking high-order group interaction patterns captured by motifs. This limitation hinders the effective modeling of high-order dependencies in complex networks. Motifs, as frequently occurring functional substructures in networks, can effectively reveal high-order semantic relationships among nodes. The motif co-occurrence view provides a novel perspective for representing such interactions. However, the weak connectivity of motif co-occurrence views restricts message passing in GNNs, thereby impeding the effective propagation of global information. To address this issue, we propose a motif-aware multi-view cooperative clustering optimization algorithm (MMCC), which fully exploits high-order topological information through an adaptive multi-view fusion mechanism while enhancing representation consistency across different views via contrastive learning to alleviate the issue of restricted message passing. Specifically, MMCC first constructs multiple motif co-occurrence views based on different motif structures and employs a semantic attention-based multi-view auto-encoder to dynamically learn the importance of different motif views, achieving adaptive fusion. Then, contrastive learning is introduced to enforce embedding space consistency between the original view and motif co-occurrence views, mitigating the message passing limitations caused by weak connectivity. Finally, by optimizing a KL-divergence-based objective function, MMCC jointly optimizes feature learning and clustering tasks. Experimental results on seven real-world networks demonstrate that MMCC outperforms eight baseline algorithms in clustering accuracy (ACC), normalized mutual information (NMI), F1-score (F1), and adjusted Rand index (ARI), highlighting its effectiveness in high-order network clustering.

  • Haojun Ai, Feng Zhang, Pengfei Lü, Xuehua Tang, Zhongyuan Wang
    Journal of Computer Research and Development. 2026, 63(2): 338-351.

    In recent years, self-supervised monocular depth estimation methods have achieved impressive improvements. However, their performance degrades significantly when generating structured depth maps in complex indoor scenarios. To bridge this gap, focusing on the training process, we propose LoFtDepth, a novel method that combines self-supervised monocular depth estimation with local feature guided knowledge distillation. Firstly, an off-the-shelf depth estimation network is used to generate structured relative depth maps as depth priors. Local features are then extracted from these priors as boundary points, guiding the local depth refinement. This reduces the interference of depth-irrelevant features and transfers the boundary knowledge of depth priors to the self-supervised depth estimation network. Additionally, we introduce an inverse auto-mask weighted surface normal loss. This encourages normal directions of depth maps predicted by self-supervised network to align with those of depth priors in untextured regions. As a result, the depth estimation accuracy is enhanced. Finally, according to the coherence of camera motion, we impose a pose consistency constraint on residual pose estimation. This constraint enables effective adaptation to indoor scenes where camera poses change frequently, thereby mitigating training errors and boosting model performance. Extensive experiments on major indoor datasets demonstrate that LoFtDepth outperforms previous methods. It reduces the absolute relative error to 0.121, and successfully generates accurate and well-structured depth maps.

  • Zhongsheng Qian, Hui Zhu, Qingyuan Yu, Yulong Li, Zilong Wan
    Journal of Computer Research and Development. 2026, 63(2): 352-377.

    Social recommender systems explore collaborative data behind social labels to offer personalized suggestions. Despite many users lacking explicit social connections, they share similar item interaction histories. Prior studies have tried extracting high-order implicit social features via complex metapaths, which often diminishes model practicality. Additionally, the noise in these features can reduce adaptability when combined with explicit features using concatenation or deep learning. Recently, generative adversarial networks (GANs) have supported robust data augmentation but pose challenges with model convergence, impacting efficiency in social recommendation contexts. To address these issues, we introduce AFS-GAN (generative adversarial networks recommender systems for adaptive fusion of social features), a generative adversarial recommendation model with an adaptive fusion strategy for user social features. Initially, two simple metapaths extract first-order explicit and second-order implicit social features, improving model practicality and reducing subjective bias. An adaptive factor then flexibly fuses these features, capturing the diversity of user behaviors and enhancing recommendation adaptability. The generator uses straight-through Gumbel Softmax to speed up pseudo-item generation, while the discriminator employs a quartic BPR (bayesian personalized ranking) loss function to optimize discrimination loss, thus speeding convergence and simplifying the model. Extensive comparisons on 4 benchmark recommendation datasets with 8 leading social recommendation models have demonstrated that our approach excels in Precision, Recall, and NDCG metrics.

  • Jingping Liu, Zhedong Cen, Weiyan Zhang, Tong Ruan, Chao Wang, Haofen Wang
    Journal of Computer Research and Development. 2026, 63(2): 378-392.

    Relation reasoning, an important task in natural language processing, aims to infer possible semantic relations between two or more entities. The reasoning process typically involves deriving new relations from known relations between entities, and the results can be widely applied in various downstream tasks such as knowledge graph completion, relation extraction, and commonsense knowledge question answering. Previous studies often face two main limitations: First, they are primarily based on the closed-world assumption, meaning the relation types are predefined and difficult to expand. Second, even if some methods focus on open domains, they typically only handle 1-hop reasoning, which is insufficient for complex multi-hop reasoning scenarios. To address these issues, we propose and define an open domain 2-hop relation reasoning task and construct a dataset for evaluating this task. Furthermore, we introduce an open domain 2-hop relation reasoning framework, named ORANGE (open domain relation reasoning method on generative model), which includes 3 key modules: entity generation, relation generation, and result aggregation. Firstly, the entity generation module generates unknown entities. Secondly, the relation generation module proposes potential new relations. Finally, the result aggregation module integrates the outputs of the preceding modules to determine the final result. Experimental results demonstrate that, when compared with the best existing methods, our approach achieves a 10.36% improvement in the average score. Moreover, when employing ORANGE’s 3-module relation reasoning framework with large language models, it surpasses the conventional in-context learning prompt strategy, showcasing a 9.58% enhancement in the average score.

  • Zhuo Chen, Jiaqi Di, Ao Zhang, Xiaopeng Lu, Junwei Du
    Journal of Computer Research and Development. 2026, 63(2): 393-404.

    Graph-based fake review detection primarily faces the notoriously challenge of effectively aggregating neighbor information from different relations particularly in an attributed graph with only a limited number of labeled positive samples. The goal is to enhance the sensitivity of graph representation learning to anomalous nodes and improve its generalization capability. To address this challenge, we propose a meta-learning-based multi-information fusion graph difference network (Meta-MGDN). By innovatively constructing a multi-view partitioning and multi-information fusion module, the structural and attribute information of users, items, and rating relationships are fully explored to enable the network to capture multi-faceted information and uncover and analyze relationships between review nodes. We design a multi-view neighborhood difference aggregation module that integrates neighborhood information with self-neighborhood difference information, enabling the network to simultaneously capture both the correlation and the differences between nodes, thereby significantly enhancing its sensitivity to potentially anomalous review nodes. Finally, a meta-learning framework is introduced to simulate the few-shot problem using multiple auxiliary networks, which helps the network practically maintain a high generalization ability in the critical issue of few-shot fake review detection scenarios. Experiments on real-world datasets show that Meta-MGDN significantly outperforms the state-of-the-art baselines in the field of graph-based fake review detection.