VLDB 2026 Research / reviewers in the wild / expert
Jinhua Yang
dblp:131/5596
· DBLP profile ↗
8ranked-venue papers
1as first author
6since 2021 · last 2026
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 2 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1Theory of computation · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Billboard-sorted hybrid rendering of large-scale multi-scale hybrid lattice-solid structure
Jinhua Yang, Yunhui Zhu, Qianfeng Cao |
Comput. Graph. | 1 |
| 2023 | A Comparative Evaluation of Visual Summarization Techniques for Event SequencesabstractAbstract Real‐world event sequences are often complex and heterogeneous, making it difficult to create meaningful visualizations using simple data aggregation and visual encoding techniques. Consequently, visualization researchers have developed numerous visual summarization techniques to generate concise overviews of sequential data. These techniques vary widely in terms of summary structures and contents, and currently there is a knowledge gap in understanding the effectiveness of these techniques. In this work, we present the design and results of an insight‐based crowdsourcing experiment evaluating three existing visual summarization techniques: CoreFlow, SentenTree, and Sequence Synopsis. We compare the visual summaries generated by these techniques across three tasks, on six datasets, at six levels of granularity. We analyze the effects of these variables on summary quality as rated by participants and completion time of the experiment tasks. Our analysis shows that Sequence Synopsis produces the highest‐quality visual summaries for all three tasks, but understanding Sequence Synopsis results also takes the longest time. We also find that the participants evaluate visual summary quality based on two aspects: content and interpretability. We discuss the implications of our findings on developing and evaluating new visual summarization techniques. Kazi Tasnim Zinat, Jinhua Yang, Arjun Gandhi, Nistha Mitra, Zhicheng Liu 0001 |
Comput. Graph. Forum | 2 |
| 2023 | A primal-dual approximation algorithm for the k-prize-collecting minimum vertex cover problem with submodular penalties
Weidong Li 0002, Jinhua Yang |
Frontiers Comput. Sci. | 3 |
| 2021 | Approximation Algorithms for the Maximum Bounded Connected Bipartition Problem
Weidong Li 0002, Jinhua Yang |
AAIM | 4 |
| 2021 | Online Bottleneck Semi-matching
Weidong Li 0002, Jinhua Yang |
COCOA | 4 |
| 2021 | Fiber Bragg Grating Sensor Based on Refractive Index Segment Code of Mobile Modulation
Zhi-Chao Liu, Jinhua Yang |
Mob. Networks Appl. | 3 |
| 2019 | Meta Path-Based Information Entropy for Modeling Social Influence in Heterogeneous Information NetworksabstractInfluence is a complex and subtle force that changes the behavior of involved users. Measuring influence can benefit to identify the influential users, and also benefit to provide important insights into the design of social platforms and applications. However, most existing work on social influence analysis has focused on homogeneous information networks. Few studies systematically investigate how to mine the strength of influence between nodes in heterogeneous information networks. In this paper, we present a meta path-based information entropy for modeling social influence in heterogeneous information networks (MPIE). Through setting meta paths, MPIE not only flexibly integrates heterogeneous information, but also obtains potential link information to measure the influence of nodes. Experiments on real data sets demonstrate the effectiveness of our proposed method. Yudi Yang, Lihua Zhou, Jinhua Yang |
MDM | 4 |
| 2018 | Real-Time Trajectory Data Publishing Method with Differential PrivacyabstractWith the increasing popularity of location technologies and location-based service applications, a large number of user's trajectory data have been collected. Publishing the real-time statistics data of trajectory streams can be useful in many fields such as intelligent transportation system, urban road planning and road congestion detection. As the trajectory data itself contains a wealth of user's privacy information, the privacy leakage problem has aggravated the risk of data publishing. In order to realize the personalized and uniform privacy preserving of user's trajectory data, the differential privacy model based on data perturbation is introduced, and a privacy preserving algorithm is proposed. The algorithm contains three modules of dynamic privacy budget allocation, privacy approximation and privacy publishing. In the experiment, the performances of the proposed method are verified by using real-life datasets. Fengyun Li, Jinhua Yang, Lifang Xue, Dawei Sun 0001 |
MSN | 2 |