{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T02:56:08Z","timestamp":1774752968293,"version":"3.50.1"},"reference-count":33,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["11601221"],"award-info":[{"award-number":["11601221"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["11731006"],"award-info":[{"award-number":["11731006"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Pattern Recognition"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1016\/j.patcog.2019.107083","type":"journal-article","created":{"date-parts":[[2019,11,5]],"date-time":"2019-11-05T16:42:49Z","timestamp":1572972169000},"page":"107083","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"special_numbering":"C","title":["Sign consistency for the linear programming discriminant rule"],"prefix":"10.1016","volume":"100","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7444-6692","authenticated-orcid":false,"given":"Zhen","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shengzheng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Bian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.patcog.2019.107083_bib0001","series-title":"Discriminant Analysis and Statistical Pattern Recognition","author":"McLachlan","year":"2004"},{"issue":"3","key":"10.1016\/j.patcog.2019.107083_bib0002","doi-asserted-by":"crossref","first-page":"1083","DOI":"10.1016\/j.patcog.2007.07.022","article-title":"A comparison of generalized linear discriminant analysis algorithms","volume":"41","author":"Park","year":"2008","journal-title":"Pattern Recognit."},{"issue":"2","key":"10.1016\/j.patcog.2019.107083_bib0003","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1109\/TPAMI.2008.70","article-title":"Geometric mean for subspace selection","volume":"31","author":"Tao","year":"2009","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.patcog.2019.107083_bib0004","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1016\/j.patcog.2016.06.004","article-title":"Enhancing information discriminant analysis: feature extraction with linear statistical model and information-theoretic criteria","volume":"60","author":"Li","year":"2016","journal-title":"Pattern Recognit."},{"issue":"10","key":"10.1016\/j.patcog.2019.107083_bib0005","doi-asserted-by":"crossref","first-page":"2067","DOI":"10.1016\/S0031-3203(00)00162-X","article-title":"A direct LDA algorithm for high-dimensional data with application to face recognition","volume":"34","author":"Yu","year":"2001","journal-title":"Pattern Recognit."},{"issue":"6","key":"10.1016\/j.patcog.2019.107083_bib0006","doi-asserted-by":"crossref","first-page":"989","DOI":"10.3150\/bj\/1106314847","article-title":"Some theory for Fisher\u2019s linear discriminant function, \u2018Naive Bayes\u2019, and some alternatives when there are many more variables than observations","volume":"10","author":"Bickel","year":"2004","journal-title":"Bernoulli"},{"issue":"7","key":"10.1016\/j.patcog.2019.107083_bib0007","doi-asserted-by":"crossref","first-page":"1470","DOI":"10.1109\/TPAMI.2010.186","article-title":"Accuracy of pseudo-inverse covariance learning random matrix theory analysis","volume":"33","author":"Hoyle","year":"2011","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"12","key":"10.1016\/j.patcog.2019.107083_bib0008","doi-asserted-by":"crossref","first-page":"2325","DOI":"10.1109\/TPAMI.2014.2327983","article-title":"Asymptotic generalization bound of fisher linear discriminant analysis","volume":"36","author":"Bian","year":"2014","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.patcog.2019.107083_bib0009","series-title":"Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"1119","article-title":"Compressed fisher linear discriminant analysis: Classification of randomly projected data","author":"Durrant","year":"2010"},{"issue":"2","key":"10.1016\/j.patcog.2019.107083_bib0010","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/s10994-014-5466-8","article-title":"Random projections as regularizers: learning a linear discriminant from fewer observations than dimensions","volume":"99","author":"Durrant","year":"2014","journal-title":"Mach. Learn."},{"issue":"496","key":"10.1016\/j.patcog.2019.107083_bib0011","doi-asserted-by":"crossref","first-page":"1566","DOI":"10.1198\/jasa.2011.tm11199","article-title":"A direct estimation approach to sparse linear discriminant analysis","volume":"106","author":"Cai","year":"2011","journal-title":"J. Am. Stat. Assoc."},{"issue":"6","key":"10.1016\/j.patcog.2019.107083_bib0012","doi-asserted-by":"crossref","first-page":"2605","DOI":"10.1214\/07-AOS504","article-title":"High dimensional classification using features annealed independence rules","volume":"36","author":"Fan","year":"2008","journal-title":"Ann. Stat."},{"key":"10.1016\/j.patcog.2019.107083_bib0013","first-page":"2541","article-title":"On model selection consistency of lasso","volume":"7","author":"Zhao","year":"2006","journal-title":"J. Mach. Learn. Res."},{"key":"10.1016\/j.patcog.2019.107083_bib0014","series-title":"Proceedings of the 30th International Conference on Machine Learning (ICML-13)","first-page":"329","article-title":"Feature selection in high-dimensional classification","author":"Kolar","year":"2013"},{"issue":"4","key":"10.1016\/j.patcog.2019.107083_bib0015","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1111\/j.1467-9868.2012.01029.x","article-title":"A road to classification in high dimensional space: the regularized optimal affine discriminant","volume":"74","author":"Fan","year":"2012","journal-title":"J. Royal Stat. Soc."},{"issue":"498","key":"10.1016\/j.patcog.2019.107083_bib0016","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1080\/01621459.2012.682825","article-title":"Vast portfolio selection with gross-exposure constraints","volume":"107","author":"Fan","year":"2012","journal-title":"J. Am. Stat. Assoc."},{"issue":"1","key":"10.1016\/j.patcog.2019.107083_bib0017","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1093\/biomet\/asr066","article-title":"A direct approach to sparse discriminant analysis in ultra-high dimensions","volume":"99","author":"Mai","year":"2012","journal-title":"Biometrika"},{"key":"10.1016\/j.patcog.2019.107083_bib0018","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","article-title":"Regression shrinkage and selection via the lasso","author":"Tibshirani","year":"1996","journal-title":"J. Royal Stat. Soc., Series B (Methodological)"},{"issue":"4","key":"10.1016\/j.patcog.2019.107083_bib0019","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1198\/TECH.2011.08118","article-title":"Sparse discriminant analysis","volume":"53","author":"Clemmensen","year":"2011","journal-title":"Technometrics"},{"issue":"9","key":"10.1016\/j.patcog.2019.107083_bib0020","doi-asserted-by":"crossref","first-page":"1145","DOI":"10.1093\/bioinformatics\/btp019","article-title":"Sparse linear discriminant analysis for simultaneous testing for the significance of a gene set\/pathway and gene selection","volume":"25","author":"Wu","year":"2009","journal-title":"Bioinformatics"},{"issue":"2","key":"10.1016\/j.patcog.2019.107083_bib0021","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1080\/00401706.2012.746208","article-title":"A note on the connection and equivalence of three sparse linear discriminant analysis methods","volume":"55","author":"Mai","year":"2013","journal-title":"Technometrics"},{"issue":"2","key":"10.1016\/j.patcog.2019.107083_bib0022","doi-asserted-by":"crossref","first-page":"1063","DOI":"10.1109\/TIT.2014.2381241","article-title":"Optimal feature selection in high-dimensional discriminant analysis","volume":"61","author":"Kolar","year":"2015","journal-title":"Inf. Theory, IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.patcog.2019.107083_bib0023","first-page":"615","article-title":"Model selection consistency of Dantzig selector","volume":"23","author":"Gai","year":"2013","journal-title":"Stat. Sin."},{"key":"10.1016\/j.patcog.2019.107083_bib0024","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1214\/08-EJS177","article-title":"Sup-norm convergence rate and sign concentration property of lasso and Dantzig estimators","volume":"2","author":"Lounici","year":"2008","journal-title":"Electron. J. Stat."},{"issue":"1","key":"10.1016\/j.patcog.2019.107083_bib0025","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/cjs.11151","article-title":"Parallelism, uniqueness, and large-sample asymptotics for the Dantzig selector","volume":"41","author":"Dicker","year":"2013","journal-title":"Can. J. Stat."},{"key":"10.1016\/j.patcog.2019.107083_bib0026","doi-asserted-by":"crossref","first-page":"1360","DOI":"10.1214\/09-EJS506","article-title":"On the conditions used to prove oracle results for the lasso","volume":"3","author":"van de Geer","year":"2009","journal-title":"Electron. J. Stat."},{"key":"10.1016\/j.patcog.2019.107083_bib0027","series-title":"Statistics for High-Dimensional Data: Methods, Theory and Applications","author":"B\u00fchlmann","year":"2011"},{"key":"10.1016\/j.patcog.2019.107083_bib0028","series-title":"Communications in Statistics - Theory and Methods","first-page":"3321","article-title":"Variable selection of linear programming discriminant estimator","volume":"46","author":"Xia","year":"2017"},{"key":"10.1016\/j.patcog.2019.107083_bib0029","series-title":"Convex Optimization Theory","author":"Bertsekas","year":"2009"},{"key":"10.1016\/j.patcog.2019.107083_bib0030","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0711-5","article-title":"A Probabilistic Theory of Pattern Recognition","author":"Devroye","year":"1996"},{"key":"10.1016\/j.patcog.2019.107083_bib0031","article-title":"Aspects of Multivariate Statistical Theory","author":"Muirhead","year":"2005"},{"issue":"486","key":"10.1016\/j.patcog.2019.107083_bib0032","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1198\/jasa.2009.0121","article-title":"On consistency and sparsity for principal components analysis in high dimensions","volume":"104","author":"Johnstone","year":"2009","journal-title":"J. Am. Stat. Assoc."},{"key":"10.1016\/j.patcog.2019.107083_bib0033","doi-asserted-by":"crossref","first-page":"2389","DOI":"10.1016\/j.jmva.2008.02.024","article-title":"Properties of the singular, inverse and generalized inverse partitioned wishart distributions","volume":"99","author":"Bodnar","year":"2008","journal-title":"J. Multivar. Anal."}],"container-title":["Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S003132031930384X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S003132031930384X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,5,13]],"date-time":"2020-05-13T14:15:40Z","timestamp":1589379340000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S003132031930384X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4]]},"references-count":33,"alternative-id":["S003132031930384X"],"URL":"https:\/\/doi.org\/10.1016\/j.patcog.2019.107083","relation":{},"ISSN":["0031-3203"],"issn-type":[{"value":"0031-3203","type":"print"}],"subject":[],"published":{"date-parts":[[2020,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Sign consistency for the linear programming discriminant rule","name":"articletitle","label":"Article Title"},{"value":"Pattern Recognition","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.patcog.2019.107083","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"107083"}}