Yu Duan

Dr. Yu Duan

orcid

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
12 June 2024 in Neurocomputing
Verified
Journal Article
Closed access
YDYu Duan
Yu Duan
DWDanyang Wu
Danyang Wu
RWRong Wang
Rong Wang
XLXuelong Li
Xuelong Li
FNFeiping Nie
Feiping Nie

12 January 2024 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
YDYu Duan
Yu Duan
ZLZhoumin Lu
Zhoumin Lu
RWRong Wang
Rong Wang
XLXuelong Li
Xuelong Li
FNFeiping Nie
Feiping Nie
The goal of balanced clustering is partitioning data into distinct groups of equal size. Previous studies have attempted to address this problem by designing balanced regularizers or utilizing conventional clustering methods. However, these methods often rely solely on classic methods, which limits their performance and primarily focuses on low-dimensional data. Although neural networks exhibit effective performance on high-dimensional datasets, they struggle to effectively leverage prior knowledge for clustering with a balanced tendency. To overcome the above limitations, we propose deep semisupervised balanced clustering, which simultaneously learns clustering and generates balance-favorable representations. Our model is based on the autoencoder paradigm incorporating a semisupervised module. Specifically, we introduce a balance-oriented clustering loss and incorporate pairwise constraints into the penalty term as a pluggable module using the Lagrangian multiplier method. Theoretically, we ensure that the proposed model maintains a balanced orientation and provides a comprehensive optimization process. Empirically, we conducted extensive experiments on four datasets to demonstrate significant improvements in clustering performance and balanced measurements. Our code is available at https://github.com/DuannYu/BalancedSemi-TNNLS.

17 September 2024 in IEEE Transactions on Fuzzy Systems
Verified
Journal Article
Closed access
RZRunxin Zhang
Runxin Zhang
YDYu Duan
Yu Duan
FNFeiping Nie
Feiping Nie
RWRong Wang
Rong Wang
XLXuelong Li
Xuelong Li
Deep fuzzy clustering employs neural networks to discover the low-dimensional embedding space of data, providing an effective solution to the clustering problem posed by high-dimensional data. Although some algorithms have achieved good results in application, the field still faces the following problems: the lack of clustering loss function limits the development of deep clustering, and most of them use the self-training strategy-based KL divergence; some algorithms directly use conventional constrained clustering objective function as the loss function in deep models, and update network parameters alternately, the optimization process is cumbersome. Focusing on the issues mentioned above, this paper firstly proposed an unconstrained fuzzy c-means algorithm that can be solved using gradient descent and then used it as the clustering loss function to obtain a novel deep fuzzy clustering model named Unsupervised Deep Embedding for Fuzzy Clustering. The proposed model simultaneously learns the low-dimensional representation of data and performs fuzzy clustering. It updates parameters through gradient descent and backpropagation, achieving end-to-end optimization. The proposed algorithm's effectiveness and competitiveness are fully demonstrated through extensive experiments conducted on image and text datasets.

8 February 2024 in Neurocomputing
Verified
Journal Article
Closed access
YDYu Duan
Yu Duan
FNFeiping Nie
Feiping Nie
RWRong Wang
Rong Wang
XLXuelong Li
Xuelong Li

5 July 2024 in IEEE Transactions on Fuzzy Systems
Verified
Journal Article
Closed access
HCHuimin Chen
Huimin Chen
YDYu Duan
Yu Duan
FNFeiping Nie
Feiping Nie
RWRong Wang
Rong Wang
XLXuelong Li
Xuelong Li
Fuzzy theory, which extends precise binary logic to continuous fuzzy logic, provides an effective tool for uncertainty problems in machine learning and thus evolved fuzzy methods such as fuzzy c-means and fuzzy graph clustering. Among them, graph-based clustering methods have become a hot spot in the field of unsupervised clustering due to their good ability to process nonlinear data. Unfortunately, they usually suffer from high time complexity and cumbersome regularization parameter tuning, so their practical applications are greatly limited. To this end, we propose an efficient graph-cut algorithm called fS2F. Based on the similarity graph between the dataset and landmark subset, fS2F transforms the membership learning of the entire dataset into a clustering problem of representative points, which greatly improves its clustering efficiency. In addition, fS2F softly constrains the cluster size in a way that does not require additional regularization parameters so that it can be widely and conveniently applied. The paper also presents the optimization method for this model and demonstrates its effectiveness through experiments.

3 July 2025 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
YDYu Duan
Yu Duan
HCHuimin Chen
Huimin Chen
RZRunxin Zhang
Runxin Zhang
RWRong Wang
Rong Wang
FNFeiping Nie
Feiping Nie
XLXuelong Li
Xuelong Li
Existing deep clustering methods leverage contrastive or non-contrastive learning to facilitate downstream tasks. Most contrastive-based methods typically learn representations by comparing positive pairs (two views of the same sample) against negative pairs (views of different samples). However, we spot that this hard treatment of samples inadequately models inter-sample relationships, leading to class collision and degraded clustering performance. In this paper, we propose a soft neighbor supported contrastive clustering method to address this issue. Specifically, we propose the perception radius concept to quantify similarity confidence between a sample and its neighbors. Building on this insight, we design a two-level soft neighbor loss that captures both local and global neighborhood relationships. Additionally, a cluster-level loss enforces compact and well-separated cluster distributions. Finally, we introduce a pseudo-label refinement strategy to mitigate false negative samples. Extensive experiments on benchmark datasets demonstrate the superiority of our method. The code is available at https://github.com/DuannYu/soft-neighbors–supported-clustering.