{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:08:19Z","timestamp":1774368499683,"version":"3.50.1"},"reference-count":59,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Special Research Fund-Doctoral Scholarships, Ghent University, Belgium","award":["BOF15\/DOS\/039"],"award-info":[{"award-number":["BOF15\/DOS\/039"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1109\/tnnls.2018.2890021","type":"journal-article","created":{"date-parts":[[2019,1,17]],"date-time":"2019-01-17T19:40:50Z","timestamp":1547754050000},"page":"3084-3095","source":"Crossref","is-referenced-by-count":55,"title":["Kernel-Based Distance Metric Learning for Supervised $k$ -Means Clustering"],"prefix":"10.1109","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9193-1908","authenticated-orcid":false,"given":"Bac","family":"Nguyen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3876-620X","authenticated-orcid":false,"given":"Bernard","family":"De Baets","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"1057","article-title":"Spectral relaxation for k-means clustering","author":"zha","year":"2002","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2006.883723"},{"key":"ref33","first-page":"577","article-title":"Constrained k-means clustering with background knowledge","author":"wagstaff","year":"2001","journal-title":"Proc 18th Int Conf Mach Learn"},{"key":"ref32","first-page":"937","article-title":"Learning a Mahalanobis metric from equivalence constraints","volume":"6","author":"bar-hillel","year":"2006","journal-title":"J Mach Learn Res"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2009.12.009"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2009.11.037"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014062"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-008-5084-4"},{"key":"ref34","first-page":"305","article-title":"Learning spectral clustering","author":"bach","year":"2003","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref28","first-page":"946","article-title":"Inductive regularized learning of kernel functions","author":"jain","year":"2010","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273523"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2014.2361142"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2013.2293795"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"ref20","first-page":"41","article-title":"Learning a distance metric from relative comparisons","author":"schultz","year":"2004","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref22","article-title":"Supervised k-means clustering","author":"finley","year":"2008"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.190715"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.424"},{"key":"ref23","first-page":"297","article-title":"Large-margin metric learning for constrained partitioning problems","author":"lajugie","year":"2014","journal-title":"Proc 31st Int Conf Mach Learn"},{"key":"ref26","author":"sch\u00f6lkopf","year":"2002","journal-title":"Learning With Kernels Support Vector Machines Regularization Optimization and Beyond"},{"key":"ref25","first-page":"1453","article-title":"Large margin methods for structured and interdependent output variables","volume":"6","author":"tsochantaridis","year":"2005","journal-title":"J Mach Learn Res"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623498345075"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(88)90223-6"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1145\/345508.345578"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-55860-377-6.50048-7"},{"key":"ref57","first-page":"509","article-title":"Learning to extract symbolic knowledge from the world wide Web","author":"craven","year":"1998","journal-title":"Proc Conf Artif Intell \/Innov Appl Artif Intell"},{"key":"ref56","first-page":"2837","article-title":"Information theoretic measures for clusterings comparison: Variants, properties, normalization and correction for chance","volume":"11","author":"vinh","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.2307\/2284239"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553511"},{"key":"ref53","first-page":"28","article-title":"Latent maximum margin clustering","author":"zhou","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1561\/2200000019"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2017.11.022"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2436432"},{"key":"ref40","first-page":"849","article-title":"On spectral clustering: Analysis and an algorithm","author":"ng","year":"2002","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.215"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1015330.1015360"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2009.11.005"},{"key":"ref15","first-page":"1980","article-title":"Efficient learning of Mahalanobis metrics for ranking","author":"lim","year":"2014","journal-title":"Proc 31st Int Conf Mach Learn"},{"key":"ref16","first-page":"519","article-title":"Metric and kernel learning using a linear transformation","volume":"13","author":"jain","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102379"},{"key":"ref18","first-page":"1551","article-title":"A Bayesian model for supervised clustering with the Dirichlet process prior","volume":"6","author":"marcu","year":"2005","journal-title":"J Mach Learn Res"},{"key":"ref19","first-page":"505","article-title":"Distance metric learning with application to clustering with side-information","author":"xing","year":"2002","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2013.2275170"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2016.07.005"},{"key":"ref6","first-page":"207","article-title":"Distance metric learning for large margin nearest neighbor classification","volume":"10","author":"weinberger","year":"2009","journal-title":"J Mach Learn Res"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2016.11.010"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2017.2761773"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2018.04.024"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1023\/A:1017501703105"},{"key":"ref9","first-page":"513","article-title":"Neighbourhood components analysis","author":"goldberger","year":"2005","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2012.2188906"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44581-1_27"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-009-5108-8"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-009-5103-0"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1137\/050641983"},{"key":"ref44","first-page":"778","article-title":"Rank\/norm regularization with closed-form solutions: Application to subspace clustering","author":"yu","year":"2011","journal-title":"Proc Conf Uncertainty of Artificial Intelligence"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/177424.178042"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5962385\/8844334\/08617698.pdf?arnumber=8617698","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:55:56Z","timestamp":1657745756000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8617698\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10]]},"references-count":59,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2018.2890021","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"value":"2162-237X","type":"print"},{"value":"2162-2388","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10]]}}}