{"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-continuous-clustering","title":"Deep Continuous Clustering","arxiv_id":"1803.01449","date":"2018-03-05","proceeding":"ICLR 2018 1","authors":["Sohil Atul Shah","Vladlen Koltun"],"abstract":"Clustering high-dimensional datasets is hard because interpoint distances\nbecome less informative in high-dimensional spaces. We present a clustering\nalgorithm that performs nonlinear dimensionality reduction and clustering\njointly. The data is embedded into a lower-dimensional space by a deep\nautoencoder. The autoencoder is optimized as part of the clustering process.\nThe resulting network produces clustered data. The presented approach does not\nrely on prior knowledge of the number of ground-truth clusters. Joint nonlinear\ndimensionality reduction and clustering are formulated as optimization of a\nglobal continuous objective. We thus avoid discrete reconfigurations of the\nobjective that characterize prior clustering algorithms. Experiments on\ndatasets from multiple domains demonstrate that the presented algorithm\noutperforms state-of-the-art clustering schemes, including recent methods that\nuse deep networks.","url_abs":"http://arxiv.org/abs/1803.01449v1","url_pdf":"http://arxiv.org/pdf/1803.01449v1.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-continuous-clustering","repo_url":"https://github.com/shahsohil/DCC","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"deep-continuous-clustering","repo_url":"https://github.com/ilyak93/DCC","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"deep-continuous-clustering","repo_url":"https://github.com/waynezhanghk/gacluster","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"BSD-2-Clause"}}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"dimensionality-reduction","task_name":"Dimensionality Reduction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1803.01449","atlas_url":"https://app.syntology.ai/?focus=1803.01449","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":"1803.01449"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1803.01449\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1803.01449"},"call":"get_concepts_for_paper(arxiv_id=\"1803.01449\")"}],"by_repo":[{"repo":"shahsohil/DCC","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"ilyak93/DCC","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"waynezhanghk/gacluster","kind":"listed","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":"a39652ca01d7e44d5d40d742f0315a993919c5c79fb9311a04c3a932fb258134","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}