{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,23]],"date-time":"2026-10-23T19:16:55Z","timestamp":1792783015952,"version":"4.5.0"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2026,8,13]],"date-time":"2026-08-13T00:00:00Z","timestamp":1786579200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,8,13]],"date-time":"2026-08-13T00:00:00Z","timestamp":1786579200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"University of Helsinki","id":[{"id":"https:\/\/ror.org\/040af2s02","id-type":"ROR","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2026,9]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Constraint-based Deep Active Clustering (CODAC) integrates actively selected pairwise constraints into deep representation learning to efficiently improve existing cluster structures, even under tight query budgets. CODAC encodes the constraint information into the embedding so that the learned representation can generalize to unconstrained data, leading to a rapid improvement of the clustering quality even on large datasets. CODAC makes minimal assumptions regarding the data and can be combined with a wide variety of deep clustering models. It does not require the number of clusters to be known a priori and is even effective if the initial estimate is badly misspecified. Across diverse image, text, and tabular datasets, CODAC consistently attains higher cluster quality with fewer queries than the previous state-of-the-art, and can substantially improve the clustering quality with just 100\u2013200 queries compared to the deep clustering baselines.<\/jats:p>","DOI":"10.1007\/s10618-026-01229-4","type":"journal-article","created":{"date-parts":[[2026,8,13]],"date-time":"2026-08-13T04:20:58Z","timestamp":1786594858000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["CODAC: Constraint-based Deep Active Clustering"],"prefix":"10.1007","volume":"40","author":[{"given":"Anri","family":"Patron","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sandra","family":"Gilhuber","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kai","family":"Puolam\u00e4ki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Collin","family":"Leiber","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,8,13]]},"reference":[{"key":"1229_CR1","first-page":"243","volume":"70","author":"K Asadi","year":"2017","unstructured":"Asadi K, Littman ML (2017) An alternative softmax operator for reinforcement learning. ICML 70:243\u2013252","journal-title":"ICML"},{"key":"1229_CR2","doi-asserted-by":"publisher","unstructured":"Basu S, Banerjee A, Mooney RJ (2004) Active semi-supervision for pairwise constrained clustering. In: SDM, pp 333\u2013344. https:\/\/doi.org\/10.1137\/1.9781611972740.31","DOI":"10.1137\/1.9781611972740.31"},{"key":"1229_CR3","doi-asserted-by":"publisher","unstructured":"Cui Y, Zhang X, Zong L, Mu J (2021) Maintaining consistency with constraints: a constrained deep clustering method. In: PAKDD (2), vol. 12713, pp 219\u2013230. https:\/\/doi.org\/10.1007\/978-3-030-75765-6_18","DOI":"10.1007\/978-3-030-75765-6_18"},{"key":"1229_CR4","unstructured":"Deng X, Liu J, Zhong H, Feng F, Shen C, He X, Ye J, Wang Z (2024) A3S: a general active clustering method with pairwise constraints. ICML. pp 10488\u201310505"},{"key":"1229_CR5","doi-asserted-by":"publisher","unstructured":"Fu X, Xie W-B, Chen B, Deng T, Zou T, Wang X (2024) ACDM: an effective and scalable active clustering with pairwise constraint. In: CIKM, pp 643\u2013652. https:\/\/doi.org\/10.1145\/3627673.3679601","DOI":"10.1145\/3627673.3679601"},{"key":"1229_CR6","doi-asserted-by":"publisher","unstructured":"Guo X, Gao L, Liu X, Yin J (2017) Improved deep embedded clustering with local structure preservation. In: IJCAI, pp 1753\u20131759. https:\/\/doi.org\/10.24963\/ijcai.2017\/243","DOI":"10.24963\/ijcai.2017\/243"},{"issue":"5","key":"1229_CR7","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s10462-024-11103-8","volume":"58","author":"G Gonz\u00e1lez-Almagro","year":"2025","unstructured":"Gonz\u00e1lez-Almagro G, Peralta D, Poorter ED, Cano JR, Garc\u00eda S (2025) Semi-supervised constrained clustering: an in-depth overview, ranked taxonomy and future research directions. Artif Intell Rev 58(5):157. https:\/\/doi.org\/10.1007\/s10462-024-11103-8","journal-title":"Artif Intell Rev"},{"issue":"6","key":"1229_CR8","doi-asserted-by":"publisher","first-page":"7509","DOI":"10.1109\/TPAMI.2022.3216454","volume":"45","author":"Z Huang","year":"2023","unstructured":"Huang Z, Chen J, Zhang J, Shan H (2023) Learning representation for clustering via prototype scattering and positive sampling. IEEE Trans Pattern Anal Mach Intell 45(6):7509\u20137524. https:\/\/doi.org\/10.1109\/TPAMI.2022.3216454","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"1229_CR9","doi-asserted-by":"publisher","first-page":"1059739","DOI":"10.3389\/fnbot.2022.1059739","volume":"16","author":"J Huang","year":"2022","unstructured":"Huang J, Ding W, Zhang J, Li Z, Shu T, Kuosmanen P, Zhou G, Zhou C, Yu G (2022) Variational deep embedding-based active learning for the diagnosis of pneumonia. Front Neurorobot 16:1059739. https:\/\/doi.org\/10.3389\/fnbot.2022.1059739","journal-title":"Front Neurorobot"},{"key":"1229_CR10","doi-asserted-by":"publisher","unstructured":"Kingma DP, Ba J (2015) Adam: a method for stochastic optimization. In: ICLR (Poster). https:\/\/doi.org\/10.48550\/arXiv.1412.6980","DOI":"10.48550\/arXiv.1412.6980"},{"key":"1229_CR11","doi-asserted-by":"publisher","unstructured":"Leiber C, Bauer LGM, Schelling B, B\u00f6hm C, Plant C (2021) Dip-based deep embedded clustering with k-estimation. In: KDD, pp 903\u2013913. https:\/\/doi.org\/10.1145\/3447548.3467316","DOI":"10.1145\/3447548.3467316"},{"key":"1229_CR12","doi-asserted-by":"publisher","first-page":"42369","DOI":"10.52202\/079017-1341","volume":"37","author":"H Liu","year":"2024","unstructured":"Liu H, Hu P, Zhang C, Li Y, Peng X (2024) Interactive deep clustering via value mining. Adv Neural Inf Process Syst 37:42369\u201342387. https:\/\/doi.org\/10.52202\/079017-1341","journal-title":"Adv Neural Inf Process Syst"},{"issue":"2","key":"1229_CR13","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"SP Lloyd","year":"1982","unstructured":"Lloyd SP (1982) Least squares quantization in PCM. IEEE Trans Inf Theory 28(2):129\u2013136. https:\/\/doi.org\/10.1109\/TIT.1982.1056489","journal-title":"IEEE Trans Inf Theory"},{"key":"1229_CR14","doi-asserted-by":"crossref","unstructured":"Liu J, Liu J, Yan S, Jiang R, Tian X, Gu B, Chen Y, Shen C, Huang J (2022) MPC: multi-view probabilistic clustering. In: CVPR, pp 9509\u20139518","DOI":"10.1109\/CVPR52688.2022.00929"},{"key":"1229_CR15","doi-asserted-by":"publisher","unstructured":"Leiber C, Miklautz L, Plant C, B\u00f6hm C (2023) Benchmarking deep clustering algorithms with ClustPy. In: ICDM (Workshops), pp 625\u2013632. https:\/\/doi.org\/10.1109\/ICDMW60847.2023.00087","DOI":"10.1109\/ICDMW60847.2023.00087"},{"key":"1229_CR16","doi-asserted-by":"publisher","unstructured":"Leiber C, Miklautz L, Plant C, B\u00f6hm C (2025) An introductory survey to autoencoder-based deep clustering - sandboxes for combining clustering with deep learning. https:\/\/doi.org\/10.48550\/arXiv.2504.02087","DOI":"10.48550\/arXiv.2504.02087"},{"key":"1229_CR17","unstructured":"Manduchi L, Chin-Cheong K, Michel H, Wellmann S, Vogt JE (2021) Deep conditional gaussian mixture model for constrained clustering. In: NeurIPS, pp 11303\u201311314"},{"key":"1229_CR18","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.patrec.2020.07.028","volume":"138","author":"M Moradi Fard","year":"2020","unstructured":"Moradi Fard M, Thonet T, Gaussier E (2020) Deep k-Means: jointly clustering with k-Means and learning representations. Pattern Recognit Lett 138:185\u2013192. https:\/\/doi.org\/10.1016\/j.patrec.2020.07.028","journal-title":"Pattern Recognit Lett"},{"key":"1229_CR19","doi-asserted-by":"crossref","unstructured":"Ronen M, Finder SE, Freifeld O (2022) Deepdpm: deep clustering with an unknown number of clusters. In: CVPR, pp 9851\u20139860","DOI":"10.1109\/CVPR52688.2022.00963"},{"key":"1229_CR20","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.neucom.2018.10.016","volume":"325","author":"Y Ren","year":"2019","unstructured":"Ren Y, Hu K, Dai X, Pan L, Hoi SCH, Xu Z (2019) Semi-supervised deep embedded clustering. Neurocomputing 325:121\u2013130. https:\/\/doi.org\/10.1016\/j.neucom.2018.10.016","journal-title":"Neurocomputing"},{"key":"1229_CR21","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0377-0427(87)90125-7","volume":"20","author":"PJ Rousseeuw","year":"1987","unstructured":"Rousseeuw PJ (1987) Silhouettes: a graphical aid to the interpretation and validation of cluster analysis. J Comput Appl Math 20:53\u201365. https:\/\/doi.org\/10.1016\/0377-0427(87)90125-7","journal-title":"J Comput Appl Math"},{"issue":"4","key":"1229_CR22","doi-asserted-by":"publisher","first-page":"5858","DOI":"10.1109\/TNNLS.2024.3403155","volume":"36","author":"Y Ren","year":"2025","unstructured":"Ren Y, Pu J, Yang Z, Xu J, Li G, Pu X, Yu PS, He L (2025) Deep clustering: a comprehensive survey. IEEE Trans Neural Netw Learn Syst 36(4):5858\u20135878. https:\/\/doi.org\/10.1109\/TNNLS.2024.3403155","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"1229_CR23","unstructured":"Settles B, Craven M, Friedland L (2008) Active learning with real annotation costs. In: Proceedings of the NIPS workshop on cost-sensitive learning, vol 1"},{"key":"1229_CR24","doi-asserted-by":"publisher","unstructured":"Song C, Liu F, Huang Y, Wang L, Tan T (2013) Auto-encoder based data clustering. In: CIARP, pp 117\u2013124. https:\/\/doi.org\/10.1007\/978-3-642-41822-8_15","DOI":"10.1007\/978-3-642-41822-8_15"},{"key":"1229_CR25","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.neunet.2020.04.017","volume":"127","author":"M Smieja","year":"2020","unstructured":"Smieja M, Struski L, Figueiredo MAT (2020) A classification-based approach to semi-supervised clustering with pairwise constraints. Neural Netw 127:193\u2013203. https:\/\/doi.org\/10.1016\/j.neunet.2020.04.017","journal-title":"Neural Netw"},{"issue":"8","key":"1229_CR26","doi-asserted-by":"publisher","first-page":"3593","DOI":"10.1109\/TNNLS.2020.3015795","volume":"32","author":"Y Shi","year":"2021","unstructured":"Shi Y, Yu Z, Cao W, Chen CLP, Wong H-S, Han G (2021) Fast and effective active clustering ensemble based on density peak. IEEE Trans Neural Netw Learn Syst 32(8):3593\u20133607. https:\/\/doi.org\/10.1109\/TNNLS.2020.3015795","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"1229_CR27","doi-asserted-by":"publisher","first-page":"109346","DOI":"10.1016\/j.knosys.2022.109346","volume":"252","author":"B Sun","year":"2022","unstructured":"Sun B, Zhou P, Du L, Li X (2022) Active deep image clustering. Knowl Based Syst 252:109346. https:\/\/doi.org\/10.1016\/j.knosys.2022.109346","journal-title":"Knowl Based Syst"},{"key":"1229_CR28","doi-asserted-by":"publisher","unstructured":"Van Craenendonck T, Dumancic S, Blockeel H (2017) COBRA: a fast and simple method for active clustering with pairwise constraints. In: IJCAI, pp 2871\u20132877. https:\/\/doi.org\/10.24963\/ijcai.2017\/400","DOI":"10.24963\/ijcai.2017\/400"},{"key":"1229_CR29","doi-asserted-by":"publisher","unstructured":"Van\u00a0Craenendonck T, Duman\u010di\u0107 S, Van\u00a0Wolputte E, Blockeel H (2018) COBRAS: interactive clustering with pairwise queries. In: IDA, pp 353\u2013366. https:\/\/doi.org\/10.1007\/978-3-030-01768-2_29","DOI":"10.1007\/978-3-030-01768-2_29"},{"issue":"11","key":"1229_CR30","doi-asserted-by":"publisher","first-page":"9688","DOI":"10.1109\/TPAMI.2025.3588239","volume":"47","author":"J Wu","year":"2025","unstructured":"Wu J, Li Z, Sun W, Yin J, Nie L, Lin Z (2025) Clusmatch: improving deep clustering by unified positive and negative pseudo-label learning. IEEE Trans Pattern Anal Mach Intell 47(11):9688\u20139701. https:\/\/doi.org\/10.1109\/TPAMI.2025.3588239","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"1","key":"1229_CR31","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/TKDE.2013.22","volume":"26","author":"S Xiong","year":"2013","unstructured":"Xiong S, Azimi J, Fern XZ (2013) Active learning of constraints for semi-supervised clustering. IEEE Trans Knowl Data Eng 26(1):43\u201354. https:\/\/doi.org\/10.1109\/TKDE.2013.22","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1229_CR32","unstructured":"Xie J, Girshick RB, Farhadi A (2016) Unsupervised deep embedding for clustering analysis. In: ICML, vol. 48, pp 478\u2013487"},{"issue":"1","key":"1229_CR33","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/TPAMI.2016.2539965","volume":"39","author":"C Xiong","year":"2016","unstructured":"Xiong C, Johnson DM, Corso JJ (2016) Active clustering with model-based uncertainty reduction. IEEE Trans Pattern Anal Mach Intell 39(1):5\u201317. https:\/\/doi.org\/10.1109\/TPAMI.2016.2539965","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"1229_CR34","unstructured":"Yang B, Fu X, Sidiropoulos ND, Hong M (2017) Towards K-means-friendly spaces: simultaneous deep learning and clustering. In: ICML. pp 3861\u20133870"},{"key":"1229_CR35","doi-asserted-by":"publisher","unstructured":"Zhao H, Chen W, Zhou P (2024) Deep self-paced active learning for image clustering. In: ICME, pp 1\u20136. https:\/\/doi.org\/10.1109\/ICME57554.2024.10687884","DOI":"10.1109\/ICME57554.2024.10687884"},{"issue":"2","key":"1229_CR36","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/s10618-020-00734-4","volume":"35","author":"H Zhang","year":"2021","unstructured":"Zhang H, Zhan T, Basu S, Davidson I (2021) A framework for deep constrained clustering. Data Min Knowl Discov 35(2):593\u2013620. https:\/\/doi.org\/10.1007\/s10618-020-00734-4","journal-title":"Data Min Knowl Discov"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-026-01229-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10618-026-01229-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-026-01229-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T03:05:42Z","timestamp":1790823942000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10618-026-01229-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8,13]]},"references-count":36,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2026,9]]}},"alternative-id":["1229"],"URL":"https:\/\/doi.org\/10.1007\/s10618-026-01229-4","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,8,13]]},"assertion":[{"value":"31 October 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 August 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors have no conflict of interest to declare.","order":1,"name":"Ethics","label":"Conflict of interest","group":{"name":"EthicsHeading","label":"Declarations"}}],"article-number":"80"}}