|
| 1 | +<?xml version="1.0" encoding="UTF-8"?> |
| 2 | +<doi_batch xmlns="http://www.crossref.org/schema/5.3.1" |
| 3 | + xmlns:ai="http://www.crossref.org/AccessIndicators.xsd" |
| 4 | + xmlns:rel="http://www.crossref.org/relations.xsd" |
| 5 | + xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" |
| 6 | + version="5.3.1" |
| 7 | + xsi:schemaLocation="http://www.crossref.org/schema/5.3.1 http://www.crossref.org/schemas/crossref5.3.1.xsd"> |
| 8 | + <head> |
| 9 | + <doi_batch_id>20260225192520-4e17f5d658e05a8196f405b11db1931d51b4a47b</doi_batch_id> |
| 10 | + <timestamp>20260225192520</timestamp> |
| 11 | + <depositor> |
| 12 | + <depositor_name>JOSS Admin</depositor_name> |
| 13 | + <email_address>admin@theoj.org</email_address> |
| 14 | + </depositor> |
| 15 | + <registrant>The Open Journal</registrant> |
| 16 | + </head> |
| 17 | + <body> |
| 18 | + <journal> |
| 19 | + <journal_metadata> |
| 20 | + <full_title>Journal of Open Source Software</full_title> |
| 21 | + <abbrev_title>JOSS</abbrev_title> |
| 22 | + <issn media_type="electronic">2475-9066</issn> |
| 23 | + <doi_data> |
| 24 | + <doi>10.21105/joss</doi> |
| 25 | + <resource>https://joss.theoj.org</resource> |
| 26 | + </doi_data> |
| 27 | + </journal_metadata> |
| 28 | + <journal_issue> |
| 29 | + <publication_date media_type="online"> |
| 30 | + <month>02</month> |
| 31 | + <year>2026</year> |
| 32 | + </publication_date> |
| 33 | + <journal_volume> |
| 34 | + <volume>11</volume> |
| 35 | + </journal_volume> |
| 36 | + <issue>118</issue> |
| 37 | + </journal_issue> |
| 38 | + <journal_article publication_type="full_text"> |
| 39 | + <titles> |
| 40 | + <title>corrselect: Fast and flexible predictor pruning for data analysis and modeling</title> |
| 41 | + </titles> |
| 42 | + <contributors> |
| 43 | + <person_name sequence="first" contributor_role="author"> |
| 44 | + <given_name>Gilles</given_name> |
| 45 | + <surname>Colling</surname> |
| 46 | + <affiliations> |
| 47 | + <institution><institution_name>Department of Botany and Biodiversity Research, University of Vienna, Austria</institution_name></institution> |
| 48 | + </affiliations> |
| 49 | + <ORCID>https://orcid.org/0000-0003-3070-6066</ORCID> |
| 50 | + </person_name> |
| 51 | + </contributors> |
| 52 | + <publication_date> |
| 53 | + <month>02</month> |
| 54 | + <day>25</day> |
| 55 | + <year>2026</year> |
| 56 | + </publication_date> |
| 57 | + <pages> |
| 58 | + <first_page>9539</first_page> |
| 59 | + </pages> |
| 60 | + <publisher_item> |
| 61 | + <identifier id_type="doi">10.21105/joss.09539</identifier> |
| 62 | + </publisher_item> |
| 63 | + <ai:program name="AccessIndicators"> |
| 64 | + <ai:license_ref applies_to="vor">http://creativecommons.org/licenses/by/4.0/</ai:license_ref> |
| 65 | + <ai:license_ref applies_to="am">http://creativecommons.org/licenses/by/4.0/</ai:license_ref> |
| 66 | + <ai:license_ref applies_to="tdm">http://creativecommons.org/licenses/by/4.0/</ai:license_ref> |
| 67 | + </ai:program> |
| 68 | + <rel:program> |
| 69 | + <rel:related_item> |
| 70 | + <rel:description>Software archive</rel:description> |
| 71 | + <rel:inter_work_relation relationship-type="references" identifier-type="doi">10.5281/zenodo.18429041</rel:inter_work_relation> |
| 72 | + </rel:related_item> |
| 73 | + <rel:related_item> |
| 74 | + <rel:description>GitHub review issue</rel:description> |
| 75 | + <rel:inter_work_relation relationship-type="hasReview" identifier-type="uri">https://github.com/openjournals/joss-reviews/issues/9539</rel:inter_work_relation> |
| 76 | + </rel:related_item> |
| 77 | + </rel:program> |
| 78 | + <doi_data> |
| 79 | + <doi>10.21105/joss.09539</doi> |
| 80 | + <resource>https://joss.theoj.org/papers/10.21105/joss.09539</resource> |
| 81 | + <collection property="text-mining"> |
| 82 | + <item> |
| 83 | + <resource mime_type="application/pdf">https://joss.theoj.org/papers/10.21105/joss.09539.pdf</resource> |
| 84 | + </item> |
| 85 | + </collection> |
| 86 | + </doi_data> |
| 87 | + <citation_list> |
| 88 | + <citation key="cran"> |
| 89 | + <volume_title>Corrselect: Correlation-based variable subset selection</volume_title> |
| 90 | + <author>Colling</author> |
| 91 | + <doi>10.32614/CRAN.package.corrselect</doi> |
| 92 | + <cYear>2025</cYear> |
| 93 | + <unstructured_citation>Colling, G. (2025). Corrselect: Correlation-based variable subset selection. https://doi.org/10.32614/CRAN.package.corrselect</unstructured_citation> |
| 94 | + </citation> |
| 95 | + <citation key="Bron1973"> |
| 96 | + <article_title>Algorithm 457: Finding all cliques of an undirected graph</article_title> |
| 97 | + <author>Bron</author> |
| 98 | + <journal_title>Communications of the ACM</journal_title> |
| 99 | + <issue>9</issue> |
| 100 | + <volume>16</volume> |
| 101 | + <doi>10.1145/362342.362367</doi> |
| 102 | + <cYear>1973</cYear> |
| 103 | + <unstructured_citation>Bron, C., & Kerbosch, J. (1973). Algorithm 457: Finding all cliques of an undirected graph. Communications of the ACM, 16(9), 575–577. https://doi.org/10.1145/362342.362367</unstructured_citation> |
| 104 | + </citation> |
| 105 | + <citation key="Dormann2013"> |
| 106 | + <article_title>Collinearity: A review of methods to deal with it and a simulation study evaluating their performance</article_title> |
| 107 | + <author>Dormann</author> |
| 108 | + <journal_title>Ecography</journal_title> |
| 109 | + <issue>1</issue> |
| 110 | + <volume>36</volume> |
| 111 | + <doi>10.1111/j.1600-0587.2012.07348.x</doi> |
| 112 | + <cYear>2013</cYear> |
| 113 | + <unstructured_citation>Dormann, C. F., Elith, J., Bacher, S., & al., et. (2013). Collinearity: A review of methods to deal with it and a simulation study evaluating their performance. Ecography, 36(1), 27–46. https://doi.org/10.1111/j.1600-0587.2012.07348.x</unstructured_citation> |
| 114 | + </citation> |
| 115 | + <citation key="Szekely2007"> |
| 116 | + <article_title>Measuring and testing dependence by correlation of distances</article_title> |
| 117 | + <author>Székely</author> |
| 118 | + <journal_title>The Annals of Statistics</journal_title> |
| 119 | + <issue>6</issue> |
| 120 | + <volume>35</volume> |
| 121 | + <doi>10.1214/009053607000000505</doi> |
| 122 | + <cYear>2007</cYear> |
| 123 | + <unstructured_citation>Székely, G. J., Rizzo, M. L., & Bakirov, N. K. (2007). Measuring and testing dependence by correlation of distances. The Annals of Statistics, 35(6), 2769–2794. https://doi.org/10.1214/009053607000000505</unstructured_citation> |
| 124 | + </citation> |
| 125 | + <citation key="Szekely2009"> |
| 126 | + <article_title>Brownian distance covariance</article_title> |
| 127 | + <author>Székely</author> |
| 128 | + <journal_title>The Annals of Applied Statistics</journal_title> |
| 129 | + <issue>4</issue> |
| 130 | + <volume>3</volume> |
| 131 | + <doi>10.1214/09-AOAS312</doi> |
| 132 | + <cYear>2009</cYear> |
| 133 | + <unstructured_citation>Székely, G. J., & Rizzo, M. L. (2009). Brownian distance covariance. The Annals of Applied Statistics, 3(4), 1236–1265. https://doi.org/10.1214/09-AOAS312</unstructured_citation> |
| 134 | + </citation> |
| 135 | + <citation key="Reshef2011"> |
| 136 | + <article_title>Detecting novel associations in large data sets</article_title> |
| 137 | + <author>Reshef</author> |
| 138 | + <journal_title>Science</journal_title> |
| 139 | + <issue>6062</issue> |
| 140 | + <volume>334</volume> |
| 141 | + <doi>10.1126/science.1205438</doi> |
| 142 | + <cYear>2011</cYear> |
| 143 | + <unstructured_citation>Reshef, D. N., Reshef, Y. A., Finucane, H. K., & al., et. (2011). Detecting novel associations in large data sets. Science, 334(6062), 1518–1524. https://doi.org/10.1126/science.1205438</unstructured_citation> |
| 144 | + </citation> |
| 145 | + <citation key="Langfelder2008"> |
| 146 | + <article_title>WGCNA: An R package for weighted correlation network analysis</article_title> |
| 147 | + <author>Langfelder</author> |
| 148 | + <journal_title>BMC Bioinformatics</journal_title> |
| 149 | + <issue>1</issue> |
| 150 | + <volume>9</volume> |
| 151 | + <doi>10.1186/1471-2105-9-559</doi> |
| 152 | + <cYear>2008</cYear> |
| 153 | + <unstructured_citation>Langfelder, P., & Horvath, S. (2008). WGCNA: An R package for weighted correlation network analysis. BMC Bioinformatics, 9(1), 559. https://doi.org/10.1186/1471-2105-9-559</unstructured_citation> |
| 154 | + </citation> |
| 155 | + <citation key="ZouHastie2005"> |
| 156 | + <article_title>Regularization and variable selection via the elastic net</article_title> |
| 157 | + <author>Zou</author> |
| 158 | + <journal_title>Journal of the Royal Statistical Society: Series B</journal_title> |
| 159 | + <issue>2</issue> |
| 160 | + <volume>67</volume> |
| 161 | + <doi>10.1111/j.1467-9868.2005.00503.x</doi> |
| 162 | + <cYear>2005</cYear> |
| 163 | + <unstructured_citation>Zou, H., & Hastie, T. (2005). Regularization and variable selection via the elastic net. Journal of the Royal Statistical Society: Series B, 67(2), 301–320. https://doi.org/10.1111/j.1467-9868.2005.00503.x</unstructured_citation> |
| 164 | + </citation> |
| 165 | + <citation key="Witten2009"> |
| 166 | + <article_title>A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis</article_title> |
| 167 | + <author>Witten</author> |
| 168 | + <journal_title>Biostatistics</journal_title> |
| 169 | + <issue>3</issue> |
| 170 | + <volume>10</volume> |
| 171 | + <doi>10.1093/biostatistics/kxp008</doi> |
| 172 | + <cYear>2009</cYear> |
| 173 | + <unstructured_citation>Witten, D. M., Tibshirani, R., & Hastie, T. (2009). A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis. Biostatistics, 10(3), 515–534. https://doi.org/10.1093/biostatistics/kxp008</unstructured_citation> |
| 174 | + </citation> |
| 175 | + <citation key="Eppstein2010"> |
| 176 | + <article_title>Listing all maximal cliques in sparse graphs in near-optimal time</article_title> |
| 177 | + <author>Eppstein</author> |
| 178 | + <journal_title>Algorithms and computation (ISAAC 2010)</journal_title> |
| 179 | + <volume>6506</volume> |
| 180 | + <doi>10.1007/978-3-642-17517-6_36</doi> |
| 181 | + <cYear>2010</cYear> |
| 182 | + <unstructured_citation>Eppstein, D., Löffler, M., & Strash, D. (2010). Listing all maximal cliques in sparse graphs in near-optimal time. Algorithms and Computation (ISAAC 2010), 6506, 403–414. https://doi.org/10.1007/978-3-642-17517-6_36</unstructured_citation> |
| 183 | + </citation> |
| 184 | + <citation key="igraph"> |
| 185 | + <article_title>The igraph software package for complex network research</article_title> |
| 186 | + <author>Csardi</author> |
| 187 | + <journal_title>InterJournal, Complex Systems</journal_title> |
| 188 | + <issue>5</issue> |
| 189 | + <volume>1695</volume> |
| 190 | + <cYear>2006</cYear> |
| 191 | + <unstructured_citation>Csardi, G., & Nepusz, T. (2006). The igraph software package for complex network research. InterJournal, Complex Systems, 1695(5), 1–9. https://igraph.org</unstructured_citation> |
| 192 | + </citation> |
| 193 | + <citation key="YuLiu2003"> |
| 194 | + <article_title>Feature selection for high-dimensional data: A fast correlation-based filter solution</article_title> |
| 195 | + <author>Yu</author> |
| 196 | + <journal_title>Proceedings of the 20th international conference on machine learning (ICML-03)</journal_title> |
| 197 | + <cYear>2003</cYear> |
| 198 | + <unstructured_citation>Yu, L., & Liu, H. (2003). Feature selection for high-dimensional data: A fast correlation-based filter solution. Proceedings of the 20th International Conference on Machine Learning (ICML-03), 856–863.</unstructured_citation> |
| 199 | + </citation> |
| 200 | + </citation_list> |
| 201 | + </journal_article> |
| 202 | + </journal> |
| 203 | + </body> |
| 204 | +</doi_batch> |
0 commit comments