{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T13:15:53Z","timestamp":1762866953692,"version":"3.41.0"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,10,7]],"date-time":"2016-10-07T00:00:00Z","timestamp":1475798400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001824","name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","doi-asserted-by":"publisher","award":["P103\/16\/25694Y","P103\/16\/25694Y"],"award-info":[{"award-number":["P103\/16\/25694Y","P103\/16\/25694Y"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001824","name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","doi-asserted-by":"publisher","award":["P103\/16\/25694Y"],"award-info":[{"award-number":["P103\/16\/25694Y"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006443","name":"Vysok\u00e1 \u0160kola B\u00e1nsk\u00e1 - Technick\u00e1 Univerzita Ostrava","doi-asserted-by":"publisher","award":["SP2016\/97","SP2016\/97"],"award-info":[{"award-number":["SP2016\/97","SP2016\/97"]}],"id":[{"id":"10.13039\/501100006443","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006443","name":"Vysok\u00e1 \u0160kola B\u00e1nsk\u00e1 - Technick\u00e1 Univerzita Ostrava","doi-asserted-by":"publisher","award":["SP2016\/97","SP2016\/97"],"award-info":[{"award-number":["SP2016\/97","SP2016\/97"]}],"id":[{"id":"10.13039\/501100006443","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1007\/s10479-016-2331-0","type":"journal-article","created":{"date-parts":[[2016,10,7]],"date-time":"2016-10-07T12:22:02Z","timestamp":1475842922000},"page":"205-222","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":36,"title":["Optimal column subset selection for image classification by genetic algorithms"],"prefix":"10.1007","volume":"265","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8428-3332","authenticated-orcid":false,"given":"Pavel","family":"Kr\u00f6mer","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8481-0136","authenticated-orcid":false,"given":"Jan","family":"Plato\u0161","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5213-3302","authenticated-orcid":false,"given":"Jana","family":"Nowakov\u00e1","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9600-8319","authenticated-orcid":false,"given":"V\u00e1clav","family":"Sn\u00e1\u0161el","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,10,7]]},"reference":[{"issue":"4","key":"2331_CR1","doi-asserted-by":"publisher","first-page":"1464","DOI":"10.1137\/120867287","volume":"34","author":"H Avron","year":"2013","unstructured":"Avron, H., & Boutsidis, C. (2013). Faster subset selection for matrices and applications. SIAM Journal on Matrix Analysis and Applications, 34(4), 1464\u20131499. doi: 10.1137\/120867287 .","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"2331_CR2","unstructured":"Balzano, L., Nowak, R., & Bajwa, W.U. (2010). Column subset selection with missing data. In NIPS workshop on low-rank methods for large-scale machine learning."},{"key":"2331_CR3","doi-asserted-by":"crossref","unstructured":"Boutsidis, C. (2009). An improved approximation algorithm for the column subset selection problem. In Proceedings of the twentieth annual ACM-SIAM symposium on discrete algorithms, ser. SODA \u201909. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics (pp. 968\u2013977). http:\/\/dl.acm.org\/citation.cfm?id=1496770.1496875","DOI":"10.1137\/1.9781611973068.105"},{"key":"2331_CR4","unstructured":"Boutsidis, C., & Magdon-Ismail, M. (2011). Deterministic feature selection for k-means clustering. arXiv:1109.5664 ."},{"key":"2331_CR5","doi-asserted-by":"crossref","unstructured":"Boutsidis, C., Mahoney, M.W., & Drineas, P. (2009). An improved approximation algorithm for the column subset selection problem. In Proceedings of the 20th annual ACM-SIAM symposium on discrete algorithms (SODA), SIAM, Philadelphia (pp. 968\u2013977).","DOI":"10.1137\/1.9781611973068.105"},{"key":"2331_CR6","unstructured":"Boutsidis, C., Zouzias, A., Mahoney, M. W., & Drineas, P. (2013). Stochastic dimensionality reduction for k-means clustering. arXiv:1110.2897 ."},{"key":"2331_CR7","doi-asserted-by":"crossref","unstructured":"Boutsidis, C., & Magdon-Ismail, M. (2014). A note on sparse leastsquares regression. Information Processing Letter, 114(5), 273\u2013276.","DOI":"10.1016\/j.ipl.2013.11.011"},{"key":"2331_CR8","volume-title":"Optimal subset selection: Multiple regression, interdependence and optimal network algorithms","author":"D Boyce","year":"2013","unstructured":"Boyce, D., Farhi, A., & Weischedel, R. (2013). Optimal subset selection: Multiple regression, interdependence and optimal network algorithms (Vol. 103). New York: Springer Science & Business Media."},{"key":"2331_CR9","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1137\/0913043","volume":"13","author":"TF Chan","year":"1992","unstructured":"Chan, T. F., & Hansen, P. C. (1992). Some applications of the rank revealing QR factorization. SIAM Journal on Scientific and Statistical Computing, 13, 727\u2013741.","journal-title":"SIAM Journal on Scientific and Statistical Computing"},{"key":"2331_CR10","doi-asserted-by":"crossref","unstructured":"Cicirello, V.\u00a0A. (2006). Non-wrapping order crossover: An order preserving crossover operator that respects absolute position. In Proceedings of the 8th annual conference on genetic and evolutionary computation, GECCO \u201906, New York, NY, USA. ACM (pp. 1125\u20131132).","DOI":"10.1145\/1143997.1144177"},{"key":"2331_CR11","doi-asserted-by":"crossref","unstructured":"\u00c7ivril, A., & Magdon-Ismail, M. (2012) Column subset selection via sparse approximation of SVD. Theoretical Computer Science, 421(0), 1\u201314. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397511009388","DOI":"10.1016\/j.tcs.2011.11.019"},{"issue":"4","key":"2331_CR12","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1016\/j.jcss.2014.01.004","volume":"80","author":"A \u00c7ivril","year":"2014","unstructured":"\u00c7ivril, A. (2014). Column subset selection problem is UG-hard. Journal of Computer and System Sciences, 80(4), 849\u2013859.","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"2331_CR13","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1137\/S0895479898332928","volume":"21","author":"C Couvreur","year":"2000","unstructured":"Couvreur, C., & Bresler, Y. (2000). On the optimality of the backward greedy algorithm for the subset selection problem. SIAM Journal on Matrix Analysis and Applications, 21(3), 797\u2013808. doi: 10.1137\/S0895479898332928 .","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"2331_CR14","doi-asserted-by":"crossref","unstructured":"Czarn, A., MacNish, C., Vijayan, K., & Turlach, B.\u00a0A. (2004). Statistical exploratory analysis of genetic algorithms: The influence of gray codes upon the difficulty of a problem. In Australian conference on artificial intelligence, ser. Lecture Notes in Computer Science, G.\u00a0I. Webb and X.\u00a0Yu, Eds., vol. 3339 (pp. 1246\u20131252). Springer.","DOI":"10.1007\/978-3-540-30549-1_130"},{"key":"2331_CR15","doi-asserted-by":"publisher","unstructured":"Das, A., & Kempe, D. (2008). Algorithms for subset selection in linear regression. In Proceedings of the fortieth annual ACM symposium on theory of computing, ser. STOC \u201908. New York, NY, USA: ACM (pp. 45\u201354). doi: 10.1145\/1374376.1374384","DOI":"10.1145\/1374376.1374384"},{"key":"2331_CR16","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/j.laa.2006.08.034","volume":"422","author":"FR Hoog de","year":"2007","unstructured":"de Hoog, F. R., & Mattheij, R. M. M. (2007). Subset selection for matrices. Linear Algebra and its Applications, 422, 349\u2013359.","journal-title":"Linear Algebra and its Applications"},{"key":"2331_CR17","doi-asserted-by":"crossref","first-page":"1845","DOI":"10.1016\/j.laa.2010.11.053","volume":"434","author":"FR Hoog de","year":"2011","unstructured":"de Hoog, F. R., & Mattheij, R. M. M. (2011). A note on subset selection for matrices. Linear Algebra and its Applications, 434, 1845\u20131850.","journal-title":"Linear Algebra and its Applications"},{"key":"2331_CR18","doi-asserted-by":"publisher","unstructured":"Deshpande, A., & Rademacher, L. (2010). Efficient volume sampling for row\/column subset selection. In Proceedings of the 2010 IEEE 51st annual symposium on foundations of computer science, ser. FOCS \u201910. Washington, DC, USA: IEEE Computer Society (pp. 329\u2013338). doi: 10.1109\/FOCS.2010.38","DOI":"10.1109\/FOCS.2010.38"},{"issue":"3","key":"2331_CR19","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s10462-015-9428-8","volume":"44","author":"R Diao","year":"2015","unstructured":"Diao, R., & Shen, Q. (2015). Nature inspired feature selection meta-heuristics. Artificial Intelligence Review, 44(3), 311\u2013340.","journal-title":"Artificial Intelligence Review"},{"key":"2331_CR20","doi-asserted-by":"crossref","unstructured":"Farahat, A.\u00a0K. (2013). Distributed column subset selection on mapreduce. In 2013 IEEE 13th international conference on data mining (ICDM) (pp. 171\u2013180).","DOI":"10.1109\/ICDM.2013.155"},{"key":"2331_CR21","unstructured":"Farahat, A.\u00a0K., Elgohary, A., Ghodsi, A., & Kamel, M.\u00a0S. (2013). Greedy column subset selection for large-scale data sets, CoRR. arXiv:1312.6838 ."},{"key":"2331_CR22","unstructured":"Farahat, A.\u00a0K., Ghodsi, A., & Kamel, M.\u00a0S. (2013). A fast greedy algorithm for generalized column subset selection. CoRR. arXiv:1312.6820 ."},{"key":"2331_CR23","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1145\/1132973.1132981","volume":"32","author":"L Foster","year":"2006","unstructured":"Foster, L., & Kommu, R. (2006). Algorithm 853: An efficient algorithm for solving rank-deficient least squares problems. ACM Transactions on Mathematical Software, 32, 157\u2013165.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"2331_CR24","unstructured":"Friedberg, S. (2003). Linear algebra, 4th edn. Prentice-Hall Of India Pvt. Limited. http:\/\/books.google.cz\/books?id=yLCLMQAACAAJ"},{"issue":"supplement 16","key":"2331_CR25","first-page":"189","volume":"31","author":"MD Garris","year":"1994","unstructured":"Garris, M. D. (1994). Design, collection, and analysis of handwriting sample image databases. Encyclopedia of Computer Science and Technology, 31(supplement 16), 189\u2013213.","journal-title":"Encyclopedia of Computer Science and Technology"},{"key":"2331_CR26","unstructured":"Golub, G., & Van\u00a0Loan, C. (1996). Matrix computations, 3rd edn. In Johns Hopkins studies in the mathematical sciences. Johns Hopkins University Press."},{"key":"2331_CR27","volume-title":"The elements of statistical learning: data mining, inference, and prediction. Springer series in statistics","author":"T Hastie","year":"2013","unstructured":"Hastie, T., Tibshirani, R., & Friedman, J. (2013). The elements of statistical learning: data mining, inference, and prediction. Springer series in statistics. New York: Springer."},{"key":"2331_CR28","doi-asserted-by":"crossref","first-page":"1244","DOI":"10.1137\/090780882","volume":"49","author":"ICF Ipsen","year":"2011","unstructured":"Ipsen, I. C. F., Kelley, C. T., & Pope, S. R. (2011). Rank-deficient nonlinear least squares problems and subset selection. SIAM Journal on Numerical Analysis, 49, 1244\u20131266.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"2331_CR29","volume-title":"Optimization theory","author":"H Th Jongen","year":"2004","unstructured":"Jongen, H. Th, Meer, K., & Triesch, E. (2004). Optimization theory. Berlin: Kluwer Academic Publishers."},{"key":"2331_CR30","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1109\/TSP.2008.2007095","volume":"57","author":"S Joshi","year":"2009","unstructured":"Joshi, S., & Boyd, S. (2009). Sensor selection via convex optimization. IEEE Transactions on Signal Processing, 57, 451\u2013462.","journal-title":"IEEE Transactions on Signal Processing"},{"key":"2331_CR31","doi-asserted-by":"crossref","unstructured":"Kr\u00f6mer, P., & Plato\u0161, J. (2014). Genetic algorithm for sampling from scale-free data and networks. In Proceedings of the 2014 annual conference on genetic and evolutionary computation, GECCO \u201914 (pp. 793\u2013800), New York, NY, USA, ACM.","DOI":"10.1145\/2576768.2598391"},{"key":"2331_CR32","doi-asserted-by":"crossref","unstructured":"Kr\u00f6mer, P., & Plato\u0161, J. (2016). A comparison of differential evolution and genetic algorithms for the column subset selection problem. In 9th international conference on computer recognition systems, CORES 2015; Wrocaw; Poland; Advances in Intelligent Systems and Computing, Vol 403 (pp. 223\u2013232).","DOI":"10.1007\/978-3-319-26227-7_21"},{"key":"2331_CR33","unstructured":"Maynard, H. B., Zandin, K. B., & Zandin, K. B. (2001). Maynard\u2019s industrial engineering handbook. McGraw-Hill, New York. No. Sirsi i9780070411029."},{"key":"2331_CR34","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3927.001.0001","volume-title":"An introduction to genetic algorithms","author":"M Mitchell","year":"1996","unstructured":"Mitchell, M. (1996). An introduction to genetic algorithms. Cambridge, MA: MIT Press."},{"issue":"3","key":"2331_CR35","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1016\/j.ejor.2005.05.034","volume":"179","author":"N Mladenovic","year":"2007","unstructured":"Mladenovic, N., Brimberg, J., Hansen, P., & Moreno-P\u00e9rez, J. A. (2007). The p-median problem: a survey of metaheuristic approaches. European Journal of Operational Research, 179(3), 927\u2013939.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"2331_CR36","doi-asserted-by":"crossref","first-page":"740","DOI":"10.1023\/A:1022395308695","volume":"39","author":"C-T Pan","year":"1999","unstructured":"Pan, C.-T., & Tang, P. (1999). Bounds on singular values revealed by QR factorizations. BIT Numerical Mathematics, 39(4), 740\u2013756.","journal-title":"BIT Numerical Mathematics"},{"key":"2331_CR37","volume-title":"Operations Research and Management Science Handbook","author":"A Ravindran","year":"2008","unstructured":"Ravindran, A. (2008). Operations Research and Management Science Handbook. New York: CRC Press. ISBN 978-0-8493-9721-9."},{"issue":"1","key":"2331_CR38","doi-asserted-by":"crossref","first-page":"3","DOI":"10.14311\/NNW.2012.22.001","volume":"22","author":"M Sabeti","year":"2012","unstructured":"Sabeti, M., Boostani, R., & Zoughi, T. (2012). Using genetic programming to select the informative eeg-based features to distinguish schizophrenic patients. Neural Network World, 22(1), 3\u201320.","journal-title":"Neural Network World"},{"key":"2331_CR39","doi-asserted-by":"crossref","unstructured":"Santana, L.\u00a0E.\u00a0A. S., & de\u00a0Paula\u00a0Canuto, A.\u00a0M. (2014). Filter-based optimization techniques for selection of feature subsets in ensemble systems. Expert Systems with Applications, 41(4), 1622\u20131631. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0957417413006805","DOI":"10.1016\/j.eswa.2013.08.059"},{"issue":"18","key":"2331_CR40","doi-asserted-by":"crossref","first-page":"3785","DOI":"10.1016\/j.neucom.2011.07.012","volume":"74","author":"J Shen","year":"2011","unstructured":"Shen, J., Ju, B., Jiang, T., Ren, J., Zheng, M., Yao, C., et al. (2011). Column subset selection for active learning in image classification. Neurocomputing, 74(18), 3785\u20133792.","journal-title":"Neurocomputing"},{"key":"2331_CR41","doi-asserted-by":"crossref","unstructured":"Tropp, J. A. (2009). Column subset selection, matrix factorization, and eigenvalue optimization. In: 20th annual ACM-SIAM symposium on discrete algorithms location, New York (pp. 978\u2013986).","DOI":"10.1137\/1.9781611973068.106"},{"key":"2331_CR42","doi-asserted-by":"crossref","unstructured":"Wang, Y., & Singh, A. (2015). An empirical comparison of sampling techniques for matrix column subset selection. In 2015 53rd annual allerton conference on communication, control, and computing, Allerton (pp. 1069\u20131074).","DOI":"10.1109\/ALLERTON.2015.7447127"},{"key":"2331_CR43","unstructured":"Wu, A.\u00a0S., Lindsay, R.\u00a0K., & Riolo, R. (1997). Empirical observations on the roles of crossover and mutation. In\u00a0B\u00e4ck, T. (ed.), Proceedings of the seventh international conference on genetic algorithms, San Francisco, CA (pp. 362\u2013369). Morgan Kaufmann. http:\/\/citeseer.ist.psu.edu\/wu97empirical.html"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-016-2331-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2331-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2331-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T02:53:54Z","timestamp":1749610434000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-016-2331-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,7]]},"references-count":43,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["2331"],"URL":"https:\/\/doi.org\/10.1007\/s10479-016-2331-0","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2016,10,7]]}}}