Pengfei Zhang

Prof. Dr. Pengfei Zhang

School of Intelligent Medicine, Chengdu University of Traditional Chinese Medicine, Chengdu, Sichuan, China
orcid

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
4 August 2022 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
Pengfei ZhangPengfei Zhang
Pengfei Zhang
TLTianrui Li
Tianrui Li
ZYZhong Yuan
Zhong Yuan
CLChuan Luo
Chuan Luo
KLKeyu Liu
Keyu Liu
XYXiaoling Yang
Xiaoling Yang
Feature selection aims to remove irrelevant or redundant features and thereby remain relevant or informative features so that it is often preferred for alleviating the dimensionality curse, enhancing learning performance, providing better readability and interpretability, and so on. Data that contain numerical and categorical representations are called heterogeneous data, and they exist widely in many real-world applications. Neighborhood rough set (NRS) can effectively deal with heterogeneous data by using neighborhood binary relation, which has been successfully applied to heterogeneous feature selection. In this article, the NRS model as a unified framework is used to design a feature selection method to handle categorical, numerical, and heterogeneous data. First, the concept of neighborhood combination entropy (NCE) is presented. It can reflect the probability of pairs of the neighborhood granules that are probably distinguishable from each other. Then, the conditional neighborhood combination entropy (cNCE) based on NCE is proposed under the condition of considering decision attributes. Moreover, some properties and relationships between cNCE and NCE are derived. Finally, the functions of inner and outer significances are constructed to design a feature selection algorithm based on cNCE (FScNCE). The experimental results show the effectiveness and superiority of the proposed algorithm.

24 September 2021 in IEEE Transactions on Fuzzy Systems
Verified
Journal Article
Closed access
ZYZhong Yuan
Zhong Yuan
HCHongmei Chen
Hongmei Chen
Pengfei ZhangPengfei Zhang
Pengfei Zhang
JWJihong Wan
Jihong Wan
TLTianrui Li
Tianrui Li
Aiming at the problem of effectively selecting relevant features from heterogeneous data without decision, a novel feature selection approach is studied based on fuzzy mutual information in fuzzy rough set theory. First, the fuzzy relevance of each feature is defined by using fuzzy mutual information, and then, the fuzzy conditional relevance is further given. Next, the fuzzy redundancy is defined by using the difference between the fuzzy relevance and the fuzzy conditional relevance. Thereby, the evaluation index of the feature importance is obtained by using the idea of unsupervised minimum redundancy and maximum relevance. Finally, a fuzzy-mutual-information-based unsupervised feature selection algorithm is designed to select feature sequences. Extensive experiments are conducted on public datasets, and six unsupervised feature selection algorithms are compared. The selected features are evaluated by classification, clustering, and outlier detection methods. Experimental results show that the proposed algorithm can select fewer heterogeneous features to maintain or improve the performance of learning algorithms.

31 October 2024 in Information Fusion
Verified
Journal Article
Closed access
QZQinli Zhang
Qinli Zhang
Pengfei ZhangPengfei Zhang
Pengfei Zhang
TLTianrui Li
Tianrui Li

1 February 2024 in Information Fusion
Verified
Journal Article
Closed access
Pengfei ZhangPengfei Zhang
Pengfei Zhang
DWDexian Wang
Dexian Wang
ZYZheng Yu
Zheng Yu
YZYujie Zhang
Yujie Zhang
TJTao Jiang
Tao Jiang
TLTianrui Li
Tianrui Li

4 May 2023 in ACM Transactions on Knowledge Discovery From Data
Verified
Journal Article
Open access
DWDexian Wang
Dexian Wang
TLTianrui Li
Tianrui Li
PDPing Deng
Ping Deng
Fan ZhangFan Zhang
Fan Zhang
WHWei Huang
Wei Huang
JLJia Liu Liu
Jia Liu Liu
Clustering is a popular research topic in the field of data mining, in which the clustering method based on non-negative matrix factorization (NMF) has been widely employed. However, in the update process of NMF, there is no learning rate to guide the update as well as the update depends on the data itself, which leads to slow convergence and low clustering accuracy. To solve these problems, a generalized deep learning clustering (GDLC) algorithm based on NMF is proposed in this article. Firstly, a nonlinear constrained NMF (NNMF) algorithm is constructed to achieve sequential updates of the elements in the matrix guided by the learning rate. Then, the gradient values corresponding to the element update are transformed into generalized weights and generalized biases, by inputting the elements as well as their corresponding generalized weights and generalized biases into the nonlinear activation function to construct the GDLC algorithm. In addition, for improving the understanding of the GDLC algorithm, its detailed inference procedure and algorithm design are provided. Finally, the experimental results on eight datasets show that the GDLC algorithm has efficient performance.

30 January 2023 in IEEE Transactions on Fuzzy Systems
Verified
Journal Article
Closed access
Pengfei ZhangPengfei Zhang
Pengfei Zhang
TLTianrui Li
Tianrui Li
ZYZhong Yuan
Zhong Yuan
ZDZhixuan Deng
Zhixuan Deng
GWGuoqiang Wang
Guoqiang Wang
Fan ZhangFan Zhang
Fan Zhang
The main goal of most information quality (IQ)-based measures is to combine data provided by multiple information sources to enhance the quality of information essential for decision makers to perform their tasks. However, there is few work to fuse multi-source information from the perspective of possibility distribution (PD) and use IQ as the evaluation criteria for feature selection. The PD is one of important concepts in possibility theory, which is a generally acknowledged method for describing a kind of uncertain knowledge. In this paper, we propose a novel representation model of possibility distributions based on fuzzy multisets, namely, a possibility distribution information system (PDIS). Then, several IQ measures are defined in the PDIS, including Gini entropy, compatibility, conflict, credibility and separability degrees. In view of this, a minimal-separability-minimal-uncertainty-based unsupervised feature selection algorithm (UmSMU) is designed. The proposed UmSMU can sufficiently fuse multiple possibilistic information. Meanwhile, the selected features maintain as much information as possible while minimizing the uncertainty of information. The experimental results show that the proposed algorithm performs well, especially when it comes to selecting fewer features and improving performance.