EDBT 2026 Demo / reviewers in the wild / expert
Jianzhi Wang
dblp:290/3484
· DBLP profile ↗
3ranked-venue papers
0as first author
3since 2021 · last 2026
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 1 · 1 since 2021Databases, data management, data science and information retrieval · 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 |
Information retrieval · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information retrieval › similarity search › nearest neighbor search › approximate nearest neighbor search
graph-based approximate nearest neighbor search |
0.9 | 1 | 2025 | Highly Efficient Disk-based Nearest Neighbor Search on Extended Neighborhood Graph · SIGIR 2025 |
Information retrieval › similarity search
nearest neighbor search |
0.9 | 1 | 2025 | Highly Efficient Disk-based Nearest Neighbor Search on Extended Neighborhood Graph · SIGIR 2025 |
Methods — techniques the papers use, named apart from their topics
neighborhood graph · 0.9dataset partitioning · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Frame-Level Temporal Action Segmentation in Non-Human Primates by Fusing Skeleton and Visual ModalitiesabstractPrecise and objective quantification of non-human primates (NHPs) actions is vital for neuroscience research and for the phenotypic analysis of neuropsychiatric disorder models. However, existing computational ethology methods primarily focus on coarse-grained action recognition at the video-clip level and lack frame-level temporal segmentation tools for analyzing continuous action streams. This severely restricts the in-depth exploration of action dynamics, including duration, transition patterns, and rhythmicity. To address this issue, this study proposes a multi-modal, multi-stage action segmentation framework. The framework synergistically leverages the complementary strengths of different modalities by deeply fusing kinematic information from skeleton data, appearance features from RGB video, and dense motion information from optical flow, enabling fine-grained frame-wise action analysis of NHPs. To facilitate this task, MonActSeg was introduced as the first fine-grained, frame-by-frame annotated benchmark specifically designed for NHP temporal action segmentation. It encompasses a total of 1.37 million labeled frames across seven core actions. Evaluated on the MonActSeg benchmark under the video-level protocol, the proposed framework demonstrated superior performance, achieving a frame-wise accuracy (Acc) of 91.08%, an edit distance (Edit) of 85.94%, and a segmental F1@50 of 81.23%. This work provides an analytical tool and a standardized benchmark for computational ethology, enabling fine-grained quantification of NHPs behavioral phenotypes. Junwen Wu, Jianzhi Wang |
IEEE Trans Autom. Sci. Eng. | 7 |
| 2025 | Highly Efficient Disk-based Nearest Neighbor Search on Extended Neighborhood GraphabstractNearest neighbor search (NN search) plays a fundamental role in many disciplines. According to recent studies, graph-based search methods show superior performance over other types of methods. In order to accommodate the high dimensionality as well as the growing data-scale, the disk-based NN search in which the index graph and the full-precision vectors are kept in SSD has become a promising direction. This paper optimizes the disk-based NN search from three perspectives. Firstly, an eXtended Neighborhood Graph (XN-Graph) structure is proposed. In contrast to the existing index graphs, the out-edges of the graph neighborhood are collected from much wider coverage of the data space. It therefore reduces the number of hops during NN search, which in turn reduces the search latency. Additionally, a dataset partitioning method called Boundary-adaptive Balanced Partition is proposed to facilitate the graph construction in cases where the system cannot handle large datasets in a single round. Moreover, an efficient hybrid NN search method called In-Memory First Search is proposed. Compared to the existing methods, it considerably reduces the CPU idle times. With the support of XN-Graph, it shows 1.5-3 times lower search latency than SOTA methods. On billion-scale datasets, its QPS is still above 4000 when Recall@10 is as high as 0.9. Jianzhi Wang, Wanlei Zhao, Shihai Xiao |
SIGIR | 2 |
| 2022 | 5G-A Capability Exposure Scheme based on Harmonized Communication and SensingabstractWith the trend of 5G-A (5G-Advanced) harmonized network communications and sensing harmonized communication and sensing, network capability exposure technology will help operators, business providers and 3rd business parties to realize harmonized network communications and sensing harmonized communication and sensing business and applications. This paper will focus on capability exposure technology based on 5G-A harmonized communication and sensing. Initially, this paper discusses the capability exposure hierarchical architecture based on harmonized communication and sensing, secondly proposes the harmonized communication and sensing network architecture and basic network signaling process combined with capability exposure technology. Then, this paper discusses capability exposure application scenarios based on communication sensing. This paper can provide relevant reference for the technological evolution, network deployment and application discussion of the harmonized communication and sensing capability in the operator network. Guangquan Wang, Jianzhi Wang, Lexi Xu, Sai Han, Yuwei Jia |
TrustCom | 5 |