Qi Li

Qi Li

Auto-generated profile, based on publicly available information

Qi Li

School of Information Science and Technology, Beijing Forestry University, Beijing, China

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

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

Representative Publications

View All Publications
1 January 2021 in Information Sciences
Verified
Journal Article
Closed access
SWShuliang Wang
Shuliang Wang
QLQi Li
Qi Li
Chuanfeng ZhaoChuanfeng Zhao
Chuanfeng Zhao
XZXingquan Zhu
Xingquan Zhu
HYHanning Yuan
Hanning Yuan
TDTianru Dai
Tianru Dai

13 January 2026 in ACM Transactions on Knowledge Discovery From Data
Verified
Journal Article
Open access
JGJing Geng
Jing Geng
SZShangxian Zhao
Shangxian Zhao
WWWang Weizhe
Wang Weizhe
QLQi Li
Qi Li
In recent years, graph-partition-based clustering algorithms have attracted increasing attention. These algorithms first construct a graph over the data points and then partition this graph, regarding each connected subgraph in the partitioned graph as a cluster. However, traditional graph-partition-based clustering algorithms face challenges when clustering datasets with highly imbalanced density distributions. This is because, during the process of graph partitioning, they mainly rely on edge lengths and largely ignore local density variations. To address this issue, we propose the Adaptive Graph Partitioning (AGP) clustering algorithm. AGP integrates local density information into the partitioning process and adaptively normalizes the magnitudes of edge weights in both sparse and dense regions. This enhancement allows AGP to avoid the over-partitioning of dense clusters, effectively addressing a common problem in traditional graph-partition-based clustering algorithms. Additionally, the mechanism of connectivity domain differences is introduced into AGP, further enhancing the algorithm’s ability to discriminate between neighboring clusters that are difficult to separate. Extensive experiments on 13 benchmark datasets show that AGP achieves the best clustering performance on 7 datasets and performs competitively on the others, especially when density imbalance is severe. Moreover, scalability experiments on datasets with up to 100,000 data points, together with complexity analysis, demonstrate that AGP enjoys favorable time and memory efficiency compared with representative baselines.

9 December 2024 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
Shuliang WangShuliang Wang
Shuliang Wang
QYQianyu Yang
Qianyu Yang
SRSijie Ruan
Sijie Ruan
CLCheng Long
Cheng Long
YYYe Yuan
Ye Yuan
YZYu Zheng
Yu Zheng
Intelligent logistics relies on accurately predicting the service time, which is a part of time cost in the last-mile delivery. However, service time prediction (STP) is non-trivial given complex delivery circumstances, location heterogeneity, and skewed observations in space, which are not well-handled by existing solutions. In our prior work, we treat STP at each location as a learning task to keep the location heterogeneity, propose a prior knowledge-enhanced meta-learning to tackle skewed observations, and introduce a Transformer-based representation module to encode complex delivery circumstances. Maintaining the design principles of prior work, in this extended paper, we propose MetaSTP+. In addition to fusing the prior knowledge after the meta-learning process, MetaSTP+ also injects the prior knowledge before and during the meta-learning process to better tackle skewed observations. More specifically, MetaSTP+ completes the support set of tasks with scarce samples from other tasks based on prior knowledge and is equipped with a prior knowledge-aware historical observation encoding module to achieve those purposes accordingly. Experiments show MetaSTP+ outperforms the best baseline by 11.2% and 8.4% on two real-world datasets. Finally, an intelligent waybill assignment system based on MetaSTP+ is deployed in JD Logistics.

19 April 2018 in Computing
Verified
Journal Article
Closed access
PDF file
Shuliang WangShuliang Wang
Shuliang Wang
SWShaopeng Wang
Shaopeng Wang
HYHanning Yuan
Hanning Yuan
QLQi Li
Qi Li
JGJing Geng
Jing Geng
YYYang Yu
Yang Yu

18 May 2023 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
BZBoxiang Zhao
Boxiang Zhao
Shuliang WangShuliang Wang
Shuliang Wang
Lianhua ChiLianhua Chi
Lianhua Chi
Chuanfeng ZhaoChuanfeng Zhao
Chuanfeng Zhao
HYHanning Yuan
Hanning Yuan
YYYe Yuan
Ye Yuan
Discovering causal relationships among observed variables is a new research focus in the area of data mining. Methods based on the additive noise model have been proved to be efficient in the identification of cause-effect pairs. However, when trying to determine many-to-one causality, additive noise models often fail to identify the causal direction due to the complex interrelationships and interactions even though the generation of each causal relation follows the additive noise model, and become unreliable in practical applications. In this work, to identify the causal direction, we propose a Hierarchical Additive Noise Model (HANM) to convert many-to-one causality into an approximate one-to-one causality by generalizing multiple factors into an intermediate variable with a variational approach, and use asymmetry in the forward model and backward model of HANM to identify causal direction. Experiments using synthetic data show that many-to-one causality can be effectively identified through asymmetry with our proposed HANM and the accuracy of HANM is higher than the best existing model. By applying the model to real-world data, it can be seen that HANM can greatly augment the application scope of functional causal models for causal discovery.

1 January 2019 in Chinese Journal of Electronics
Verified
Journal Article
Open access
PDF file
SWShuliang Wang
Shuliang Wang
QLQi Li
Qi Li
HYHanning Yuan
Hanning Yuan
JGJing Geng
Jing Geng
TDTianru Dai
Tianru Dai
CDChenwei Deng
Chenwei Deng
Clustering is fundamental in many fields with big data. In this paper, a novel method based on Topological graph partition (TGP) is proposed to group objects. A topological graph is created for a data set with many objects, in which an object is connected to k nearest neighbors. By computing the weight of each object, a decision graph under probability comes into being. A cut threshold is conveniently selected where the probability of weight anomalously becomes large. With the threshold, the topological graph is cut apart into several sub-graphs after the noise edges are cut off, in which a connected subgraph is treated as a cluster. The compared experiments demonstrate that the proposed method is more robust to cluster the data sets with high dimensions, complex distribution, and hidden noises. It is not sensitive to input parameter, we need not more priori knowledge.