{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T15:20:45Z","timestamp":1771946445080,"version":"3.50.1"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031539688","type":"print"},{"value":"9783031539695","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-53969-5_33","type":"book-chapter","created":{"date-parts":[[2024,2,15]],"date-time":"2024-02-15T09:03:35Z","timestamp":1707987815000},"page":"445-462","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Can Complexity Measures and Instance Hardness Measures Reflect the Actual Complexity of Microarray Data?"],"prefix":"10.1007","author":[{"given":"Omaimah","family":"Al Hosni","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1797-8737","authenticated-orcid":false,"given":"Andrew","family":"Starkey","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,16]]},"reference":[{"key":"33_CR1","doi-asserted-by":"publisher","unstructured":"Sarbazi-Azad, S., Saniee Abadeh, M. Mowlaei, M.E.: Using data complexity measures and an evolutionary cultural algorithm for gene selection in Microarray Data. Soft Comput. Lett. 3, 100007 (2021). https:\/\/doi.org\/10.1016\/j.socl.2020.100007","DOI":"10.1016\/j.socl.2020.100007"},{"key":"33_CR2","doi-asserted-by":"publisher","unstructured":"Alonso-Betanzos, A. et al.: A review of microarray datasets: where to find them and specific characteristics. Methods Mol. Biol. 65\u201385 (2019). https:\/\/doi.org\/10.1007\/978-1-4939-9442-7_4","DOI":"10.1007\/978-1-4939-9442-7_4"},{"key":"33_CR3","doi-asserted-by":"publisher","unstructured":"Bolan-Canedo, V., Moran-Fernandez, L., Alonso-Betanzos, A.: An insight on complexity measures and classification in Microarray Data. In: 2015 International Joint Conference on Neural Networks (IJCNN) [Preprint] (205). https:\/\/doi.org\/10.1109\/ijcnn.2015.7280302","DOI":"10.1109\/ijcnn.2015.7280302"},{"issue":"3","key":"33_CR4","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1109\/34.990132","volume":"24","author":"TK Ho","year":"2002","unstructured":"Ho, T.K., Basu, M.: Complexity measures of supervised classification problems. IEEE Trans. Pattern Anal. Mach. Intell. 24(3), 289\u2013300 (2002)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"33_CR5","doi-asserted-by":"publisher","unstructured":"Barella, V.H., Garcia, L.P.F., de Souto, M.P., Lorena, A.C., de Carvalho, A.: Data Complexity Measures for Imbalanced Classification Tasks. In:\u00a02018 International Joint Conference on Neural Networks (IJCNN), pp. 1\u20138 (2018). https:\/\/doi.org\/10.1109\/IJCNN.2018.8489661","DOI":"10.1109\/IJCNN.2018.8489661"},{"key":"33_CR6","doi-asserted-by":"publisher","unstructured":"Garcia, L.P.F., Lorena, A.C., de Souto, M.C.P., Ho, T.K.: Classifier recommendation using data complexity measures. In:\u00a02018 24th International Conference on Pattern Recognition (ICPR), pp. 874\u2013879 (2018). https:\/\/doi.org\/10.1109\/ICPR.2018.8545110","DOI":"10.1109\/ICPR.2018.8545110"},{"key":"33_CR7","doi-asserted-by":"publisher","unstructured":"Shah, R., Khemani, V., Azarian, M., Pecht, M., Su, Y.: Analyzing data complexity using metafeatures for classification algorithm selection. In: 2018 Prognostics and System Health Management Conference (PHM-Chongqing), pp. 1280\u20131284 (2018). https:\/\/doi.org\/10.1109\/PHM-Chongqing.2018.00224","DOI":"10.1109\/PHM-Chongqing.2018.00224"},{"key":"33_CR8","doi-asserted-by":"publisher","unstructured":"Mor\u00e1n-Fern\u00e1ndez, L., Bol\u00f3n-Canedo, V. Alonso-Betanzos, A.: CAN classification performance be predicted by complexity measures? A study using microarray data. Knowl. Inf. Syst. 51(3), 1067\u20131090 (2016). https:\/\/doi.org\/10.1007\/s10115-016-1003-3","DOI":"10.1007\/s10115-016-1003-3"},{"key":"33_CR9","doi-asserted-by":"publisher","unstructured":"Al Hosni, O., Starkey, A.: Assesing the stability and selection performance of feature selection methods under different data complexity. Int. Arab J. Inf. Technol. 19(3A) (2022). https:\/\/doi.org\/10.34028\/iajit\/19\/3a\/4","DOI":"10.34028\/iajit\/19\/3a\/4"},{"issue":"2","key":"33_CR10","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10994-013-5422-z","volume":"95","author":"M Smith","year":"2013","unstructured":"Smith, M., Martinez, T., Giraud-Carrier, C.: An instance level analysis of data complexity. Mach. Learn. 95(2), 225\u2013256 (2013)","journal-title":"Mach. Learn."},{"key":"33_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-030-61380-8_33","volume-title":"Intelligent Systems","author":"JLM Arruda","year":"2020","unstructured":"Arruda, J.L.M., Prud\u00eancio, R.B.C., Lorena, A.C.: Measuring instance hardness using data complexity measures. In: Cerri, R., Prati, R.C. (eds.) BRACIS 2020. LNCS (LNAI), vol. 12320, pp. 483\u2013497. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-61380-8_33"},{"key":"33_CR12","doi-asserted-by":"publisher","unstructured":"Dong, N.T., Khosla, M.: Revisiting feature selection with Data Complexity (2019). https:\/\/doi.org\/10.1101\/754630","DOI":"10.1101\/754630"},{"key":"33_CR13","doi-asserted-by":"publisher","unstructured":"Leyva, E., Gonzalez, A., Perez, R.: A set of complexity measures designed for applying meta-learning to instance selection.\u00a0IEEE Trans. Knowl. Data Eng. 27(2), 354\u2013367 (2015). https:\/\/doi.org\/10.1109\/tkde.2014.2327034","DOI":"10.1109\/tkde.2014.2327034"},{"key":"33_CR14","doi-asserted-by":"publisher","unstructured":"Leyva, E., Gonzalez, A., Perez, R.: A set of complexity measures designed for applying meta-learning to instance selection.\u00a0IEEE Trans. Knowl. Data Eng. 27(2), 354\u2013367 (2014). https:\/\/doi.org\/10.1109\/tkde.2014.2327034","DOI":"10.1109\/tkde.2014.2327034"},{"key":"33_CR15","doi-asserted-by":"publisher","unstructured":"Lorena, A.C., et al.:\u00a0Analysis of complexity indices for classification problems: cancer gene expression data.\u00a0Neurocomputing, 75(1), 33\u201342 (2012). https:\/\/doi.org\/10.1016\/j.neucom.2011.03.054","DOI":"10.1016\/j.neucom.2011.03.054"},{"key":"33_CR16","doi-asserted-by":"publisher","unstructured":"Garcia, L.P.F., de Carvalho, A.C.P.L.F., Lorena, A.C.: Effect of label noise in the complexity of classification problems. Neurocomputing, 160, 108119 (2015). https:\/\/doi.org\/10.1016\/j.neucom.2014.10.085","DOI":"10.1016\/j.neucom.2014.10.085"},{"key":"33_CR17","unstructured":"Wang, Z., Zou, Q., Li, X.: Small sample size problem in machine learning. In: International Conference on Bioinformatics and Biomedical Engineering, pp. 373\u2013381. Springer, Cham (2019)"},{"issue":"10","key":"33_CR18","doi-asserted-by":"publisher","first-page":"2044","DOI":"10.1016\/j.ins.2009.12.010","volume":"180","author":"S Garc\u00eda","year":"2010","unstructured":"Garc\u00eda, S., Fern\u00e1ndez, A., Luengo, J., Herrera, F.: Advanced nonparametric tests for multiple comparisons in the design of experiments in computational intelligence and data mining: experimental analysis of power. Inf. Sci. 180(10), 2044\u20132064 (2010)","journal-title":"Inf. Sci."},{"issue":"1","key":"33_CR19","first-page":"10","volume":"28","author":"ML Zhang","year":"2016","unstructured":"Zhang, M.L., Zhou, Z.H.: A review on multi-label learning algorithms. IEEE Trans. Knowl. Data Eng. 28(1), 10\u201324 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"5","key":"33_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3347711","volume":"52","author":"A Lorena","year":"2020","unstructured":"Lorena, A., Garcia, L., Lehmann, J., Souto, M., Ho, T.: How complex is your classification problem? ACM Comput. Surv. 52(5), 1\u201334 (2020)","journal-title":"ACM Comput. Surv."},{"key":"33_CR21","doi-asserted-by":"publisher","unstructured":"Du, N.D., Huy, N.H., Hoai, N.X.: The impact of high dimensionality on SVM when classifying ERP data - a solution from LDA. In: Proceedings of the Sixth International Symposium on Information and Communication Technology\u00a0[Preprint] (2015). https:\/\/doi.org\/10.1145\/2833258.2833290","DOI":"10.1145\/2833258.2833290"},{"key":"33_CR22","doi-asserted-by":"publisher","unstructured":"Nasution, M.Z., Sitompul, O.S., Ramli, M.: PCA based feature reduction to improve the accuracy of Decision Tree C4.5 classification. J. Phys. Conf. Ser. 978, 012058 (2018). https:\/\/doi.org\/10.1088\/1742-6596\/978\/1\/012058","DOI":"10.1088\/1742-6596\/978\/1\/012058"}],"container-title":["Lecture Notes in Computer Science","Machine Learning, Optimization, and Data Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-53969-5_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,15]],"date-time":"2024-02-15T09:10:24Z","timestamp":1707988224000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-53969-5_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031539688","9783031539695"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-53969-5_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"16 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LOD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Machine Learning, Optimization, and Data Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Grasmere","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mod2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lod2023.icas.cc\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"In-house system and EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"119","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"72","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"61% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5-6","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1-2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}