Yue Li

Dr. Yue Li

China Agricultural University, Beijing, China
orcid

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
1 December 2021 in Applied Soft Computing
Verified
Journal Article
Closed access
YLYue Li
Yue Li
XCXiaoquan Chu
Xiaoquan Chu
DTDong Tian
Dong Tian
JFJianying Feng
Jianying Feng
WMWeisong Mu
Weisong Mu

9 January 2022 in The Computer Journal
Verified
Journal Article
Closed access
PDF file
YLYue Li
Yue Li
JQJianfang Qi
Jianfang Qi
XCXiaoquan Chu
Xiaoquan Chu
WMWeisong Mu
Weisong Mu
In a competitive market, it is of great significance to divide customer groups to develop customer-centered personalized products. In this paper, we propose a customer segmentation method based on the K-means algorithm and the improved particle swarm optimization (PSO) algorithm. As the PSO algorithm easily falls into local extremum, the improved hybrid particle swarm optimization (IHPSO) algorithm is proposed to improve optimization accuracy. The full factorial design is used to determine the optimal parameter combination; the roulette operator is used to select excellent particles; then, the selected particles are crossed according to their adaptive crossover probabilities; when the population falls into a local optimum, the particles are mutated according to their adaptive mutation probabilities. Aimed at the K-means’ sensitivity to selecting the initial cluster centers, IHPSO is used to optimize the cluster centers (IHPSO-KM). We compare IHPSO with the PSO, LDWPSO, GA, GA-PSO and ALPSO algorithms on nine benchmark functions. We also conduct comparative experiments to compare IHPSO-KM with several conventional and state-of-the-art approaches on five UCI datasets. All results show that the two proposed methods outperform existing models. Finally, IHPSO-KM is applied in customer segmentation. The experimental results also prove the rationality and applicability of IHPSO-KM for customer segmentation.

26 March 2022 in Expert Systems with Applications
Verified
Journal Article
Closed access
YLYue Li
Yue Li
XJXiaoyun Jia
Xiaoyun Jia
Ruili WangRuili Wang
Ruili Wang
JQJianfang Qi
Jianfang Qi
HJHaibin Jin
Haibin Jin
WMWeisong Mu
Weisong Mu

YLYue Li
Yue Li
CZChengmeng Zhang
Chengmeng Zhang
YTYan Tong
Yan Tong
YZYalu Zhang
Yalu Zhang
GCGong Chen
Gong Chen
The old-age dependency ratio (ODR) is an important indicator reflecting the degree of a regional population’s aging. In the context of aging, this study provides a timely and effective method for predicting the ODR in Chinese cities. Using the provincial ODR from the Seventh National Population Census and Defense Meteorological Satellite Program/Operational Linescan System (DMSP/OLS) nighttime light data, this study aims to predict and analyze the spatial correlation of the municipal ODR in Chinese cities. First, the prediction model of the ODR was established with curve regression. Second, the spatial structure of the municipal ODR was investigated using the Moran’s I method. The experimental results show the following: (1) the correlation between the sum of the nighttime light and ODR is greater than the mean of nighttime light in the study areas; (2) the Sigmoid model fits better than other regression models using the provincial ODR in the past ten years; and (3) there exists an obvious spatial agglomeration and dependence on the municipal ODR. The findings indicate that it is reasonable to use nighttime light data to predict the municipal ODR in large and medium-sized cities. Our approach can provide support for future regional censuses and spatial simulations.

23 June 2023 in International Journal of Machine Learning and Cybernetics
Verified
Journal Article
Closed access
PDF file
JQJianfang Qi
Jianfang Qi
YLYue Li
Yue Li
HJHaibin Jin
Haibin Jin
JFJianying Feng
Jianying Feng
DTDong Tian
Dong Tian
WMWeisong Mu
Weisong Mu

5 February 2024 in Applied Intelligence
Verified
Journal Article
Closed access
PDF file
YLYue Li
Yue Li
CLChengqi Liu
Chengqi Liu
XHXinyue Hu
Xinyue Hu
JQJianfang Qi
Jianfang Qi
GCGong Chen
Gong Chen