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 条
  • [31] An adaptive mutual K-nearest neighbors clustering algorithm based on maximizing mutual information
    Wang, Yizhang
    Pang, Wei
    Jiao, Zhixiang
    PATTERN RECOGNITION, 2023, 137
  • [32] A multi-center clustering algorithm based on mutual nearest neighbors for arbitrarily distributed data
    Tong, Wuning
    Wang, Yuping
    Liu, Delong
    Guo, Xiulin
    INTEGRATED COMPUTER-AIDED ENGINEERING, 2022, 29 (03) : 259 - 275
  • [33] Density Peaks Clustering Algorithm Based on Weighted k-Nearest Neighbors and Geodesic Distance
    Liu, Lina
    Yu, Donghua
    IEEE ACCESS, 2020, 8 : 168282 - 168296
  • [34] A Fuzzy Density Peaks Clustering Algorithm Based on Improved DNA Genetic Algorithm and K-Nearest Neighbors
    Zhang, Wenqian
    Zang, Wenke
    INTELLIGENCE SCIENCE AND BIG DATA ENGINEERING, 2018, 11266 : 476 - 487
  • [36] Fast reciprocal nearest neighbors clustering
    Lopez-Sastre, Roberto J.
    Onoro-Rubio, Daniel
    Gil-Jimenez, Pedro
    Maldonado-Bascon, Saturnino
    SIGNAL PROCESSING, 2012, 92 (01) : 270 - 275
  • [37] ALGORITHM FOR FINDING NEAREST NEIGHBORS
    DELANNOY, C
    RAIRO-INFORMATIQUE-COMPUTER SCIENCE, 1980, 14 (03): : 275 - 286
  • [38] Soft Inference as a Voting Mechanism in k-Nearest Neighbors Clustering Algorithm
    Bury, Tomasz
    Kacprzak, Aleksandra
    Zerdzinski, Piotr
    INFORMATION AND SOFTWARE TECHNOLOGIES, ICIST 2023, 2024, 1979 : 309 - 318
  • [39] An adaptive k-nearest neighbors clustering algorithm for complex distribution dataset
    Zhang, Yan
    Jia, Yan
    Huang, Xiaobin
    Zhou, Bin
    Gu, Jian
    ADVANCED INTELLIGENT COMPUTING THEORIES AND APPLICATIONS, PROCEEDINGS: WITH ASPECTS OF ARTIFICIAL INTELLIGENCE, 2007, 4682 : 398 - 407
  • [40] Density peaks clustering algorithm with K-nearest neighbors and weighted similarity
    Zhao J.
    Chen L.
    Wu R.-X.
    Zhang B.
    Han L.-Z.
    Kongzhi Lilun Yu Yingyong/Control Theory and Applications, 2022, 39 (12): : 2349 - 2357