{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T19:19:09Z","timestamp":1770837549255,"version":"3.50.1"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T00:00:00Z","timestamp":1768608000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T00:00:00Z","timestamp":1770768000000},"content-version":"vor","delay-in-days":25,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"name":"J. Robert Beyster Computational Innovation Graduate Fellowship"},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF-18-1-0240"],"award-info":[{"award-number":["W911NF-18-1-0240"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100023581","name":"National Science Foundation Graduate Research Fellowship Program","doi-asserted-by":"publisher","award":["DGE 1256260"],"award-info":[{"award-number":["DGE 1256260"]}],"id":[{"id":"10.13039\/100023581","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ECO-CBET","award":["2318495"],"award-info":[{"award-number":["2318495"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cheminform"],"DOI":"10.1186\/s13321-025-01096-z","type":"journal-article","created":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T16:45:38Z","timestamp":1768668338000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Universal feature selection for simultaneous interpretability of multitask datasets"],"prefix":"10.1186","volume":"18","author":[{"given":"Matt","family":"Raymond","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacob Charles","family":"Saldinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Elvati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Angela","family":"Violi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,17]]},"reference":[{"key":"1096_CR1","unstructured":"Dereli O, O\u011fuz C, G\u00f6nen M (2019) A multitask multiple kernel learning algorithm for survival analysis with application to cancer biology. In: Chaudhuri K, Salakhutdinov R (eds) Proceedings of the 36th International Conference on Machine Learning, Proceedings of Machine Learning Research, vol\u00a097. PMLR, Long Beach, CA, USA, pp 1576\u20131585. https:\/\/proceedings.mlr.press\/v97\/dereli19a.html"},{"key":"1096_CR2","doi-asserted-by":"publisher","unstructured":"Valmarska A, Miljkovic D, Konitsiotis S, et\u00a0al (2017) Combining multitask learning and short time series analysis in parkinson\u2019s disease patients stratification. In: ten Teije A, Popow C, Holmes JH, et\u00a0al (eds) 16th Conference on Artificial Intelligence in Medicine, vol 10259. Springer International Publishing, Vienna, Austria, pp 116\u2013125. https:\/\/doi.org\/10.1007\/978-3-319-59758-4_13","DOI":"10.1007\/978-3-319-59758-4_13"},{"issue":"1","key":"1096_CR3","doi-asserted-by":"publisher","first-page":"31619","DOI":"10.1038\/srep31619","volume":"6","author":"H Yuan","year":"2016","unstructured":"Yuan H, Paskov I, Paskov H et al (2016) Multitask learning improves prediction of cancer drug sensitivity. Sci Rep 6(1):31619. https:\/\/doi.org\/10.1038\/srep31619","journal-title":"Sci Rep"},{"key":"1096_CR4","doi-asserted-by":"publisher","first-page":"7392","DOI":"10.1039\/D3CS01130E","volume":"53","author":"X Sun","year":"2024","unstructured":"Sun X, Araujo RB, Santos EC et al (2024) Advancing electrocatalytic reactions through mapping key intermediates to active sites via descriptors. Chem Soc Rev 53:7392\u20137425. https:\/\/doi.org\/10.1039\/D3CS01130E","journal-title":"Chem Soc Rev"},{"issue":"1","key":"1096_CR5","doi-asserted-by":"publisher","first-page":"3513","DOI":"10.1038\/s41467-020-17263-9","volume":"11","author":"B Weng","year":"2020","unstructured":"Weng B, Song Z, Zhu R et al (2020) Simple descriptor derived from symbolic regression accelerating the discovery of new perovskite catalysts. Nat Commun 11(1):3513. https:\/\/doi.org\/10.1038\/s41467-020-17263-9","journal-title":"Nat Commun"},{"issue":"1","key":"1096_CR6","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s10994-010-5231-6","volume":"85","author":"O Chapelle","year":"2010","unstructured":"Chapelle O, Shivaswamy P, Vadrevu S et al (2010) Boosted multi-task learning. Mach Learn 85(1):149\u2013173. https:\/\/doi.org\/10.1007\/s10994-010-5231-6","journal-title":"Mach Learn"},{"key":"1096_CR7","doi-asserted-by":"publisher","unstructured":"Ke G, Meng Q, Finley T, et\u00a0al (2017) LightGBM: A highly efficient gradient boosting decision tree. In: Guyon I, Von\u00a0Luxburg U, Bengio S, et\u00a0al (eds) Proceedings of the 31st International Conference on Neural Information Processing Systems. Curran Associates Inc., Red Hook, NY, USA, pp 3149\u20133157, https:\/\/doi.org\/10.5555\/3294996.3295074","DOI":"10.5555\/3294996.3295074"},{"issue":"3","key":"1096_CR8","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10994-007-5040-8","volume":"73","author":"A Argyriou","year":"2008","unstructured":"Argyriou A, Evgeniou T, Pontil M (2008) Convex multi-task feature learning. Mach Learn 73(3):243\u2013272. https:\/\/doi.org\/10.1007\/s10994-007-5040-8","journal-title":"Mach Learn"},{"key":"1096_CR9","doi-asserted-by":"publisher","unstructured":"Jebara T (2004) Multi-task feature and kernel selection for svms. In: Brodley C (ed) Proceedings of the 21st International Conference on Machine Learning. Association for Computing Machinery, New York, NY, USA, p\u00a055, https:\/\/doi.org\/10.1145\/1015330.1015426","DOI":"10.1145\/1015330.1015426"},{"issue":"7","key":"1096_CR10","doi-asserted-by":"publisher","first-page":"1287","DOI":"10.1109\/TNNLS.2013.2291772","volume":"25","author":"C Li","year":"2014","unstructured":"Li C, Georgiopoulos M, Anagnostopoulos GC (2014) A unifying framework for typical multitask multiple kernel learning problems. IEEE Trans Neural Netw Learn Syst 25(7):1287\u20131297. https:\/\/doi.org\/10.1109\/TNNLS.2013.2291772","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"1096_CR11","doi-asserted-by":"publisher","unstructured":"Peng J, An L, Zhu X, et\u00a0al (2016) Structured sparse kernel learning for imaging genetics based alzheimer\u2019s disease diagnosis. In: MICCAI 2016, vol 9901. Springer, Athens, Greece, pp 70\u201378, https:\/\/doi.org\/10.1007\/978-3-319-46723-8_9","DOI":"10.1007\/978-3-319-46723-8_9"},{"key":"1096_CR12","volume-title":"Classification and regression trees","author":"L Breiman","year":"1984","unstructured":"Breiman L, Friedman J, Stone CJ et al (1984) Classification and regression trees, 1st edn. Taylor & Francis Group, Boca Raton. Accessed 7 Dec 2022","edition":"1"},{"key":"1096_CR13","doi-asserted-by":"publisher","unstructured":"Xu Z, Huang G, Weinberger KQ, et\u00a0al (2014) Gradient boosted feature selection. In: Macskassy S, Perlich C, Leskovec J, et\u00a0al (eds) Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Association for Computing Machinery, New York, NY, USA, pp 522\u2013531. https:\/\/doi.org\/10.1145\/2623330.2623635","DOI":"10.1145\/2623330.2623635"},{"issue":"174","key":"1096_CR14","first-page":"1","volume":"18","author":"S Nogueira","year":"2018","unstructured":"Nogueira S, Sechidis K, Brown G (2018) On the stability of feature selection algorithms. J Mach Learn Res 18(174):1\u201354","journal-title":"J Mach Learn Res"},{"issue":"1","key":"1096_CR15","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1021\/acs.jcim.3c01250","volume":"64","author":"E Heid","year":"2024","unstructured":"Heid E, Greenman KP, Chung Y et al (2024) Chemprop: a machine learning package for chemical property prediction. J Chem Inf Model 64(1):9\u201317. https:\/\/doi.org\/10.1021\/acs.jcim.3c01250","journal-title":"J Chem Inf Model"},{"issue":"1","key":"1096_CR16","doi-asserted-by":"publisher","first-page":"2519","DOI":"10.1038\/s41467-020-16413-3","volume":"11","author":"X Yan","year":"2020","unstructured":"Yan X, Sedykh A, Wang W et al (2020) Construction of a web-based nanomaterial database by big data curation and modeling friendly nanostructure annotations. Nat Commun 11(1):2519. https:\/\/doi.org\/10.1038\/s41467-020-16413-3","journal-title":"Nat Commun"},{"issue":"5","key":"1096_CR17","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1214\/aos\/1013203451","volume":"29","author":"JH Friedman","year":"2001","unstructured":"Friedman JH (2001) Greedy function approximation: a gradient boosting machine. Ann Statist 29(5):1189\u20131232","journal-title":"Ann Statist"},{"key":"1096_CR18","unstructured":"Pedregosa F, Varoquaux G, Gramfort A, et\u00a0al (2023) Scikit-learn: Machine learning in Python. https:\/\/github.com\/scikit-learn\/scikit-learn"},{"issue":"7","key":"1096_CR19","doi-asserted-by":"publisher","first-page":"eaap7885","DOI":"10.1126\/sciadv.aap7885","volume":"4","author":"M Popova","year":"2018","unstructured":"Popova M, Isayev O, Tropsha A (2018) Deep reinforcement learning for de novo drug design. Sci Adv 4(7):eaap7885. https:\/\/doi.org\/10.1126\/sciadv.aap7885. Accessed 19 June 2024","journal-title":"Sci Adv"},{"key":"1096_CR20","unstructured":"Estimation Programs Interface Suite$$^\\text{TM}$$ (2006) Environmental Protection Agency"},{"issue":"22","key":"1096_CR21","doi-asserted-by":"publisher","first-page":"4640","DOI":"10.1093\/bioinformatics\/btz294","volume":"35","author":"X Han","year":"2019","unstructured":"Han X, Wang X, Zhou K (2019) Develop machine learning-based regression predictive models for engineering protein solubility. Bioinformatics 35(22):4640\u20134646. https:\/\/doi.org\/10.1093\/bioinformatics\/btz294","journal-title":"Bioinformatics"},{"issue":"12","key":"1096_CR22","doi-asserted-by":"publisher","first-page":"980","DOI":"10.1038\/nsb1203-980","volume":"10","author":"H Berman","year":"2003","unstructured":"Berman H, Henrick K, Nakamura H (2003) Announcing the worldwide protein data bank. Nat Struct Mol Biol 10(12):980. https:\/\/doi.org\/10.1038\/nsb1203-980","journal-title":"Nat Struct Mol Biol"},{"issue":"7873","key":"1096_CR23","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1038\/s41586-021-03819-2","volume":"596","author":"J Jumper","year":"2021","unstructured":"Jumper J, Evans R, Pritzel A et al (2021) Highly accurate protein structure prediction with alphafold. Nature 596(7873):583\u2013589. https:\/\/doi.org\/10.1038\/s41586-021-03819-2","journal-title":"Nature"},{"issue":"1","key":"1096_CR24","doi-asserted-by":"publisher","first-page":"15679","DOI":"10.1038\/ncomms15679","volume":"8","author":"O Isayev","year":"2017","unstructured":"Isayev O, Oses C, Toher C et al (2017) Universal fragment descriptors for predicting properties of inorganic crystals. Nat Commun 8(1):15679. https:\/\/doi.org\/10.1038\/ncomms15679","journal-title":"Nat Commun"},{"issue":"1\u20134","key":"1096_CR25","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1080\/10629369708039126","volume":"7","author":"R Todeschini","year":"1997","unstructured":"Todeschini R, Gramatica P (1997) The whim theory: new 3d molecular descriptors for qsar in environmental modelling. SAR QSAR Environ Res 7(1\u20134):89\u2013115. https:\/\/doi.org\/10.1080\/10629369708039126","journal-title":"SAR QSAR Environ Res"},{"key":"1096_CR26","volume-title":"Statistical power analysis for the behavioral sciences","author":"J Cohen","year":"1988","unstructured":"Cohen J (1988) Statistical power analysis for the behavioral sciences, 2nd edn. Lawrence Erlbaum Associates, New York","edition":"2"},{"key":"1096_CR27","first-page":"1","volume-title":"Advances in neural information processing systems 23","author":"A Jalali","year":"2010","unstructured":"Jalali A, Sanghavi S, Ruan C et al (2010) A dirty model for multi-task learning. In: Lafferty J, Williams C, Shawe-Taylor J et al (eds) Advances in neural information processing systems 23. Curran Associates, Inc., Vancouver, pp 1\u20139"},{"key":"1096_CR28","unstructured":"Janati H (2021) MuTaR: Multi-task regression in python. https:\/\/github.com\/hichamjanati\/mutar"},{"issue":"1","key":"1096_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13321-021-00488-1","volume":"13","author":"J Chen","year":"2021","unstructured":"Chen J, Zheng S, Zhao H et al (2021) Structure-aware protein solubility prediction from sequence through graph convolutional network and predicted contact map. J Cheminform 13(1):1\u201310. https:\/\/doi.org\/10.1186\/s13321-021-00488-1","journal-title":"J Cheminform"},{"key":"1096_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-10531-0","volume-title":"Statistics for data scientists: an introduction to probability, statistics, and data analysis","author":"M Kaptein","year":"2022","unstructured":"Kaptein M, Heuvel E (2022) Statistics for data scientists: an introduction to probability, statistics, and data analysis, 1st edn. Springer Nature Switzerland, Cham. https:\/\/doi.org\/10.1007\/978-3-030-10531-0","edition":"1"},{"key":"1096_CR31","first-page":"2579","volume":"9","author":"L Maaten","year":"2008","unstructured":"Maaten L, Hinton GE (2008) Visualizing data using t-SNE. J Mach Learn Res 9:2579\u20132605","journal-title":"J Mach Learn Res"},{"issue":"2","key":"1096_CR32","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1037\/h0043158","volume":"63","author":"GA Miller","year":"1956","unstructured":"Miller GA (1956) The magical number seven, plus or minus two: some limits on our capacity for processing information: psychological Review. Psychol Rev 63(2):81\u201397. https:\/\/doi.org\/10.1037\/h0043158. Accessed 7 Mar 2024","journal-title":"Psychol Rev"},{"key":"1096_CR33","unstructured":"Rao N, Cox C, Nowak R, et\u00a0al (2013) Sparse overlapping sets lasso for multitask learning and its application to fMRI analysis. In: Burges C, Bottou L, Welling M, et\u00a0al (eds) Proceedings of Advances in Neural Information Processing Systems 26. Curran Associates, Inc., Lake Tahoe, CA, USA, pp 1\u20139, https:\/\/papers.nips.cc\/paper_files\/paper\/2013\/hash\/a1519de5b5d44b31a01de013b9b51a80-Abstract.html"},{"issue":"1","key":"1096_CR34","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1021\/ci00023a010","volume":"35","author":"MD Wessel","year":"1995","unstructured":"Wessel MD, Jurs PC (1995) Prediction of normal boiling points of hydrocarbons from molecular structures. J Chem Inf Comput Sci 35(1):68\u201376. https:\/\/doi.org\/10.1021\/ci00023a010","journal-title":"J Chem Inf Comput Sci"},{"issue":"9","key":"1096_CR35","doi-asserted-by":"publisher","first-page":"10221","DOI":"10.1021\/acsnano.9b03434","volume":"13","author":"C Liu","year":"2019","unstructured":"Liu C, Elvati P, Majumder S et al (2019) Predicting the time of entry of nanoparticles in lipid membranes. ACS Nano 13(9):10221\u201310232. https:\/\/doi.org\/10.1021\/acsnano.9b03434. Accessed 19 June 2024","journal-title":"ACS Nano"},{"issue":"4","key":"1096_CR36","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1016\/S1093-3263(00)00068-1","volume":"18","author":"P Labute","year":"2000","unstructured":"Labute P (2000) A widely applicable set of descriptors. J Mol Graph Model 18(4):464\u2013477. https:\/\/doi.org\/10.1016\/S1093-3263(00)00068-1","journal-title":"J Mol Graph Model"},{"issue":"11","key":"1096_CR37","doi-asserted-by":"publisher","first-page":"e2200116","DOI":"10.1002\/minf.202200116","volume":"41","author":"JL Medina-Franco","year":"2022","unstructured":"Medina-Franco JL, Ch\u00e1vez-Hern\u00e1ndez AL, L\u00f3pez-L\u00f3pez E et al (2022) Chemical multiverse: an expanded view of chemical space. Mol Inf 41(11):e2200116. https:\/\/doi.org\/10.1002\/minf.202200116. Accessed 04 Mar 2024","journal-title":"Mol Inf"},{"issue":"2","key":"1096_CR38","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1515\/sagmb-2012-0067","volume":"12","author":"HW Lee","year":"2013","unstructured":"Lee HW, Lawton C, Na YJ et al (2013) Robustness of chemometrics-based feature selection methods in early cancer detection and biomarker discovery. Stat Appl Genet Mol 12(2):207\u2013223. https:\/\/doi.org\/10.1515\/sagmb-2012-0067","journal-title":"Stat Appl Genet Mol"},{"issue":"5","key":"1096_CR39","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1038\/s43588-023-00438-x","volume":"3","author":"JC Saldinger","year":"2023","unstructured":"Saldinger JC, Raymond M, Elvati P et al (2023) Domain-agnostic predictions of nanoscale interactions in proteins and nanoparticles. Nat Comput Sci 3(5):393\u2013402. https:\/\/doi.org\/10.1038\/s43588-023-00438-x","journal-title":"Nat Comput Sci"},{"key":"1096_CR40","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/3-540-59119-2_166","volume-title":"Comput Learn Theory","author":"Y Freund","year":"1995","unstructured":"Freund Y, Schapire RE (1995) A desicion-theoretic generalization of on-line learning and an application to boosting. In: Vit\u00e1nyi P (ed) Comput Learn Theory. Springer, Berlin, pp 23\u201337"},{"issue":"1","key":"1096_CR41","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1002\/widm.12","volume":"1","author":"M Segal","year":"2011","unstructured":"Segal M, Xiao Y (2011) Multivariate random forests. WIREs Data Min Knowl Discov 1(1):80\u201387. https:\/\/doi.org\/10.1002\/widm.12","journal-title":"WIREs Data Min Knowl Discov"},{"issue":"5","key":"1096_CR42","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1021\/ci990307l","volume":"39","author":"SA Wildman","year":"1999","unstructured":"Wildman SA, Crippen GM (1999) Prediction of physicochemical parameters by atomic contributions. J Chem Inf Comput Sci 39(5):868\u2013873. https:\/\/doi.org\/10.1021\/ci990307l. Accessed 19 June 2024","journal-title":"J Chem Inf Comput Sci"},{"key":"1096_CR43","doi-asserted-by":"publisher","DOI":"10.20517\/jmi.2024.61","author":"X Zeng","year":"2025","unstructured":"Zeng X, Ye X, Liu D et al (2025) A new simple and efficient molecular descriptor for the fast and accurate prediction of log p. J Materi Inform. https:\/\/doi.org\/10.20517\/jmi.2024.61","journal-title":"J Materi Inform"},{"key":"1096_CR44","unstructured":"Satorras VG, Hoogeboom E, Welling M (2021) E(n) equivariant graph neural networks. In: Meila M, Zhang T (eds) Proceedings of the 38th International Conference on Machine Learning, Proceedings of Machine Learning Research, vol 139. PMLR, pp 9323\u20139332. https:\/\/proceedings.mlr.press\/v139\/satorras21a.html"},{"key":"1096_CR45","doi-asserted-by":"publisher","unstructured":"Chen T, Guestrin C (2016) XGBoost: A scalable tree boosting system. In: Krishnapuram B, Shah M, Smola A, et\u00a0al (eds) Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Association for Computing Machinery, New York, NY, USA, Kdd \u201916, pp 785\u2013794. https:\/\/doi.org\/10.1145\/2939672.2939785.","DOI":"10.1145\/2939672.2939785"},{"issue":"3","key":"1096_CR46","first-page":"543","volume":"269","author":"YE Nesterov","year":"1983","unstructured":"Nesterov YE (1983) A method of solving a convex programming problem with convergence rate $$o\\left(\\frac{1}{k^2}\\right)$$. Dokl Akad Nauk SSSR 269(3):543\u2013547","journal-title":"Dokl Akad Nauk SSSR"},{"issue":"4","key":"1096_CR47","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1016\/j.dss.2009.05.016","volume":"47","author":"P Cortez","year":"2009","unstructured":"Cortez P, Cerdeira A, Almeida F et al (2009) Modeling wine preferences by data mining from physicochemical properties. Decis Support Syst 47(4):547\u2013553. https:\/\/doi.org\/10.1016\/j.dss.2009.05.016","journal-title":"Decis Support Syst"},{"key":"1096_CR48","unstructured":"Vijayakumar S, Schaal S (2000) Lwpr: An O(n) algorithm for incremental real time learning in high dimensional space. In: Proceedings of the 17th International Conference on Machine Learning (ICML), pp 1079\u20131086"},{"key":"1096_CR49","doi-asserted-by":"publisher","unstructured":"Anonymous (2019) Apartment for Rent Classified. UCI Machine Learning Repository. https:\/\/doi.org\/10.24432\/C5X623","DOI":"10.24432\/C5X623"},{"key":"1096_CR50","unstructured":"Ustimenko A, Beliakov A, Prokhorenkova L (2023) Gradient boosting performs gaussian process inference. In: Liu Y, Kim B, Nickel M, et\u00a0al (eds) The 11th International Conference on Learning Representations. OpenReview.net, Kigali, Rwanda, pp 1\u201329. https:\/\/openreview.net\/forum?id=3VKiaagxw1S"},{"key":"1096_CR51","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.inffus.2021.11.011","volume":"81","author":"R Shwartz-Ziv","year":"2022","unstructured":"Shwartz-Ziv R, Armon A (2022) Tabular data: deep learning is not all you need. Inf Fusion 81:84\u201390. https:\/\/doi.org\/10.1016\/j.inffus.2021.11.011","journal-title":"Inf Fusion"},{"key":"1096_CR52","doi-asserted-by":"publisher","unstructured":"Caruana R, Niculescu-Mizil A (2006) An empirical comparison of supervised learning algorithms. In: Proceedings of the 23rd International Conference on Machine Learning. Association for Computing Machinery, New York, NY, USA, ICML \u201906, p 161\u2013168. https:\/\/doi.org\/10.1145\/1143844.1143865,","DOI":"10.1145\/1143844.1143865"}],"container-title":["Journal of Cheminformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13321-025-01096-z","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13321-025-01096-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13321-025-01096-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T18:36:33Z","timestamp":1770834993000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1186\/s13321-025-01096-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,17]]},"references-count":52,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["1096"],"URL":"https:\/\/doi.org\/10.1186\/s13321-025-01096-z","relation":{},"ISSN":["1758-2946"],"issn-type":[{"value":"1758-2946","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,17]]},"assertion":[{"value":"7 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2026","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 no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"23"}}