Qiaoyong Jiang

Dr. Qiaoyong Jiang


Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
11 May 2023 in Applied Sciences
Verified
Journal Article
Open access
PDF file
YMyongjuan ma
yongjuan ma
LWLei Wang
Lei Wang
JZJiating Zhang
Jiating Zhang
FLFengjuan Liu
Fengjuan Liu
QJQiaoyong Jiang
Qiaoyong Jiang
In this era of intelligence, the learning methods of learners have substantially changed. Many learners choose to learn through online education platforms. Although learners may enjoy more high-quality educational resources, when they are faced with an abundance of resource information, they are prone to become lost in knowledge, among other problems. To solve this problem, a multi-algorithm collaborative, personalized, learning path recommendation model is proposed to provide learning guidance for learners of online learning platforms. First, the learner model is constructed from four perspectives: cognitive level, learning ability, learning style, and learning intensity. Second, the association rule algorithm is employed to generate a sequence of knowledge points and to plan the learning sequence of knowledge points for learners. Last, the swarm intelligence algorithm is utilized to ensure that each knowledge point is matched with personalized learning resources with a higher degree of adaptability so that learners can learn using a more targeted approach. The experimental results show that the research results of this paper can, to a certain extent, recommend ideal learning paths to target users, effectively improve the accuracy of recommended resources, and thus improve the learning quality and learning effect of users.

4 July 2023 in Applied Sciences
Verified
Journal Article
Open access
PDF file
BLBingyu Li
Bingyu Li
LWLei Wang
Lei Wang
QJQiaoyong Jiang
Qiaoyong Jiang
WLWei Li
Wei Li
RHRong Huang
Rong Huang
In view of the limitations of traditional statistical methods in dealing with multifactor and nonlinear data and the inadequacy of classical machine learning algorithms in dealing with and predicting data with high dimensions and large sample sizes, this paper proposes an operational risk prediction model based on an automatic encoder and convolutional neural networks. First, we use an automatic encoder to extract features of motion risk factors and obtain feature components that can highly represent risk. Secondly, based on the causal relationship between sports risk and risk characteristics, a convolutional neural network with a dual convolution layer and dual pooling layer topology is constructed. Finally, the sports risk prediction model is established by combining the auto-coded feature components with the topology of the convolutional neural network. Compared with other algorithms, the proposed method can effectively analyze and extract risk characteristics and has a high prediction accuracy. At the same time, it promotes the integration of sports science and computer science and provides a basis for the application of machine learning in the field of sports risk prediction.

1 May 2015
Verified
Conference Paper
Closed access
ZCZijian Cao
Zijian Cao
LWLei Wang
Lei Wang
YSYuhui Shi
Yuhui Shi
XHXinhong Hei*
Xinhong Hei*
XRXiaofeng Rong
Xiaofeng Rong
HLHong-Ye Li
Hong-Ye Li
Cooperative Coevolution (CC) was introduced into evolutionary algorithms as a promising framework for tackling large scale optimization problems through a divide-and-conquer strategy. A number of decomposition methods to identify interacting variables have been proposed to construct subcomponents of a large scale problem, but if the variables are all non-separable, all the CC-based algorithms of decomposition will lose the functionality, therefore, classical CC-based algorithms are inefficient in processing non-separable problems that have many interacting variables. In this paper, a new CC framework which integrates global and local search algorithms is proposed for solving large scale optimization problems. In the stage of global cooperative coevolution, we introduce a new interacting variables grouping method named Sequential Sliding Window. When the performance of global search reaches a deviation tolerance or the variables are fully non-separable, we then use a more effective local search algorithm to subsequently search the solution space of the large scale optimization problem. The integration of global and local algorithms into CC framework can efficiently improve the capability in processing large scale non-separable problems. Experimental results on large scale optimization benchmarks show that the proposed framework is more effective than other existing CC frameworks.

1 January 2021 in Wireless Communications and Mobile Computing
Verified
Journal Article
Open access
PDF file
FWFeng Wang
Feng Wang
CWChenle Wang
Chenle Wang
Kan WangKan Wang
Kan Wang
QJQiaoyong Jiang
Qiaoyong Jiang
BWBin Wang
Bin Wang
WHWenjuan He
Wenjuan He
In a vehicular ad hoc network (VANET), roadside units (RSUs) are installed at roadside and intersections to process vehicle‐to‐infrastructure communication, collect and analyse intelligent vehicle traffic data, send information to vehicles, and achieve early warning of safe driving of vehicles. Owning to the high cost of implementing and maintaining RSUs, it is of vital importance to determine where and how many RSUs to deploy. Optimal RSU deployment requires both a small number of RSUs and the maximum coverage of vehicle running process, which constitutes a conflicting multiobjective problem. Nevertheless, existing works do not explicitly utilize multiobjective algorithm to solve the RSU deployment problem. Therefore, a multiobjective differential evolution approach is proposed in this work to solve the problem. Firstly, to conquer the complexity of urban road RSU deployment, the static model is established. Secondly, in the proposed multiobjective differential evolution with discrete elitist guide (MODE‐deg), the sigmoid function is applied to discrete individual values. Finally, elitist individuals are selected based on crowding distance ranking and nondominated ranking to generate new individuals, which further improve the convergence speed and population performance. Experimental results show that MODE‐deg can generate the optimal nondominant solution set with good convergence and diversity, in contrast to other multiobjective evolutionary algorithms in five test functions of ZDT.

7 June 2022 in Energies
Verified
Journal Article
Open access
PDF file
FYFan Yu
Fan Yu
LWLei Wang
Lei Wang
QJQiaoyong Jiang
Qiaoyong Jiang
QYQunmin Yan
Qunmin Yan
SQShi Qiao
Shi Qiao
Accurate and rapid forecasting of short-term loads facilitates demand-side management by electricity retailers. The complexity of customer demand makes traditional forecasting methods incapable of meeting the accuracy requirements, so a self-attention based short-term load forecasting (STLF) considering demand-side management is proposed. In the data preprocessing stage, non-parametric kernel density estimation is used to construct customer electricity consumption feature curves, and then historical load data are used to delineate the feasible domain range for outlier detection. In the feature selection stage, the feature data are selected using variational modal decomposition and a maximum information coefficient to enhance the model prediction accuracy. In the model prediction stage, the decomposed intrinsic mode function components are independently predicted and reconstructed using an Informer based on improved self-attention. Additionally, the novel AdaBlief optimizer is used to optimize the model parameters. Cross-sectional and longitudinal experiments are conducted on a regional-level load dataset set in Spain. The experimental results prove that the proposed method is superior to other methods in STLF.

4 February 2023 in Applied Sciences
Verified
Journal Article
Open access
PDF file
XXXiangrong Xu
Xiangrong Xu
LWLei Wang
Lei Wang
SZShuo Zhang
Shuo Zhang
WLWei Li
Wei Li
QJQiaoyong Jiang
Qiaoyong Jiang
Traditional route planning methods usually plan the “fastest” or “lowest cost” travel route for users with the goal of finding the shortest path or the lowest cost, but this method cannot meet the needs of tourism users for personalized and multifunctional travel routes. Given this phenomenon, this paper proposes a personalized route planning model based on urgency. First, the model uses the visitor’s historical tourism data and public road network data to extract their preferences, POI (point of interest) relationships, edge scenic values and other information. Then, the planned route function is determined according to the urgency value, which provides users with travel routes that accommodate their interest preferences and urgency. Finally, the improved genetic algorithm based on gene replacement and gene splicing operators is used to carry out numerical experiments on the Xi’an and Wuhan road network datasets. The experimental results show that the proposed algorithm is not only capable of planning routes with different functions for diverse users but also performs personalized route planning according to their preferences.