{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T22:43:51Z","timestamp":1765233831687,"version":"3.38.0"},"reference-count":42,"publisher":"Tech Science Press","issue":"1","license":[{"start":{"date-parts":[[2024,7,19]],"date-time":"2024-07-19T00:00:00Z","timestamp":1721347200000},"content-version":"vor","delay-in-days":200,"URL":"https:\/\/doi.org\/10.32604\/TSP-CROSSMARKPOLICY"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["CMC"],"published-print":{"date-parts":[[2024]]},"DOI":"10.32604\/cmc.2024.051816","type":"journal-article","created":{"date-parts":[[2024,6,28]],"date-time":"2024-06-28T07:40:20Z","timestamp":1719560420000},"page":"281-298","update-policy":"https:\/\/doi.org\/10.32604\/tsp-crossmarkpolicy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Clustering Network Based on Matrix Factorization"],"prefix":"10.32604","volume":"80","author":[{"given":"Jieren","family":"Cheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jimei","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Faqiang","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhicong","family":"Tao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yue","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"17807","published-online":{"date-parts":[[2024]]},"reference":[{"key":"ref1","doi-asserted-by":"crossref","first-page":"127041","DOI":"10.1016\/j.neucom.2023.127041","article-title":"WSNMF: Weighted symmetric nonnegative matrix factorization for attributed graph clustering","volume":"566","author":"Berahmand","year":"2024","journal-title":"Neurocomputing"},{"key":"ref2","first-page":"1","article-title":"A deep semi-supervised community detection based on point-wise mutual information","author":"Berahmand","year":"2023","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"key":"ref3","first-page":"2148","article-title":"Multi-view contrastive graph clustering","volume":"34","author":"Pan","year":"2021","journal-title":"Adv. Neural Inf. Process Syst."},{"key":"ref4","series-title":"Proc. Twenty-Eighth Int. Joint Conf. Artif. Intell.","first-page":"3670","article-title":"Attributed graph clustering: A deep attentional embedding approach","author":"Wang","year":"2019"},{"key":"ref5","series-title":"Proc. web conf. 2020","first-page":"1400","article-title":"Structural deep clustering network","author":"Bo","year":"2020"},{"key":"ref6","series-title":"Proc. AAAI Conf. Artif. Intell.","first-page":"9978","article-title":"Deep fusion clustering network","volume":"35","author":"Tu","year":"2021"},{"key":"ref7","series-title":"Proc. 29th ACM Int. Conf. Multimed.","first-page":"935","article-title":"Attention-driven graph clustering network","author":"Peng","year":"2021"},{"key":"ref8","series-title":"Proc. IEEE\/CVF Int. Conf. Comput. Vision","first-page":"6519","article-title":"Symmetric graph convolutional autoencoder for unsupervised graph representation learning","author":"Park","year":"2019"},{"key":"ref9","series-title":"Proc. Twenty-Ninth Int. Conf. Int. Joint Conf. Artif. Int.","first-page":"2973","article-title":"Multi-view attribute graph convolution networks for clustering","author":"Cheng","year":"2021"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"2475","DOI":"10.1109\/TCYB.2019.2932096","article-title":"Learning graph embedding with adversarial training methods","volume":"50","author":"Pan","year":"2019","journal-title":"IEEE Trans. Cybern."},{"key":"ref11","series-title":"Proc. 28th Int. Joint Conf. Artif. Intell.","first-page":"3562","article-title":"Adversarial graph embedding for ensemble clustering","author":"Tao","year":"2019"},{"key":"ref12","series-title":"Proc. 26th ACM SIGKDD Int. Conf. Knowl. Discov. Data Min.","first-page":"976","article-title":"Adaptive graph encoder for attributed graph embedding","author":"Cui","year":"2020"},{"key":"ref13","series-title":"Int. Conf. Mach. Learn.","first-page":"4116","article-title":"Contrastive multi-view representation learning on graphs","author":"Hassani","year":"2020"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.neunet.2021.10.006","article-title":"Multi-view graph embedding clustering network: Joint self-supervision and block diagonal representation","volume":"145","author":"Xia","year":"2022","journal-title":"Neural Netw."},{"key":"ref15","series-title":"Proc. AAAI Con. Artif. Intell.","first-page":"7603","article-title":"Deep graph clustering via dual correlation reduction","volume":"36","author":"Liu","year":"2022"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/j.ins.2022.09.042","article-title":"Multilayer graph contrastive clustering network","volume":"613","author":"Liu","year":"2022","journal-title":"Inf. Sci."},{"key":"ref17","doi-asserted-by":"crossref","first-page":"83","DOI":"10.26599\/BDMA.2018.9020003","article-title":"Multi-view clustering: A survey, big data mining and analytics","volume":"1","author":"Yang","year":"2018","journal-title":"Big Data Min. Anal."},{"key":"ref18","series-title":"Eleventh Int. Conf. Learn. Rep.","first-page":"1","article-title":"LightGCL: Simple yet effective graph contrastive learning for recommendation","author":"Cai","year":"2022"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s13042-021-01307-7","article-title":"Multi-view data clustering via non-negative matrix factorization with manifold regularization","volume":"13","author":"Khan","year":"2022","journal-title":"Int. J. Mach. Learn. Cybern."},{"key":"ref20","series-title":"Int. Conf. Mach. Learn.","first-page":"1597","article-title":"A simple framework for contrastive learning of visual representations","author":"Chen","year":"2020"},{"key":"ref21","series-title":"Int. Conf. Mach. Learn.","first-page":"12310","article-title":"Barlow twins: Self-supervised learning via redundancy reduction","author":"Zbontar","year":"2021"},{"key":"ref22","series-title":"Proc. IEEE\/CVF Int. Conf. Comput. Vis.","first-page":"9224","article-title":"Graph contrastive clustering","author":"Zhong","year":"2021"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"2054","DOI":"10.1109\/TNNLS.2022.3186512","article-title":"Interpolation-based contrastive learning for few-label semi-supervised learning","volume":"35","author":"Yang","year":"2022","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"ref24","first-page":"5812","article-title":"Graph contrastive learning with augmentations","volume":"33","author":"You","year":"2020","journal-title":"Adv. Neural Inf. Process Syst."},{"key":"ref25","series-title":"Proc. ACM Web Conf. 2022","first-page":"1070","article-title":"SimGRACE: A simple framework for graph contrastive learning without data augmentation","author":"Xia","year":"2022"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"109631","DOI":"10.1016\/j.knosys.2022.109631","article-title":"Graph barlow twins: A self-supervised representation learning framework for graphs","volume":"256","author":"Bielak","year":"2022","journal-title":"Knowl. Based Syst."},{"key":"ref27","first-page":"7372","article-title":"Augmentation-free self-supervised learning on graphs","volume":"36","author":"Lee","year":"2022","journal-title":"Proc. AAAI Conf. Artif. Intell."},{"key":"ref28","series-title":"IJCAI","first-page":"1","article-title":"Attributed graph clustering with dual redundancy reduction","author":"Gong","year":"2022"},{"key":"ref29","series-title":"Proc. 27th Int. Conf. Mach. Learn. (ICML-10)","first-page":"807","article-title":"Rectified linear units improve restricted boltzmann machines","author":"Nair","year":"2010"},{"key":"ref30","first-page":"1","article-title":"Rethinking graph auto-encoder models for attributed graph clustering","author":"Mrabah","year":"2022","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref31","doi-asserted-by":"crossref","first-page":"1351","DOI":"10.1109\/TNNLS.2019.2919900","article-title":"Multiple kernel clustering with neighbor-kernel subspace segmentation","volume":"31","author":"Zhou","year":"2019","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"ref32","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1109\/TIP.2021.3131941","article-title":"Fast parameter-free multi-view subspace clustering with consensus anchor guidance","volume":"31","author":"Wang","year":"2021","journal-title":"IEEE Trans. Image Process."},{"key":"ref33","doi-asserted-by":"crossref","first-page":"4359","DOI":"10.1109\/TNNLS.2021.3117403","article-title":"Late fusion multiple kernel clustering with proxy graph refinement","volume":"34","author":"Wang","year":"2021","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"ref34","series-title":"Proc. ACM Web Conf. 2023","first-page":"737","article-title":"GraphMAE2: A decoding-enhanced masked self-supervised graph learner","author":"Hou","year":"2023"},{"key":"ref35","series-title":"Int. Conf. Mach. Learn.","first-page":"3861","article-title":"Towards K-means-friendly spaces: Simultaneous deep learning and clustering","author":"Yang","year":"2017"},{"key":"ref36","series-title":"Int. Conf. Mach. Learn.","first-page":"478","article-title":"Unsupervised deep embedding for clustering analysis","author":"Xie","year":"2016"},{"key":"ref37","series-title":"Int. Conf. Learn. Rep.","first-page":"1","article-title":"Simple spectral graph convolution","author":"Zhu","year":"2020"},{"key":"ref38","first-page":"1","article-title":"Scalable attributed-graph subspace clustering","volume":"37","author":"Fettal","year":"2023","journal-title":"Proc. AAAI Conf. Artif. Intell."},{"key":"ref39","series-title":"Proc. Thirtieth Int. Joint Conf. Artif. Intell.","first-page":"3434","article-title":"Graph debiased contrastive learning with joint representation clustering","author":"Zhao","year":"2021"},{"key":"ref40","series-title":"Int. Conf. Mach. Learn.","first-page":"24332","article-title":"ProGCL: Rethinking hard negative mining in graph contrastive learning","author":"Xia","year":"2022"},{"key":"ref41","series-title":"10th Int. Conf. Learn. Rep. (ICLR 2022)","article-title":"Automated self-supervised learning for graphs","author":"Jin","year":"2022"},{"key":"ref42","series-title":"Proc. 31st ACM Int. Conf. Multimed.","first-page":"3857","article-title":"Self-contrastive graph diffusion network","author":"Ma","year":"2023"}],"container-title":["Computers, Materials & Continua"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.techscience.com\/files\/cmc\/2024\/TSP_CMC-80-1\/TSP_CMC_51816\/TSP_CMC_51816.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T11:38:06Z","timestamp":1741261086000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.techscience.com\/cmc\/v80n1\/57400"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":42,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024]]},"published-print":{"date-parts":[[2024]]}},"URL":"https:\/\/doi.org\/10.32604\/cmc.2024.051816","relation":{},"ISSN":["1546-2226"],"issn-type":[{"type":"electronic","value":"1546-2226"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"2024-03-15","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-05-21","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-07-18","order":2,"name":"published","label":"Published Online","group":{"name":"publication_history","label":"Publication History"}}]}}