{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T15:56:16Z","timestamp":1781798176322,"version":"3.54.5"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"Program of Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62176212"],"award-info":[{"award-number":["62176212"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1109\/tnnls.2025.3539628","type":"journal-article","created":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T13:58:19Z","timestamp":1740578299000},"page":"15167-15180","source":"Crossref","is-referenced-by-count":2,"title":["Harmonic Fast One-Step Cut: An Efficient Strategy for Spectral Clustering Optimization"],"prefix":"10.1109","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9868-8936","authenticated-orcid":false,"given":"Jingwei","family":"Chen","sequence":"first","affiliation":[{"name":"Jiangxi Key Laboratory of Flood and Drought Disaster Defense, Jiangxi Academy of Water Science and Engineering, Nanchang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shasha","family":"Fu","sequence":"additional","affiliation":[{"name":"Jiangxi Key Laboratory of Flood and Drought Disaster Defense, Jiangxi Academy of Water Science and Engineering, Nanchang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2560-9528","authenticated-orcid":false,"given":"Hui","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Electrical and Automation Engineering and the Key Laboratory of Advanced Control and Optimization of Jiangxi Province, East China Jiaotong University, Nanchang, Jiangxi, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0871-6519","authenticated-orcid":false,"given":"Feiping","family":"Nie","sequence":"additional","affiliation":[{"name":"School of Artificial Intelligence, OPtics and ElectroNics (iOPEN), School of Computer Science and the Key Laboratory of Intelligent Interaction and Applications, Ministry of Industry and Information Technology, Northwestern Polytechnical University, Xi’an, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2020.3011269"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58555-6_20"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2020.3025688"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2023.109340"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1038\/s42256-021-00333-y"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2020.02.005"},{"issue":"1","key":"ref7","first-page":"87","article-title":"Ball kk-means: Fast adaptive clustering with no bounds","volume":"44","author":"Xia","year":"2022","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0098-3004(84)90020-7"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-007-9033-z"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2023.3282938"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2022.3217343"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/34.244673"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/43.159993"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2018.2811764"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2020.3002587"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.23952\/jnva.6.2022.1.02"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9053271"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-017-3036-2"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2019.2909425"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.10780"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.inffus.2024.102347"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2022.3171088"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2023.3275299"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2019.2944565"},{"key":"ref26","first-page":"577","article-title":"Constrained k-means clustering with background knowledge","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wagstaff"},{"key":"ref27","first-page":"8","article-title":"Constrained K-Means clustering","volume":"20","author":"Bennett","year":"2000","journal-title":"Microsoft Res., Redmond"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.227"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-020-01320-3"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TAI.2021.3123126"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-021-00958-4"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2021.3081990"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2021.108517"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2023.118994"},{"key":"ref35","first-page":"874","article-title":"Spectral clustering with graph neural networks for graph pooling","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Bianchi"},{"key":"ref36","first-page":"14855","article-title":"Efficient clustering based on a unified view of k-means and ratio-cut","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Pei"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1155\/2019\/5864020"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623726"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/5962385\/11114436\/10905055.pdf?arnumber=10905055","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T18:41:23Z","timestamp":1765219283000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10905055\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8]]},"references-count":38,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2025.3539628","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"value":"2162-237X","type":"print"},{"value":"2162-2388","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8]]}}}