Zifang Tang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Zifang Tang has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Tong Li
Beijing University of Technology, Beijing, China
7 shared publications - Zhen Yang
Beijing University of Technology
7 shared publications - Junrui Liu
Beijing University of Technology, Beijing, Beijing, China
4 shared publications - Di Wu
Beijing University of Technology
3 shared publications - Fahad Sabah
College of Computer Science, Beijing University of Technology, Beijing, China
1 shared publication - Farooq Ahmad
College of Electronic Information and Control Engineering, Beijing University of Technology, Beijing, China
1 shared publication
Latest Publications
- 25 June 2026
- Published by Springer Nature
- p. 269-281
ExpaRank: A Multi-dimensional Contribution-Aware Method for Passage Re-ranking
- 25 June 2026
- Published by Springer Nature
- p. 269-281
ExpaRank: A Multi-dimensional Contribution-Aware Method for Passage Re-ranking
- 9 June 2026
- Published by Springer Nature
- p. 573-585
A Path Value-Aware Reinforcement Learning Method for Knowledge Graph Question Answering
- 9 June 2026
- Published by Springer Nature
- p. 573-585
A Path Value-Aware Reinforcement Learning Method for Knowledge Graph Question Answering
- 30 January 2026
- Published by Springer Nature
- p. 496-511
Prior Knowledge Augmentation for Reinforcement Learning-Based Knowledge Graph Reasoning
- 30 January 2026
- Published by Springer Nature
- p. 496-511
Prior Knowledge Augmentation for Reinforcement Learning-Based Knowledge Graph Reasoning
- Open Access
- 22 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 12-20
A Multi-Factor Collaborative Prediction for Review-based Recommendation
- 22 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 12-20
Open AccessA Multi-Factor Collaborative Prediction for Review-based Recommendation
- Open Access
- 10 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 503-511
An Aspect Performance-aware Hypergraph Neural Network for Review-based Recommendation
Online reviews allow consumers to provide detailed feedback on various aspects of items. Existing methods utilize these aspects to model users' fine-grained preferences for specific item features through graph neural networks. We argue that the performance of items on different aspects is important for making precise recommendations, which has not been taken into account by existing approaches, due to lack of data. In this paper, we propose an aspect performance-aware hypergraph neural network (APH) for the review-based recommendation, which learns the performance of items from the conflicting sentiment polarity of user reviews. Specifically, APH comprehensively models the relationships among users, items, aspects, and sentiment polarity by systematically constructing an aspect hypergraph based on user reviews. In addition, APH aggregates aspects representing users and items by employing an aspect performance-aware hypergraph aggregation method. It aggregates the sentiment polarities from multiple users by jointly considering user preferences and the semantics of their sentiments, determining the weights of sentiment polarities to infer the performance of items on various aspects. Such performances are then used as weights to aggregate neighboring aspects. Experiments on six real-world datasets demonstrate that APH improves MSE, Precision@5, and Recall@5 by an average of 2.30%, 4.89%, and 1.60% over the best baseline. The source code and data are available at https://github.com/dianziliu/APH.
- 10 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 503-511
Open AccessAn Aspect Performance-aware Hypergraph Neural Network for Review-based Recommendation
Online reviews allow consumers to provide detailed feedback on various aspects of items. Existing methods utilize these aspects to model users' fine-grained preferences for specific item features through graph neural networks. We argue that the performance of items on different aspects is important for making precise recommendations, which has not been taken into account by existing approaches, due to lack of data. In this paper, we propose an aspect performance-aware hypergraph neural network (APH) for the review-based recommendation, which learns the performance of items from the conflicting sentiment polarity of user reviews. Specifically, APH comprehensively models the relationships among users, items, aspects, and sentiment polarity by systematically constructing an aspect hypergraph based on user reviews. In addition, APH aggregates aspects representing users and items by employing an aspect performance-aware hypergraph aggregation method. It aggregates the sentiment polarities from multiple users by jointly considering user preferences and the semantics of their sentiments, determining the weights of sentiment polarities to infer the performance of items on various aspects. Such performances are then used as weights to aggregate neighboring aspects. Experiments on six real-world datasets demonstrate that APH improves MSE, Precision@5, and Recall@5 by an average of 2.30%, 4.89%, and 1.60% over the best baseline. The source code and data are available at https://github.com/dianziliu/APH.
- Open Access
- 26 December 2024
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 81 (1) , 1-35
Deep deterministic policy gradients with a self-adaptive reward mechanism for image retrieval
Traditional image retrieval methods often face challenges in adapting to varying user preferences and dynamic datasets. To address these limitations, this research introduces a novel image retrieval framework utilizing deep deterministic policy gradients (DDPG) augmented with a self-adaptive reward mechanism (SARM). The DDPG-SARM framework dynamically adjusts rewards based on user feedback and retrieval context, enhancing the learning efficiency and retrieval accuracy of the agent. Key innovations include dynamic reward adjustment based on user feedback, context-aware reward structuring that considers the specific characteristics of each retrieval task, and an adaptive learning rate strategy to ensure robust and efficient model convergence. Extensive experimentation with the three distinct datasets demonstrates that the proposed framework significantly outperforms traditional methods, achieving the highest retrieval accuracy having 3.38%, 5.26%, and 0.21% improvement overall as compared to the mainstream models over DermaMNIST, PneumoniaMNIST, and OrganMNIST datasets, respectively. The findings contribute to the advancement of reinforcement learning applications in image retrieval, providing a user-centric solution adaptable to various dynamic environments. The proposed method also offers a promising direction for future developments in intelligent image retrieval systems.
- 26 December 2024
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 81 (1) , 1-35
Open AccessDeep deterministic policy gradients with a self-adaptive reward mechanism for image retrieval
Traditional image retrieval methods often face challenges in adapting to varying user preferences and dynamic datasets. To address these limitations, this research introduces a novel image retrieval framework utilizing deep deterministic policy gradients (DDPG) augmented with a self-adaptive reward mechanism (SARM). The DDPG-SARM framework dynamically adjusts rewards based on user feedback and retrieval context, enhancing the learning efficiency and retrieval accuracy of the agent. Key innovations include dynamic reward adjustment based on user feedback, context-aware reward structuring that considers the specific characteristics of each retrieval task, and an adaptive learning rate strategy to ensure robust and efficient model convergence. Extensive experimentation with the three distinct datasets demonstrates that the proposed framework significantly outperforms traditional methods, achieving the highest retrieval accuracy having 3.38%, 5.26%, and 0.21% improvement overall as compared to the mainstream models over DermaMNIST, PneumoniaMNIST, and OrganMNIST datasets, respectively. The findings contribute to the advancement of reinforcement learning applications in image retrieval, providing a user-centric solution adaptable to various dynamic environments. The proposed method also offers a promising direction for future developments in intelligent image retrieval systems.
- 19 March 2024
- Published by World Scientific Pub Co Pte Ltd in International Journal of Software Engineering and Knowledge Engineering
- Vol. 34 (05) , 821-843
A Novel Entity and Relation Joint Interaction Learning Approach for Entity Alignment
Entity alignment (EA) aims to find equivalent entities in knowledge graphs (KGs) from multiple data sources and is a crucial step in integrating KGs. Recent studies learn the similarity of entity embeddings by aggregating neighboring entities. However, these methods solely compare neighboring entities and do not incorporate the connected relation between an entity and its neighbors. In this paper, we propose a novel Entity and Relation joint Interaction Learning (ERIL) approach, which effectively captures the interaction between entities and relations, enhancing the precision of alignment across different KGs. Specifically, the ERIL model jointly learns the neighborhood features of entities and the spatial structure of relations to train a shared permutation matrix, capturing comprehensive associative relations within KGs. Moreover, a semi-supervised iterative framework is designed to leverage the positive interactions between entities and relations to identify more aligned entities. Extensive experiments are conducted on five benchmark datasets to demonstrate the effectiveness of ERIL compared with existing state-of-the-art EA methods. On DBP15K, our model ERIL outperforms currently available EA methods by 1.9% on Hits@10.
- 19 March 2024
- Published by World Scientific Pub Co Pte Ltd in International Journal of Software Engineering and Knowledge Engineering
- Vol. 34 (05) , 821-843
A Novel Entity and Relation Joint Interaction Learning Approach for Entity Alignment
Entity alignment (EA) aims to find equivalent entities in knowledge graphs (KGs) from multiple data sources and is a crucial step in integrating KGs. Recent studies learn the similarity of entity embeddings by aggregating neighboring entities. However, these methods solely compare neighboring entities and do not incorporate the connected relation between an entity and its neighbors. In this paper, we propose a novel Entity and Relation joint Interaction Learning (ERIL) approach, which effectively captures the interaction between entities and relations, enhancing the precision of alignment across different KGs. Specifically, the ERIL model jointly learns the neighborhood features of entities and the spatial structure of relations to train a shared permutation matrix, capturing comprehensive associative relations within KGs. Moreover, a semi-supervised iterative framework is designed to leverage the positive interactions between entities and relations to identify more aligned entities. Extensive experiments are conducted on five benchmark datasets to demonstrate the effectiveness of ERIL compared with existing state-of-the-art EA methods. On DBP15K, our model ERIL outperforms currently available EA methods by 1.9% on Hits@10.
- Open Access
- 29 September 2023
- Published by Elsevier in Expert Systems with Applications
- Vol. 238
A Systematic Literature Review of Reinforcement Learning-based Knowledge Graph Research
- 29 September 2023
- Published by Elsevier in Expert Systems with Applications
- Vol. 238
Open AccessA Systematic Literature Review of Reinforcement Learning-based Knowledge Graph Research