{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T15:56:03Z","timestamp":1774713363316,"version":"3.50.1"},"reference-count":29,"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\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100004052","name":"King Abdullah University of Science and Technology (KAUST) Office of Sponsored Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004052","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007446","name":"Deanship of Scientific Research, King Khalid University, Saudi Arabia","doi-asserted-by":"publisher","award":["RGP1\/357\/43"],"award-info":[{"award-number":["RGP1\/357\/43"]}],"id":[{"id":"10.13039\/501100007446","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/access.2023.3236608","type":"journal-article","created":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T21:23:28Z","timestamp":1673558608000},"page":"5824-5836","source":"Crossref","is-referenced-by-count":7,"title":["Constrained Clustering: General Pairwise and Cardinality Constraints"],"prefix":"10.1109","volume":"11","author":[{"given":"Adel","family":"Bibi","sequence":"first","affiliation":[{"name":"Department of Engineering Science, University of Oxford, Oxford, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1052-2657","authenticated-orcid":false,"given":"Ali","family":"Alqahtani","sequence":"additional","affiliation":[{"name":"Department of Computer Science, King Khalid University, Abha, Saudi Arabia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernard","family":"Ghanem","sequence":"additional","affiliation":[{"name":"Visual Computing Center, King Abdullah University of Science and Technology, Thuwal, Saudi Arabia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/2.781637"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2011.6033226"},{"key":"ref3","first-page":"57","article-title":"Semi-supervised classification by low density separation","volume-title":"Proc. Int. Workshop Artif. Intell. Statist. (AISTATS)","author":"Chapelle"},{"key":"ref4","first-page":"577","article-title":"Clustering with instance-level constraints","volume-title":"Proc. AAAI\/IAAI","author":"Wagstaff"},{"key":"ref5","first-page":"307","article-title":"From instance-level constraints to space-level constraints: Making the most of prior knowledge in data clustering","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Klein"},{"key":"ref6","first-page":"1","article-title":"On spectral clustering: Analysis and an algorithm","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"14","author":"Ng"},{"key":"ref7","article-title":"Constrained k-means clustering","author":"Bradley","year":"2000"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15567-3_1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-007-9033-z"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1162\/neco.2007.19.6.1528"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972733.27"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.450"},{"key":"ref13","first-page":"577","article-title":"Constrained k-means clustering with background knowledge","volume-title":"Proc. ICML","volume":"1","author":"Wagstaff"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79474-5_8"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/11893004_9"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2845842"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/BF00114265"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014062"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.355"},{"key":"ref21","volume-title":"A Unified View of Kernel K-Means, Spectral Clustering and Graph Cuts","author":"Dhillon","year":"2004"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973730.97"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40994-3_27"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/050641983"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/bf01908075"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmva.2006.11.013"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2018.8451506"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-29888-3_18"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.3390\/electronics10233001"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10005208\/10015761.pdf?arnumber=10015761","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,13]],"date-time":"2024-02-13T06:57:29Z","timestamp":1707807449000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10015761\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/access.2023.3236608","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]}}}