{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,22]],"date-time":"2026-06-22T17:10:53Z","timestamp":1782148253631,"version":"3.54.5"},"reference-count":186,"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:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/tpami.2023.3237667","type":"journal-article","created":{"date-parts":[[2023,1,17]],"date-time":"2023-01-17T18:53:56Z","timestamp":1673981636000},"page":"1-20","source":"Crossref","is-referenced-by-count":29,"title":["Transforming Complex Problems into K-means Solutions"],"prefix":"10.1109","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0821-8640","authenticated-orcid":false,"given":"Hongfu","family":"Liu","sequence":"first","affiliation":[{"name":"Department of Computer Science, Brandeis University, Waltham, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Junxiang","family":"Chen","sequence":"additional","affiliation":[{"name":"Department of Biomedical Informatics, University of Pittsburgh, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jennifer","family":"Dy","sequence":"additional","affiliation":[{"name":"Department of Electrical & Computer Engineering, Northeastern University, Boston, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5098-2853","authenticated-orcid":false,"given":"Yun","family":"Fu","sequence":"additional","affiliation":[{"name":"Department of Electrical & Computer Engineering, Northeastern University, Boston, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1145\/584792.584890"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-09259-1_2"},{"key":"ref59","author":"hartigan","year":"1975","journal-title":"Clustering Algorithms"},{"key":"ref58","first-page":"281","article-title":"Learning the K in K-means","author":"hamerly","year":"2003","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/WiCom.2008.2534"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2018.03.022"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972801.12"},{"key":"ref168","first-page":"1799","article-title":"A theoretic framework of K-means-based consensus clustering","author":"wu","year":"2013","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref54","first-page":"3887","article-title":"Accelerating large-scale inference with anisotropic vector quantization","author":"guo","year":"2020","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref169","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2316512"},{"key":"ref170","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2017.2742463"},{"key":"ref177","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2011.6126286"},{"key":"ref178","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.383103"},{"key":"ref51","first-page":"59","article-title":"Histogram-based outlier score (HBOS): A fast unsupervised anomaly detection algorithm","author":"goldstein","year":"2012","journal-title":"Proc Poster Demo Track 35th German Conf Artif Intell"},{"key":"ref175","first-page":"478","article-title":"Unsupervised deep embedding for clustering analysis","author":"xie","year":"2016","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1002\/mrm.1910400211"},{"key":"ref176","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623676"},{"key":"ref173","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.261"},{"key":"ref174","first-page":"87","article-title":"A fast adaptive K-means with no bounds","volume":"44","author":"xia","year":"2022","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"ref171","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557115"},{"key":"ref172","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2011.2179659"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2005.113"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.2172\/15002155"},{"key":"ref48","first-page":"2096","article-title":"Domain-adversarial training of neural networks","volume":"17","author":"ganin","year":"2016","journal-title":"J Mach Learn Res"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2017.03.008"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273562"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972757.70"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/1015330.1015414"},{"key":"ref179","first-page":"1649","article-title":"Discriminative K-means for clustering","author":"ye","year":"2007","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref43","first-page":"147","article-title":"Using the triangle inequality to accelerate K-means","author":"elkan","year":"2003","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.5120\/ijca2015905919"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10259"},{"key":"ref180","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1109\/TKDE.2005.29","article-title":"Iterative projected clustering by subspace mining","volume":"17","author":"yiu","year":"2005","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"ref7","first-page":"55","article-title":"Fast and provably good seedings for K-means","author":"bachem","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref181","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2906644"},{"key":"ref9","first-page":"1","article-title":"Linear discriminant analysis-a brief tutorial","volume":"18","author":"balakrishnama","year":"1998","journal-title":"Inst Signal Inf Process"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-009-5103-0"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.3390\/electronics9081295"},{"key":"ref6","first-page":"1027","article-title":"K-means : The advantages of careful seeding","author":"arthur","year":"2007","journal-title":"Proc ACM-SIAM Symp Discrete Algorithms"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1137856.1137880"},{"key":"ref100","article-title":"Consensus clustering: An embedding perspective, extension and beyond","author":"liu","year":"2019"},{"key":"ref101","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2763945"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/1015330.1015408"},{"key":"ref186","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00608"},{"key":"ref184","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2017.2754942"},{"key":"ref185","article-title":"A note of K-modes clustering","volume":"20","author":"zhexue huang","year":"2003","journal-title":"J Classification"},{"key":"ref182","first-page":"7404","article-title":"Bridging theory and algorithm for domain adaptation","author":"zhang","year":"2019","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref183","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00517"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s00357-016-9208-4"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2008.222"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014118"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143875"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00150"},{"key":"ref148","first-page":"1495","article-title":"Convergence rate of stochastic K-means","author":"tang","year":"2017","journal-title":"Proc Artif Intell Statist"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.114041"},{"key":"ref149","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-47887-6_53"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021326"},{"key":"ref146","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49409-8_35"},{"key":"ref32","first-page":"447","article-title":"DeepJDOT: Deep joint distribution optimal transport for unsupervised domain adaptation","author":"damodaran","year":"2018","journal-title":"Proc Eur Conf Comput Vis"},{"key":"ref147","author":"tan","year":"2016","journal-title":"Introduction to Data Mining"},{"key":"ref39","first-page":"1265","article-title":"A divisive information theoretic feature clustering algorithm for text classification","volume":"3","author":"dhillon","year":"2003","journal-title":"J Mach Learn Res"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014118"},{"key":"ref155","doi-asserted-by":"publisher","DOI":"10.3233\/IFS-2012-0519"},{"key":"ref156","doi-asserted-by":"crossref","first-page":"35","DOI":"10.7551\/mitpress\/4057.003.0004","article-title":"A primer on kernel methods","volume":"47","author":"vert","year":"2004","journal-title":"Kernel Methods Comput Biol"},{"key":"ref153","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.316"},{"key":"ref154","article-title":"Deep domain confusion: Maximizing for domain invariance","author":"tzeng","year":"2014"},{"key":"ref151","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2003.1250937"},{"key":"ref152","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.35"},{"key":"ref150","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.11203"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2014.2332399"},{"key":"ref23","first-page":"2598","article-title":"Multi-view K-means clustering on Big Data","author":"cai","year":"2013","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s00357-001-0004-3"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2012.07.021"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335388"},{"key":"ref159","first-page":"106","article-title":"A wavelet-based anytime algorithm for K-means clustering of time series","author":"vlachos","year":"2003","journal-title":"Proc Workshop Clustering High Dimensionality Data Appl"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2807452"},{"key":"ref157","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995530"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1980.1163445"},{"key":"ref158","first-page":"3371","article-title":"Stacked denoising autoencoders: Learning useful representations in a deep network with a local denoising criterion","volume":"11","author":"vincent","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref28","article-title":"Marginalized denoising autoencoders for domain adaptation","author":"chen","year":"2012"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972832.21"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020558"},{"key":"ref166","first-page":"506","article-title":"Non-negative matrix factorization with constraints","author":"wu","year":"2010","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref167","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29807-3"},{"key":"ref164","doi-asserted-by":"publisher","DOI":"10.14778\/3377369.3377378"},{"key":"ref165","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2863278"},{"key":"ref162","first-page":"431","article-title":"Scalable kernel K-means clustering with nyström approximation: Relative-error bounds","volume":"20","author":"wang","year":"2019","journal-title":"J Mach Learn Res"},{"key":"ref163","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974010.105"},{"key":"ref160","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-007-9033-z"},{"key":"ref161","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972795.4"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-010-0415-x"},{"key":"ref12","author":"basu","year":"2008","journal-title":"Constrained Clustering Advances in Algorithms Theory and Applications"},{"key":"ref15","first-page":"153","article-title":"Greedy layer-wise training of deep networks","author":"bengio","year":"2007","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref128","doi-asserted-by":"publisher","DOI":"10.1109\/3477.836381"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1162\/089976603321780317"},{"key":"ref129","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCS49678.2020.9276978"},{"key":"ref97","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2843342"},{"key":"ref126","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339669"},{"key":"ref96","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783287"},{"key":"ref127","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45643-0_13"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.31"},{"key":"ref99","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2016.0136"},{"key":"ref124","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74958-5_67"},{"key":"ref10","first-page":"1705","article-title":"Clustering with bregman divergences","volume":"6","author":"banerjee","year":"2005","journal-title":"J Mach Learn Res"},{"key":"ref98","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10221"},{"key":"ref125","first-page":"727","article-title":"X-means: Extending K-means with efficient estimation of the number of clusters","author":"pelleg","year":"2000","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49487-6_3"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0098-3004(84)90020-7"},{"key":"ref19","first-page":"91","article-title":"Refining initial points for K-means clustering","author":"bradley","year":"1998","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref18","first-page":"585","article-title":"Convergence properties of the K-means algorithms","author":"bottou","year":"1995","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref93","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.17"},{"key":"ref133","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00392"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1980.1094577"},{"key":"ref134","doi-asserted-by":"publisher","DOI":"10.1162\/089976601750264965"},{"key":"ref95","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2954317"},{"key":"ref131","doi-asserted-by":"publisher","DOI":"10.1126\/science.290.5500.2323"},{"key":"ref94","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2015.18"},{"key":"ref132","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6247745"},{"key":"ref130","doi-asserted-by":"publisher","DOI":"10.5120\/8282-1278"},{"key":"ref91","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(02)00060-2"},{"key":"ref90","article-title":"Understanding and projecting the battle state","author":"liao","year":"2002","journal-title":"Proc 23rd Army Sci Conf"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206852"},{"key":"ref139","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11784"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.01053"},{"key":"ref137","author":"sch\u00fctze","year":"2008","journal-title":"Introduction to Information Retrieval"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081891"},{"key":"ref138","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.53"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1145\/1008992.1009031"},{"key":"ref135","doi-asserted-by":"publisher","DOI":"10.1162\/089976698300017467"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2007.98"},{"key":"ref136","author":"sch\u00f6lkopf","year":"2002","journal-title":"Learning With Kernels Support Vector Machines Regularization Optimization and Beyond"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(01)00021-6"},{"key":"ref144","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1016\/j.ins.2017.07.016","article-title":"Semi-supervised cross-entropy clustering with information bottleneck constraint","volume":"421","author":"?mieja","year":"2017","journal-title":"Inf Sci"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1145\/253262.253332"},{"key":"ref145","first-page":"583","article-title":"Cluster ensembles — a knowledge reuse framework for combining partitions","volume":"3","author":"strehl","year":"2002","journal-title":"J Mach Learn Res"},{"key":"ref84","first-page":"1131","article-title":"Revisiting K-means: New algorithms via Bayesian nonparametrics","author":"kulis","year":"2012","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref142","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.126"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01307-2_86"},{"key":"ref143","first-page":"1677","article-title":"Hartigan's K-means versus lloyd's K-means—is it time for a change?","author":"slonim","year":"2013","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref140","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1109\/34.868688","article-title":"Normalized cuts and image segmentation","volume":"22","author":"shi","year":"2000","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"ref141","article-title":"A novel anomaly detection scheme based on principal component classifier","author":"shyu","year":"2003"},{"key":"ref80","first-page":"90","article-title":"Review on determining number of cluster in K-means clustering","volume":"1","author":"kodinariya","year":"2013","journal-title":"Int J"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1007\/978-81-322-2752-6_48"},{"key":"ref108","first-page":"136","article-title":"Unsupervised domain adaptation with residual transfer networks","author":"long","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2004.04.007"},{"key":"ref109","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-013-5339-6"},{"key":"ref106","first-page":"97","article-title":"Learning transferable features with deep adaptation networks","author":"long","year":"2015","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref107","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.274"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539868"},{"key":"ref104","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-87199-4_13"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1002\/0470013192.bsa501"},{"key":"ref105","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316801.ch2"},{"key":"ref102","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2650229"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974973.55"},{"key":"ref103","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR48806.2021.9413284"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.5120\/13713-1472"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2015.04.007"},{"key":"ref71","author":"jain","year":"1988","journal-title":"Algorithms for clustering data"},{"key":"ref111","first-page":"281","article-title":"Some methods for classification and analysis of multivariate observations","author":"macqueen","year":"1967","journal-title":"Proc Berkeley Symp Math Statist Probability"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2009.09.011"},{"key":"ref112","article-title":"Survey on medical image segmentation using enhanced K-means and kernelized fuzzy C-means","volume":"6","author":"mahajan","year":"2014","journal-title":"Int J Adv Eng Technol"},{"key":"ref73","first-page":"2168","article-title":"Robust visual domain adaptation with low-rank reconstruction","author":"jhuo","year":"2012","journal-title":"Proc IEEE Conf Comput Vis and Pattern Recog"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.32604\/csse.2019.34.259"},{"key":"ref110","first-page":"665","article-title":"From comparing clusterings to combining clusterings","author":"lu","year":"2008","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1002\/widm.33"},{"key":"ref119","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/394"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009769707641"},{"key":"ref117","author":"nassar","year":"2013","journal-title":"Telecommunications Demystified"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081942"},{"key":"ref118","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":"ref64","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(03)00003-5"},{"key":"ref115","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010924920739"},{"key":"ref63","first-page":"195","article-title":"Automatic topic identification using webpage clustering","author":"he","year":"2001","journal-title":"Proc IEEE Int Conf Data Mining"},{"key":"ref116","doi-asserted-by":"publisher","DOI":"10.1023\/A:1023949509487"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2503753"},{"key":"ref113","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10631-6_103"},{"key":"ref65","first-page":"249","article-title":"Fast svd for large-scale matrices","author":"holmes","year":"2007","journal-title":"Proc Workshop Efficient Mach Learn"},{"key":"ref114","doi-asserted-by":"publisher","DOI":"10.1016\/j.spl.2013.09.026"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.2307\/2346830"},{"key":"ref122","doi-asserted-by":"publisher","DOI":"10.1145\/3439950"},{"key":"ref123","doi-asserted-by":"publisher","DOI":"10.1145\/1007730.1007731"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2018.2796860"},{"key":"ref120","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1109\/TNN.2010.2091281","article-title":"Domain adaptation via transfer component analysis","volume":"22","author":"pan","year":"2011","journal-title":"IEEE Trans Neural Netw"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2008.4761105"},{"key":"ref121","article-title":"Outlier detection in complex categorical data by modelling the feature value couplings","author":"pang","year":"2016","journal-title":"Proc Int Joint Conf Artif Intell"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/4359286\/10018468.pdf?arnumber=10018468","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,4]],"date-time":"2023-12-04T21:55:17Z","timestamp":1701726917000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10018468\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":186,"URL":"https:\/\/doi.org\/10.1109\/tpami.2023.3237667","relation":{},"ISSN":["0162-8828","2160-9292","1939-3539"],"issn-type":[{"value":"0162-8828","type":"print"},{"value":"2160-9292","type":"electronic"},{"value":"1939-3539","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]}}}