{"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-via-boundary-erosion","title":"Clustering via Boundary Erosion","arxiv_id":"1804.04312","date":"2018-04-12","proceeding":null,"authors":["Cheng-Hao Deng","Wan-Lei Zhao"],"abstract":"Clustering analysis identifies samples as groups based on either their mutual\ncloseness or homogeneity. In order to detect clusters in arbitrary shapes, a\nnovel and generic solution based on boundary erosion is proposed. The clusters\nare assumed to be separated by relatively sparse regions. The samples are\neroded sequentially according to their dynamic boundary densities. The erosion\nstarts from low density regions, invading inwards, until all the samples are\neroded out. By this manner, boundaries between different clusters become more\nand more apparent. It therefore offers a natural and powerful way to separate\nthe clusters when the boundaries between them are hard to be drawn at once.\nWith the sequential order of being eroded, the sequential boundary levels are\nproduced, following which the clusters in arbitrary shapes are automatically\nreconstructed. As demonstrated across various clustering tasks, it is able to\noutperform most of the state-of-the-art algorithms and its performance is\nnearly perfect in some scenarios.","url_abs":"http://arxiv.org/abs/1804.04312v2","url_pdf":"http://arxiv.org/pdf/1804.04312v2.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-via-boundary-erosion","repo_url":"https://github.com/redfoxdch/beClustering","is_official":0,"mentioned_in_paper":0,"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":"redfoxdch/beClustering","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":"33e499c5c10cf0de2d900397b2733ced903380919415bb5a30a6756dbf894847","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}