{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,4]],"date-time":"2025-09-04T14:28:40Z","timestamp":1756996120541,"version":"3.37.3"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,7,6]],"date-time":"2024-07-06T00:00:00Z","timestamp":1720224000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,6]],"date-time":"2024-07-06T00:00:00Z","timestamp":1720224000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s13042-024-02275-4","type":"journal-article","created":{"date-parts":[[2024,7,6]],"date-time":"2024-07-06T05:01:26Z","timestamp":1720242086000},"page":"661-685","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Self-representation with adaptive loss minimization via doubly stochastic graph regularization for robust unsupervised feature selection"],"prefix":"10.1007","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4947-2282","authenticated-orcid":false,"given":"Xiangfa","family":"Song","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,6]]},"reference":[{"issue":"1","key":"2275_CR1","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1109\/TPAMI.2007.250598","volume":"29","author":"S Yan","year":"2007","unstructured":"Yan S, Xu D, Zhang B, Zhang H, Yang Q, Lin S (2007) Graph embedding and extensions: a general framework for dimensionality reduction. IEEE Trans Pattern Anal Mach Intell 29(1):40\u201351","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"5","key":"2275_CR2","doi-asserted-by":"crossref","first-page":"3473","DOI":"10.1007\/s10462-020-09928-0","volume":"54","author":"P Ray","year":"2021","unstructured":"Ray P, Reddy SS, Banerjee T (2021) Various dimension reduction techniques for high dimensional data analysis: a review. Artif Intell Rev 54(5):3473\u20133515","journal-title":"Artif Intell Rev"},{"issue":"3","key":"2275_CR3","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1007\/s13042-017-0741-1","volume":"10","author":"LY Yang","year":"2019","unstructured":"Yang LY, Xu Z (2019) Feature extraction by PCA and diagnosis of breast tumors using SVM with de-based parameter tuning. Int J Mach Learn Cybern 10(3):591\u2013601","journal-title":"Int J Mach Learn Cybern"},{"issue":"7","key":"2275_CR4","doi-asserted-by":"crossref","first-page":"1731","DOI":"10.1007\/s13042-018-0849-y","volume":"10","author":"W Zhang","year":"2019","unstructured":"Zhang W, Kang P, Fang X, Teng L, Han N (2019) Joint sparse representation and locality preserving projection for feature extraction. Int J Mach Learn Cybern 10(7):1731\u20131745","journal-title":"Int J Mach Learn Cybern"},{"key":"2275_CR5","volume":"113","author":"J Lu","year":"2021","unstructured":"Lu J, Wang H, Zhou J, Chen Y, Lai Z, Hu Q (2021) Low-rank adaptive graph embedding for unsupervised feature extraction. Pattern Recognit 113:107758","journal-title":"Pattern Recognit"},{"key":"2275_CR6","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.jvcir.2017.02.015","volume":"45","author":"H Du","year":"2017","unstructured":"Du H, Zhao Z, Wang S, Hu Q (2017) Two-dimensional discriminant analysis based on schatten p-norm for image feature extraction. J Vis Commun Image Represent 45:87\u201394","journal-title":"J Vis Commun Image Represent"},{"key":"2275_CR7","first-page":"1157","volume":"3","author":"I Guyon","year":"2003","unstructured":"Guyon I, Elisseeff A (2003) An introduction to variable and feature selection. J Mach Learn Res 3:1157\u20131182","journal-title":"J Mach Learn Res"},{"issue":"8","key":"2275_CR8","doi-asserted-by":"crossref","first-page":"1226","DOI":"10.1109\/TPAMI.2005.159","volume":"27","author":"H Peng","year":"2005","unstructured":"Peng H, Long F, Ding CHQ (2005) Feature selection based on mutual information: criteria of max-dependency, max-relevance, and min-redundancy. IEEE Trans Pattern Anal Mach Intell 27(8):1226\u20131238","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"2275_CR9","unstructured":"He X, Cai D, Niyogi P (2005) Laplacian score for feature selection. In: Advances in Neural Information Processing Systems, pp 507\u2013514"},{"issue":"1","key":"2275_CR10","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s13042-021-01347-z","volume":"13","author":"A Hashemi","year":"2022","unstructured":"Hashemi A, Dowlatshahi MB, Nezamabadi-pour H (2022) Ensemble of feature selection algorithms: a multi-criteria decision-making approach. Int J Mach Learn Cybern 13(1):49\u201369","journal-title":"Int J Mach Learn Cybern"},{"issue":"6","key":"2275_CR11","first-page":"94","volume":"50","author":"J Li","year":"2018","unstructured":"Li J, Cheng K, Wang S, Morstatter F, Trevino RP, Tang J, Liu H (2018) Feature aelection: a data perspective. ACM Comput Surv 50(6):94\u201319445","journal-title":"ACM Comput Surv"},{"issue":"9","key":"2275_CR12","doi-asserted-by":"crossref","first-page":"2461","DOI":"10.1007\/s13042-021-01324-6","volume":"12","author":"M Asim","year":"2021","unstructured":"Asim M, Javed K, Rehman A, Babri HA (2021) A new feature selection metric for text classification: eliminating the need for a separate pruning stage. Int J Mach Learn Cybern 12(9):2461\u20132478","journal-title":"Int J Mach Learn Cybern"},{"issue":"6","key":"2275_CR13","doi-asserted-by":"crossref","first-page":"4519","DOI":"10.1007\/s10462-019-09800-w","volume":"53","author":"E Hancer","year":"2020","unstructured":"Hancer E, Xue B, Zhang M (2020) A survey on feature selection approaches for clustering. Artif Intell Rev 53(6):4519\u20134545","journal-title":"Artif Intell Rev"},{"issue":"11","key":"2275_CR14","doi-asserted-by":"crossref","first-page":"2844","DOI":"10.1109\/TMM.2020.2966887","volume":"22","author":"Y Zhang","year":"2020","unstructured":"Zhang Y, Wu J, Cai Z, Philip SY (2020) Multi-view multi-label learning with sparse feature selection for image annotation. IEEE Trans Multim 22(11):2844\u20132857","journal-title":"IEEE Trans Multim"},{"key":"2275_CR15","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2022.109884","volume":"256","author":"F Saberi-Movahed","year":"2022","unstructured":"Saberi-Movahed F, Rostami M, Berahmand K, Karami S, Tiwari P, Oussalah M, Band SS (2022) Dual regularized unsupervised feature selection based on matrix factorization and minimum redundancy with application in gene selection. Knowl Based Syst 256:109884","journal-title":"Knowl Based Syst"},{"key":"2275_CR16","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.120480","volume":"230","author":"B Sang","year":"2023","unstructured":"Sang B, Yang L, Chen H, Xu W, Zhang X (2023) Fuzzy rough feature selection using a robust non-linear vague quantifier for ordinal classification. Expert Syst Appl 230:120480","journal-title":"Expert Syst Appl"},{"key":"2275_CR17","doi-asserted-by":"crossref","unstructured":"Sang B, Xu W, Chen H, Li T (2023) Active anti-noise fuzzy dominance rough feature selection using adaptive k-nearest neighbors. IEEE Transactions on Fuzzy Systems","DOI":"10.1109\/TFUZZ.2023.3272316"},{"key":"2275_CR18","unstructured":"Nie F, Huang H, Cai X, Ding CHQ (2010) Efficient and robust feature selection via joint L2,1-norms minimization. In: Advances in Neural Information Processing Systems, pp 1813\u20131821"},{"issue":"5","key":"2275_CR19","doi-asserted-by":"crossref","first-page":"1831","DOI":"10.1109\/TNNLS.2020.2991336","volume":"32","author":"X Wu","year":"2021","unstructured":"Wu X, Xu X, Liu J, Wang H, Hu B, Nie F (2021) Supervised feature selection with orthogonal regression and feature weighting. IEEE Trans Neural Netw Learn Syst 32(5):1831\u20131838","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"2275_CR20","volume":"204","author":"Y Huang","year":"2020","unstructured":"Huang Y, Jin W, Yu Z, Li B (2020) Supervised feature selection through deep neural networks with pairwise connected structure. Knowl Based Syst 204:106202","journal-title":"Knowl Based Syst"},{"key":"2275_CR21","doi-asserted-by":"crossref","unstructured":"Zhao Z, Liu H (2007) Semi-supervised feature selection via spectral analysis. In: SIAM Conference on Data Mining, pp 641\u2013646","DOI":"10.1137\/1.9781611972771.75"},{"issue":"7","key":"2275_CR22","doi-asserted-by":"crossref","first-page":"1033","DOI":"10.1109\/TNN.2010.2047114","volume":"21","author":"Z Xu","year":"2010","unstructured":"Xu Z, King I, Lyu MR, Jin R (2010) Discriminative semi-supervised feature selection via manifold regularization. IEEE Trans Neural Netw 21(7):1033\u20131047","journal-title":"IEEE Trans Neural Netw"},{"key":"2275_CR23","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/j.patcog.2016.11.003","volume":"64","author":"R Sheikhpour","year":"2017","unstructured":"Sheikhpour R, Sarram MA, Gharaghani S, Chahooki MAZ (2017) A survey on semi-supervised feature selection methods. Pattern Recognit 64:141\u2013158","journal-title":"Pattern Recognit"},{"issue":"3","key":"2275_CR24","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1109\/34.990133","volume":"24","author":"P Mitra","year":"2002","unstructured":"Mitra P, Murthy CA, Pal SK (2002) Unsupervised feature selection using feature similarity. IEEE Trans Pattern Anal Mach Intell 24(3):301\u2013312","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"2275_CR25","doi-asserted-by":"crossref","unstructured":"Li Z, Yang Y, Liu J, Zhou X, Lu H (2012) Unsupervised feature selection using nonnegative spectral analysis. In: AAAI Conference on Artificial Intelligence, pp 1026\u20131032","DOI":"10.1609\/aaai.v26i1.8289"},{"key":"2275_CR26","doi-asserted-by":"crossref","unstructured":"Wang S, Tang J, Liu H (2015) Embedded unsupervised feature selection. In: AAAI Conference on Artificial Intelligence, pp 470\u2013476","DOI":"10.1609\/aaai.v29i1.9211"},{"issue":"2","key":"2275_CR27","doi-asserted-by":"crossref","first-page":"907","DOI":"10.1007\/s10462-019-09682-y","volume":"53","author":"S Solorio-Fern\u00e1ndez","year":"2020","unstructured":"Solorio-Fern\u00e1ndez S, Carrasco-Ochoa JA, Mart\u00ednez-Trinidad JF (2020) A review of unsupervised feature selection methods. Artif Intell Rev 53(2):907\u2013948","journal-title":"Artif Intell Rev"},{"issue":"5","key":"2275_CR28","doi-asserted-by":"crossref","first-page":"1695","DOI":"10.1007\/s13042-022-01721-5","volume":"14","author":"T Chen","year":"2023","unstructured":"Chen T, Zeng Y, Yuan H, Zhong G, Lai LL, Tang YY (2023) Multi-level regularization-based unsupervised multi-view feature selection with adaptive graph learning. Int J Mach Learn Cybern 14(5):1695\u20131709","journal-title":"Int J Mach Learn Cybern"},{"key":"2275_CR29","doi-asserted-by":"crossref","unstructured":"Zhao Z, Liu H (2007) Spectral feature selection for supervised and unsupervised learning. In: International Conference on Machine Learning, pp 1151\u20131157","DOI":"10.1145\/1273496.1273641"},{"issue":"1\u20132","key":"2275_CR30","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/S0004-3702(97)00043-X","volume":"97","author":"R Kohavi","year":"1997","unstructured":"Kohavi R, John GH (1997) Wrappers for feature subset selection. Artif Intell 97(1\u20132):273\u2013324","journal-title":"Artif Intell"},{"issue":"13","key":"2275_CR31","doi-asserted-by":"crossref","first-page":"2208","DOI":"10.1016\/j.ins.2009.02.014","volume":"179","author":"S Maldonado","year":"2009","unstructured":"Maldonado S, Weber R (2009) A wrapper method for feature selection using support vector machines. Inf Sci 179(13):2208\u20132217","journal-title":"Inf Sci"},{"key":"2275_CR32","doi-asserted-by":"crossref","unstructured":"Cai D, Zhang C, He X (2010) Unsupervised feature selection for multi-cluster data. In: ACM conference on Knowledge Discovery and Data Mining, pp 333\u2013342","DOI":"10.1145\/1835804.1835848"},{"issue":"6","key":"2275_CR33","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1109\/TCYB.2013.2272642","volume":"44","author":"C Hou","year":"2014","unstructured":"Hou C, Nie F, Li X, Yi D, Wu Y (2014) Joint embedding learning and sparse regression: a framework for unsupervised feature selection. IEEE Trans Cybern 44(6):793\u2013804","journal-title":"IEEE Trans Cybern"},{"key":"2275_CR34","doi-asserted-by":"crossref","unstructured":"Du L, Shen Y (2015) Unsupervised feature selection with adaptive structure learning. In:ACM Conference on Knowledge Discovery and Data Mining, pp 209\u2013218","DOI":"10.1145\/2783258.2783345"},{"issue":"1","key":"2275_CR35","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/j.patcog.2014.08.004","volume":"48","author":"S Wang","year":"2015","unstructured":"Wang S, Pedrycz W, Zhu Q, Zhu W (2015) Subspace learning for unsupervised feature selection via matrix factorization. Pattern Recognit 48(1):10\u201319","journal-title":"Pattern Recognit"},{"key":"2275_CR36","doi-asserted-by":"crossref","unstructured":"Zhu P, Hu Q, Zhang C, Zuo W (2016) Coupled dictionary learning for unsupervised feature selection. In: AAAI Conference on Artificial Intelligence, pp 2422-2428","DOI":"10.1609\/aaai.v30i1.10239"},{"key":"2275_CR37","doi-asserted-by":"crossref","unstructured":"Nie F, Zhu W, Li X (2016) Unsupervised feature selection with structured graph optimization. In: AAAI Conference on Artificial Intelligence,pp 1302\u20131308","DOI":"10.1609\/aaai.v30i1.10168"},{"key":"2275_CR38","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/j.neucom.2019.07.020","volume":"366","author":"H Zhang","year":"2019","unstructured":"Zhang H, Zhang R, Nie F, Li X (2019) An efficient framework for unsupervised feature selection. Neurocomputing 366:194\u2013207","journal-title":"Neurocomputing"},{"key":"2275_CR39","volume":"193","author":"Y Liu","year":"2020","unstructured":"Liu Y, Ye D, Li W, Wang H, Gao Y (2020) Robust neighborhood embedding for unsupervised feature selection. Knowl Based Syst 193:105462","journal-title":"Knowl Based Syst"},{"key":"2275_CR40","volume":"122","author":"J Miao","year":"2022","unstructured":"Miao J, Yang T, Sun L, Fei X, Niu L, Shi Y (2022) Graph regularized locally linear embedding for unsupervised feature selection. Pattern Recognit 122:108299","journal-title":"Pattern Recognit"},{"issue":"2","key":"2275_CR41","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1016\/j.patcog.2014.08.006","volume":"48","author":"P Zhu","year":"2015","unstructured":"Zhu P, Zuo W, Zhang L, Hu Q, Shiu SCK (2015) Unsupervised feature selection by regularized self-representation. Pattern Recognit 48(2):438\u2013446","journal-title":"Pattern Recognit"},{"key":"2275_CR42","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.imavis.2016.11.014","volume":"60","author":"P Zhu","year":"2017","unstructured":"Zhu P, Zhu W, Wang W, Zuo W, Hu Q (2017) Non-convex regularized self-representation for unsupervised feature selection. Image Vis Comput 60:22\u201329","journal-title":"Image Vis Comput"},{"key":"2275_CR43","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2021.114643","volume":"173","author":"J Miao","year":"2021","unstructured":"Miao J, Ping Y, Chen Z, Jin X-B, Li P, Niu L (2021) Unsupervised feature selection by non-convex regularized self-representation. Expert Syst Appl 173:114643","journal-title":"Expert Syst Appl"},{"key":"2275_CR44","doi-asserted-by":"crossref","first-page":"1242","DOI":"10.1016\/j.neucom.2015.07.068","volume":"171","author":"R Shang","year":"2016","unstructured":"Shang R, Zhang Z, Jiao L, Liu C, Li Y (2016) Self-representation based dual-graph regularized feature selection clustering. Neurocomputing 171:1242\u20131253","journal-title":"Neurocomputing"},{"issue":"9","key":"2275_CR45","doi-asserted-by":"crossref","first-page":"12149","DOI":"10.1007\/s11042-016-3937-6","volume":"76","author":"W He","year":"2017","unstructured":"He W, Zhu X, Cheng D, Hu R, Zhang S (2017) Low-rank unsupervised graph feature selection via feature self-representation. Multim Tools Appl 76(9):12149\u201312164","journal-title":"Multim Tools Appl"},{"key":"2275_CR46","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/j.neucom.2016.05.081","volume":"220","author":"R Hu","year":"2017","unstructured":"Hu R, Zhu X, Cheng D, He W, Yan Y, Song J, Zhang S (2017) Graph self-representation method for unsupervised feature selection. Neurocomputing 220:130\u2013137","journal-title":"Neurocomputing"},{"key":"2275_CR47","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.patrec.2017.09.022","volume":"109","author":"Y Li","year":"2018","unstructured":"Li Y, Lei C, Fang Y, Hu R, Li Y, Zhang S (2018) Unsupervised feature selection by combining subspace learning with feature self-representation. Pattern Recognit Lett 109:35\u201343","journal-title":"Pattern Recognit Lett"},{"key":"2275_CR48","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.neucom.2018.04.001","volume":"301","author":"Q Lu","year":"2018","unstructured":"Lu Q, Li X, Dong Y (2018) Structure preserving unsupervised feature selection. Neurocomputing 301:36\u201345","journal-title":"Neurocomputing"},{"key":"2275_CR49","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.knosys.2018.01.009","volume":"145","author":"C Tang","year":"2018","unstructured":"Tang C, Liu X, Li M, Wang P, Chen J, Wang L, Li W (2018) Robust unsupervised feature selection via dual self-representation and manifold regularization. Knowl Based Syst 145:109\u2013120","journal-title":"Knowl Based Syst"},{"issue":"4","key":"2275_CR50","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1007\/s13042-017-0760-y","volume":"10","author":"R Shang","year":"2019","unstructured":"Shang R, Chang J, Jiao L, Xue Y (2019) Unsupervised feature selection based on self-representation sparse regression and local similarity preserving. Int J Mach Learn Cybern 10(4):757\u2013770","journal-title":"Int J Mach Learn Cybern"},{"key":"2275_CR51","unstructured":"Nie F, Wang H, Huang H, Ding CHQ (2013) Adaptive loss minimization for semi-supervised elastic embedding. In: IJCAI Conference on Artificial Intelligence, pp 1026\u20131032"},{"issue":"1","key":"2275_CR52","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1109\/TBDATA.2022.3178715","volume":"9","author":"H Chang","year":"2023","unstructured":"Chang H, Guo J, Zhu W (2023) Rethinking embedded unsupervised feature selection: A simple joint approach. IEEE Trans Big Data 9(1):380\u2013387","journal-title":"IEEE Trans Big Data"},{"key":"2275_CR53","doi-asserted-by":"crossref","unstructured":"Tang C, Zheng X, Zhang W, Liu X, Zhu X, Zhu E (2023) Unsupervised feature selection via multiple graph fusion and feature weight learning. Sci. China Inf. Sci. 66(5)","DOI":"10.1007\/s11432-022-3579-1"},{"key":"2275_CR54","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1109\/TIP.2024.3353572","volume":"33","author":"Q Zhou","year":"2024","unstructured":"Zhou Q, Wang Q, Gao Q, Yang M, Gao X (2024) Unsupervised discriminative feature selection via contrastive graph learning. IEEE Trans Image Process 33:972\u2013986","journal-title":"IEEE Trans Image Process"},{"key":"2275_CR55","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.neucom.2021.12.020","volume":"475","author":"M Chen","year":"2022","unstructured":"Chen M, Gong M, Li X (2022) Robust doubly stochastic graph clustering. Neurocomputing 475:15\u201325","journal-title":"Neurocomputing"},{"key":"2275_CR56","doi-asserted-by":"crossref","unstructured":"Wang X, Nie F, Huang H (2016) Structured doubly stochastic matrix for graph based clustering: structured doubly stochastic matrix. In: ACM Conference on Knowledge Discovery and Data Mining, pp 1245\u20131254","DOI":"10.1145\/2939672.2939805"},{"key":"2275_CR57","doi-asserted-by":"crossref","unstructured":"Zass R, Shashua A (2006) Doubly stochastic normalization for spectral clustering. In: Advances in Neural Information Processing Systems, pp 1569\u20131576","DOI":"10.7551\/mitpress\/7503.003.0201"},{"issue":"1","key":"2275_CR58","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"SP Boyd","year":"2011","unstructured":"Boyd SP, Parikh N, Chu E, Peleato B, Eckstein J (2011) Distributed optimization and statistical learning via the alternating direction method of multipliers. Found Trends Mach Learn 3(1):1\u2013122","journal-title":"Found Trends Mach Learn"},{"key":"2275_CR59","unstructured":"Neumann JV (1950) Functional Operators (AM-22), Volume 2: The Geometry of Orthogonal Spaces.(AM-22). Princeton University Press, Princeton"},{"issue":"1","key":"2275_CR60","first-page":"390","volume":"44","author":"Q Wang","year":"2022","unstructured":"Wang Q, He X, Jiang X, Li X (2022) Robust bi-stochastic graph regularized matrix factorization for data clustering. IEEE Trans Pattern Anal Mach Intell 44(1):390\u2013403","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"1\u20132","key":"2275_CR61","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn HW (1955) The hungarian method for the assignment problem. Naval Res Logistics Q 2(1\u20132):83\u201397","journal-title":"Naval Res Logistics Q"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-024-02275-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13042-024-02275-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-024-02275-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T07:40:27Z","timestamp":1737531627000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13042-024-02275-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,6]]},"references-count":61,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["2275"],"URL":"https:\/\/doi.org\/10.1007\/s13042-024-02275-4","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"type":"print","value":"1868-8071"},{"type":"electronic","value":"1868-808X"}],"subject":[],"published":{"date-parts":[[2024,7,6]]},"assertion":[{"value":"25 June 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 June 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 July 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author declares that he has no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}