{"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/multi-view-low-rank-sparse-subspace","title":"Multi-view Low-rank Sparse Subspace Clustering","arxiv_id":"1708.08732","date":"2017-08-29","proceeding":null,"authors":["Maria Brbic","Ivica Kopriva"],"abstract":"Most existing approaches address multi-view subspace clustering problem by\nconstructing the affinity matrix on each view separately and afterwards propose\nhow to extend spectral clustering algorithm to handle multi-view data. This\npaper presents an approach to multi-view subspace clustering that learns a\njoint subspace representation by constructing affinity matrix shared among all\nviews. Relying on the importance of both low-rank and sparsity constraints in\nthe construction of the affinity matrix, we introduce the objective that\nbalances between the agreement across different views, while at the same time\nencourages sparsity and low-rankness of the solution. Related low-rank and\nsparsity constrained optimization problem is for each view solved using the\nalternating direction method of multipliers. Furthermore, we extend our\napproach to cluster data drawn from nonlinear subspaces by solving the\ncorresponding problem in a reproducing kernel Hilbert space. The proposed\nalgorithm outperforms state-of-the-art multi-view subspace clustering\nalgorithms on one synthetic and four real-world datasets.","url_abs":"http://arxiv.org/abs/1708.08732v1","url_pdf":"http://arxiv.org/pdf/1708.08732v1.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":"multi-view-low-rank-sparse-subspace","repo_url":"https://github.com/mbrbic/Multi-view-LRSSC","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"multi-view-low-rank-sparse-subspace","repo_url":"https://github.com/mbrbic/MultiViewLRSSC","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"multi-view-subspace-clustering","task_name":"Multi-view Subspace Clustering"}],"methods":[{"method_slug":"spectral-clustering","method_name":"Spectral Clustering"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1708.08732","atlas_url":"https://app.syntology.ai/?focus=1708.08732","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":"1708.08732"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1708.08732\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1708.08732"},"call":"get_concepts_for_paper(arxiv_id=\"1708.08732\")"}],"by_repo":[{"repo":"mbrbic/Multi-view-LRSSC","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"mbrbic/MultiViewLRSSC","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":"7318e7090ae3e885644492b2899800b1f8b7d9615558ecf4dd789dd434759c6c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}