Yahong Lian
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yahong Lian has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Chunyao Song
College of Computer Science, TJ Key Lab of NDST, DISSec, TMCC, TBI Center, Nankai University, Tianjin, China
7 shared publications - Lin Zhang
School of Computer Science, TJ Key Lab of NDST, DISSec, TMCC, TBI Center, AAIS, Nankai University, Tianjin, China
2 shared publications - Qiong Huang2 shared publications
- Ruijia Ma
School of Computer Science, TJ Key Lab of NDST, DISSec, TMCC, TBI Center, AAIS, Nankai University, Tianjin, China
2 shared publications - Tingjian Ge
Department of Computer Science, University of Massachusetts Lowell, Lowell, MA, USA
2 shared publications - Haixia Wu
College of Computer Science, TJ Key Lab of NDST, DISSec, TMCC, TBI Center, Nankai University, Tianjin, China
1 shared publication
Latest Publications
- 22 December 2025
- Published by Elsevier in Neurocomputing
- Vol. 669
GD-GCN: Granular-diversified graph convolutional network for recommendation
- 22 December 2025
- Published by Elsevier in Neurocomputing
- Vol. 669
GD-GCN: Granular-diversified graph convolutional network for recommendation
- Open Access
- 19 May 2025
- Published by Springer Nature in Data Science and Engineering
- p. 1-20
An Exploratory Study on Information Cocoon in Recommender Systems
In recent years, while algorithm-driven recommendation applications have seen widespread use, their negative impacts have also increasingly raised concerns. To gain a more comprehensive understanding of the impact of different recommendation algorithms, we explored the phenomenon of information cocoons, where users are enveloped by homogenized recommended content, in different algorithm-driven recommender systems. We simulated long-term interactions between users and various algorithm-driven recommender systems, trying to recreate multi-stage recommendation scenarios under the influence of complex factors, and explored whether and to what extent users would fall into information cocoons while analyzing the underlying reasons from the perspective of algorithms. We conducted simulation experiments on two real-world recommendation datasets from different fields. The results show that information cocoons is prevalent across different algorithm-driven recommender systems, and the extent of its occurrence varies. Diversity-oriented recommendations can help alleviate information cocoons but are limited in effectiveness. The ability of diversity-aware re-ranking frameworks to alleviate information cocoons is influenced by the basic recommendation models. Not only considering the diversity of the current recommendation list but also the similarity between items and users’ historical consumption content, we proposed a simple and lightweight re-ranking framework called ICMF. Compared to other re-ranking methods, ICMF avoids an average of 12.48% of users encountering homogenized recommended content.
- 19 May 2025
- Published by Springer Nature in Data Science and Engineering
- p. 1-20
Open AccessAn Exploratory Study on Information Cocoon in Recommender Systems
In recent years, while algorithm-driven recommendation applications have seen widespread use, their negative impacts have also increasingly raised concerns. To gain a more comprehensive understanding of the impact of different recommendation algorithms, we explored the phenomenon of information cocoons, where users are enveloped by homogenized recommended content, in different algorithm-driven recommender systems. We simulated long-term interactions between users and various algorithm-driven recommender systems, trying to recreate multi-stage recommendation scenarios under the influence of complex factors, and explored whether and to what extent users would fall into information cocoons while analyzing the underlying reasons from the perspective of algorithms. We conducted simulation experiments on two real-world recommendation datasets from different fields. The results show that information cocoons is prevalent across different algorithm-driven recommender systems, and the extent of its occurrence varies. Diversity-oriented recommendations can help alleviate information cocoons but are limited in effectiveness. The ability of diversity-aware re-ranking frameworks to alleviate information cocoons is influenced by the basic recommendation models. Not only considering the diversity of the current recommendation list but also the similarity between items and users’ historical consumption content, we proposed a simple and lightweight re-ranking framework called ICMF. Compared to other re-ranking methods, ICMF avoids an average of 12.48% of users encountering homogenized recommended content.
- Open Access
- 22 April 2025
- Published by Association for Computing Machinery (ACM)
- p. 4171-4182
ITMPRec: Intention-based Targeted Multi-round Proactive Recommendation
- 22 April 2025
- Published by Association for Computing Machinery (ACM)
- p. 4171-4182
Open AccessITMPRec: Intention-based Targeted Multi-round Proactive Recommendation
- Open Access
- 11 April 2025
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 39 (12) , 12346-12354
Sub-Interest-Aware Representation Uniformity for Recommender System
In today’s information-rich era, users rely heavily on recommender systems to identify relevant content. Graph structures, renowned for their ability to model intricate user-content relationships, have become essential to these systems. However, the accuracy of recommendations hinges critically on the quality of node representations within these graphs. Personalized recommendations strive to enhance uniqueness by maximizing the dissimilarity between representations (known as uniformity) while simultaneously ensuring that the representations align closely with the content users engage with (dubbed as alignment). Nevertheless, balancing these conflicting objectives remains a challenge for optimal recommendation performance. To tackle these challenges, we propose an innovative approach called SIURec, which differs significantly from previous studies. Rather than relying on manual weight selection between uniformity and alignment and optimizing uniformity solely on the final representation, SIURec adopts an adaptive adjustment method that learns the optimal weight between uniformity and alignment automatically. By optimizing uniformity at every convolutional layer, SIURec captures users’ sub-interests more effectively, ultimately leading to improved recommendation accuracy. Experimental results on four datasets demonstrate that SIURec achieves superior learning of uniformity (with an average improvement of 4.26% in accuracy compared to eleven SOTA methods) and exhibits robustness across different hyperparameter settings.
- 11 April 2025
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 39 (12) , 12346-12354
Open AccessSub-Interest-Aware Representation Uniformity for Recommender System
In today’s information-rich era, users rely heavily on recommender systems to identify relevant content. Graph structures, renowned for their ability to model intricate user-content relationships, have become essential to these systems. However, the accuracy of recommendations hinges critically on the quality of node representations within these graphs. Personalized recommendations strive to enhance uniqueness by maximizing the dissimilarity between representations (known as uniformity) while simultaneously ensuring that the representations align closely with the content users engage with (dubbed as alignment). Nevertheless, balancing these conflicting objectives remains a challenge for optimal recommendation performance. To tackle these challenges, we propose an innovative approach called SIURec, which differs significantly from previous studies. Rather than relying on manual weight selection between uniformity and alignment and optimizing uniformity solely on the final representation, SIURec adopts an adaptive adjustment method that learns the optimal weight between uniformity and alignment automatically. By optimizing uniformity at every convolutional layer, SIURec captures users’ sub-interests more effectively, ultimately leading to improved recommendation accuracy. Experimental results on four datasets demonstrate that SIURec achieves superior learning of uniformity (with an average improvement of 4.26% in accuracy compared to eleven SOTA methods) and exhibits robustness across different hyperparameter settings.
- 7 March 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 276
SORCL: Social-Reachability-driven Contrastive Learning for friend recommendation
- 7 March 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 276
SORCL: Social-Reachability-driven Contrastive Learning for friend recommendation
- 4 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 37 (6) , 3810-3823
Valid Coverage Oriented Item Perspective Recommendation
Today, mainstream recommendation systems have achieved remarkable success in recommending items that align with user interests. However, limited attention has been paid to the perspective of item providers. Content providers often desire that all their offerings, including unpopular or cold items, are displayed and appreciated by users. To tackle the challenges of unfair exhibition and limited item acceptance coverage, we introduce a novel recommendation perspective that enables items to “select” their most relevant users. We further introduce ItemRec, a straightforward plug-and-play approach that leverages mutual scores calculated by any model. The goal is to maximize the recommendation and acceptance of items by users. Through extensive experiments on three real-world datasets, we demonstrate that ItemRec can enhance valid coverage by up to 38.5% while maintaining comparable or superior recommendation quality. This improvement comes with only a minor increase in model inference time, ranging from 1.5% to 5%. Furthermore, when compared to thirteen state-of-the-art recommendation methods across accuracy, fairness, and diversity, ItemRec exhibits significant advantages as well. Specifically, ItemRec achieves an optimal balance between precision and valid coverage, showcasing an efficiency gain ranging from 1.8 to 45 times compared to other fairness-oriented methodologies.
- 4 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 37 (6) , 3810-3823
Valid Coverage Oriented Item Perspective Recommendation
Today, mainstream recommendation systems have achieved remarkable success in recommending items that align with user interests. However, limited attention has been paid to the perspective of item providers. Content providers often desire that all their offerings, including unpopular or cold items, are displayed and appreciated by users. To tackle the challenges of unfair exhibition and limited item acceptance coverage, we introduce a novel recommendation perspective that enables items to “select” their most relevant users. We further introduce ItemRec, a straightforward plug-and-play approach that leverages mutual scores calculated by any model. The goal is to maximize the recommendation and acceptance of items by users. Through extensive experiments on three real-world datasets, we demonstrate that ItemRec can enhance valid coverage by up to 38.5% while maintaining comparable or superior recommendation quality. This improvement comes with only a minor increase in model inference time, ranging from 1.5% to 5%. Furthermore, when compared to thirteen state-of-the-art recommendation methods across accuracy, fairness, and diversity, ItemRec exhibits significant advantages as well. Specifically, ItemRec achieves an optimal balance between precision and valid coverage, showcasing an efficiency gain ranging from 1.8 to 45 times compared to other fairness-oriented methodologies.
- 6 October 2023
- Published by Elsevier in Expert Systems with Applications
- Vol. 238
Target-driven user preference transferring recommendation
- 6 October 2023
- Published by Elsevier in Expert Systems with Applications
- Vol. 238
Target-driven user preference transferring recommendation