A Novel Image Clustering Algorithm Based on Supported Nearest Neighbors

被引:0
|
作者
Li, Lin [1 ]
Zhang, Feng [1 ]
Zhang, Jiashuai [1 ]
Hua, Qiang [1 ]
Dong, Chun-Ru [1 ]
Lim, Chee-Peng [2 ]
机构
[1] Hebei Univ, Computat Intelligence Coll Math & Informat Sci, Hebei Key Lab Machine Learning, Shijiazhuang, Peoples R China
[2] Deakin Univ, Inst Intelligent Syst Res & Innovat, Melbourne, Australia
关键词
Deep clustering; contrastive learning; support set; NETWORK;
D O I
10.1142/S0129054122460017
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Unsupervised image clustering is a challenging task in computer vision. Recently, various deep clustering algorithms based on contrastive learning have achieved promising performance and some distinguishable features representation were obtained only by taking different augmented views of same image as positive pairs and maximizing their similarities, whereas taking other images' augmentations in the same batch as negative pairs and minimizing their similarities. However, due to the fact that there is more than one image in a batch belong to the same class, simply pushing the negative instances apart will result in inter-class conflictions and lead to the clustering performance degradation. In order to solve this problem, we propose a deep clustering algorithm based on supported nearest neighbors (SNDC), which constructs positive pairs of current images by maintaining a support set and find its k nearest neighbors from the support set. By going beyond single instance positive, SNDC can learn more generalized features representation with inherent semantic meaning and therefore alleviating inter-class conflictions. Experimental results on multiple benchmark datasets show that the performance of SNDC is superior to the state-of-the-art clustering models, with accuracy improvement of 6.2% and 20.5% on CIFAR-10 and ImageNet-Dogs respectively.
引用
收藏
页数:20
相关论文
共 50 条
  • [21] A UNIMODAL CLUSTERING-ALGORITHM BASED ON THE K-NEAREST NEIGHBORS METHOD
    KOVALENKO, AP
    AUTOMATION AND REMOTE CONTROL, 1993, 54 (05) : 794 - 798
  • [22] Clustering method based on nearest neighbors representation
    State Key Laboratory for Novel Software Technology , Nanjing
    210023, China
    Ruan Jian Xue Bao, 11 (2847-2855):
  • [23] A Novel Classification Algorithm Based on the Synergy Between Dynamic Clustering with Adaptive Distances and K-Nearest Neighbors
    Sabri, Mohammed
    Verde, Rosanna
    Balzanella, Antonio
    Maturo, Fabrizio
    Tairi, Hamid
    Yahyaouy, Ali
    Riffi, Jamal
    JOURNAL OF CLASSIFICATION, 2024, 41 (02) : 264 - 288
  • [24] A clustering algorithm using dynamic nearest neighbors selection model
    Jin, Yang
    Zuo, Wan-Li
    Jisuanji Xuebao/Chinese Journal of Computers, 2007, 30 (05): : 756 - 762
  • [25] KNN-SC: Novel Spectral Clustering Algorithm Using k-Nearest Neighbors
    Kim, Jeong-Hun
    Choi, Jong-Hyeok
    Park, Young-Ho
    Leung, Carson Kai-Sang
    Nasridinov, Aziz
    IEEE ACCESS, 2021, 9 : 152616 - 152627
  • [26] Density Peaks Clustering Algorithm Based on Representative Points and K-nearest Neighbors
    Zhang Q.-H.
    Zhou J.-P.
    Dai Y.-Y.
    Wang G.-Y.
    Ruan Jian Xue Bao/Journal of Software, 2023, 34 (12): : 5629 - 5648
  • [27] Selective Nearest Neighbors Clustering
    Sengupta, Souhardya
    Das, Swagatam
    PATTERN RECOGNITION LETTERS, 2022, 155 : 178 - 185
  • [28] Density Peak Clustering Algorithm Based on K-nearest Neighbors and Optimized Allocation Strategy
    Sun L.
    Qin X.-Y.
    Xu J.-C.
    Xue Z.-A.
    Ruan Jian Xue Bao/Journal of Software, 2022, 33 (04): : 1390 - 1411
  • [30] Density based clustering algorithm for distributed datasets using mutual K-nearest neighbors
    Salim A.
    International Journal of Advanced Computer Science and Applications, 2019, 10 (03): : 620 - 630