{"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/git-clustering-based-on-graph-of-intensity","title":"Git: Clustering Based on Graph of Intensity Topology","arxiv_id":"2110.01274","date":"2021-10-04","proceeding":null,"authors":["Zhangyang Gao","Haitao Lin","Cheng Tan","Lirong Wu","Stan. Z Li"],"abstract":"\\textbf{A}ccuracy, \\textbf{R}obustness to noises and scales, \\textbf{I}nterpretability, \\textbf{S}peed, and \\textbf{E}asy to use (ARISE) are crucial requirements of a good clustering algorithm. However, achieving these goals simultaneously is challenging, and most advanced approaches only focus on parts of them. Towards an overall consideration of these aspects, we propose a novel clustering algorithm, namely GIT (Clustering Based on \\textbf{G}raph of \\textbf{I}ntensity \\textbf{T}opology). GIT considers both local and global data structures: firstly forming local clusters based on intensity peaks of samples, and then estimating the global topological graph (topo-graph) between these local clusters. We use the Wasserstein Distance between the predicted and prior class proportions to automatically cut noisy edges in the topo-graph and merge connected local clusters as final clusters. Then, we compare GIT with seven competing algorithms on five synthetic datasets and nine real-world datasets. With fast local cluster detection, robust topo-graph construction and accurate edge-cutting, GIT shows attractive ARISE performance and significantly exceeds other non-convex clustering methods. For example, GIT outperforms its counterparts about $10\\%$ (F1-score) on MNIST and FashionMNIST. Code is available at \\color{red}{https://github.com/gaozhangyang/GIT}.","url_abs":"https://arxiv.org/abs/2110.01274v1","url_pdf":"https://arxiv.org/pdf/2110.01274v1.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":"git-clustering-based-on-graph-of-intensity","repo_url":"https://github.com/gaozhangyang/git","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"git-clustering-based-on-graph-of-intensity","repo_url":"https://github.com/gaozhangyang/DGC","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"git-clustering-based-on-graph-of-intensity","repo_url":"https://github.com/2024-MindSpore-1/Code2/tree/main/model-1/git","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"git-clustering-based-on-graph-of-intensity","repo_url":"https://github.com/yangyucheng000/University/tree/main/model-2/git","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"clustering-algorithms-evaluation","task_name":"Clustering Algorithms Evaluation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/clustering-algorithms-evaluation-on-fashion-2","task":"Clustering Algorithms Evaluation","dataset":"Fashion-MNIST","model":"AE+GIT","rank_in_archive_order":1,"of":6,"metrics":{"ARI":"49%","F1-score":"65%","NMI":"61%"},"uses_additional_data":false},{"leaderboard":"/sota/clustering-algorithms-evaluation-on-fashion-2","task":"Clustering Algorithms Evaluation","dataset":"Fashion-MNIST","model":"k-Means++","rank_in_archive_order":2,"of":6,"metrics":{"ARI":"35%","F1-score":"39%","NMI":"51%"},"uses_additional_data":false},{"leaderboard":"/sota/clustering-algorithms-evaluation-on-fashion-2","task":"Clustering Algorithms Evaluation","dataset":"Fashion-MNIST","model":"Spectral Clustering","rank_in_archive_order":3,"of":6,"metrics":{"ARI":"34%","F1-score":"43%","NMI":"49%"},"uses_additional_data":false},{"leaderboard":"/sota/clustering-algorithms-evaluation-on-fashion-2","task":"Clustering Algorithms Evaluation","dataset":"Fashion-MNIST","model":"GIT","rank_in_archive_order":4,"of":6,"metrics":{"ARI":"32%","F1-score":"56%","NMI":"51%"},"uses_additional_data":false},{"leaderboard":"/sota/clustering-algorithms-evaluation-on-fashion-2","task":"Clustering Algorithms Evaluation","dataset":"Fashion-MNIST","model":"SpectACI","rank_in_archive_order":5,"of":6,"metrics":{"ARI":"29%","F1-score":"47%","NMI":"45%"},"uses_additional_data":false},{"leaderboard":"/sota/clustering-algorithms-evaluation-on-fashion-2","task":"Clustering Algorithms Evaluation","dataset":"Fashion-MNIST","model":"QuickShiftPP","rank_in_archive_order":6,"of":6,"metrics":{"ARI":"16%","F1-score":"42%","NMI":"41%"},"uses_additional_data":false},{"leaderboard":"/sota/clustering-algorithms-evaluation-on-mnist","task":"Clustering Algorithms Evaluation","dataset":"MNIST","model":"AE+GIT","rank_in_archive_order":1,"of":6,"metrics":{"ARI":"77%","F1-score":"88%","NMI":"81%"},"uses_additional_data":false},{"leaderboard":"/sota/clustering-algorithms-evaluation-on-mnist","task":"Clustering Algorithms Evaluation","dataset":"MNIST","model":"GIT","rank_in_archive_order":2,"of":6,"metrics":{"ARI":"42%","F1-score":"59%","NMI":"53%"},"uses_additional_data":false},{"leaderboard":"/sota/clustering-algorithms-evaluation-on-mnist","task":"Clustering Algorithms Evaluation","dataset":"MNIST","model":"k-Means++","rank_in_archive_order":3,"of":6,"metrics":{"ARI":"36%","F1-score":"50%","NMI":"45%"},"uses_additional_data":false},{"leaderboard":"/sota/clustering-algorithms-evaluation-on-mnist","task":"Clustering Algorithms Evaluation","dataset":"MNIST","model":"Spectral Clustering","rank_in_archive_order":4,"of":6,"metrics":{"ARI":"33%","F1-score":"41%","NMI":"44%"},"uses_additional_data":false},{"leaderboard":"/sota/clustering-algorithms-evaluation-on-mnist","task":"Clustering Algorithms Evaluation","dataset":"MNIST","model":"SpectACI","rank_in_archive_order":5,"of":6,"metrics":{"ARI":"17%","F1-score":"40%","NMI":"33%"},"uses_additional_data":false},{"leaderboard":"/sota/clustering-algorithms-evaluation-on-mnist","task":"Clustering Algorithms Evaluation","dataset":"MNIST","model":"QuickShiftPP","rank_in_archive_order":6,"of":6,"metrics":{"ARI":"13%","F1-score":"45%","NMI":"45%"},"uses_additional_data":false},{"leaderboard":"/sota/clustering-algorithms-evaluation-on-olivetti","task":"Clustering Algorithms Evaluation","dataset":"Olivetti face","model":"GIT","rank_in_archive_order":1,"of":5,"metrics":{"ARI":"45%","F1-score":"62%","NMI":"78%"},"uses_additional_data":false},{"leaderboard":"/sota/clustering-algorithms-evaluation-on-olivetti","task":"Clustering Algorithms Evaluation","dataset":"Olivetti face","model":"QuickShiftPP","rank_in_archive_order":2,"of":5,"metrics":{"ARI":"38%","F1-score":"60%","NMI":"79%"},"uses_additional_data":false},{"leaderboard":"/sota/clustering-algorithms-evaluation-on-olivetti","task":"Clustering Algorithms Evaluation","dataset":"Olivetti face","model":"k-Means++","rank_in_archive_order":3,"of":5,"metrics":{"ARI":"38%","F1-score":"52%","NMI":"74%"},"uses_additional_data":false},{"leaderboard":"/sota/clustering-algorithms-evaluation-on-olivetti","task":"Clustering Algorithms Evaluation","dataset":"Olivetti face","model":"Spectral Clustering","rank_in_archive_order":4,"of":5,"metrics":{"ARI":"19%","F1-score":"37%","NMI":"66%"},"uses_additional_data":false},{"leaderboard":"/sota/clustering-algorithms-evaluation-on-olivetti","task":"Clustering Algorithms Evaluation","dataset":"Olivetti face","model":"SpectACI","rank_in_archive_order":5,"of":5,"metrics":{"ARI":"21%","F1-score":"34%","NMI":"61%"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"gaozhangyang/git","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"gaozhangyang/DGC","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"2024-MindSpore-1/Code2","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"yangyucheng000/University","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2409.12191"],"harvested_for_calls":[{"arxiv_id":"2409.12191","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2409.12191"},"call":"get_harvested_code_for_paper(arxiv_id=\"2409.12191\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"be362edea127b41528a85d7edcfd8e037456fe47256e16393d0abf0b10ddffdf","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}