Zhengping Qian

Zhengping Qian

Auto-generated profile, based on publicly available information

Zhengping Qian

Alibaba Group, Hangzhou, China

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
3 July 2024 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
PYPeilun Yang
Peilun Yang
Hanchen WangHanchen Wang
Hanchen Wang
JYJianye Yang
Jianye Yang
ZQZhengping Qian
Zhengping Qian
YZYing Zhang
Ying Zhang
XLXuemin Lin
Xuemin Lin
The requirement for appropriate ways to measure the similarity between data objects is a common but vital task in various domains, such as data mining, machine learning and so on. Driven by abundant real-world applications, many well-known similarity (distance) metrics are proposed to measure the pairwise similarity of data pairs, e.g., graph edit distance for graphs and dynamic time warping for time series. However, many similarity metrics suffer from the high time complexity. More specifically, most of the well-known similarity metrics often need quadratic time or even much more time to compute the ground truth similarity and some of them are proven to be NP-hard. With the development of deep learning techniques, there is an emerging research trend on the learning for similarity computation on various data types in the field of database (DB) and data mining, which is quite different with the metric learning studies in the machine learning (ML) literature. Specifically, the studies in the ML focus on the learning for semantic similarity in specific tasks, which is implicitly indicated by the training data, on the data in the feature space. While the studies in the DB literature usually consider the learning for well-defined similarity metrics (e.g., graph edit distance) on the data objects (e.g., graphs), such that it can benefit the similarity computation on data in terms of multiple aspects, such as computation time, metric quality and search heuristic, and the learned representation of data can also be naturally fed to downstream tasks. This survey paper provides a comprehensive review of similarity computation learning on several data types, including set, sequence and graph. Moreover, we first classify the learning-based approaches in terms of their learning target into three categories, i.e., similarity learning, cost matrix learning and search heuristic learning. Then we detail some representative approaches for each category on every data type, and analyze some key features that are utilized by these approaches. Finally, we discuss some challenges and future directions towards the learning for similarity learning on these data types.

23 December 2021 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
ZCZi Chen
Zi Chen
LYLong Yuan
Long Yuan
LHLi Han
Li Han
ZQZhengping Qian
Zhengping Qian
$k$ -truss model is a typical cohesive subgraph model and has been received considerable attention recently. However, the $k$ -truss model only considers the direct common neighbors of an edge, which restricts its ability to reveal fine-grained structure information of the graph. Motivated by this, in this paper, we propose a new model named $(k, \tau)$ -truss that considers the higher-order neighborhood ( $\tau$ hop) information of an edge. Based on the $(k, \tau)$ -truss model, we study the higher-order truss decomposition problem which computes the $(k, \tau)$ -trusses for all possible $k$ values regarding a given $\tau$ . Higher-order truss decomposition can be used in the applications such as community detection and search, hierarchical structure analysis, and graph visualization. To address this problem, we first propose a bottom-up decomposition paradigm in the increasing order of $k$ values to compute the corresponding $(k, \tau)$ -truss. Based on the bottom-up decomposition paradigm, we further devise three optimization strategies to reduce the unnecessary computation. We evaluate our proposed algorithms on real datasets and synthetic datasets, the experimental results demonstrate the efficiency, effectiveness and scalability of our proposed algorithms.

18 April 2022 in The VLDB Journal
Verified
Journal Article
Open access
PDF file
BLBingqing Lyu
Bingqing Lyu
LQLu Qin
Lu Qin
XLXuemin Lin
Xuemin Lin
YZYing Zhang
Ying Zhang
ZQZhengping Qian
Zhengping Qian
JZJingren Zhou
Jingren Zhou
Maximum biclique search, which finds the biclique with the maximum number of edges in a bipartite graph, is a fundamental problem with a wide spectrum of applications in different domains, such as E-Commerce, social analysis, web services, and bioinformatics. Unfortunately, due to the difficulty of the problem in graph theory, no practical solution has been proposed to solve the issue in large-scale real-world datasets. Existing techniques for maximum clique search on a general graph cannot be applied because the search objective of maximum biclique search is two-dimensional, i.e., we have to consider the size of both parts of the biclique simultaneously. In this paper, we divide the problem into several subproblems each of which is specified using two parameters. These subproblems are derived in a progressive manner, and in each subproblem, we can restrict the search in a very small part of the original bipartite graph. We prove that a logarithmic number of subproblems is enough to guarantee the algorithm correctness. To minimize the computational cost, we show how to reduce significantly the bipartite graph size for each subproblem while preserving the maximum biclique satisfying certain constraints by exploring the properties of one-hop and two-hop neighbors for each vertex. Furthermore, we study the diversified top-kbiclique search problem which aims to findkmaximal bicliques that cover the most edges in total. The basic idea is to repeatedly find the maximum biclique in the bipartite graph and remove it from the bipartite graphktimes. We design an efficient algorithm that considers to share the computation cost among thekresults, based on the idea of deriving the same subproblems of different results. We further propose two optimizations to accelerate the computation by pruning the search space with size constraint and refining the candidates in a lazy manner. We use several real datasets from various application domains, one of which contains over 300 million vertices and 1.3 billion edges, to demonstrate the high efficiency and scalability of our proposed solution. It is reported that 50% improvement on recall can be achieved after applying our method in Alibaba Group to identify the fraudulent transactions in their e-commerce networks. This further demonstrates the usefulness of our techniques in practice.

7 October 2021 in The VLDB Journal
Verified
Journal Article
Closed access
PDF file
SXSheng Xiang
Sheng Xiang
DWDong Wen
Dong Wen
DCDawei Cheng
Dawei Cheng
YZYing Zhang
Ying Zhang
LQLu Qin
Lu Qin
XLXuemin Lin
Xuemin Lin

20 July 2025
Verified
Conference Paper
Open access
JDJinyu Duan
Jinyu Duan
HGHaicheng Guo
Haicheng Guo
FZFan Zhang
Fan Zhang
KWKai Wang
Kai Wang
ZQZhengping Qian
Zhengping Qian
Zhihong TianZhihong Tian
Zhihong Tian

13 March 2025 in arXiv
Verified
Preprint
Open access
PDF file
YFYijiang Fan
Yijiang Fan
YMYuren Mao
Yuren Mao
LLLongbin Lai
Longbin Lai
YZYing Zhang
Ying Zhang
ZQZhengping Qian
Zhengping Qian
YGYunjun Gao
Yunjun Gao
Due to the limited computational resources, most Large Language Models (LLMs) developers can only fine-tune Small Language Models (SLMs) on their own data. These private SLMs typically have limited effectiveness. To boost the performance of private SLMs, this paper proposes to ask general LLMs for help. The general LLMs can be APIs or larger LLMs whose inference cost the developers can afford. Specifically, we propose the G-Boost framework where a private SLM adaptively performs collaborative inference with a general LLM under the guide of process reward. Experiments demonstrate that our framework can significantly boost the performance of private SLMs.