Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Gengyu Lin

dblp:350/4141 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2025
0009-0000-5401-9952ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 since 2021Computer networks · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
3 papers
Graph learning · 46% Time series and sequential data · 20% Trustworthy machine learning · 18%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Smart cities and intelligent transportation · 100%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
fairness
0.912025
FairSTG: Countering Performance Heterogeneity via Collaborative Sample-Level Optimization · IEEE Trans. Mob. Comput. 2025
Machine learning › Graph learning
spatio-temporal graph learning
0.912025
FairSTG: Countering Performance Heterogeneity via Collaborative Sample-Level Optimization · IEEE Trans. Mob. Comput. 2025
Machine learning › Time series and sequential data
large language model for time series
0.812024
LeRet: Language-Empowered Retentive Network for Time Series Forecasting · IJCAI 2024
Machine learning › Deep learning architectures and training › sequence modeling
retentive network
0.812024
LeRet: Language-Empowered Retentive Network for Time Series Forecasting · IJCAI 2024
Machine learning › Graph learning
dynamic graph learning
0.712023
GReTo: Remedying dynamic graph topology-task discordance via target homophily · ICLR 2023
Machine learning › Graph learning
graph neural network
0.712023
GReTo: Remedying dynamic graph topology-task discordance via target homophily · ICLR 2023
Smart cities and intelligent transportation
urban computing
0.312025
FairSTG: Countering Performance Heterogeneity via Collaborative Sample-Level Optimization · IEEE Trans. Mob. Comput. 2025
Machine learning › Time series and sequential data › time series analysis
time series forecasting
0.212024
LeRet: Language-Empowered Retentive Network for Time Series Forecasting · IJCAI 2024

Methods — techniques the papers use, named apart from their topics

mixup · 1.7collaborative representation enhancement · 1.7retentive network · 0.8language model · 0.8homophily · 0.7graph neural network · 0.7
YearPublicationVenuePosition
2025 FairSTG: Countering Performance Heterogeneity via Collaborative Sample-Level Optimization
abstract
Spatiotemporal learning plays a crucial role in mobile computing techniques to empower smart cites. While existing research has made great efforts to achieve accurate predictions on the overall dataset, they still neglect the significant performance heterogeneity across samples. In this work, we designate the performance heterogeneity as the reason for unfair spatiotemporal learning, which not only degrades the practical functions of models, but also brings serious potential risks to real-world urban applications. To fix this gap, we propose a model-independent Fairness-aware framework for SpatioTemporal Graph learning (FairSTG), which inherits the idea of exploiting advantages of well-learned samples to challenging ones with collaborative mix-up. Specifically, FairSTG consists of a spatiotemporal feature extractor for model initialization, a collaborative representation enhancement for knowledge transfer between well-learned samples and challenging ones, and fairness objectives for immediately suppressing sample-level performance heterogeneity. Experiments on four spatiotemporal datasets demonstrate that our FairSTG significantly improves the fairness quality while maintaining comparable forecasting accuracy. Case studies show FairSTG can counter both spatial and temporal performance heterogeneity by our sample-level retrieval and compensation, and our work can potentially alleviate the risks on spatiotemporal resource allocation for underrepresented urban regions.
Gengyu Lin, Zhengyang Zhou, Qihe Huang, Kuo Yang 0002, Shifen Cheng, Yang Wang 0015
IEEE Trans. Mob. Comput.1
2024 LeRet: Language-Empowered Retentive Network for Time Series Forecasting
Qihe Huang, Zhengyang Zhou, Kuo Yang 0002, Gengyu Lin, Zhongchao Yi, Yang Wang 0015
IJCAI4
2023 GReTo: Remedying dynamic graph topology-task discordance via target homophily
Zhengyang Zhou, Qihe Huang, Gengyu Lin, Kuo Yang 0002, Lei Bai 0001, Yang Wang 0015
ICLR3