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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Song Yang 0001

dblp:64/2155-1 · DBLP profile ↗
← Back
8ranked-venue papers
2as first author
6since 2021 · last 2025
0000-0002-1200-1129ORCID · conflict

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

Artificial intelligence and machine learning · 4 · 1 first-author · 4 since 2021Databases, data management, data science and information retrieval · 3 · 2 first-author · 3 since 2021Software engineering, systems software and programming languages · 2Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 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
2 papers
Graph learning · 70% Representation and self-supervised learning · 30%
Databases, data mining, and information retrieval
2 papers
Recommender systems · 90% Web and social media mining · 10%
Software engineering, system software, and programming languages
1 paper
Empirical software engineering · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Smart cities and intelligent transportation · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › contrastive learning
graph contrastive learning
0.712023
Contrastive Learning for Signed Bipartite Graphs · SIGIR 2023
Machine learning › Graph learning
graph neural network
0.712023
USER: Unsupervised Structural Entropy-Based Robust Graph Neural Network · AAAI 2023
Machine learning › Graph learning
graph representation learning
0.712023
Contrastive Learning for Signed Bipartite Graphs · SIGIR 2023
Machine learning › Graph learning › graph neural network
robust graph neural network
0.712023
USER: Unsupervised Structural Entropy-Based Robust Graph Neural Network · AAAI 2023
Recommender systems › point-of-interest recommendation
next POI recommendation
0.612022
GETNext: Trajectory Flow Map Enhanced Transformer for Next POI Recommendation · SIGIR 2022
Recommender systems
point-of-interest recommendation
0.612022
GETNext: Trajectory Flow Map Enhanced Transformer for Next POI Recommendation · SIGIR 2022
Recommender systems
sequential recommendation
0.612022
GETNext: Trajectory Flow Map Enhanced Transformer for Next POI Recommendation · SIGIR 2022
Smart cities and intelligent transportation
traffic prediction
0.512021
Space Meets Time: Local Spacetime Neural Network For Traffic Flow Forecasting · ICDM 2021
Empirical software engineering
evidence-based software engineering
0.312018
Synthesizing qualitative research in software engineering: a critical review · ICSE 2018
Empirical software engineering
systematic literature review
0.312018
Synthesizing qualitative research in software engineering: a critical review · ICSE 2018
Machine learning › Representation and self-supervised learning › representation learning
unsupervised representation learning
0.212023
USER: Unsupervised Structural Entropy-Based Robust Graph Neural Network · AAAI 2023
Web and social media mining
social network analysis
0.212023
Contrastive Learning for Signed Bipartite Graphs · SIGIR 2023

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

stochastic perturbation · 1.3graph augmentation · 1.3contrastive learning · 1.3structural entropy · 0.7transformer · 0.6trajectory flow map · 0.6graph neural network · 0.6spacetime convolution · 0.5neural network · 0.5attention mechanism · 0.5systematic literature review · 0.3survey · 0.3
YearPublicationVenuePosition
2025 Data Pricing for Graph Neural Networks without Pre-purchased Inspection
Mengxiao Zhang 0002, Jiamou Liu, Song Yang 0001
AAMAS4
2024 Optimizing Resource Distribution Towards Energy Justice in Resilient Smart Grids
Libo Zhang 0006, Yuly Wu, Song Yang 0001, Yang Chen 0028, Kaiqi Zhao 0001, Jiamou Liu
PKAW4
2023 USER: Unsupervised Structural Entropy-Based Robust Graph Neural Network
abstract
Unsupervised/self-supervised graph neural networks (GNN) are susceptible to the inherent randomness in the input graph data, which adversely affects the model's performance in downstream tasks. In this paper, we propose USER, an unsupervised and robust version of GNN based on structural entropy, to alleviate the interference of graph perturbations and learn appropriate representations of nodes without label information. To mitigate the effects of undesirable perturbations, we analyze the property of intrinsic connectivity and define the intrinsic connectivity graph. We also identify the rank of the adjacency matrix as a crucial factor in revealing a graph that provides the same embeddings as the intrinsic connectivity graph. To capture such a graph, we introduce structural entropy in the objective function. Extensive experiments conducted on clustering and link prediction tasks under random-perturbation and meta-attack over three datasets show that USER outperforms benchmarks and is robust to heavier perturbations.
Yifei Wang 0003, Yupan Wang, Zeyu Zhang 0004, Song Yang 0001, Kaiqi Zhao 0001, Jiamou Liu
AAAI4
2023 Contrastive Learning for Signed Bipartite Graphs
abstract
This paper is the first to use contrastive learning to improve the robustness of graph representation learning for signed bipartite graphs, which are commonly found in social networks, recommender systems, and paper review platforms. Existing contrastive learning methods for signed graphs cannot capture implicit relations between nodes of the same type in signed bipartite graphs, which have two types of nodes and edges only connect nodes of different types. We propose a Signed Bipartite Graph Contrastive Learning (SBGCL) method to learn robust node representation while retaining the implicit relations between nodes of the same type. SBGCL augments a signed bipartite graph with a novel two-level graph augmentation method. At the top level, we maintain two perspectives of the signed bipartite graph, one presents the original interactions between nodes of different types, and the other presents the implicit relations between nodes of the same type. At the bottom level, we employ stochastic perturbation strategies to create two perturbed graphs in each perspective. Then, we construct positive and negative samples from the perturbed graphs and design a multi-perspective contrastive loss to unify the node presentations learned from the two perspectives. Results show proposed model is effective over state-of-the-art methods on real-world datasets.
Zeyu Zhang 0004, Jiamou Liu, Kaiqi Zhao 0001, Song Yang 0001, Xianda Zheng, Yifei Wang 0003
SIGIR4
2022 GETNext: Trajectory Flow Map Enhanced Transformer for Next POI Recommendation
abstract
Next POI recommendation intends to forecast users' immediate future movements given their current status and historical information, yielding great values for both users and service providers. However, this problem is perceptibly complex because various data trends need to be considered together. This includes the spatial locations, temporal contexts, user's preferences, etc. Most existing studies view the next POI recommendation as a sequence prediction problem while omitting the collaborative signals from other users. Instead, we propose a user-agnostic global trajectory flow map and a novel Graph Enhanced Transformer model (GETNext) to better exploit the extensive collaborative signals for a more accurate next POI prediction, and alleviate the cold start problem in the meantime. GETNext incorporates the global transition patterns, user's general preference, spatio-temporal context, and time-aware category embeddings together into a transformer model to make the prediction of user's future moves. With this design, our model outperforms the state-of-the-art methods with a large margin and also sheds light on the cold start challenges within the spatio-temporal involved recommendation problems.
Song Yang 0001, Jiamou Liu, Kaiqi Zhao 0001
SIGIR1
2021 Space Meets Time: Local Spacetime Neural Network For Traffic Flow Forecasting
abstract
Traffic flow forecasting is a crucial task in urban computing. The challenge arises as traffic flows often exhibit intrinsic and latent spatio-temporal correlations that cannot be identified by extracting the spatial and temporal patterns of traffic data separately. We argue that such correlations are universal and play a pivotal role in traffic flow. We put forward spacetime interval learning as a paradigm to explicitly capture these correlations through a unified analysis of both spatial and temporal features. Unlike the state-of-the-art methods, which are restricted to a particular road network, we model the universal spatio-temporal correlations that are transferable from cities to cities. To this end, we propose a new spacetime interval learning framework that constructs a local-spacetime context of a traffic sensor comprising the data from its neighbors within close time points. Based on this idea, we introduce local spacetime neural network (STNN), which employs novel spacetime convolution and attention mechanism to learn the universal spatio-temporal correlations. The proposed STNN captures local traffic patterns, which does not depend on a specific network structure. As a result, a trained STNN model can be applied on any unseen traffic networks. We evaluate the proposed STNN on two public real-world traffic datasets and a simulated dataset on dynamic networks. The experiment results show that STNN not only improves prediction accuracy by 15% over state-of-the-art methods, but is also effective in handling the case when the traffic network undergoes dynamic changes as well as the superior generalization capability.
Song Yang 0001, Jiamou Liu, Kaiqi Zhao 0001
ICDM1
2018 Synthesizing qualitative research in software engineering: a critical review
abstract
Synthesizing data extracted from primary studies is an integral component of the methodologies in support of Evidence Based Software Engineering (EBSE) such as System Literature Review (SLR). Since a large and increasing number of studies in Software Engineering (SE) incorporate qualitative data, it is important to systematically review and understand different aspects of the Qualitative Research Synthesis (QRS) being used in SE. We have reviewed the use of QRS methods in 328 SLRs published between 2005 and 2015. We also inquired the authors of 274 SLRs to confirm whether or not any QRS methods were used in their respective reviews. 116 of them provided the responses, which were included in our analysis. We found eight QRS methods applied in SE research, two of which, narrative synthesis and thematic synthesis, have been predominantly adopted by SE researchers for synthesizing qualitative data. Our study determines that a significant amount of missing knowledge and incomplete understanding of the defined QRS methods in the community. Our effort also identifies an initial set factors that may influence the selection and use of appropriate QRS methods in SE.
Xin Huang 0019, He Zhang 0001, Xin Zhou 0016, Muhammad Ali Babar 0001, Song Yang 0001
ICSE5
2015 Quality assessment of systematic reviews in software engineering: a tertiary study
abstract
Context: The quality of an Systematic Literature Review (SLR) is as good as the quality of the reviewed papers. Hence, it is vital to rigorously assess the papers included in an SLR. There has been no tertiary study aimed at reporting the state of the practice of quality assessment used in SLRs in Software Engineering (SE).
He Zhang 0001, Xin Huang 0019, Song Yang 0001, Muhammad Ali Babar 0001
EASE4