{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T17:58:14Z","timestamp":1777053494497,"version":"3.51.4"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/access.2023.3260971","type":"journal-article","created":{"date-parts":[[2023,3,23]],"date-time":"2023-03-23T17:49:36Z","timestamp":1679593776000},"page":"30197-30207","source":"Crossref","is-referenced-by-count":9,"title":["Self-Weighted Graph-Based Framework for Multi-View Clustering"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6330-8991","authenticated-orcid":false,"given":"Yanfang","family":"He","sequence":"first","affiliation":[{"name":"School of Computer Sciences, Universiti Sains Malaysia, Gelugor, Penang, Malaysia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4358-7430","authenticated-orcid":false,"given":"Umi Kalsom","family":"Yusof","sequence":"additional","affiliation":[{"name":"School of Computer Sciences, Universiti Sains Malaysia, Gelugor, Penang, Malaysia"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2018.11.007"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5756"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-021-01421-6"},{"key":"ref4","first-page":"1881","article-title":"Parameter-free auto-weighted multiple graph learning: A framework for multiview clustering and semi-supervised classification","volume-title":"Proc. Int. Joint Conf. Artif. Intell.","author":"Nie"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2681670"},{"key":"ref6","article-title":"An efficient k-means clustering algorithm","volume":"43","author":"Alsabti","year":"1997","journal-title":"Electr. Eng. Comput. Sci."},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/icdm.2004.10095"},{"key":"ref8","first-page":"393","article-title":"A co-training approach for multi-view spectral clustering","volume-title":"Proc. 28th Int. Conf. Mach. Learn. (ICML)","author":"Kumar"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972795.55"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.105102"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.482"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2603983"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2022.3192445"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.inffus.2022.10.020"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2009.2038764"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10302"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/357"},{"key":"ref18","first-page":"113","article-title":"Multi-view clustering with adaptively learned graph","volume-title":"Proc. Asian Conf. Mach. Learn.","author":"Tao"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2725263"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.10909"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2903810"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9598"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v28i1.8950"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2018.2817538"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-45062-4_17"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.3021649"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2018.2829867"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2017.2754939"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2913377"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1201\/9781315373515-8"},{"issue":"12","key":"ref31","first-page":"871","article-title":"The Laplacian spectrum of graphs","volume-title":"Graph Theory, Combinatorics, and Applications","volume":"2","author":"Mohar","year":"1991"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623726"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-017-3036-2"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1090\/cbms\/092"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.35.11.652"},{"key":"ref36","first-page":"1","article-title":"Efficient and robust feature selection via joint \u21132,1-norms minimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"23","author":"Nie"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.43"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2018.10.022"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2023.3236698"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10005208\/10078860.pdf?arnumber=10078860","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,13]],"date-time":"2024-02-13T15:19:22Z","timestamp":1707837562000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10078860\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/access.2023.3260971","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]}}}