{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T04:05:57Z","timestamp":1747541157834,"version":"3.40.5"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T00:00:00Z","timestamp":1746662400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T00:00:00Z","timestamp":1746662400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"DOI":"10.13039\/100014440","name":"Ministerio de Ciencia, Innovaci\u00f3n y Universidades","doi-asserted-by":"publisher","award":["PID2019-108528RB-C22","PID2023-149943OB-I00"],"award-info":[{"award-number":["PID2019-108528RB-C22","PID2023-149943OB-I00"]}],"id":[{"id":"10.13039\/100014440","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s40747-025-01911-y","type":"journal-article","created":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T06:41:20Z","timestamp":1746686480000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Complexity analysis and practical resolution of the data classification problem with private characteristics"],"prefix":"10.1007","volume":"11","author":[{"given":"David","family":"Pantoja","sequence":"first","affiliation":[]},{"given":"Ismael","family":"Rodr\u00edguez","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8969-6002","authenticated-orcid":false,"given":"Fernando","family":"Rubio","sequence":"additional","affiliation":[]},{"given":"Clara","family":"Segura","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,8]]},"reference":[{"issue":"3","key":"1911_CR1","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1007\/s12065-023-00822-6","volume":"17","author":"B Alhijawi","year":"2024","unstructured":"Alhijawi B, Awajan A (2024) Genetic algorithms: theory, genetic operators, solutions, and applications. Evol Intel 17(3):1245\u20131256","journal-title":"Evol Intel"},{"key":"1911_CR2","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.ijmedinf.2017.04.003","volume":"103","author":"R Caballero","year":"2017","unstructured":"Caballero R, Sen S, Nyg\u00e5rd JF (2017) Anticipating anonymity in screening program databases. Int J Med Inform 103:20\u201331","journal-title":"Int J Med Inform"},{"key":"1911_CR3","volume-title":"Practical nonparametric statistics","author":"WJ Conover","year":"1999","unstructured":"Conover WJ (1999) Practical nonparametric statistics, vol 350. Wiley, London"},{"key":"1911_CR4","first-page":"1","volume":"25","author":"B Dattner","year":"2019","unstructured":"Dattner B, Chamorro-Premuzic T, Buchband R, Schettler L (2019) The legal and ethical implications of using AI in hiring. Harv Bus Rev 25:1\u20137","journal-title":"Harv Bus Rev"},{"key":"1911_CR5","unstructured":"Esponda F (2006) Negative surveys. Preprint arXiv:math\/0608176"},{"key":"1911_CR6","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.comcom.2016.12.016","volume":"100","author":"J Estrada-Jim\u00e9nez","year":"2017","unstructured":"Estrada-Jim\u00e9nez J, Parra-Arnau J, Rodr\u00edguez-Hoyos A, Forn\u00e9 J (2017) Online advertising: analysis of privacy threats and protection approaches. Comput Commun 100:32\u201351","journal-title":"Comput Commun"},{"key":"1911_CR7","volume-title":"Alpha-beta pruning","author":"C Felstiner","year":"2019","unstructured":"Felstiner C (2019) Alpha-beta pruning. Whitman College, New York"},{"key":"1911_CR8","doi-asserted-by":"publisher","DOI":"10.1145\/3337064","author":"S Fletcher","year":"2019","unstructured":"Fletcher S, Islam MZ (2019) Decision tree classification with differential privacy: a survey. ACM Comput Surv. https:\/\/doi.org\/10.1145\/3337064","journal-title":"ACM Comput Surv"},{"issue":"5","key":"1911_CR9","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1109\/TKDE.2007.1015","volume":"19","author":"BC Fung","year":"2007","unstructured":"Fung BC, Wang K, Yu PS (2007) Anonymizing classification data for privacy preservation. IEEE Trans Knowl Data Eng 19(5):711\u2013725. https:\/\/doi.org\/10.1109\/TKDE.2007.1015","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1911_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110094","volume":"136","author":"J Galiana","year":"2023","unstructured":"Galiana J, Rodr\u00edguez I, Rubio F (2023) How to stop undesired propagations by using bi-level genetic algorithms. Appl Soft Comput 136:110094","journal-title":"Appl Soft Comput"},{"key":"1911_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2024.102328","volume":"80","author":"A Godoy","year":"2024","unstructured":"Godoy A, Rodr\u00edguez I, Rubio F (2024) Voting according to one\u2019s political stances is difficult: problems definition, computational hardness, and approximate solutions. J Comput Sci 80:102328","journal-title":"J Comput Sci"},{"issue":"326","key":"1911_CR12","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1080\/01621459.1969.10500991","volume":"64","author":"BG Greenberg","year":"1969","unstructured":"Greenberg BG, Abul-Ela ALA, Simmons WR, Horvitz DG (1969) The unrelated question randomized response model: theoretical framework. J Am Stat Assoc 64(326):520\u2013539","journal-title":"J Am Stat Assoc"},{"key":"1911_CR13","first-page":"85","volume-title":"Reducibility among combinatorial problems","author":"RM Karp","year":"1972","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. Springer, Boston, pp 85\u2013103"},{"key":"1911_CR14","doi-asserted-by":"publisher","first-page":"8091","DOI":"10.1007\/s11042-020-10139-6","volume":"80","author":"S Katoch","year":"2021","unstructured":"Katoch S, Chauhan SS, Kumar V (2021) A review on genetic algorithm: past, present, and future. Multimed Tools Appl 80:8091\u20138126","journal-title":"Multimed Tools Appl"},{"key":"1911_CR15","doi-asserted-by":"publisher","unstructured":"Kennedy MC, O\u2019Hagan A (2002) Bayesian calibration of computer models. J R Stat Soc Ser B Stat Methodol 63(3):425\u2013464. https:\/\/doi.org\/10.1111\/1467-9868.00294","DOI":"10.1111\/1467-9868.00294"},{"key":"1911_CR16","unstructured":"Kodiyan AA (2019) An overview of ethical issues in using AI systems in hiring with a case study of Amazon\u2019s AI based hiring tool. Researchgate Preprint, pp 1\u201319"},{"issue":"2","key":"1911_CR17","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1111\/ijsa.12138","volume":"24","author":"E Kroll","year":"2016","unstructured":"Kroll E, Ziegler M (2016) Discrimination due to ethnicity and gender: How susceptible are video-based job interviews? Int J Sel Assess 24(2):161\u2013171","journal-title":"Int J Sel Assess"},{"issue":"1","key":"1911_CR18","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0020-0190(76)90095-8","volume":"5","author":"H Laurent","year":"1976","unstructured":"Laurent H, Rivest RL (1976) Constructing optimal binary decision trees is NP-complete. Inf Process Lett 5(1):15\u201317","journal-title":"Inf Process Lett"},{"key":"1911_CR19","first-page":"26","volume":"2011","author":"T Macan","year":"2011","unstructured":"Macan T, Merritt S (2011) Actions speak too: uncovering possible implicit and explicit discrimination in the employment interview process. Int Rev Ind Organ Psychol 2011:26","journal-title":"Int Rev Ind Organ Psychol"},{"key":"1911_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2021.101388","volume":"53","author":"A Mu\u00f1oz","year":"2021","unstructured":"Mu\u00f1oz A, Rubio F (2021) Evaluating genetic algorithms through the approximability hierarchy. J Comput Sci 53:101388","journal-title":"J Comput Sci"},{"key":"1911_CR21","doi-asserted-by":"crossref","unstructured":"Pantoja D (2024) Complexity and practical resolution of the data classification problem with private characteristics. https:\/\/github.com\/davidpantojasanchez\/Data-classification-problem-with-private-characteristics.git","DOI":"10.1007\/s40747-025-01911-y"},{"issue":"1","key":"1911_CR22","first-page":"1","volume":"19","author":"VT Paschos","year":"2016","unstructured":"Paschos VT (2016) An overview on polynomial approximation of np-hard problems. Yugoslav J Oper Res 19(1):1","journal-title":"Yugoslav J Oper Res"},{"issue":"2","key":"1911_CR23","first-page":"23","volume":"11","author":"DD Patil","year":"2010","unstructured":"Patil DD, Wadhai V, Gokhale J (2010) Evaluation of decision tree pruning algorithms for complexity and classification accuracy. Int J Comput Appl 11(2):23\u201330","journal-title":"Int J Comput Appl"},{"issue":"2","key":"1911_CR24","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/j.obhdp.2006.06.005","volume":"101","author":"SLS Purkiss","year":"2006","unstructured":"Purkiss SLS, Perrew\u00e9 PL, Gillespie TL, Mayes BT, Ferris GR (2006) Implicit sources of bias in employment interview judgments and decisions. Organ Behav Hum Decis Process 101(2):152\u2013167","journal-title":"Organ Behav Hum Decis Process"},{"issue":"3","key":"1911_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-022-1673-9","volume":"17","author":"I Rodr\u00edguez","year":"2023","unstructured":"Rodr\u00edguez I, Rubio D, Rubio F (2023) Complexity of adaptive testing in scenarios defined extensionally. Front Comput Sci 17(3):173206","journal-title":"Front Comput Sci"},{"key":"1911_CR26","doi-asserted-by":"crossref","unstructured":"Rodr\u00edguez-Fdez I, Canosa A, Mucientes M, Bugar\u00edn A (2015) STAC: a web platform for the comparison of algorithms using statistical tests. In: 2015 IEEE international conference on fuzzy systems (FUZZ-IEEE). IEEE, pp 1\u20138","DOI":"10.1109\/FUZZ-IEEE.2015.7337889"},{"key":"1911_CR27","doi-asserted-by":"publisher","unstructured":"Saravanan R, Sujatha P (2018) A state of art techniques on machine learning algorithms: a perspective of supervised learning approaches in data classification. In: 2018 second international conference on intelligent computing and control systems (ICICCS), pp 945\u2013949. https:\/\/doi.org\/10.1109\/ICCONS.2018.8663155","DOI":"10.1109\/ICCONS.2018.8663155"},{"issue":"8","key":"1911_CR28","doi-asserted-by":"publisher","first-page":"9836","DOI":"10.1109\/TPAMI.2023.3256421","volume":"45","author":"O Tutsoy","year":"2023","unstructured":"Tutsoy O (2023) Graph theory based large-scale machine learning with multi-dimensional constrained optimization approaches for exact epidemiological modeling of pandemic diseases. IEEE Trans Pattern Anal Mach Intell 45(8):9836\u20139845","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"1911_CR29","doi-asserted-by":"crossref","unstructured":"Ullah I, Boreli R, Kanhere SS (2020) Privacy in targeted advertising: a survey. Preprint arXiv:2009.06861","DOI":"10.36227\/techrxiv.12952073"},{"issue":"2","key":"1911_CR30","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s00500-016-2474-6","volume":"22","author":"D Wang","year":"2018","unstructured":"Wang D, Tan D, Liu L (2018) Particle swarm optimization algorithm: an overview. Soft Comput 22(2):387\u2013408","journal-title":"Soft Comput"},{"issue":"309","key":"1911_CR31","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1080\/01621459.1965.10480775","volume":"60","author":"SL Warner","year":"1965","unstructured":"Warner SL (1965) Randomized response: a survey technique for eliminating evasive answer bias. J Am Stat Assoc 60(309):63\u201369","journal-title":"J Am Stat Assoc"},{"issue":"3","key":"1911_CR32","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1399","volume":"11","author":"E Zorarpac\u0131","year":"2021","unstructured":"Zorarpac\u0131 E, \u00d6zel SA (2021) Privacy preserving classification over differentially private data. Wiley Interdiscip Rev Data Min Knowl Disc 11(3):e1399","journal-title":"Wiley Interdiscip Rev Data Min Knowl Disc"}],"container-title":["Complex & Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-025-01911-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-025-01911-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-025-01911-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T11:22:41Z","timestamp":1747480961000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-025-01911-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,8]]},"references-count":32,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["1911"],"URL":"https:\/\/doi.org\/10.1007\/s40747-025-01911-y","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"type":"print","value":"2199-4536"},{"type":"electronic","value":"2198-6053"}],"subject":[],"published":{"date-parts":[[2025,5,8]]},"assertion":[{"value":"2 January 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 April 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2025","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":"Conflict of interest"}}],"article-number":"274"}}