{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T10:16:32Z","timestamp":1770459392678,"version":"3.49.0"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T00:00:00Z","timestamp":1623888000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T00:00:00Z","timestamp":1623888000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004329","name":"Javna Agencija za Raziskovalno Dejavnost RS","doi-asserted-by":"publisher","award":["your researcher"],"award-info":[{"award-number":["your researcher"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004329","name":"Javna Agencija za Raziskovalno Dejavnost RS","doi-asserted-by":"publisher","award":["P2-0103"],"award-info":[{"award-number":["P2-0103"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004329","name":"Javna Agencija za Raziskovalno Dejavnost RS","doi-asserted-by":"publisher","award":["N2-0078"],"award-info":[{"award-number":["N2-0078"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2022,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Feature ranking has been widely adopted in machine learning applications such as high-throughput biology and social sciences. The approaches of the popular Relief family of algorithms assign importances to features by iteratively accounting for nearest relevant and irrelevant instances. Despite their high utility, these algorithms can be computationally expensive and not-well suited for high-dimensional sparse input spaces. In contrast, recent embedding-based methods learn compact, low-dimensional representations, potentially facilitating down-stream learning capabilities of conventional learners. This paper explores how the Relief branch of algorithms can be adapted to benefit from (Riemannian) manifold-based embeddings of instance and target spaces, where a given embedding\u2019s dimensionality is intrinsic to the dimensionality of the considered data set. The developed ReliefE algorithm is faster and can result in better feature rankings, as shown by our evaluation on 20 real-life data sets for multi-class and multi-label classification tasks. The utility of ReliefE for high-dimensional data sets is ensured by its implementation that utilizes sparse matrix algebraic operations. Finally, the relation of ReliefE to other ranking algorithms is studied via the Fuzzy Jaccard Index.<\/jats:p>","DOI":"10.1007\/s10994-021-05998-5","type":"journal-article","created":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T19:02:50Z","timestamp":1623956570000},"page":"273-317","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["ReliefE: feature ranking in high-dimensional spaces via manifold embeddings"],"prefix":"10.1007","volume":"111","author":[{"given":"Bla\u017e","family":"\u0160krlj","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sa\u0161o","family":"D\u017eeroski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nada","family":"Lavra\u010d","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0495-9046","authenticated-orcid":false,"given":"Matej","family":"Petkovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,17]]},"reference":[{"issue":"4","key":"5998_CR2","first-page":"369","volume":"34","author":"E Alpaydin","year":"1998","unstructured":"Alpaydin, E., & Kaynak, C. (1998). Cascading classifiers. Kybernetika, 34(4), 369\u2013374.","journal-title":"Kybernetika"},{"key":"5998_CR3","unstructured":"Anguita, D., Ghio, A., Oneto, L., Parra, X., & Reyes-Ortiz, J. (2013). A public domain dataset for human activity recognition using smartphones. ESANN."},{"issue":"1","key":"5998_CR4","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1038\/ng765","volume":"30","author":"SA Armstrong","year":"2002","unstructured":"Armstrong, S. A., Staunton, J. E., Silverman, L. B., Pieters, R., den Boer, M. L., Minden, M. D., et al. (2002). Mll translocations specify a distinct gene expression profile that distinguishes a unique leukemia. Nature Genetics, 30(1), 41\u201347.","journal-title":"Nature Genetics"},{"key":"5998_CR5","doi-asserted-by":"crossref","unstructured":"Arora, S., Hazan, E., & Kale, S. (2006). A fast random sampling algorithm for sparsifying matrices. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (pp. 272\u2013279). Springer.","DOI":"10.1007\/11830924_26"},{"issue":"5552","key":"5998_CR6","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1126\/science.295.5552.7a","volume":"295","author":"M Balasubramanian","year":"2002","unstructured":"Balasubramanian, M., & Schwartz, E. L. (2002). The isomap algorithm and topological stability. Science, 295(5552), 7\u20137.","journal-title":"Science"},{"issue":"1","key":"5998_CR7","first-page":"2653","volume":"18","author":"A Benavoli","year":"2017","unstructured":"Benavoli, A., Corani, G., Dem\u0161ar, J., & Zaffalon, M. (2017). Time for a change: A tutorial for comparing multiple classifiers through Bayesian analysis. The Journal of Machine Learning Research, 18(1), 2653\u20132688.","journal-title":"The Journal of Machine Learning Research"},{"issue":"11","key":"5998_CR8","doi-asserted-by":"publisher","first-page":"1673","DOI":"10.1007\/s10994-018-5744-y","volume":"107","author":"M Breskvar","year":"2018","unstructured":"Breskvar, M., Kocev, D., & Dzeroski, S. (2018). Ensembles for multi-target regression with random output selections. Machine Learning, 107(11), 1673\u20131709. https:\/\/doi.org\/10.1007\/s10994-018-5744-y.","journal-title":"Machine Learning"},{"issue":"4","key":"5998_CR9","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1109\/MSP.2017.2693418","volume":"34","author":"MM Bronstein","year":"2017","unstructured":"Bronstein, M. M., Bruna, J., LeCun, Y., Szlam, A., & Vandergheynst, P. (2017). Geometric deep learning: Going beyond Euclidean data. IEEE Signal Processing Magazine, 34(4), 18\u201342.","journal-title":"IEEE Signal Processing Magazine"},{"issue":"7745","key":"5998_CR10","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1038\/s41586-019-0969-x","volume":"566","author":"J Cao","year":"2019","unstructured":"Cao, J., Spielmann, M., Qiu, X., Huang, X., Ibrahim, D. M., Hill, A. J., et al. (2019). The single-cell transcriptional landscape of mammalian organogenesis. Nature, 566(7745), 496\u2013502. https:\/\/doi.org\/10.1038\/s41586-019-0969-x.","journal-title":"Nature"},{"issue":"2","key":"5998_CR11","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1109\/72.279188","volume":"5","author":"JT Connor","year":"1994","unstructured":"Connor, J. T., Martin, R. D., & Atlas, L. E. (1994). Recurrent neural networks and robust time series prediction. IEEE Transactions on Neural Networks, 5(2), 240\u2013254.","journal-title":"IEEE Transactions on Neural Networks"},{"issue":"Jan","key":"5998_CR12","first-page":"1","volume":"7","author":"J Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar, J. (2006). Statistical comparisons of classifiers over multiple data sets. Journal of Machine Learning Research, 7(Jan), 1\u201330.","journal-title":"Journal of Machine Learning Research"},{"key":"5998_CR13","doi-asserted-by":"crossref","unstructured":"Dong, W., Moses, C., & Li, K. (2011). Efficient k-nearest neighbor graph construction for generic similarity measures. In Proceedings of the 20th international conference on World wide web (pp. 577\u2013586).","DOI":"10.1145\/1963405.1963487"},{"key":"5998_CR14","doi-asserted-by":"crossref","unstructured":"D\u017eeroski, S., Blockeel, H., Kompare, B., Kramer, S., Pfahringer, B., & Van\u00a0Laer, W. (1999). Experiments in predicting biodegradability. In textitInternational conference on inductive logic programming (pp. 80\u201391). Springer.","DOI":"10.1007\/3-540-48751-4_9"},{"key":"5998_CR15","doi-asserted-by":"crossref","unstructured":"Eppstein, M. J., & Haake, P. (2008). Very large scale relieff for genome-wide association analysis. In 2008 IEEE symposium on computational intelligence in bioinformatics and computational biology (pp. 112\u2013119). IEEE.","DOI":"10.1109\/CIBCB.2008.4675767"},{"issue":"1","key":"5998_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-017-11873-y","volume":"7","author":"E Facco","year":"2017","unstructured":"Facco, E., d\u2019Errico, M., Rodriguez, A., & Laio, A. (2017). Estimating the intrinsic dimension of datasets by a minimal neighborhood information. Scientific Reports, 7(1), 1\u20138.","journal-title":"Scientific Reports"},{"key":"5998_CR17","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.knosys.2018.03.022","volume":"151","author":"P Goyal","year":"2018","unstructured":"Goyal, P., & Ferrara, E. (2018). Graph embedding techniques, applications, and performance: A survey. Knowledge-Based Systems, 151, 78\u201394.","journal-title":"Knowledge-Based Systems"},{"key":"5998_CR18","doi-asserted-by":"crossref","unstructured":"Granizo-Mackenzie, D., & Moore, J. H. (2013). Multiple threshold spatially uniform relieff for the genetic analysis of complex human diseases. In European conference on evolutionary computation, machine learning and data mining in bioinformatics (pp. 1\u201310). Springer.","DOI":"10.1007\/978-3-642-37189-9_1"},{"key":"5998_CR19","doi-asserted-by":"crossref","unstructured":"Greene, C. S., Himmelstein, D. S., Kiralis, J., & Moore, J. H. (2010). The informative extremes: Using both nearest and farthest individuals can improve relief algorithms in the domain of human genetics. In European conference on evolutionary computation, machine learning and data mining in bioinformatics (pp. 182\u2013193). Springer.","DOI":"10.1007\/978-3-642-12211-8_16"},{"issue":"1","key":"5998_CR20","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1186\/1756-0381-2-5","volume":"2","author":"CS Greene","year":"2009","unstructured":"Greene, C. S., Penrod, N. M., Kiralis, J., & Moore, J. H. (2009). Spatially uniform relieff (surf) for computationally-efficient filtering of gene-gene interactions. BioData Mining, 2(1), 5.","journal-title":"BioData Mining"},{"key":"5998_CR21","unstructured":"Guyon, I., Gunn, S., Ben-Hur, A., & Dror, G. (2005). Result analysis of the nips 2003 feature selection challenge. In Advances in neural information processing systems (pp. 545\u2013552)."},{"key":"5998_CR22","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/3-540-45372-5_46","volume-title":"Principles of data mining and knowledge discovery","author":"EHS Han","year":"2000","unstructured":"Han, E. H. S., & Karypis, G. (2000). Centroid-based document classification: Analysis and experimental results. In D. A. Zighed, J. Komorowski, & J. \u017bytkow (Eds.), Principles of data mining and knowledge discovery (pp. 424\u2013431). Berlin: Springer."},{"issue":"1","key":"5998_CR23","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1109\/TIT.1968.1054102","volume":"14","author":"G Hughes","year":"1968","unstructured":"Hughes, G. (1968). On the mean accuracy of statistical pattern recognizers. IEEE Transactions on Information Theory, 14(1), 55\u201363. https:\/\/doi.org\/10.1109\/TIT.1968.1054102.","journal-title":"IEEE Transactions on Information Theory"},{"key":"5998_CR1","unstructured":"Imdb dataset. (2010). https:\/\/sourceforge.net\/projects\/meka\/files\/Datasets\/IMDB-F.arff\/download."},{"key":"5998_CR24","unstructured":"Katakis, I., Tsoumakas, G., & Vlahavas, I. (2008). Multilabel text classification for automated tag suggestion. In Proceedings of the ECML\/PKDD 2008 discovery challenge."},{"key":"5998_CR25","unstructured":"Kipf, T. N., & Welling, M. (2016). Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907."},{"key":"5998_CR26","first-page":"129","volume":"2","author":"K Kira","year":"1992","unstructured":"Kira, K., Rendell, L. A., et al. (1992). The feature selection problem: Traditional methods and a new algorithm. AAAI, 2, 129\u2013134.","journal-title":"AAAI"},{"key":"5998_CR27","doi-asserted-by":"crossref","unstructured":"Lam, S.K., Pitrou, A., & Seibert, S. (2015). Numba: A llvm-based python jit compiler. In Proceedings of the second workshop on the LLVM compiler infrastructure in HPC (pp. 1\u20136).","DOI":"10.1145\/2833157.2833162"},{"issue":"7553","key":"5998_CR28","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1038\/nature14539","volume":"521","author":"Y LeCun","year":"2015","unstructured":"LeCun, Y., Bengio, Y., & Hinton, G. (2015). Deep learning. Nature, 521(7553), 436\u2013444.","journal-title":"Nature"},{"key":"5998_CR29","unstructured":"Liu, T., Moore, A. W., Yang, K., & Gray, A. G. (2005). An investigation of practical approximate nearest neighbor algorithms. In Advances in neural information processing systems (pp. 825\u2013832)."},{"issue":"Nov","key":"5998_CR30","first-page":"2579","volume":"9","author":"L.v.d. Maaten","year":"2008","unstructured":"Maaten, L. .v.d., & Hinton, G. (2008). Visualizing data using t-SNE. Journal of Machine Learning Research, 9(Nov), 2579\u20132605.","journal-title":"Journal of Machine Learning Research"},{"key":"5998_CR31","doi-asserted-by":"crossref","unstructured":"Masci, J., Boscaini, D., Bronstein, M., & Vandergheynst, P. (2015). Geodesic convolutional neural networks on Riemannian manifolds. In Proceedings of the IEEE international conference on computer vision workshops (pp. 37\u201345).","DOI":"10.1109\/ICCVW.2015.112"},{"key":"5998_CR32","doi-asserted-by":"crossref","unstructured":"McInnes, L., Healy, J., & Melville, J. (2018). Umap: Uniform manifold approximation and projection for dimension reduction. arXiv preprint arXiv:1802.03426.","DOI":"10.21105\/joss.00861"},{"issue":"29","key":"5998_CR33","doi-asserted-by":"publisher","first-page":"861","DOI":"10.21105\/joss.00861","volume":"3","author":"L McInnes","year":"2018","unstructured":"McInnes, L., Healy, J., Saul, N., & Grossberger, L. (2018). Umap: Uniform manifold approximation and projection. The Journal of Open Source Software, 3(29), 861.","journal-title":"The Journal of Open Source Software"},{"key":"5998_CR34","doi-asserted-by":"publisher","first-page":"212568","DOI":"10.1109\/ACCESS.2020.3039541","volume":"8","author":"S Me\u017enar","year":"2020","unstructured":"Me\u017enar, S., Lavra\u010d, N., & \u0160krlj, B. (2020). Snore: Scalable unsupervised learning of symbolic node representations. IEEE Access, 8, 212568\u2013212588. https:\/\/doi.org\/10.1109\/ACCESS.2020.3039541.","journal-title":"IEEE Access"},{"key":"5998_CR35","unstructured":"Mikolov, T., Sutskever, I., Chen, K., Corrado, G. S., & Dean, J. (2013). Distributed representations of words and phrases and their compositionality. In C.J.C. Burges, L.\u00a0Bottou, M.\u00a0Welling, Z.\u00a0Ghahramani & K.Q. Weinberger (Eds.), Advances in neural information processing systems (Vol. 26, pp. 3111\u20133119). Curran Associates, Inc."},{"key":"5998_CR36","doi-asserted-by":"crossref","unstructured":"Moore, J. H., & White, B. C. (2007). Tuning relieff for genome-wide genetic analysis. In European conference on evolutionary computation, machine learning and data mining in bioinformatics (pp. 166\u2013175). Springer.","DOI":"10.1007\/978-3-540-71783-6_16"},{"issue":"Oct","key":"5998_CR37","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., et al. (2011). Scikit-learn: Machine learning in python. Journal of Machine Learning Research, 12(Oct), 2825\u20132830.","journal-title":"Journal of Machine Learning Research"},{"issue":"17\u201318","key":"5998_CR38","doi-asserted-by":"publisher","first-page":"6442","DOI":"10.1016\/j.eswa.2015.04.017","volume":"42","author":"M Perov\u0161ek","year":"2015","unstructured":"Perov\u0161ek, M., Vavpeti\u010d, A., Kranjc, J., Cestnik, B., & Lavra\u010d, N. (2015). Wordification: Propositionalization by unfolding relational data into bags of words. Expert Systems with Applications, 42(17\u201318), 6442\u20136456.","journal-title":"Expert Systems with Applications"},{"key":"5998_CR39","doi-asserted-by":"crossref","unstructured":"Pestian, J. P., Brew, C., Matykiewicz, P., Hovermale, D. J., Johnson, N., Bretonnel\u00a0Cohen, K., & Duch, W. (2007). A shared task involving multi-label classification of clinical free text. In Proceedings of the workshop on BioNLP 2007: Biological, translational, and clinical language processing (BioNLP\u201907) (pp. 97\u2013104).","DOI":"10.3115\/1572392.1572411"},{"key":"5998_CR40","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-030-01771-2_4","volume-title":"Discovery science","author":"M Petkovi\u0107","year":"2018","unstructured":"Petkovi\u0107, M., Kocev, D., & D\u017eeroski, S. (2018). Feature ranking with relief for multi-label classification: Does distance matter? In L. Soldatova, J. Vanschoren, G. Papadopoulos, & M. Ceci (Eds.), Discovery science (pp. 51\u201365). Cham: Springer International Publishing."},{"key":"5998_CR41","doi-asserted-by":"publisher","first-page":"104143","DOI":"10.1016\/j.compbiomed.2020.104143","volume":"128","author":"M Petkovi\u0107","year":"2021","unstructured":"Petkovi\u0107, M., Slavkov, I., Kocev, D., & D\u017eeroski, S. (2021). Biomarker discovery by feature ranking: Evaluation on a case study of embryonal tumors. Computers in Biology and Medicine, 128, 104143. https:\/\/doi.org\/10.1016\/j.compbiomed.2020.104143.","journal-title":"Computers in Biology and Medicine"},{"key":"5998_CR42","doi-asserted-by":"crossref","unstructured":"Petkovi\u0107, M., \u0160krlj, B., Kocev, D., & Simidjievski, N. (2020). Fuzzy Jaccard index: A robust comparison of ordered lists. https:\/\/arxiv.org\/abs\/2008.02216","DOI":"10.1016\/j.asoc.2021.107849"},{"key":"5998_CR43","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1038\/415436a","volume":"415","author":"S Pomeroy","year":"2002","unstructured":"Pomeroy, S., Tamayo, P., Gaasenbeek, M., Sturla, L. M., Angelo, M., McLaughlin, M., et al. (2002). Prediction of central nervous system embryonal tumour outcome based on gene expression. Nature, 415, 436\u201342. https:\/\/doi.org\/10.1038\/415436a.","journal-title":"Nature"},{"issue":"5","key":"5998_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3234150","volume":"51","author":"S Pouyanfar","year":"2018","unstructured":"Pouyanfar, S., Sadiq, S., Yan, Y., Tian, H., Tao, Y., Reyes, M. P., et al. (2018). A survey on deep learning: Algorithms, techniques, and applications. ACM Computing Surveys (CSUR), 51(5), 1\u201336.","journal-title":"ACM Computing Surveys (CSUR)"},{"issue":"1\u20132","key":"5998_CR45","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1023\/A:1025667309714","volume":"53","author":"M Robnik-\u0160ikonja","year":"2003","unstructured":"Robnik-\u0160ikonja, M., & Kononenko, I. (2003). Theoretical and empirical analysis of relieff and rrelieff. Machine Learning, 53(1\u20132), 23\u201369.","journal-title":"Machine Learning"},{"issue":"5500","key":"5998_CR46","doi-asserted-by":"publisher","first-page":"2323","DOI":"10.1126\/science.290.5500.2323","volume":"290","author":"S.T. Roweis","year":"2000","unstructured":"Roweis, S. .T. ., & Saul, L. .K. . (2000). Nonlinear dimensionality reduction by locally linear embedding. Science, 290(5500), 2323\u20132326.","journal-title":"Science"},{"issue":"4","key":"5998_CR47","doi-asserted-by":"publisher","first-page":"828","DOI":"10.1109\/JBHI.2013.2245674","volume":"17","author":"BE Sakar","year":"2013","unstructured":"Sakar, B. E., Isenkul, M. E., Sakar, C. O., Sertbas, A., Gurgen, F., Delil, S., et al. (2013). Collection and analysis of a Parkinson speech dataset with multiple types of sound recordings. IEEE Journal of Biomedical and Health Informatics, 17(4), 828\u2013834.","journal-title":"IEEE Journal of Biomedical and Health Informatics"},{"key":"5998_CR48","unstructured":"Shapiro, A. D. (1984). The role of structured induction in expert systems. Annexe Thesis Digitisation Project 2018 Block 19."},{"key":"5998_CR49","unstructured":"\u0160krlj, B., D\u017eeroski, S., Lavra\u010d, N., & Petkovi\u010d, M. (2020). Feature importance estimation with self-attention networks. arXiv preprint arXiv:2002.04464."},{"key":"5998_CR50","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-030-59491-6_7","volume-title":"Foundations of intelligent systems","author":"T Stepi\u0161nik","year":"2020","unstructured":"Stepi\u0161nik, T., & Kocev, D. (2020). Hyperbolic embeddings for hierarchical multi-label classification. In D. Helic, G. Leitner, M. Stettinger, A. Felfernig, & Z. W. Ra\u015b (Eds.), Foundations of intelligent systems (pp. 66\u201376). Cham: Springer International Publishing."},{"key":"5998_CR51","doi-asserted-by":"crossref","unstructured":"Stiglic, G., & Kokol, P. (2010). Stability of ranked gene lists in large microarray analysis studies. BioMed Research International, 2010.","DOI":"10.1155\/2010\/616358"},{"issue":"1","key":"5998_CR52","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1186\/1756-0381-5-20","volume":"5","author":"ME Stokes","year":"2012","unstructured":"Stokes, M. E., & Visweswaran, S. (2012). Application of a spatially-weighted relief algorithm for ranking genetic predictors of disease. BioData Mining, 5(1), 20.","journal-title":"BioData Mining"},{"key":"5998_CR53","unstructured":"Tsoumakas, G., Katakis, I., & Vlahavas, I. (2008). Effective and efficient multilabel classification in domains with large number of labels. In ECML\/PKDD 2008 workshop on mining multidimensional data (MMD\u201908)."},{"key":"5998_CR54","unstructured":"Ueda, N., & Saito, K. (2003). Parametric mixture models for multi-labeled text. In Advances in neural information processing systems (Vol. 15, pp. 721\u2013728). MIT Press."},{"key":"5998_CR55","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.jbi.2018.07.015","volume":"85","author":"RJ Urbanowicz","year":"2018","unstructured":"Urbanowicz, R. J., Olson, R. S., Schmitt, P., Meeker, M., & Moore, J. H. (2018). Benchmarking relief-based feature selection methods for bioinformatics data mining. Journal of Biomedical Informatics, 85, 168\u2013188.","journal-title":"Journal of Biomedical Informatics"},{"key":"5998_CR56","unstructured":"Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A. N., Kaiser, \u0141., & Polosukhin, I. (2017). Attention is all you need. In Advances in neural information processing systems (pp. 5998\u20136008)."},{"issue":"10","key":"5998_CR57","doi-asserted-by":"publisher","first-page":"1113","DOI":"10.1038\/ng.2764","volume":"45","author":"JN Weinstein","year":"2013","unstructured":"Weinstein, J. N., Collisson, E. A., Mills, G. B., Shaw, K. R. M., Ozenberger, B. A., Ellrott, K., et al. (2013). The cancer genome atlas pan-cancer analysis project. Nature Genetics, 45(10), 1113.","journal-title":"Nature Genetics"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-021-05998-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-021-05998-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-021-05998-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,3]],"date-time":"2022-02-03T18:20:27Z","timestamp":1643912427000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-021-05998-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,17]]},"references-count":57,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["5998"],"URL":"https:\/\/doi.org\/10.1007\/s10994-021-05998-5","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,17]]},"assertion":[{"value":"6 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 January 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 June 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}