{"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/clustering-with-confidence-finding-clusters","title":"Clustering with Confidence: Finding Clusters with Statistical Guarantees","arxiv_id":"1612.08714","date":"2016-12-27","proceeding":null,"authors":["Andreas Henelius","Kai Puolamäki","Henrik Boström","Panagiotis Papapetrou"],"abstract":"Clustering is a widely used unsupervised learning method for finding\nstructure in the data. However, the resulting clusters are typically presented\nwithout any guarantees on their robustness; slightly changing the used data\nsample or re-running a clustering algorithm involving some stochastic component\nmay lead to completely different clusters. There is, hence, a need for\ntechniques that can quantify the instability of the generated clusters. In this\nstudy, we propose a technique for quantifying the instability of a clustering\nsolution and for finding robust clusters, termed core clusters, which\ncorrespond to clusters where the co-occurrence probability of each data item\nwithin a cluster is at least $1 - \\alpha$. We demonstrate how solving the core\nclustering problem is linked to finding the largest maximal cliques in a graph.\nWe show that the method can be used with both clustering and classification\nalgorithms. The proposed method is tested on both simulated and real datasets.\nThe results show that the obtained clusters indeed meet the guarantees on\nrobustness.","url_abs":"http://arxiv.org/abs/1612.08714v2","url_pdf":"http://arxiv.org/pdf/1612.08714v2.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":"clustering-with-confidence-finding-clusters","repo_url":"https://github.com/bwrc/corecluster-r","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"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":"bwrc/corecluster-r","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":"8f2637d7eb266fb561c4a100d0e052182b3d07c0fa6044d3893abbaf24028977","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}