The paper introduces FedDCN, a federated deep clustering network that jointly optimizes reconstruction and clustering losses for high‑dimensional, heterogeneous data. It addresses challenges of non‑IID client data by generating synthetic augmentations and applying geometric regularization to align latent spaces. Experiments show the method’s effectiveness under both IID and non‑IID settings, and the authors outline future research directions.
By Morris Stallmann, Charalampos S. Kouzinopoulos, Marcin Pietrasik, Anna Wilbik
arXiv:2403.14830v2 Announce Type: replace
Abstract: Deep clustering partitions complex high-dimensional data using deep neural networks for clustering. It involves projecting data into lower-dimensio...
By Zeya Wang, Chenglong Ye
arXiv:2608. 00346v1 Announce Type: new Abstract: Data imbalance poses a major challenge in supervised classification, where the majority-class bias contributes to false negatives and overestimates classification accuracy.
By Pulock Das, Yina Hou, Md. Kamrozzaman Bhuiyan, Manar D. Samad
The paper introduces a selective inference framework tailored for deep clustering that uses a fixed pretrained encoder to map high‑dimensional data into a latent space before clustering. It addresses the complex selection bias arising from the nonlinear transformation and offers a computationally tractable method to perform valid statistical tests on cluster differences. Experiments on synthetic data show controlled Type I error and higher power compared to conservative baselines, while genomic case studies demonstrate the ability to uncover significant cluster differences while properly accounting for selection bias.
By Eina Mizui, Tomohiro Shiraishi, Shunichi Nishino, Ichiro Takeuchi
arXiv:2609.36648v1 Announce Type: new
Abstract: Vision-language pre-training has reshaped image clustering, giving rise to language-assisted image clustering (LaIC), which leverages textual semantics...
By Yuanwei Hu, Bo Peng, Yuheng Jia, Xinting Hu, Yadan Luo, Wenjie Zhu
arXiv:2607. 06887v1 Announce Type: new Abstract: Most self-supervised image clustering models, actually almost all deep learning approaches, are based on gradient descent: In order to calculate the loss, every optimization step requires a clearly defined target, whether a contrastive split, a masked patch or entity, an EMA-teacher output, a pseudo-label, or a differentiable information-theoretic functional.
By Canlin Zhang, Xiuwen Liu
arXiv:2604. 07085v2 Announce Type: replace Abstract: In electronic health records (EHRs), clustering patients and distinguishing disease subtypes are key tasks to elucidate pathophysiology and aid clinical decision-making.
By Manar D. Samad, Yina Hou, Shrabani Ghosh
arXiv:2509. 25289v4 Announce Type: replace-cross Abstract: Identifying an effective clustering algorithm for a given dataset remains a fundamental unsupervised learning issue.
By Mohammadreza Bakhtyari, Bogdan Mazoure, Renato Cordeiro de Amorim, Guillaume Rabusseau, Vladimir Makarenkov
Fed-BRDECS is a federated deep embedded clustering framework that protects client privacy by replacing globally normalized clustering objectives with a locally computable sample‑stability loss, eliminating the need to share sensitive soft‑assignment distributions. It addresses non‑IID client data through prediction‑balanced sampling, which oversamples rare predicted clusters, and centroid‑level restarting, which refreshes biased or inactive centroids. Experiments on image, text, and time‑series datasets demonstrate that Fed‑BRDECS outperforms existing federated and deep clustering methods while adding no inference‑time cost for anomaly detection.
By Haemin Park, Diego Klabjan, Martin W. Braun, Xiuqi Li, Balakrishnan Ananthanarayanan
arXiv:2610.17314v1 Announce Type: cross
Abstract: Deep learning has become the dominant form of machine learning due in part, to its ability to automatically engineer complex meta features from data....
By Rishav Mukherjee, Jeffrey Ahearn Thompson
arXiv:2610. 09760v1 Announce Type: new Abstract: Transformers have in-context learning capabilities, where some known learning algorithms can be executed in the forward pass through the model.
By Charlotte Park, Kenneth L. Clarkson, Lior Horesh, Takuya Ito, Parikshit Ram
The paper introduces CoCo, a conjoint framework for deep graph clustering that emphasizes compactness and consistency in node representations. CoCo uses graph convolutional filters to learn robust embeddings from both local and global views, then encodes them into low‑rank compact embeddings to reduce redundancy and noise. A consistency learning strategy further enriches node semantics, enabling knowledge transfer between perspectives and yielding superior performance over state‑of‑the‑art methods on multiple datasets.
By Wei Ju, Siyu Yi, Kangjie Zheng, Yifan Wang, Ziyue Qiao, Li Shen, Yongdao Zhou, Xiaochun Cao, Jiancheng Lv