{"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/adaptive-low-rank-kernel-subspace-clustering","title":"Adaptive Low-Rank Kernel Subspace Clustering","arxiv_id":"1707.04974","date":"2017-07-17","proceeding":null,"authors":["Pan Ji","Ian Reid","Ravi Garg","Hongdong Li","Mathieu Salzmann"],"abstract":"In this paper, we present a kernel subspace clustering method that can handle\nnon-linear models. In contrast to recent kernel subspace clustering methods\nwhich use predefined kernels, we propose to learn a low-rank kernel matrix,\nwith which mapped data in feature space are not only low-rank but also\nself-expressive. In this manner, the low-dimensional subspace structures of the\n(implicitly) mapped data are retained and manifested in the high-dimensional\nfeature space. We evaluate the proposed method extensively on both motion\nsegmentation and image clustering benchmarks, and obtain superior results,\noutperforming the kernel subspace clustering method that uses standard\nkernels[Patel 2014] and other state-of-the-art linear subspace clustering\nmethods.","url_abs":"http://arxiv.org/abs/1707.04974v4","url_pdf":"http://arxiv.org/pdf/1707.04974v4.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":"adaptive-low-rank-kernel-subspace-clustering","repo_url":"https://github.com/panji1990/Low-rank-kernel-subspace-clustering","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"image-clustering","task_name":"Image Clustering"},{"task_slug":"motion-segmentation","task_name":"Motion Segmentation"}],"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":"panji1990/Low-rank-kernel-subspace-clustering","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":"a42c4804096acd455b0713d914822e890c8aa30aa189d691b02ff8c1f28b8657","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}