{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/deep-comprehensive-correlation-mining-for","title":"Deep Comprehensive Correlation Mining for Image Clustering","arxiv_id":"1904.06925","date":"2019-04-15","proceeding":"ICCV 2019 10","authors":["Jianlong Wu","Keyu Long","Fei Wang","Chen Qian","Cheng Li","Zhouchen Lin","Hongbin Zha"],"abstract":"Recent developed deep unsupervised methods allow us to jointly learn representation and cluster unlabelled data. These deep clustering methods mainly focus on the correlation among samples, e.g., selecting high precision pairs to gradually tune the feature representation, which neglects other useful correlations. In this paper, we propose a novel clustering framework, named deep comprehensive correlation mining(DCCM), for exploring and taking full advantage of various kinds of correlations behind the unlabeled data from three aspects: 1) Instead of only using pair-wise information, pseudo-label supervision is proposed to investigate category information and learn discriminative features. 2) The features' robustness to image transformation of input space is fully explored, which benefits the network learning and significantly improves the performance. 3) The triplet mutual information among features is presented for clustering problem to lift the recently discovered instance-level deep mutual information to a triplet-level formation, which further helps to learn more discriminative features. Extensive experiments on several challenging datasets show that our method achieves good performance, e.g., attaining $62.3\\%$ clustering accuracy on CIFAR-10, which is $10.1\\%$ higher than the state-of-the-art results.","url_abs":"https://arxiv.org/abs/1904.06925v3","url_pdf":"https://arxiv.org/pdf/1904.06925v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"deep-comprehensive-correlation-mining-for","repo_url":"https://github.com/Cory-M/DCCM","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"GPL-3.0"}}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"deep-clustering","task_name":"Deep Clustering"},{"task_slug":"image-clustering","task_name":"Image Clustering"},{"task_slug":"pseudo-label","task_name":"Pseudo Label"},{"task_slug":null,"task_name":"Triplet"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/image-clustering-on-cifar-10","task":"Image Clustering","dataset":"CIFAR-10","model":"DCCM","rank_in_archive_order":31,"of":40,"metrics":{"ARI":"0.408","Accuracy":"0.623","Backbone":"AlexNet","NMI":"0.496","Train set":"Train+Test"},"uses_additional_data":true},{"leaderboard":"/sota/image-clustering-on-cifar-100","task":"Image Clustering","dataset":"CIFAR-100","model":"DCCM","rank_in_archive_order":23,"of":30,"metrics":{"Accuracy":"0.327","NMI":"0.285","Train Set":"Train+Test"},"uses_additional_data":true},{"leaderboard":"/sota/image-clustering-on-imagenet-10","task":"Image Clustering","dataset":"ImageNet-10","model":"DCCM","rank_in_archive_order":13,"of":18,"metrics":{"Accuracy":"0.71","NMI":"0.608"},"uses_additional_data":false},{"leaderboard":"/sota/image-clustering-on-imagenet-dog-15","task":"Image Clustering","dataset":"Imagenet-dog-15","model":"DCCM","rank_in_archive_order":14,"of":20,"metrics":{"Accuracy":"0.383","NMI":"0.321"},"uses_additional_data":false},{"leaderboard":"/sota/image-clustering-on-stl-10","task":"Image Clustering","dataset":"STL-10","model":"DCCM","rank_in_archive_order":24,"of":29,"metrics":{"Accuracy":"0.482","Backbone":"AlexNet","NMI":"0.376","Train Split":"Train+Test"},"uses_additional_data":true},{"leaderboard":"/sota/image-clustering-on-tiny-imagenet","task":"Image Clustering","dataset":"Tiny-ImageNet","model":"DCCM","rank_in_archive_order":9,"of":14,"metrics":{"Accuracy":"0.108","NMI":"0.224"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1904.06925","atlas_url":"https://app.syntology.ai/?focus=1904.06925","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1904.06925"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1904.06925\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1904.06925"},"call":"get_concepts_for_paper(arxiv_id=\"1904.06925\")"}],"by_repo":[{"repo":"Cory-M/DCCM","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"079efcfdaa15d05bebabcd220bc8844a05d3d72a222eea5d85c013fc3a84e796","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}