{"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/path-based-spectral-clustering-guarantees","title":"Path-Based Spectral Clustering: Guarantees, Robustness to Outliers, and Fast Algorithms","arxiv_id":"1712.06206","date":"2017-12-17","proceeding":null,"authors":["Anna Little","Mauro Maggioni","James M. Murphy"],"abstract":"We consider the problem of clustering with the longest-leg path distance\n(LLPD) metric, which is informative for elongated and irregularly shaped\nclusters. We prove finite-sample guarantees on the performance of clustering\nwith respect to this metric when random samples are drawn from multiple\nintrinsically low-dimensional clusters in high-dimensional space, in the\npresence of a large number of high-dimensional outliers. By combining these\nresults with spectral clustering with respect to LLPD, we provide conditions\nunder which the Laplacian eigengap statistic correctly determines the number of\nclusters for a large class of data sets, and prove guarantees on the labeling\naccuracy of the proposed algorithm. Our methods are quite general and provide\nperformance guarantees for spectral clustering with any ultrametric. We also\nintroduce an efficient, easy to implement approximation algorithm for the LLPD\nbased on a multiscale analysis of adjacency graphs, which allows for the\nruntime of LLPD spectral clustering to be quasilinear in the number of data\npoints.","url_abs":"http://arxiv.org/abs/1712.06206v2","url_pdf":"http://arxiv.org/pdf/1712.06206v2.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":"path-based-spectral-clustering-guarantees","repo_url":"https://bitbucket.org/annavlittle/llpd_code","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"}],"methods":[{"method_slug":"spectral-clustering","method_name":"Spectral Clustering"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1712.06206","atlas_url":"https://app.syntology.ai/?focus=1712.06206","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":"1712.06206"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1712.06206\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1712.06206"},"call":"get_concepts_for_paper(arxiv_id=\"1712.06206\")"}],"by_repo":[{"repo":"bitbucket.org/annavlittle/llpd_code","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":"83654c352bd0c0b4a3bc19c5429bad1a17dc3af2c3369cabe92705746e62cb4e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}