Xingchen Hu

Xingchen Hu

Auto-generated profile, based on publicly available information

Xingchen Hu

National university of defense technology, Changsha, China

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
28 November 2023 in IEEE Transactions on Fuzzy Systems
Verified
Journal Article
Closed access
XHXingchen Hu
Xingchen Hu
JQJindong Qin
Jindong Qin
Yinghua ShenYinghua Shen
Yinghua Shen
WPWitold Pedrycz
Witold Pedrycz
XLXinwang Liu
Xinwang Liu
JLJiyuan Liu
Jiyuan Liu
Multi-view clustering has been received considerable attention due to the widespread collection of multi-view data from diverse domains and sources. However, storing multi-view data across multiple devices in many real scenarios poses significant challenges for efficient data analysis. Federated Learning framework enables collaborative machine learning on distributed devices while preserving privacy constraints. Even though there have been intensive algorithms on multi-view fuzzy clustering, federated multi-view fuzzy clustering has not been adequately investigated so far. In this study, we first develop the federated learning mode into multi-view fuzzy clustering and realize the federated optimization procedure, called Federated Multiview Fuzzy C-Means clustering (FedMVFCM). Then, we design an original strategy of consensus prototype learning during federated multi-view fuzzy clustering. It is termed as Federated Multi-view Fuzzy c-means consensus Prototypes Clustering (FedMVFPC). We also further develop the federated alternative optimization algorithm with proven convergence. This study also introduces the notion of clustering prototype communication within the federated learning framework, and integrates the clustering prototypes of different views into a unified optimization formulation. The experimental studies on various benchmark datasets demonstrate that the proposed FedMVFPC method improves the federated clustering performance and efficiency. It achieves comparable or better clustering performance against the existing state-of-the-art multi-view clustering algorithms

7 August 2025 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
MLMeng Liu
Meng Liu
KLKe Liang
Ke Liang
SWSiwei Wang
Siwei Wang
XHXingchen Hu
Xingchen Hu
SZSihang Zhou
Sihang Zhou
XLXinwang Liu
Xinwang Liu
Temporal Graph Clustering (TGC) is a new task with little attention, focusing on node clustering in temporal graphs. Compared with existing static graph clustering, it can find the balance between time requirement and space requirement (Time-Space Balance) through the interaction sequence-based batch-processing pattern. However, there are two major challenges that hinder the development of TGC, i.e., inapplicable clustering techniques and inapplicable datasets. To address these challenges, we propose a comprehensive benchmark, called BenchTGC. Specially, we design a BenchTGC Framework to illustrate the paradigm of temporal graph clustering and improve existing clustering techniques to fit temporal graphs. In addition, we also discuss problems with public temporal graph datasets and develop multiple datasets suitable for TGC task, called BenchTGC Datasets. According to extensive experiments, we not only verify the advantages of BenchTGC, but also demonstrate the necessity and importance of TGC task. We wish to point out that the dynamically changing and complex scenarios in real world are the foundation of temporal graph clustering.

6 December 2024 in Knowledge-Based Systems
Verified
Journal Article
Closed access
ZZZefan Zeng
Zefan Zeng
QCQing Cheng
Qing Cheng
XHXingchen Hu
Xingchen Hu
YZYan Zhuang
Yan Zhuang
XLXinwang Liu
Xinwang Liu
ZLZhong Liu
Zhong Liu

28 April 2021 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
XHXingchen Hu
Xingchen Hu
Yinghua ShenYinghua Shen
Yinghua Shen
WPWitold Pedrycz
Witold Pedrycz
YLYan Li
Yan Li
GWGuohua Wu
Guohua Wu
Incomplete data are frequently encountered and bring difficulties when it comes to further processing. The concepts of granular computing (GrC) help deliver a higher level of abstraction to address this problem. Most of the existing data imputation and related modeling methods are of numeric nature and require prior numeric models to be provided. The underlying objective of this study is to introduce a novel and straightforward approach that uses information granules as a vehicle to effectively represent missing data and build granular fuzzy models directly from resulting hybrid granular and numeric data. The evaluation and optimization of this method are guided by the principle of justifiable granularity engaging the coverage and specificity criteria and carried out with the help of particle swarm optimization. We provide a collection of experimental studies using a synthetic dataset and several publicly available real-world datasets to demonstrate the feasibility and analyze the main features of this method.

1 December 2020 in Applied Soft Computing
Verified
Journal Article
Closed access
GJGuangyin Jin
Guangyin Jin
QWQi Wang
Qi Wang
CZCunchao Zhu
Cunchao Zhu
YFYanghe Feng
Yanghe Feng
JHJincai Huang
Jincai Huang
XHXingchen Hu
Xingchen Hu

1 August 2018 in Pattern Recognition
Verified
Journal Article
Closed access
XHXingchen Hu
Xingchen Hu
WPWitold Pedrycz
Witold Pedrycz
XWXianmin Wang
Xianmin Wang