{"url":"/sota/image-clustering-on-mnist-full","task":{"name":"Image Clustering","url":"/task/image-clustering","note":null},"dataset":{"name":"MNIST-full","url":"/dataset/mnist"},"category":"Computer Vision","categories":["Computer Vision"],"category_note":null,"description":"Models that partition the dataset into semantically meaningful clusters without having access to the ground truth labels. \r\n\r\n<span style=\"color:grey; opacity: 0.6\"> Image credit: ImageNet clustering results of [SCAN: Learning to Classify Images without Labels (ECCV 2020)](https://arxiv.org/abs/2005.12320) </span>","description_from":"task","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["NMI","Accuracy"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"NMI":null,"Accuracy":"higher"}},"counts":{"rows":16,"rows_with_code":14,"rows_with_paper_page":16,"rows_dated":16,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"SPC","metrics":{"Accuracy":"0.992","NMI":"0.975"},"uses_additional_data":false,"paper_date":"2021-07-22","paper":"/paper/selective-pseudo-label-clustering","paper_url":"https://arxiv.org/abs/2107.10692v1","paper_title":"Selective Pseudo-label Clustering","code":"https://github.com/Lou1sM/clustering","n_code_links":1,"syntology":null},{"rank_in_archive_order":2,"model":"ADEC","metrics":{"Accuracy":"0.990","NMI":"0.971"},"uses_additional_data":false,"paper_date":"2019-09-26","paper":"/paper/adversarial-deep-embedded-clustering-on-a","paper_url":"https://arxiv.org/abs/1909.11832v1","paper_title":"Adversarial Deep Embedded Clustering: on a better trade-off between Feature Randomness and Feature Drift","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":3,"model":"N2D (UMAP)","metrics":{"Accuracy":"0.987","NMI":"0.964"},"uses_additional_data":false,"paper_date":"2019-08-16","paper":"/paper/n2dnot-too-deep-clustering-via-clustering-the","paper_url":"https://arxiv.org/abs/1908.05968v6","paper_title":"N2D: (Not Too) Deep Clustering via Clustering the Local Manifold of an Autoencoded Embedding","code":"https://github.com/rymc/n2d","n_code_links":5,"syntology":{"n_ran":2,"n_unverified":2,"n_samples":4,"n_pointer_only_licence":2}},{"rank_in_archive_order":4,"model":"DynAE","metrics":{"Accuracy":"0.987","NMI":"0.964"},"uses_additional_data":false,"paper_date":"2019-01-23","paper":"/paper/deep-clustering-with-a-dynamic-autoencoder","paper_url":"https://arxiv.org/abs/1901.07752v5","paper_title":"Deep Clustering with a Dynamic Autoencoder: From Reconstruction towards Centroids Construction","code":"https://github.com/nairouz/DynAE","n_code_links":1,"syntology":null},{"rank_in_archive_order":5,"model":"DDC-DA","metrics":{"Accuracy":"0.986","NMI":"0.961"},"uses_additional_data":false,"paper_date":"2018-12-11","paper":"/paper/deep-density-based-image-clustering","paper_url":"http://arxiv.org/abs/1812.04287v1","paper_title":"Deep Density-based Image Clustering","code":"https://github.com/Yazhou-Ren/DDC","n_code_links":1,"syntology":null},{"rank_in_archive_order":6,"model":"DEN","metrics":{"Accuracy":"0.984","NMI":"0.956"},"uses_additional_data":false,"paper_date":"2020-06-11","paper":"/paper/interpretable-visualizations-with","paper_url":"https://arxiv.org/abs/2006.06640v1","paper_title":"Interpretable Visualizations with Differentiating Embedding Networks","code":"https://github.com/isaacrob/DEN","n_code_links":1,"syntology":null},{"rank_in_archive_order":7,"model":"DTI-Clustering","metrics":{"Accuracy":"0.979","NMI":"0.942"},"uses_additional_data":false,"paper_date":"2020-06-19","paper":"/paper/deep-transformation-invariant-clustering","paper_url":"https://arxiv.org/abs/2006.11132v2","paper_title":"Deep Transformation-Invariant Clustering","code":"https://github.com/monniert/dti-clustering","n_code_links":1,"syntology":{"n_ran":1,"n_unverified":9,"n_samples":10,"n_pointer_only_licence":0}},{"rank_in_archive_order":8,"model":"EnSC","metrics":{"Accuracy":"0.969","NMI":"0.941"},"uses_additional_data":false,"paper_date":"2016-05-09","paper":"/paper/oracle-based-active-set-algorithm-for","paper_url":"http://arxiv.org/abs/1605.02633v1","paper_title":"Oracle Based Active Set Algorithm for Scalable Elastic Net Subspace Clustering","code":"https://github.com/ChongYou/subspace-clustering","n_code_links":1,"syntology":null},{"rank_in_archive_order":9,"model":"ClusterGAN","metrics":{"Accuracy":"0.973","NMI":"0.940"},"uses_additional_data":false,"paper_date":"2019-06-01","paper":"/paper/balanced-self-paced-learning-for-generative","paper_url":"http://openaccess.thecvf.com/content_CVPR_2019/html/Ghasedi_Balanced_Self-Paced_Learning_for_Generative_Adversarial_Clustering_Network_CVPR_2019_paper.html","paper_title":"Balanced Self-Paced Learning for Generative Adversarial Clustering Network","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":10,"model":"DBC","metrics":{"Accuracy":"0.976","NMI":"0.937"},"uses_additional_data":false,"paper_date":"2017-03-23","paper":"/paper/discriminatively-boosted-image-clustering","paper_url":"http://arxiv.org/abs/1703.07980v1","paper_title":"Discriminatively Boosted Image Clustering with Fully Convolutional Auto-Encoders","code":"https://github.com/waynezhanghk/gacluster","n_code_links":2,"syntology":null},{"rank_in_archive_order":11,"model":"PSSC","metrics":{"Accuracy":"0.964","NMI":"0.921"},"uses_additional_data":false,"paper_date":"2020-11-23","paper":"/paper/scattering-transform-based-image-clustering","paper_url":"https://arxiv.org/abs/2011.11586v2","paper_title":"Scattering Transform Based Image Clustering using Projection onto Orthogonal Complement","code":"https://github.com/vmorgenshtern/scattering-clustering","n_code_links":1,"syntology":null},{"rank_in_archive_order":12,"model":"VMM","metrics":{"Accuracy":"0.967","NMI":"0.920"},"uses_additional_data":false,"paper_date":"2024-02-06","paper":"/paper/the-vampprior-mixture-model","paper_url":"https://arxiv.org/abs/2402.04412v2","paper_title":"The VampPrior Mixture Model","code":"https://github.com/astirn/vampprior-mixture-model","n_code_links":1,"syntology":null},{"rank_in_archive_order":13,"model":"JULE-RC","metrics":{"Accuracy":"0.964","NMI":"0.917"},"uses_additional_data":false,"paper_date":"2016-04-13","paper":"/paper/joint-unsupervised-learning-of-deep","paper_url":"http://arxiv.org/abs/1604.03628v3","paper_title":"Joint Unsupervised Learning of Deep Representations and Image Clusters","code":"https://github.com/jwyang/jule.torch","n_code_links":3,"syntology":{"n_ran":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":14,"model":"GDL","metrics":{"Accuracy":"0.965","NMI":"0.913"},"uses_additional_data":false,"paper_date":"2012-08-25","paper":"/paper/graph-degree-linkage-agglomerative-clustering","paper_url":"http://arxiv.org/abs/1208.5092v1","paper_title":"Graph Degree Linkage: Agglomerative Clustering on a Directed Graph","code":"https://github.com/waynezhanghk/gactoolbox","n_code_links":2,"syntology":null},{"rank_in_archive_order":15,"model":"SR-K-means","metrics":{"NMI":"0.913"},"uses_additional_data":false,"paper_date":"2018-10-09","paper":"/paper/deep-clustering-on-the-link-between","paper_url":"https://arxiv.org/abs/1810.04246v2","paper_title":"Deep clustering: On the link between discriminative models and K-means","code":"https://github.com/MOhammedJAbi/SoftKMeans","n_code_links":1,"syntology":null},{"rank_in_archive_order":16,"model":"Tree-SNE","metrics":{"NMI":"0.864"},"uses_additional_data":false,"paper_date":"2020-02-13","paper":"/paper/tree-sne-hierarchical-clustering-and","paper_url":"https://arxiv.org/abs/2002.05687v1","paper_title":"Tree-SNE: Hierarchical Clustering and Visualization Using t-SNE","code":"https://github.com/isaacrob/treesne","n_code_links":1,"syntology":null}],"since_archive":{"claim":"Results that newer papers report for their own method, placed here by Syntology. A model pointed at the cell in the paper's own table; the number was read from that cell and checked against this leaderboard's metric, dataset, split and scale; an independent check that saw this leaderboard's other rows and every other leaderboard on the same dataset accepted it. Not reviewed by the paper's authors or by the archive's editors, and not ranked against the archive rows.","extraction_file_present":true,"measurement":{"test_papers":883,"papers_with_output":881,"judged_true":108,"judged":110,"wilson95_lower":0.9361,"measured_on":"2026-09-24","frozen_commit":"0e3de0df94"},"measurement_note":"blind adjudication of accepted entries on a held-out split of archive papers, rules frozen before the test","coverage":{"sentence":"Syntology has checked 6,264 of the 9,581 papers on this site that are newer than the archive; results from the others appear after they are checked.","complete":false,"papers_newer_than_archive":9581,"papers_checked":6264,"papers_extracted_not_yet_verified":0,"boards_without_verdict":2,"papers_not_yet_extracted":3316},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per row: N of M harvested code samples from that row's paper executed on a synthesized fixture; the other M-N are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","rows_with_graph_line":3,"rows_with_any_sample_ran":2,"distinct_papers_with_graph_line":3,"distinct_papers_with_any_sample_ran":2,"samples_over_distinct_papers":{"n_ran":3,"n_unverified":12,"n_samples":15,"n_pointer_only_licence":2,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":3,"n_unverified":12,"n_samples":15,"n_pointer_only_licence":2,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}}}