Zhenping Xie

Prof. Zhenping Xie

orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
5 January 2024 in Expert Systems with Applications
Verified
Journal Article
Closed access
SCSiqi Cai
Siqi Cai
ZXZhenping Xie
Zhenping Xie

29 March 2021 in Complex & Intelligent Systems
Verified
Journal Article
Open access
PDF file
ZHZhaoxin Huang
Zhaoxin Huang
ZXZhenping Xie
Zhenping Xie
For large amount of patent texts, how to extract their keywords in an unsupervised way is a very important problem. In existing methods, only the own information of patent texts is analyzed. In this study, an improved TextRank model is proposed, in which prior public knowledge is effectively utilized. Specifically, two following points are first considered: (1) a TextRank network is constructed for each patent text, (2) a prior knowledge network is constructed based on public dictionary data, in which network edges represent the prior interpretation relationship among all dictionary words in dictionary entries. Then, an improved node rank value evaluation formula is designed for TextRank networks of patent texts, in which prior interpretation information in prior knowledge network are introduced. Finally, patent keywords can be extracted by finding top-k node words with higher node rank values. In our experiments, patent text clustering task is used to examine the performance of proposed method, wherein several comparison experiments are executed. Corresponding results demonstrate that, new method can markedly obtain better performance than existing methods for patent keywords extraction task in an unsupervised way.

24 December 2024 in Sensors
Verified
Journal Article
Open access
PDF file
CZChang Ze
Chang Ze
YCYunfei Cai
Yunfei Cai
XLXiaofan Liu
Xiaofan Liu
ZXZhenping Xie
Zhenping Xie
Yuan LiuYuan Liu
Yuan Liu
QZQianyi Zhan
Qianyi Zhan
With the rapid development of blockchain technology, fraudulent activities have significantly increased, posing a major threat to the personal assets of blockchain users. The blockchain transaction network formed during user transactions can be represented as a graph consisting of nodes and edges, making it suitable for a graph data structure. Fraudulent nodes in the transaction network are referred to as anomalous nodes. In recent years, the mainstream method for detecting anomalous nodes in graphs has been the use of graph data mining techniques. However, anomalous nodes typically constitute only a small portion of the transaction network, known as the minority class, while the majority of nodes are normal nodes, referred to as the majority class. This discrepancy in sample sizes results in class imbalance data, where models tend to overfit the features of the majority class and neglect those of the minority class. This issue presents significant challenges for traditional graph data mining techniques. In this paper, we propose a novel graph neural network method to overcome class imbalance issues by improving the Graph Attention Network (GAT) and incorporating ensemble learning concepts. Our method combines GAT with a subtree attention mechanism and two ensemble learning methods: Bootstrap Aggregating (Bagging) and Categorical Boosting (CAT), called SGAT-BC. We conducted experiments on four real-world blockchain transaction datasets, and the results demonstrate that SGAT-BC outperforms existing baseline models.

23 January 2018 in IEEE Transactions on Cognitive and Developmental Systems
Verified
Journal Article
Closed access
ZXZhenping Xie
Zhenping Xie
YJYaochu Jin
Yaochu Jin
In order to make machines more intelligent, it is inevitable to understand human-like cognitive development, in which adaptive, autonomous and progressive evolution of cognitive decision-making in interacting with the environment plays a key role. Inspired by enactive artificial intelligence and evolutionary sampling learning, a new cognitive development learning model termed evolutionary enactive learning is proposed in this work. The proposed model is constructed by extending the reinforcement learning framework and introducing the utility-selection theory to guide the coevolution of pattern representation and decision-making policies. Theoretical analysis on the model’s validity of evolutionary enactive learning is given. To further demonstrate the effectiveness of the proposed method, two simulated cognitive decision-making tasks are designed, in which pattern representation and decision-making must be jointly developed to achieve good cognitive performance. Our experimental results clearly demonstrate that the resulting learning process is rational and effective. Finally, we indicate that the proposed evolutionary enactive learning could be readily further extended by introducing existing machine learning techniques to solve more practical applications.

18 October 2023 in IEEE Transactions on Fuzzy Systems
Verified
Journal Article
Closed access
FHFuping Hu
Fuping Hu
ZDZhaohong Deng
Zhaohong Deng
GWGuanjin Wang
Guanjin Wang
ZXZhenping Xie
Zhenping Xie
KCKup-Sze Choi
Kup-Sze Choi
SWShitong Wang
Shitong Wang
Fuzzy Systems (FSs) have been widely utilized in diverse domains such as pattern recognition, intelligent control, data mining and bioinformatics due to their strong interpretation and learning abilities. Traditionally, FSs have mainly been applied to model Euclidean data. However, with the emergence of scenarios involving graph data such as social networks and traffic route maps, which inherently possess non-Euclidean structures, there is a need to develop FS modeling methods suitable for graph data while retaining the advantages of traditional FSs. This paper presents a novel FS called Graph Fuzzy System (GFS) specifically designed for modelling whole graph data. The concepts, modeling framework, and construction algorithms are systematically developed. Firstly, the paper defines GFS-related concepts, including the graph fuzzy rule base, graph fuzzy sets, and Graph Consequent Processing Unit (GCPU). Secondly, the learning framework for GFS is proposed. It includes a novel K-Means with Graph Similarity Measure clustering approach (KM-GSM) for generating antecedents in GFS and a new consequent parameters learning algorithm based on Graph Neural Network (GNNs). Moreover, three different versions of the GFS implementation algorithm are developed and thoroughly evaluated through experiments on various graph prediction datasets. The results demonstrate that the proposed GFS inherits the advantages of mainstream GNNs methods and conventional FSs methods while achieving superior performance in whole graph prediction compared to existing approaches.

1 December 2022 in World Wide Web
Verified
Journal Article
Closed access
PDF file
YSYu Sang
Yu Sang
ZXZhenping Xie
Zhenping Xie
WCWei Chen
Wei Chen
LZLei Zhao
Lei Zhao