Demo Data from SIGIR 2026 / reviewers in the wild / expert
Jun Zhang 0087
dblp:29/4190-87
· DBLP profile ↗
5ranked-venue papers
2as first author
5since 2021 · last 2025
0000-0003-1232-3475ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 4 · 2 first-author · 4 since 2021Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Computer networks · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 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
2 papers |
Recommender systems · 74% Web and social media mining · 26% | |
| Artificial intelligence
3 papers |
Graph learning · 46% Generative modeling · 30% Language models and text generation · 24% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Smart cities and intelligent transportation · 100% | |
| Computer networks
1 paper |
Edge and fog computing · 77% Network management and operations · 23% |
Topics — the 9 heaviest of 11, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Recommender systems
social recommendation |
1.1 | 2 | 2022 | Social Recommendation With Characterized Regularization · IEEE Trans. Knowl. Data Eng. 2022 Group-Buying Recommendation for Social E-Commerce · ICDE 2021 |
Smart cities and intelligent transportation
urban computing |
0.9 | 1 | 2025 | CityBench: Evaluating the Capabilities of Large Language Models for Urban Tasks · KDD (2) 2025 |
Edge and fog computing
digital twin |
0.7 | 1 | 2023 | Demo: Scalable Digital Twin System for Mobile Networks with Generative AI · MobiSys 2023 |
Web and social media mining
social influence analysis |
0.6 | 1 | 2022 | Social Recommendation With Characterized Regularization · IEEE Trans. Knowl. Data Eng. 2022 |
Recommender systems
social regularization |
0.6 | 1 | 2022 | Social Recommendation With Characterized Regularization · IEEE Trans. Knowl. Data Eng. 2022 |
Machine learning › Graph learning › graph neural network
graph convolutional network |
0.5 | 1 | 2021 | Group-Buying Recommendation for Social E-Commerce · ICDE 2021 |
Machine learning › Graph learning
graph neural network |
0.5 | 1 | 2021 | Group-Buying Recommendation for Social E-Commerce · ICDE 2021 |
Natural language and speech › Language models and text generation › large language model evaluation
capability evaluation |
0.3 | 1 | 2025 | CityBench: Evaluating the Capabilities of Large Language Models for Urban Tasks · KDD (2) 2025 |
Natural language and speech › Language models and text generation
large language model |
0.3 | 1 | 2025 | CityBench: Evaluating the Capabilities of Large Language Models for Urban Tasks · KDD (2) 2025 |
Methods — techniques the papers use, named apart from their topics
vision-language model · 1.7interactive simulator · 1.7optimizer interaction · 1.3generative AI · 1.3digital twin · 1.3pairwise loss · 1.0multi-view embedding propagation · 1.0graph convolutional network · 1.0regularization · 0.6matrix factorization · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | CityBench: Evaluating the Capabilities of Large Language Models for Urban TasksabstractAs large language models (LLMs) continue to advance and gain widespread use, establishing systematic and reliable evaluation methodologies for LLMs and vision-language models (VLMs) has become essential to ensure their real-world effectiveness and reliability. There have been some early explorations about the usability of LLMs for limited urban tasks, but a systematic and scalable evaluation benchmark is still lacking. The challenge in constructing a systematic evaluation benchmark for urban research lies in the diversity of urban data, the complexity of application scenarios and the highly dynamic nature of the urban environment. In this paper, we design CityBench, an interactive simulator based evaluation platform, as the first systematic benchmark for evaluating the capabilities of LLMs for diverse tasks in urban research. First, we build CityData to integrate the diverse urban data and CitySimu to simulate fine-grained urban dynamics. Based on CityData and CitySimu, we design 8 representative urban tasks in 2 categories of perception-understanding and decision-making as the CityBench. With extensive results from 30 well-known LLMs and VLMs in 13 cities around the world, we find that advanced LLMs and VLMs can achieve competitive performance in diverse urban tasks requiring commonsense and semantic understanding abilities, e.g., understanding the human dynamics and semantic inference of urban images. Meanwhile, they fail to solve the challenging urban tasks requiring professional knowledge and high-level numerical abilities, e.g., geospatial prediction and traffic control task. These findings provide critical insights for the effective utilization and further development of LLMs to advance urban-related tasks and research in the future. Jie Feng 0002, Jun Zhang 0087, Tianhui Liu, Xin Zhang 0106, Tianjian Ouyang, Junbo Yan, Yuwei Du, Yong Li 0008 |
KDD (2) | 2 |
| 2023 | Demo: Scalable Digital Twin System for Mobile Networks with Generative AIabstractDigital Twin brings a new realization approach to the modeling of mobile networks. Mobile networks, as complex systems comprising multiple components, such as mobile users, base stations, and wireless environments, have intricate interactions and relationships with each other. By creating a virtual replica of each physical mobile network entity in a virtual space, we build a scalable digital twin system for mobile networks with generative AI. The system can interact with multiple optimizers to evaluate and display real-time simulation results. A companion video can be accessed using the link below. https://youtu.be/xtcBIXPzvkc Jiahui Gong, Qiaohong Yu, Tong Li 0013, Haoqiang Liu, Jun Zhang 0087, Hangyu Fan, Depeng Jin, Yong Li 0008 |
MobiSys | 5 |
| 2022 | Mirage: an efficient and extensible city simulation framework (systems paper)abstractWith the increase of computing power and the development of data science, modeling and simulation are becoming indispensable tools in urban science research. Cities, as complex systems made up of many aspects such as mobility, infrastructure, have complex interactions and relationships among multiple elements. In order to provide researchers with tools to model and simulate complex urban systems, we first propose a city model that focuses on three key concepts: human, thing and space. According to the city model, we design and develop Mirage, an efficient and extensible city simulation framework and also implement an efficient mobility module as Mirage's necessary module. To show the extensibility of Mirage, we build application cases about urban vulnerability and decision making. We also conduct extensive experiments to verify the efficiency of Mirage and its mobility module. Jun Zhang 0087, Depeng Jin, Yong Li 0008 |
SIGSPATIAL/GIS | 1 |
| 2022 | Social Recommendation With Characterized RegularizationabstractSocial recommendation, which utilizes social relations to enhance recommender systems, has been gaining increasing attention recently with the rapid development of online social networks. Existing social recommendation methods are based on the assumption, so-calledsocial-trust, that users’ preference or decision is influenced by their social-connected friends’ purchase behaviors. However, they assume that the influences of social relationships are always the same, which violates the fact that users are likely to share preference on different products with different friends. More precisely, friends’ behaviors do not necessarily affect a user’s preferences, and the influence is diverse among different items. In this paper, we contribute a new solution, CSR (short forCharacterizedSocialRegularization) model by designing a universal regularization term for modeling variable social influence. This regularization term captures the finely grained similarity of social-connected friends. We further introduce two variants of our model with different optimization manners. Our proposed model can be applied to both explicit and implicit interaction due to its high generality. Extensive experiments on three real-world datasets demonstrate that our CSR can outperform state-of-the-art social recommendation methods. Further experiments show that CSR can improve recommendation performance for those users with sparse social relations or behavioral interactions. Chen Gao 0001, Nian Li 0001, Tzu-Heng Lin, Dongsheng Lin, Jun Zhang 0087, Yong Li 0008, Depeng Jin |
IEEE Trans. Knowl. Data Eng. | 5 |
| 2021 | Group-Buying Recommendation for Social E-CommerceabstractGroup buying, as an emerging form of purchase in social e-commerce websites, such as Pinduoduo1, has recently achieved great success. In this new business model, users, initiator, can launch a group and share products to their social networks, and when there are enough friends, participants, join it, the deal is clinched. Group-buying recommendation for social e-commerce, which recommends an item list when users want to launch a group, plays an important role in the group success ratio and sales. However, designing a personalized recommendation model for group buying is an entirely new problem that is seldom explored. In this work, we take the first step to approach the problem of group-buying recommendation for social e-commerce and develop a GBGCN method (short for Group-Buying Graph Convolutional Network). Considering there are multiple types of behaviors (launch and join) and structured social network data, we first propose to construct directed heterogeneous graphs to represent behavioral data and social networks. We then develop a graph convolutional network model with multi-view embedding propagation, which can extract the complicated high-order graph structure to learn the embeddings. Last, since a failed group-buying implies rich preferences of the initiator and participants, we design a double-pairwise loss function to distill such preference signals. We collect a real-world dataset of group-buying and conduct experiments to evaluate the performance. Empirical results demonstrate that our proposed GBGCN can significantly outperform baseline methods by 2.69%-7.36%. The codes and the dataset are released at https://github.com/Sweetnow/group-buying-recommendation. Jun Zhang 0087, Chen Gao 0001, Depeng Jin, Yong Li 0008 |
ICDE | 1 |