Qianjin Wang

Qianjin Wang

Auto-generated profile, based on publicly available information

Qianjin Wang

School of Electrical Engineering, Yancheng Institute of Technology, Yancheng, China

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
10 July 2023 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
QWQianjin Wang
Qianjin Wang
WDWei Dai
Wei Dai
CZChunfu Zhang
Chunfu Zhang
JZJiaji Zhu
Jiaji Zhu
XMXiaoping Ma
Xiaoping Ma
Incremental random weight networks (IRWNs) face the issues of weak generalization and complicated network structure. There is an important reason: the learning parameters of IRWNs are determined in a random fashion without guidance, which may increase many redundant hidden nodes, and thereby leading to inferior performance. To resolve this issue, a novel IRWN with compact constraint that guides the assignment of random learning parameters (CCIRWN) is developed in this brief. Using the iteration method of Greville, a compact constraint that simultaneously assures the quality of generated hidden nodes and the convergence of the CCIRWN is built to perform learning parameter configuration. Meanwhile, the output weights of the CCIRWN are assessed analytically. Two types of learning methods for constructing the CCIRWN are proposed. Finally, the performance evaluation of the proposed CCIRWN is undertaken on the 1-D nonlinear function approximation, several real-world datasets, and data-driven estimation based on the industrial data. Numerical and industrial examples indicate that the proposed CCIRWN with compact structure can achieve favorable generalization ability.

5 January 2022 in ISA Transactions
Verified
Journal Article
Closed access
QLQun Lu
Qun Lu
JCJian Chen
Jian Chen
QWQianjin Wang
Qianjin Wang
DZDan Zhang
Dan Zhang
MSMingxuan Sun
Mingxuan Sun
Chun-Yi SuChun-Yi Su
Chun-Yi Su

30 March 2022 in IEEE Transactions on Artificial Intelligence
Verified
Journal Article
Closed access
QWQianjin Wang
Qianjin Wang
QHQiqiang Hong
Qiqiang Hong
SWShang Wu
Shang Wu
WDWei Dai
Wei Dai
Existing stochastic configuration network (SCN)-based modeling methods are underperformed in handling multi-target regression problems. An important reason is that they ignore the inter-target correlations, which have an important effect on improving the modeling accuracy. To enhance the performance of these SCN-based models, in this paper, a novel multi-target SCN (MTSCN) modeling approach is presented. The L2,1 norm of a structure matrix that can be utilized to explicitly reveal the correlations between multiple targets and an L2 term are attached to the cost function of SCN. Considering the non-smoothness of the constructed cost function, an alternating optimization algorithm is adopted to compute the structure matrix and the output weights of MTSCN. Then, a new supervisory mechanism is proposed to ensure the convergence of MTSCN. Finally, experimental results using the synthetic data and several real-world datasets show that the developed MTSCN is more superior to other modeling methods in resolving multi-target modeling problems.

18 March 2021 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
QWQianjin Wang
Qianjin Wang
WDWei Dai
Wei Dai
PLPing Lin
Ping Lin
Ping ZhouPing Zhou
Ping Zhou
Optimal operation of an actual mine main fan switchover process relies heavily on a good measurement of underground airflow quantity (UAQ). However, real-time measuring the UAQ is difficult using conventional measurement techniques. In this article, a novel randomized learning model, named compact incremental random weight network (CIRWN), is proposed to estimate the UAQ. Since the hidden parameters of the original IRWN are generated in a fixed scope with a random manner, which is prone to create redundant hidden nodes, a CIRWN with new inequality constraints is proposed. The inequality constraints have several attractive properties, including dynamically guiding the generation of hidden parameters, effectively enhancing the convergence rate, and successfully establishing a universal approximator. Experiments using four benchmark datasets and an industrial dataset show that the established model possesses a more compact network structure and better modeling accuracy as well as faster convergence rate compared with other methods.

1 February 2019 in ISA Transactions
Verified
Journal Article
Closed access
QWQianjin Wang
Qianjin Wang
XMXiaoping Ma
Xiaoping Ma
CYChunyu Yang
Chunyu Yang
WDWei Dai
Wei Dai

9 May 2024 in Neurocomputing
Verified
Journal Article
Closed access
QWQianjin Wang
Qianjin Wang
WYWei Yang
Wei Yang
WDWei Dai
Wei Dai
XMXiaoping Ma
Xiaoping Ma