{"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/ensemble-learning-for-spectral-clustering","title":"Ensemble Learning for Spectral Clustering","arxiv_id":null,"date":"2020-11-20","proceeding":null,"authors":["Hongmin Li","Xiucai Ye","Akira Imakura","Tetsuya Sakurai"],"abstract":"Ensemble clustering has attracted much attention in machine learning and data mining for the high performance in the task of clustering. Spectral clustering is one of the most popular clustering methods and has superior performance compared with the traditional clustering methods. Existing ensemble clustering methods usually directly use the clustering results of the base clustering algorithms for ensemble learning, which cannot make good use of the intrinsic data structures explored by the graph Laplacians in spectral clustering, thus cannot obtain the desired clustering result. In this paper, we propose a new ensemble learning method for spectral clustering-based clustering algorithms. Instead of directly using the clustering results obtained from each base spectral clustering algorithm, the proposed method learns a robust presentation of graph Laplacian by ensemble learning from the spectral embedding of each base spectral clustering algorithm. Finally, the proposed method applies k-means on the spectral embedding obtain from the learned graph Laplacian to get clusters. Experimental results on both synthetic and real-world datasets show that the proposed method outperforms other existing ensemble clustering methods.","url_abs":"https://ieeexplore.ieee.org/document/9338349","url_pdf":"https://scholar.google.com/scholar_url?url=https://www.computer.org/csdl/pds/api/csdl/proceedings/download-article/1r54GbKzRdu/pdf%3Fcasa_token%3Dx1Nb_lJqLlcAAAAA:DPz3ReM6KGDlssLERhLHXS-KoqLClMeS5iiK0o2QhAvmKpsl2Umkk2oeWpQH5xmaagT0ALi43N4&hl=en&sa=T&oi=gsb-gga&ct=res&cd=0&d=13812841914647698097&ei=drqOYL62HILUyATd4pf4Dg&scisig=AAGBfm2wg99cdm46BHPq6pB_ZGwaThq2Fw","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":"ensemble-learning-for-spectral-clustering","repo_url":"https://github.com/Li-Hongmin/MyPaperWithCode","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"ensemble-learning","task_name":"Ensemble Learning"},{"task_slug":"imagedocument-clustering","task_name":"Image/Document Clustering"}],"methods":[{"method_slug":"ensemble-clustering","method_name":"Ensemble Clustering"},{"method_slug":"spectral-clustering","method_name":"Spectral Clustering"}],"datasets_introduced":[{"slug":"iris-1","name":"iris","full_name":"iris"},{"slug":"warppie10p","name":"warpPIE10P","full_name":"warpPIE10P"}],"methods_introduced":[{"slug":"ensemble-clustering","name":"Ensemble Clustering","full_name":"Ensemble Clustering"}],"results":[{"leaderboard":"/sota/image-document-clustering-on-ba","task":"Image/Document Clustering","dataset":"BA","model":"ELSC","rank_in_archive_order":1,"of":1,"metrics":{"Accuracy (%)":"51.8"},"uses_additional_data":false},{"leaderboard":"/sota/image-document-clustering-on-jaffe-1","task":"Image/Document Clustering","dataset":"JAFFE","model":"ELSC","rank_in_archive_order":1,"of":1,"metrics":{"Accuracy (%)":"98.6"},"uses_additional_data":false},{"leaderboard":"/sota/image-document-clustering-on-wine","task":"Image/Document Clustering","dataset":"Wine","model":"ELSC","rank_in_archive_order":1,"of":1,"metrics":{"Accuracy (%)":"75.8"},"uses_additional_data":false},{"leaderboard":"/sota/image-document-clustering-on-australian","task":"Image/Document Clustering","dataset":"australian","model":"ELSC","rank_in_archive_order":1,"of":1,"metrics":{"Accuracy (%)":"70.9"},"uses_additional_data":false},{"leaderboard":"/sota/image-document-clustering-on-iris","task":"Image/Document Clustering","dataset":"iris","model":"ELSC","rank_in_archive_order":1,"of":1,"metrics":{"Accuracy (%)":"97.7"},"uses_additional_data":false},{"leaderboard":"/sota/image-document-clustering-on-pixraw10p","task":"Image/Document Clustering","dataset":"pixraw10P","model":"ELSC","rank_in_archive_order":1,"of":1,"metrics":{"Accuracy (%)":"96.0"},"uses_additional_data":false},{"leaderboard":"/sota/image-document-clustering-on-warppie10p","task":"Image/Document Clustering","dataset":"warpPIE10P","model":"ELSC","rank_in_archive_order":1,"of":1,"metrics":{"Accuracy (%)":"53.4"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"Li-Hongmin/MyPaperWithCode","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":"72929d59f228e338eab131e365ea211b69204c7d080c8d56155ba8ba8fe9fb9e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}