A fast Branch-and-Bound algorithm for U-curve feature selection (2018)
Fonte: Pattern Recognition. Unidade: IME
Assunto: CIÊNCIA DA COMPUTAÇÃO
ABNT
ATASHPAZ-GARGARI, Esmaeil et al. A fast Branch-and-Bound algorithm for U-curve feature selection. Pattern Recognition, v. 73, p. 172-188, 2018Tradução . . Disponível em: https://doi.org/10.1016/j.patcog.2017.08.013. Acesso em: 19 set. 2024.APA
Atashpaz-Gargari, E., Reis, M. da S., Braga-Neto, U. M., Barrera, J., & Dougherty, E. R. (2018). A fast Branch-and-Bound algorithm for U-curve feature selection. Pattern Recognition, 73, 172-188. doi:10.1016/j.patcog.2017.08.013NLM
Atashpaz-Gargari E, Reis M da S, Braga-Neto UM, Barrera J, Dougherty ER. A fast Branch-and-Bound algorithm for U-curve feature selection [Internet]. Pattern Recognition. 2018 ; 73 172-188.[citado 2024 set. 19 ] Available from: https://doi.org/10.1016/j.patcog.2017.08.013Vancouver
Atashpaz-Gargari E, Reis M da S, Braga-Neto UM, Barrera J, Dougherty ER. A fast Branch-and-Bound algorithm for U-curve feature selection [Internet]. Pattern Recognition. 2018 ; 73 172-188.[citado 2024 set. 19 ] Available from: https://doi.org/10.1016/j.patcog.2017.08.013