{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:30:21Z","timestamp":1743096621408,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031808883"},{"type":"electronic","value":"9783031808890"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-80889-0_1","type":"book-chapter","created":{"date-parts":[[2025,1,24]],"date-time":"2025-01-24T08:44:00Z","timestamp":1737708240000},"page":"3-20","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Estimating Combinatorial t-Way Coverage Based on\u00a0Matrix Complexity Metrics"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-4432-6843","authenticated-orcid":false,"given":"Luiza","family":"Corpaci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2524-6539","authenticated-orcid":false,"given":"Michael","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2206-9263","authenticated-orcid":false,"given":"Sebastian","family":"Raubitzek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1870-5143","authenticated-orcid":false,"given":"Ludwig","family":"Kampel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3031-505X","authenticated-orcid":false,"given":"Kevin","family":"Mallinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8588-1924","authenticated-orcid":false,"given":"Dimitris E.","family":"Simos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,25]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Ahmed, B.S., Gambardella, L.M., Zamli, K.Z.: A new approach to speed up combinatorial search strategies using stack and hash table. In: 2016 SAI Computing Conference (SAI), pp. 1217\u20131222 (2016)","DOI":"10.1109\/SAI.2016.7556133"},{"issue":"2","key":"1_CR2","doi-asserted-by":"publisher","first-page":"221","DOI":"10.2140\/pmp.2021.2.221","volume":"2","author":"J Alt","year":"2021","unstructured":"Alt, J., Erd\u0151s, L., Kr\u00fcger, T.: Spectral radius of random matrices with independent entries. Probab. Math. Phys. 2(2), 221\u2013280 (2021)","journal-title":"Probab. Math. Phys."},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Baranov, E., Chakraborty, S., Legay, A., Meel, K.S., Variyam, V.N.: A scalable t-wise coverage estimator. In: Proceedings of the 44th International Conference on Software Engineering, pp. 36\u201347 (2022)","DOI":"10.1145\/3510003.3510218"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Benjamin\u00a0Erichson, N., Brunton, S.L., Nathan\u00a0Kutz, J.: Compressed singular value decomposition for image and video processing. In: Proceedings of the IEEE International Conference on Computer Vision (ICCV) Workshops (2017)","DOI":"10.1109\/ICCVW.2017.222"},{"issue":"4","key":"1_CR5","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1137\/0609045","volume":"9","author":"A Edelman","year":"1988","unstructured":"Edelman, A.: Eigenvalues and condition numbers of random matrices. SIAM J. Matrix Anal. Appl. 9(4), 543\u2013560 (1988)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Erichson, N.B., Voronin, S., Brunton, S.L., Kutz, J.N.: Randomized matrix decompositions using R. J. Stat. Softw. 89(11) (2019)","DOI":"10.18637\/jss.v089.i11"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Grindal, M., Offutt, J.: Input parameter modeling for combination strategies. In: Proceedings of the 25th Conference on IASTED International Multi-Conference: Software Engineering, SE 2007, pp. 255\u2013260. ACTA Press, Anaheim (2007)","DOI":"10.1109\/ASWEC.2007.27"},{"issue":"3","key":"1_CR8","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1002\/stvr.319","volume":"15","author":"M Grindal","year":"2005","unstructured":"Grindal, M., Offutt, J., Andler, S.F.: Combination testing strategies: a survey. Softw. Test. Verif. Reliabil. 15(3), 167\u2013199 (2005)","journal-title":"Softw. Test. Verif. Reliabil."},{"issue":"2","key":"1_CR9","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1137\/090771806","volume":"53","author":"N Halko","year":"2011","unstructured":"Halko, N., Martinsson, P.G., Tropp, J.A.: Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions. SIAM Rev. 53(2), 217\u2013288 (2011)","journal-title":"SIAM Rev."},{"key":"1_CR10","unstructured":"Jackson, P.T., Abarghouei, A.A., Bonner, S., Breckon, T.P., Obara, B.: Style augmentation: data augmentation via style randomization. In: Conference on Computer Vision and Pattern Recognition (CVPR) Workshops, vol.\u00a06, pp. 10\u201311 (2019)"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Jayakumar, A.V., et al.: Systematic software testing of critical embedded digital devices in nuclear power applications. In: IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW), pp. 85\u201390. IEEE (2020)","DOI":"10.1109\/ISSREW51248.2020.00042"},{"key":"1_CR12","unstructured":"Ke, G., et al.: LightGBM: a highly efficient gradient boosting decision tree. In: Proceedings of the 31st International Conference on Neural Information Processing Systems, NIPS 2017, pp. 3149\u20133157. Curran Associates Inc., Red Hook (2017)"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Kuhn, D.R., Mendoza, I.D., Kacker, R.N., Lei, Y.: Combinatorial coverage measurement concepts and applications. In: 2013 IEEE Sixth International Conference on Software Testing, Verification and Validation Workshops, pp. 352\u2013361 (2013)","DOI":"10.1109\/ICSTW.2013.77"},{"key":"1_CR14","unstructured":"Kuhn, D., Kacker, R., Lei, Y.: Introduction to Combinatorial Testing. Chapman & Hall\/CRC Innovations in Software Engineering and Software Development Series, 1st edn. Taylor & Francis (2013)"},{"issue":"1","key":"1_CR15","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1109\/MC.2019.2951980","volume":"53","author":"R Kuhn","year":"2020","unstructured":"Kuhn, R., Kacker, R.N., Lei, Y., Simos, D.: Input space coverage matters. Computer 53(1), 37\u201344 (2020)","journal-title":"Computer"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Leithner, M., Kleine, K., Simos, D.E.: CAMETRICS: a tool for advanced combinatorial analysis and measurement of test sets. In: 2018 IEEE International Conference on Software Testing, Verification and Validation Workshop (ICSTW), pp. 318\u2013327 (2018)","DOI":"10.1109\/ICSTW.2018.00067"},{"key":"1_CR17","unstructured":"Louppe, G., Wehenkel, L., Sutera, A., Geurts, P.: Understanding variable importances in forests of randomized trees. In: Advances in Neural Information Processing Systems, vol.\u00a026. Curran Associates, Inc. (2013)"},{"issue":"4","key":"1_CR18","doi-asserted-by":"publisher","first-page":"1689","DOI":"10.3758\/s13428-020-01516-y","volume":"53","author":"D Makowski","year":"2021","unstructured":"Makowski, D., et al.: NeuroKit2: a python toolbox for neurophysiological signal processing. Behav. Res. Methods 53(4), 1689\u20131696 (2021)","journal-title":"Behav. Res. Methods"},{"key":"1_CR19","doi-asserted-by":"publisher","first-page":"101429","DOI":"10.1016\/j.cosust.2024.101429","volume":"67","author":"K Mallinger","year":"2024","unstructured":"Mallinger, K., Raubitzek, S., Neubauer, T., Lade, S.: Potentials and limitations of complexity research for environmental sciences and modern farming applications. Curr. Opin. Environ. Sustain. 67, 101429 (2024)","journal-title":"Curr. Opin. Environ. Sustain."},{"key":"1_CR20","unstructured":"Oh, J., Gazzillo, P., Batory, D.: t-wise coverage by uniform sampling. In: Proceedings of the 23rd International Systems and Software Product Line Conference-Volume A, pp. 84\u201387 (2019)"},{"key":"1_CR21","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Prasantha, H., Shashidhara, H., Balasubramanya\u00a0Murthy, K.: Image compression using SVD. In: International Conference on Computational Intelligence and Multimedia Applications (ICCIMA 2007), vol.\u00a03, pp. 143\u2013145 (2007)","DOI":"10.1109\/ICCIMA.2007.386"},{"issue":"12","key":"1_CR23","doi-asserted-by":"publisher","first-page":"1671","DOI":"10.3390\/e25121671","volume":"25","author":"S Raubitzek","year":"2023","unstructured":"Raubitzek, S., Corpaci, L., Hofer, R., Mallinger, K.: Scaling exponents of time series data: a machine learning approach. Entropy 25(12), 1671 (2023)","journal-title":"Entropy"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Raubitzek, S., Neubauer, T.: Combining measures of signal complexity and machine learning for time series analysis: a review. Entropy 23(12) (2021)","DOI":"10.3390\/e23121672"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Raubitzek, S., Schrittwieser, S., Lawitschka, C., Mallinger, K., Ekelhart, A., Weippl, E.: Code obfuscation classification using singular value decomposition on grayscale image representations. In: SECRYPT (2024)","DOI":"10.5220\/0012856600003767"},{"issue":"1","key":"1_CR26","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/BF02513272","volume":"37","author":"SJ Roberts","year":"1999","unstructured":"Roberts, S.J., Penny, W., Rezek, I.: Temporal and spatial complexity measures for electroencephalogram based brain-computer interfacing. Med. Biol. Eng. Comput. 37(1), 93\u201398 (1999)","journal-title":"Med. Biol. Eng. Comput."},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Schrittwieser, S., et al.: Modeling obfuscation stealth through code complexity. In: Computer Security. ESORICS 2023 International Workshops, pp. 392\u2013408. Springer, Cham (2024)","DOI":"10.1007\/978-3-031-54129-2_23"},{"issue":"10","key":"1_CR28","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1109\/MC.2016.314","volume":"49","author":"DE Simos","year":"2016","unstructured":"Simos, D.E., Kuhn, R., Voyiatzis, A.G., Kacker, R.: Combinatorial methods in security testing. Computer 49(10), 80\u201383 (2016)","journal-title":"Computer"},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"Smith, R., et al.: Applying combinatorial testing to large-scale data processing at Adobe. In: 2019 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW), pp. 190\u2013193 (2019)","DOI":"10.1109\/ICSTW.2019.00051"},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"Smith, R., Jarman, D., Bellows, J., Kuhn, R., Kacker, R., Simos, D.: Measuring combinatorial coverage at adobe. In: IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW), pp. 194\u2013197 (2019)","DOI":"10.1109\/ICSTW.2019.00052"},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the lasso. J. Roy. Stat. Soc.: Ser. B (Methodol.) 58(1), 267\u2013288 (2018)","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"key":"1_CR32","doi-asserted-by":"publisher","first-page":"42774","DOI":"10.1109\/ACCESS.2019.2907057","volume":"7","author":"J Torres-Jimenez","year":"2019","unstructured":"Torres-Jimenez, J., Izquierdo-Marquez, I., Avila-George, H.: Methods to construct uniform covering arrays. IEEE Access 7, 42774\u201342797 (2019)","journal-title":"IEEE Access"},{"key":"1_CR33","doi-asserted-by":"crossref","unstructured":"Wagner, M., Kampel, L., Simos, D.E.: Quantum-inspired evolutionary algorithms for covering arrays of arbitrary strength. In: Analysis of Experimental Algorithms, pp. 300\u2013316. Springer, Cham (2019)","DOI":"10.1007\/978-3-030-34029-2_20"},{"issue":"3","key":"1_CR34","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1109\/TSE.2018.2852744","volume":"46","author":"H Wu","year":"2020","unstructured":"Wu, H., Nie, C., Petke, J., Jia, Y., Harman, M.: An empirical comparison of combinatorial testing, random testing and adaptive random testing. IEEE Trans. Softw. Eng. 46(3), 302\u2013320 (2020)","journal-title":"IEEE Trans. Softw. Eng."}],"container-title":["Lecture Notes in Computer Science","Testing Software and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-80889-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,24]],"date-time":"2025-01-24T08:44:12Z","timestamp":1737708252000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-80889-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031808883","9783031808890"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-80889-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"25 January 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"ICTSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IFIP International Conference on Testing Software and Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 November 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"36","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pts2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/ictss-2024","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}