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.

Zhipeng Tian

dblp:338/7009 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2026
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 since 2021Systems, architecture and hardware · 1 · 1 since 2021Applied, interdisciplinary, general and emerging 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.

Databases, data mining, and information retrieval
1 paper
Graph data management · 100%

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

TopicWeightPapersLastEvidence papers
Graph data management
graph processing
0.712023
SOWalker: An I/O-Optimized Out-of-Core Graph Processing System for Second-Order Random Walks · USENIX ATC 2023
Graph data management › graph processing
out-of-core graph processing
0.712023
SOWalker: An I/O-Optimized Out-of-Core Graph Processing System for Second-Order Random Walks · USENIX ATC 2023
Graph data management › graph algorithms
random walk
0.212023
SOWalker: An I/O-Optimized Out-of-Core Graph Processing System for Second-Order Random Walks · USENIX ATC 2023
YearPublicationVenuePosition
2026 A survey of social network alignment methods based on graph representation learning
abstract
Abstract Social network alignment (SNA) aims to match corresponding users across different platforms, playing a critical role in cross-platform behavior analysis, personalized recommendations, security, and privacy protection. Traditional methods based on attribute and structural features face significant challenges due to the sparsity, heterogeneity, and dynamic nature of social networks, resulting in limited accuracy and efficiency. Recent advances in graph representation learning (GRL) provide promising solutions to these issues by leveraging deep learning to extract network features, effectively addressing sparsity, integrating heterogeneous data, and adapting to network dynamics. This paper presents a comprehensive survey of SNA methods based on GRL. We first introduce key definitions and outline a framework for SNA using GRL. Next, we systematically review state-of-the-art advancements in both static and dynamic networks, considering homogeneous and heterogeneous settings, including emerging approaches integrating large language models (LLMs). We further conduct an in-depth comparative analysis, highlighting the effectiveness of different GRL-based methods, with a particular emphasis on LLM-enhanced techniques. Finally, we discuss open challenges and outline potential future research directions in this rapidly evolving field.
Yutong Wu 0013, Feiyang Li, Zhan Shi 0001, Zhipeng Tian, Wang Zhang 0002, Peng Fang 0002, Renzhi Xiao, Fang Wang 0001, Dan Feng 0001
Frontiers Comput. Sci.4
2023 SOWalker: An I/O-Optimized Out-of-Core Graph Processing System for Second-Order Random Walks
Yutong Wu 0013, Zhan Shi 0001, Shicai Huang, Zhipeng Tian, Pengwei Zuo, Peng Fang 0002, Dan Feng 0001
USENIX ATC4
2023 A stable data-augmented reinforcement learning method with ensemble exploration and exploitation
Guoyu Zuo, Zhipeng Tian, Gao Huang 0002
Appl. Intell.2