{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T13:41:54Z","timestamp":1762868514074,"version":"3.37.3"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"21","license":[{"start":{"date-parts":[[2021,5,10]],"date-time":"2021-05-10T00:00:00Z","timestamp":1620604800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,10]],"date-time":"2021-05-10T00:00:00Z","timestamp":1620604800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100009965","name":"Dalian Science and Technology Bureau","doi-asserted-by":"publisher","award":["2018RQ70"],"award-info":[{"award-number":["2018RQ70"]}],"id":[{"id":"10.13039\/501100009965","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s00521-021-06069-5","type":"journal-article","created":{"date-parts":[[2021,5,10]],"date-time":"2021-05-10T00:02:42Z","timestamp":1620604962000},"page":"14247-14261","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Exclusive lasso-based k-nearest-neighbor classification"],"prefix":"10.1007","volume":"33","author":[{"given":"Lin","family":"Qiu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2441-713X","authenticated-orcid":false,"given":"Yanpeng","family":"Qu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changjing","family":"Shang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Longzhi","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fei","family":"Chao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,10]]},"reference":[{"issue":"1","key":"6069_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","volume":"13","author":"TM Cover","year":"1967","unstructured":"Cover TM, Hart PE (1967) Nearest neighbor pattern classification. IEEE Trans Inf Theory 13(1):21\u201327","journal-title":"IEEE Trans Inf Theory"},{"key":"6069_CR2","first-page":"207","volume":"10","author":"Kilian Q Weinberger","year":"2009","unstructured":"Weinberger Kilian Q, Saul Lawrence K (2009) Distance metric learning for large margin nearest neighbor classification. J Machine Learn Res 10:207\u2013244","journal-title":"J Machine Learn Res"},{"key":"6069_CR3","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1016\/j.eswa.2018.08.021","volume":"115","author":"J Gou","year":"2019","unstructured":"Gou J, Ma H, Ou W, Zeng S, Rao Y, Yang H (2019) A generalized mean distance-based k-nearest neighbor classifier. Expert Syst Appl 115:356\u2013372","journal-title":"Expert Syst Appl"},{"issue":"2","key":"6069_CR4","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1109\/72.750575","volume":"10","author":"SZ Li","year":"1999","unstructured":"Li SZ, Lu J (1999) Face recognition using the nearest feature line method. IEEE Trans Neural Net 10(2):439\u2013443","journal-title":"IEEE Trans Neural Net"},{"issue":"1","key":"6069_CR5","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1016\/j.patcog.2006.06.033","volume":"40","author":"Q Gao","year":"2007","unstructured":"Gao Q, Wang Z (2007) Center-based nearest neighbor classifier. Pattern Recogn 40(1):346\u2013349","journal-title":"Pattern Recogn"},{"issue":"6","key":"6069_CR6","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1002\/cpa.20132","volume":"59","author":"D Donoho","year":"2006","unstructured":"Donoho D (2006) For most large underdetermined systems of linear equations the minimal 1-norm solution is also the sparsest solution. Commun Pure Appl Math 59(6):797\u2013829","journal-title":"Commun Pure Appl Math"},{"key":"6069_CR7","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1109\/ACCESS.2015.2430359","volume":"3","author":"Z Zhang","year":"2017","unstructured":"Zhang Z, Xu Y, Yang J, Li X, Zhang D (2017) A survey of sparse representation: algorithms and applications. IEEE Access 3:490\u2013530","journal-title":"IEEE Access"},{"issue":"4","key":"6069_CR8","doi-asserted-by":"publisher","first-page":"1709","DOI":"10.1016\/j.patcog.2013.10.018","volume":"47","author":"J Zhang","year":"2014","unstructured":"Zhang J, Yang J (2014) Linear reconstruction measure steered nearest neighbor classification framework. Pattern Recogn 47(4):1709\u20131720","journal-title":"Pattern Recogn"},{"key":"6069_CR9","doi-asserted-by":"crossref","unstructured":"Tibshirani RJ (1996) Regression shrinkage and selection via the lasso. J Roy Stat Soc B 58(1)","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"issue":"2","key":"6069_CR10","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1109\/TPAMI.2008.79","volume":"31","author":"J Wright","year":"2009","unstructured":"Wright J, Yang AY, Ganesh A, Sastry SS, Ma Y (2009) Robust face recognition via sparse representation. IEEE Trans Pattern Anal Mach Intell 31(2):210\u2013227","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"6069_CR11","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.neucom.2012.04.034","volume":"116","author":"J Li","year":"2013","unstructured":"Li J, Lu C (2013) A new decision rule for sparse representation based classification for face recognition. Neurocomputing 116:265\u2013271","journal-title":"Neurocomputing"},{"issue":"9","key":"6069_CR12","doi-asserted-by":"publisher","first-page":"980","DOI":"10.1016\/j.patrec.2013.01.028","volume":"34","author":"Y Xu","year":"2013","unstructured":"Xu Y, Zhu Q, Fan Z, Qiu M, Chen Y, Liu H (2013) Coarse to fine k nearest neighbor classifier. Pattern Recogn Lett 34(9):980\u2013986","journal-title":"Pattern Recogn Lett"},{"key":"6069_CR13","doi-asserted-by":"publisher","first-page":"16618","DOI":"10.1109\/ACCESS.2017.2739807","volume":"5","author":"H Ma","year":"2017","unstructured":"Ma H, Gou J, Wang X, Ke J, Zeng S (2017) Sparse coefficient-based $${k}$$-nearest neighbor classification. IEEE Access 5:16618\u201316634","journal-title":"IEEE Access"},{"key":"6069_CR14","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.patrec.2017.09.036","volume":"109","author":"S Zhang","year":"2018","unstructured":"Zhang S, Cheng D, Deng Z, Zong M, Deng X (2018) A novel knn algorithm with data-driven k parameter computation. Pattern Recogn Lett 109:44\u201354","journal-title":"Pattern Recogn Lett"},{"issue":"2","key":"6069_CR15","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1109\/TPAMI.2008.79","volume":"31","author":"J Wright","year":"2009","unstructured":"Wright J, Ganesh A, Zhou Z, Wagner A (2009) Robust (2007) face recognition via sparse representation. IEEE Trans Pattern Anal Mach Intell 31(2):210\u2013227","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"6069_CR16","doi-asserted-by":"crossref","unstructured":"Yang M, Zhang L, Yang J, Zhang D (2011) Robust sparse coding for face recognition. CVPR 2011 42(7): 625\u2013632","DOI":"10.1109\/CVPR.2011.5995393"},{"issue":"1","key":"6069_CR17","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1111\/j.1467-9868.2005.00532.x","volume":"68","author":"M Yuan","year":"2006","unstructured":"Yuan M, Lin Y (2006) Model selection and estimation in regression with grouped variables. J Roy Stat Soc 68(1):49\u201367","journal-title":"J Roy Stat Soc"},{"key":"6069_CR18","doi-asserted-by":"crossref","unstructured":"Jacob L, Obozinski G, Vert JP (2009) Group lasso with overlap and graph lasso. In: International Conference on Machine Learning","DOI":"10.1145\/1553374.1553431"},{"key":"6069_CR19","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.patrec.2019.02.011","volume":"130","author":"J Chen","year":"2020","unstructured":"Chen J, Zhou S, Kang Z, Wen Q (2020) Locality-constrained group lasso coding for microvessel image classification - sciencedirect. Pattern Recogn Lett 130:132\u2013138","journal-title":"Pattern Recogn Lett"},{"key":"6069_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TIM.2020.3043940","volume":"70","author":"Z Diwu","year":"2021","unstructured":"Diwu Z, Cao H, Wang L, Chen X (2021) Collaborative double sparse period-group lasso for bearing fault diagnosis. IEEE Trans Instrum Meas 70:1\u201310","journal-title":"IEEE Trans Instrum Meas"},{"key":"6069_CR21","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-319-14717-8_28","volume":"8933","author":"S Zhang","year":"2014","unstructured":"Zhang S, Zong M, Sun K, Liu Y, Cheng D (2014) Efficient knn algorithm based on graph sparse reconstruction. Lect Notes in Comput Sci 8933:356\u2013369","journal-title":"Lect Notes in Comput Sci"},{"key":"6069_CR22","unstructured":"Tang Y, Li X, Xu Y, Liu S (2014) Group lasso based collaborative representation for face recognition. In: 2014 4th IEEE International Conference on Network Infrastructure and Digital Content"},{"key":"6069_CR23","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/j.patrec.2019.12.020","volume":"131","author":"S Zheng","year":"2020","unstructured":"Zheng S, Ding C (2020) A group lasso based sparse knn classifier. Pattern Recogn Lett 131:227\u2013233","journal-title":"Pattern Recogn Lett"},{"key":"6069_CR24","unstructured":"Zhou Y, Jin R , Hoi S (2010) Exclusive lasso for multi-task feature selection. In: Proceedings of the thirteenth international conference on artificial intelligence and statistics. JMLR.org, pp 988\u2013995"},{"issue":"6","key":"6069_CR25","first-page":"1429","volume":"9","author":"J Gou","year":"2012","unstructured":"Gou J, Du L, Zhang Y, Xiong T (2012) A new distance-weighted k-nearest neighbor classifier. J Inf Comput Sci 9(6):1429\u20131436","journal-title":"J Inf Comput Sci"},{"issue":"2","key":"6069_CR26","doi-asserted-by":"publisher","first-page":"4220","DOI":"10.1214\/17-EJS1317","volume":"11","author":"F Campbell","year":"2017","unstructured":"Campbell F, Allen G (2017) Within group variable selection through the exclusive lasso. Electron J Stat 11(2):4220\u20134257","journal-title":"Electron J Stat"},{"issue":"6A","key":"6069_CR27","doi-asserted-by":"publisher","first-page":"3468","DOI":"10.1214\/07-AOS584","volume":"37","author":"P Zhao","year":"2009","unstructured":"Zhao P, Rocha G, Yu B (2009) The composite absolute penalties family for grouped and hierarchical variable selection. Ann Stat 37(6A):3468\u20133497","journal-title":"Ann Stat"},{"key":"6069_CR28","unstructured":"Obozinski G, Bach F (2012) Convex relaxation for combinatorial penalties. Eprint Arxiv:125.1240"},{"key":"6069_CR29","unstructured":"Kong D, Fujimaki R, Liu J, Nie F, Ding C (2014) Exclusive feature learning on arbitrary structures via l(1,2)-norm. In: Advances in neural information processing systems 27 (NIPS 2014), 27"},{"key":"6069_CR30","unstructured":"Sun Y, Chain B, Kaski S, Shawe-Taylor J (2020) Correlated feature selection with extended exclusive group lasso. CoRR, abs\/2002.12460"},{"key":"6069_CR31","volume-title":"UCI machine learning repository","author":"D Dheeru","year":"2017","unstructured":"Dheeru D, Graff C (2017) UCI machine learning repository. University of California, School of Information and Computer Sciences, lrvine"},{"issue":"1","key":"6069_CR32","doi-asserted-by":"publisher","first-page":"1238","DOI":"10.2991\/ijcis.10.1.82","volume":"10","author":"I Triguero","year":"2017","unstructured":"Triguero I, Gonzalez SV, Moyano J, Garcia S (2017) Keel 3.0: an open source software for multi-stage analysis in data mining. Int J Comput Intell Syst 10(1):1238\u20131249","journal-title":"Int J Comput Intell Syst"},{"issue":"6","key":"6069_CR33","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1145\/3136625","volume":"50","author":"J Li","year":"2018","unstructured":"Li J, Chen K, Wang S, Morstatter F (2018) Feature selection: a data perspective. ACM Comput Surv (CSUR) 50(6):94","journal-title":"ACM Comput Surv (CSUR)"},{"key":"6069_CR34","unstructured":"Martinez AM, Benavente R (1998) The ar face database. In: CVC Technical Report #24, 01"},{"issue":"6","key":"6069_CR35","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1109\/34.927464","volume":"23","author":"AS Georghiades","year":"2002","unstructured":"Georghiades AS, Belhumeur PN, Kriegman DJ (2002) From few to many: illumination cone models for face recognition under variable lighting and pose. IEEE Transac Pattern Analy Machine Intell 23(6):643\u2013660","journal-title":"IEEE Transac Pattern Analy Machine Intell"},{"issue":"10","key":"6069_CR36","doi-asserted-by":"publisher","first-page":"1319","DOI":"10.1109\/TMI.2003.817780","volume":"22","author":"MB Stegmann","year":"2003","unstructured":"Stegmann MB, Ersboll BK, Larsen R (2003) Fame-a flexible appearance modeling environment. IEEE Trans Med Imaging 22(10):1319\u20131331","journal-title":"IEEE Trans Med Imaging"},{"key":"6069_CR37","doi-asserted-by":"crossref","unstructured":"Bengio Y, Grandvalet Y (2005) Bias in estimating the variance of K-fold cross-validation. 1:75\u201395","DOI":"10.1007\/0-387-24555-3_5"},{"key":"6069_CR38","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.eswa.2016.09.031","volume":"67","author":"Z Pan","year":"2017","unstructured":"Pan Z, Wang Y, Ku W (2017) A new k-harmonic nearest neighbor classifier based on the multi-local means. Expert Syst Appl 67:115\u2013125","journal-title":"Expert Syst Appl"},{"issue":"6","key":"6069_CR39","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1016\/j.ins.2008.11.007","volume":"179","author":"L Peng","year":"2009","unstructured":"Peng L, Yang B, Chen Y, Abraham A (2009) Data gravitation based classification. Inf Sci 179(6):809\u2013819","journal-title":"Inf Sci"},{"key":"6069_CR40","unstructured":"John GH, Langley P (1995) Estimating continuous distributions in bayesian classifiers. In: Eleventh conference on uncertainty in artificial intelligence, 338\u2013345"},{"key":"6069_CR41","first-page":"115","volume":"95","author":"WW Cohen","year":"1995","unstructured":"Cohen WW (1995) Fast effective rule induction. Mach Learn Proc 95:115\u2013123","journal-title":"Mach Learn Proc"},{"key":"6069_CR42","unstructured":"Quinlan R (1992) C4.5 : programs for machine learning. Morgan Kaufmann Publishers Inc."},{"key":"6069_CR43","unstructured":"Freund Y, Schapire R (1996) Experiments with a new boosting algorithm draft-please do not distribute. In: Thirteenth international conference on international conference on machine learning"},{"key":"6069_CR44","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman L (2001) Random forests. Mach Learn 45:5\u201332","journal-title":"Mach Learn"},{"issue":"2","key":"6069_CR45","first-page":"123","volume":"24","author":"L Breiman","year":"1996","unstructured":"Breiman L (1996) Bagging predictors. Mach Learn 24(2):123\u201314","journal-title":"Mach Learn"},{"issue":"6088","key":"6069_CR46","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1038\/323533a0","volume":"323","author":"DE Rumelhart","year":"1986","unstructured":"Rumelhart DE, Hinton GE, Williams RJ (1986) Learning representations by back propagating errors. Nature 323(6088):533\u2013536","journal-title":"Nature"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-021-06069-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-021-06069-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-021-06069-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,24]],"date-time":"2021-10-24T06:05:33Z","timestamp":1635055533000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-021-06069-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,10]]},"references-count":46,"journal-issue":{"issue":"21","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["6069"],"URL":"https:\/\/doi.org\/10.1007\/s00521-021-06069-5","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"type":"print","value":"0941-0643"},{"type":"electronic","value":"1433-3058"}],"subject":[],"published":{"date-parts":[[2021,5,10]]},"assertion":[{"value":"17 November 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 May 2021","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 authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}