EDBT 2026 Demo / reviewers in the wild / expert
Ke Shu
dblp:255/5875
· DBLP profile ↗
10ranked-venue papers
2as first author
8since 2021 · last 2025
0009-0005-0602-0760ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 7 · 2 first-author · 6 since 2021Artificial intelligence and machine learning · 3 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Dual-Channel Graph Ranking Contrastive Learning for Dissolved Gas AnalysisabstractDissolved Gas Analysis (DGA) is a widely used diagnostic technique specifically designed to identify potential defects or irregularities in power transformers. Despite recent advancements, the fine-grained correlation modeling between samples is still insufficient. This limitation results in less contextualized feature representations, ultimately impacting the accuracy of diagnosis. To this end, we propose an effective graph deep learning model called DGRCL (Dual-channel Graph Ranking Contrastive Learning) for DGA. In our model, we construct two types of graphs: similar$K$-Nearest Neighbors (KNN) ($G_{S}$) and dissimilarKNN ($G_{\text{DS}}$), where nodes represent individual records of dissolved gases and the edges, namely similar-homophilic and dissimilar-heterophilic, capture the relationships between nodes. To better generate node representations, we design a dual-channel graph encoding component, with each channel playing a crucial role in capturing the corresponding edge type view. Furthermore, in order to better distinguish the feature differences among various fault categories, we employ ranking contrastive loss to refine the node representations. Experimental results demonstrate that our model achieves high accuracy and robustness in predicting fault types. Huifang Ma, Ke Shu |
IEEE Trans. Ind. Informatics | 4 |
| 2024 | GCS: A Graph-Augmented Semi-supervised Contrastive Learning Approach for Imbalanced Dissolved Gas Analysis in Power Transformers
Ke Shu, Huifang Ma, Qibin Zhang |
ADMA (3) | 1 |
| 2024 | Graph Contrastive Learning for Dissolved Gas Analysis
Huifang Ma, Di Zhang 0019, Ke Shu |
ADMA (3) | 4 |
| 2024 | Path-Aware Co-contrastive Learning for Signed Directed Network Embedding
Yuechen Tang, Huifang Ma, Ke Shu, Zhixin Li 0001, Liang Chang 0003 |
DASFAA (6) | 3 |
| 2024 | GraphSmin: Imbalanced dissolved gas analysis with contrastive dual-channel graph filters
Ke Shu, Huifang Ma, Jinpeng Yang |
Adv. Eng. Informatics | 1 |
| 2023 | A Scalable Query-Aware Enormous Database Generator for Database EvaluationabstractQuery-aware synthetic data generation is an essential and highly challenging task, important for database management system (DBMS) testing, database application testing and application-driven benchmarking. Prior studies on query-aware data generation suffer common problems of limited parallelization, poor scalability, and excessive memory consumption, making these systems unsatisfactory to terabyte scale data generation. In order to fill the gap between the existing data generation techniques and the emerging demands of enormous query-aware test databases, we design and implement a new data generator, called Touchstone. Touchstone adopts the random sampling algorithm instantiating query parameters and the new data generation schema generating the test database, to achieve fully parallel data generation, linear scalability and austere memory consumption. It has full support of outer joins as well as non-equi-joins for application-oriented data generation. Our experimental results show that Touchstone consistently outperforms the state-of-the-art solution on TPC-H workload by a 1000 speedup without sacrificing simulation fidelity. Qingshuai Wang, Rong Zhang 0002, Ke Shu, Aoying Zhou |
IEEE Trans. Knowl. Data Eng. | 4 |
| 2022 | Application-Oriented Workload Generation for Transactional Database Performance EvaluationabstractGenerating synthetic workloads is essential and critical to performance evaluation of database systems. When evaluating database performance for a specific application, the similarity between synthetic workloads and real application workloads determines the credibility of the evaluation results. However, it meets a great challenge to catch workload characteristics with respect to a target application considering the complexity of transaction executions. To address this problem, we propose a workload duplicator (Lauca) that can generate synthetic workloads with highly similar performance metrics compared to the real workloads of a specific application. By carefully studying the application-oriented workload generation problem, we present Transaction Logic and Data Access Distribution to characterize workloads of online transaction processing (OLTP) applications, and propose novel generation algorithms to guarantee the high fidelity of synthetic workloads. To the best of our knowledge, Lauca is the first application-oriented transactional workload generator. We conduct extensive experiments based on TPCC, SmallBank and YCSB on both centralized and distributed databases. The experimental results show that Lauca consistently generates high quality synthetic workloads. Luyi Qu, Rong Zhang 0002, Ke Shu, Weining Qian, Aoying Zhou |
ICDE | 5 |
| 2022 | Cross-Modal Food Retrieval: Learning a Joint Embedding of Food Images and Recipes With Semantic Consistency and Attention MechanismabstractFood retrieval is an important task to perform analysis of food-related information, where we are interested in retrieving relevant information about the queried food item such as ingredients, cooking instructions, etc. In this paper, we investigate cross-modal retrieval between food images and cooking recipes. The goal is to learn an embedding of images and recipes in a common feature space, such that the corresponding image-recipe embeddings lie close to one another. Two major challenges in addressing this problem are 1) large intra-variance and small inter-variance across cross-modal food data; and 2) difficulties in obtaining discriminative recipe representations. To address these two problems, we propose Semantic-Consistent and Attention-based Networks (SCAN), which regularize the embeddings of the two modalities through aligning output semantic probabilities. Besides, we exploit a self-attention mechanism to improve the embedding of recipes. We evaluate the performance of the proposed method on the large-scale Recipe1M dataset, and show that we can outperform several state-of-the-art cross-modal retrieval strategies for food images and cooking recipes by a significant margin. Hao Wang 0094, Doyen Sahoo, Ke Shu, Palakorn Achananuparp, Ee-Peng Lim, Steven C. H. Hoi |
IEEE Trans. Multim. | 4 |
| 2020 | Dependency Preserved Raft for Transactions
Huiqi Hu, Weining Qian, Ke Shu |
DASFAA (1) | 5 |
| 2020 | Face Anti-Spoofing Based on Dynamic Color Texture Analysis Using Local Directional Number PatternabstractFace anti-spoofing is becoming increasingly indispensable for face recognition systems, which are vulnerable to various spoofing attacks performed using fake photos and videos. In this paper, a novel “LDN-TOP representation followed by ProCRC classification” pipeline for face anti-spoofing is proposed. We use local directional number pattern (LDN) with the derivative-Gaussian mask to capture detailed appearance information resisting illumination variations and noises, which can influence the texture pattern distribution. To further capture motion information, we extend LDN to a spatial-temporal variant named local directional number pattern from three orthogonal planes (LDN- TOP). The multi-scale LDN- TOP capturing complete information is extracted from color images to generate the feature vector with powerful representation capacity. Finally, the feature vector is fed into the probabilistic collaborative representation based classifier (ProCRC) for face anti-spoofing. Our method is evaluated on three challenging public datasets, namely CASIA FASD, Replay-Attack database, and UVAD database using sequence-based evaluation protocol. The experimental results show that our method can achieve promising performance with 0.37% EER on CASIA and 5.73% HTER on UVAD. The performance on Replay-Attack database is also competitive. Junwei Zhou 0002, Ke Shu, Peng Liu 0005, Jianwen Xiang, Shengwu Xiong 0001 |
ICPR | 2 |