Zheng Wang

Zheng Wang

Auto-generated profile, based on publicly available information

Zheng Wang

Shanghai Jiao Tong University, Shanghai, Shanghai, China

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 October 2018 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
CWChaokun Wang
Chaokun Wang
CWChangping Wang
Changping Wang
ZWZheng Wang
Zheng Wang
XYXiaojun Ye
Xiaojun Ye
JYJeffrey Xu Yu
Jeffrey Xu Yu
BWBin Wang
Bin Wang
There exists a lot of research work on social ties, few of which is about the directionality of social ties. However, the directionality is actually a basic but important attribute of social ties. In this paper, we present a supervised learning problem, the tie direction learning (TDL) problem, which aims to learn the directionality function of directed social networks. Two ways are introduced to solve the TDL problem: one is based on handcrafted features and the other, named DeepDirect, learns the social tie representation through the topological information of the network. In DeepDirect, a novel network embedding approach, which directly maps the social ties to low-dimensional embedding vectors through deep learning techniques, is proposed. DeepDirect embeds the network considering three different aspects: preserving network topology, utilizing labeled data, and generating pseudo-labels based on observed directionality patterns. Two novel applications are proposed for the learned directionality function, i.e., direction discovery on undirected ties and direction quantification on bidirectional ties. Experiments are conducted on five different real-world data sets about these two tasks. The experimental results demonstrate our methods, especially DeepDirect, are effective and promising.

7 October 2024 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
ZWZheng Wang
Zheng Wang
HDHongming Ding
Hongming Ding
LPLi Pan
Li Pan
Jianhua LiJianhua Li
Jianhua Li
ZGZhiguo Gong
Zhiguo Gong
PYPhilip S. Yu
Philip S. Yu
Graph-based semi-supervised learning (GSSL) has long been a research focus. Traditional methods are generally shallow learners, based on the cluster assumption. Recently, graph convolutional networks (GCNs) have become the predominant techniques for their promising performance. However, a critical question remains largely unanswered: why do deep GCNs encounter the oversmoothing problem, while traditional shallow GSSL methods do not, despite both progressing through the graph in a similar iterative manner? In this article, we theoretically discuss the relationship between these two types of methods in a unified optimization framework. One of the most intriguing findings is that, unlike traditional ones, typical GCNs may not effectively incorporate both graph structure and label information at each layer. Motivated by this, we propose three simple but powerful graph convolution methods. The first, optimized simple graph convolution (), is a supervised method, which guides the graph convolution process with labels. The others are two “no-learning” unsupervised methods: graph structure preserving graph convolution () and its multiscale version GGCM, both aiming to preserve the graph structure information during the convolution process. Finally, we conduct extensive experiments to show the effectiveness of our methods.

1 January 2010 in Studies in Regional Science
Verified
Journal Article
Open access
ZWZheng Wang
Zheng Wang
Tao LiuTao Liu
Tao Liu
XDXiaoye Dai
Xiaoye Dai

11 February 2026 in arXiv
Verified
Preprint
Open access
PDF file
FPFeiyu Pan
Feiyu Pan
TZTianbin Zhang
Tianbin Zhang
AZAoqian Zhang
Aoqian Zhang
YSYu Sun
Yu Sun
ZWZheng Wang
Zheng Wang
Jianhua LiJianhua Li
Jianhua Li
Modern data lakes have emerged as foundational platforms for large-scale machine learning, enabling flexible storage of heterogeneous data and structured analytics through table-oriented abstractions. Despite their growing importance, standardized benchmarks for evaluating machine learning performance in data lake environments remain scarce. To address this gap, we present LakeMLB (Data Lake Machine Learning Benchmark), designed for the most common multi-source, multi-table scenarios in data lakes. LakeMLB focuses on two representative multi-table scenarios, Union and Join, and provides three real-world datasets for each scenario, covering government open data, finance, Wikipedia, and online marketplaces. The benchmark supports three representative integration strategies: pre-training-based, data augmentation-based, and feature augmentation-based approaches. We conduct extensive experiments with state-of-the-art tabular learning methods, offering insights into their performance under complex data lake scenarios. We release both datasets and code to facilitate rigorous research on machine learning in data lake ecosystems; the benchmark is available at https://github.com/zhengwang100/LakeMLB.

12 November 2024
Verified
Book Chapter
Closed access
PDF file
ZLZhichao Luo
Zhichao Luo
SZSiyuan Zhao
Siyuan Zhao
EZEnze Zhang
Enze Zhang
ZWZheng Wang
Zheng Wang

10 November 2026 in Preprints.org
Verified
Preprint
Open access
PDF file
FCFeiyang Chen
Feiyang Chen
JYJunqing Yang
Junqing Yang
WZWentao Zhang
Wentao Zhang
ZWZheng Wang
Zheng Wang
LPLi Pan
Li Pan
Jianhua LiJianhua Li
Jianhua Li
Large-scale LLM agent serving suffers from resource fragmentation due to task-level resource allocation. We present Wenbo, a scalable agent reasoning system based on dynamic DAG scheduling. Wenbo consists of three components: a Director that incrementally constructs execution DAGs, a Scheduler that globally dispatches ready nodes based on resource requirements, and heterogeneous Workers that execute nodes on GPUs and CPUs. Our theoretical analysis shows that the potential speedup depends on the balance between resource availability and workload demands. For example, with one GPU and 1,024× CPUs, the potential speedup can be 1,024 for CPU-heavy workloads with suitable DAG structures. In addition, we introduce ARGB, an agent reasoning graph benchmark comprising real-world workloads and configurable synthetic workloads. Experiments show that Wenbo achieves 1.4–3.8× higher throughput than Flash-Searcher on real-world workloads, with even much larger gains on synthetic workloads. Our code is available at https://github.com/wenbo-project/wenbo.