Tingjian Ge
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Tingjian Ge has a total of 13 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
6 shared publications - Rongbo Qi
School of Computer Science, TJ Key Lab of NDST, DISSec, TMCC, TBI Center, AAIS, Nankai University, Tianjin, China
3 shared publications - Qu Liu
University of Massachusetts, Lowell, Lowell, Massachusetts, USA
2 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 - Yahong Lian
College of Computer Science, TJ Key Lab of NDST, DISSec, TMCC, TBI Center, Nankai University, Tianjin, China
2 shared publications - Emil Zulawnik
University of Massachusetts, Lowell, Lowell, Massachusetts, USA
1 shared publication
Latest Publications
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (7) , 4449-4463
Intra-Group Individual Item Fairness-Aware Recommendation
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (7) , 4449-4463
Intra-Group Individual Item Fairness-Aware Recommendation
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 6276-6287
MCRec: Few-Shot Multimodal Cover Recommendation via User Interest Profiles
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 6276-6287
Open AccessMCRec: Few-Shot Multimodal Cover Recommendation via User Interest Profiles
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 6264-6275
Temporal-Series-Aware Adaptive Positional Encoding for Transformer-based Sequential Recommendation
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 6264-6275
Open AccessTemporal-Series-Aware Adaptive Positional Encoding for Transformer-based Sequential Recommendation
- Open Access
- 20 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 824-835
SCode: A Spherical Code Metric Learning Approach to Continuously Monitoring Predictive Events in Networked Data
- 20 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 824-835
Open AccessSCode: A Spherical Code Metric Learning Approach to Continuously Monitoring Predictive Events in Networked Data
- 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
- 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.
- Open Access
- 4 August 2023
- Published by Association for Computing Machinery (ACM)
- p. 1512-1523
Fairness-Aware Continuous Predictions of Multiple Analytics Targets in Dynamic Networks
- 4 August 2023
- Published by Association for Computing Machinery (ACM)
- p. 1512-1523
Open AccessFairness-Aware Continuous Predictions of Multiple Analytics Targets in Dynamic Networks
- 1 February 2019
- Published by Elsevier in Information Sciences
- Vol. 475, 100-120
Top-k frequent items and item frequency tracking over sliding windows of any size
- 1 February 2019
- Published by Elsevier in Information Sciences
- Vol. 475, 100-120
Top-k frequent items and item frequency tracking over sliding windows of any size
- Open Access
- 1 November 2016
- Published by Association for Computing Machinery (ACM) in Proceedings of the VLDB Endowment
- Vol. 10 (4) , 397-408
History is a mirror to the future
Complex event processing (CEP) has proven to be a highly relevant topic in practice. As it is sensitive to both errors in the stream and uncertainty in the pattern, approximate complex event processing (ACEP) is an important direction but has not been adequately studied before. ACEP is costly, and is often performed under insufficient computing resources. We propose an algorithm that learns from the past behavior of ACEP runs, and makes decisions on what to process first in an online manner, so as to maximize the number of full matches found. In addition, we devise effective optimization techniques. Finally, we propose a mechanism that uses reinforcement learning to dynamically update the history structure without incurring much overhead. Put together, these techniques drastically improve the fraction of full matches found in resource constrained environments.
- 1 November 2016
- Published by Association for Computing Machinery (ACM) in Proceedings of the VLDB Endowment
- Vol. 10 (4) , 397-408
Open AccessHistory is a mirror to the future
Complex event processing (CEP) has proven to be a highly relevant topic in practice. As it is sensitive to both errors in the stream and uncertainty in the pattern, approximate complex event processing (ACEP) is an important direction but has not been adequately studied before. ACEP is costly, and is often performed under insufficient computing resources. We propose an algorithm that learns from the past behavior of ACEP runs, and makes decisions on what to process first in an online manner, so as to maximize the number of full matches found. In addition, we devise effective optimization techniques. Finally, we propose a mechanism that uses reinforcement learning to dynamically update the history structure without incurring much overhead. Put together, these techniques drastically improve the fraction of full matches found in resource constrained environments.