featsel: a framework for benchmarking of feature selection algorithms and cost functions (2017)
- Authors:
- USP affiliated authors: FERREIRA, CARLOS EDUARDO - IME ; BARRERA, JUNIOR - IME
- Unidade: IME
- DOI: 10.1016/j.softx.2017.07.005
- Assunto: ÁLGEBRAS DE BOOLE
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
REIS, Marcelo da Silva et al. featsel: a framework for benchmarking of feature selection algorithms and cost functions. SoftwareX, v. 6, p. 193-197, 2017Tradução . . Disponível em: https://doi.org/10.1016/j.softx.2017.07.005. Acesso em: 19 abr. 2024. -
APA
Reis, M. da S., Estrela, G., Ferreira, C. E., & Barrera, J. (2017). featsel: a framework for benchmarking of feature selection algorithms and cost functions. SoftwareX, 6, 193-197. doi:10.1016/j.softx.2017.07.005 -
NLM
Reis M da S, Estrela G, Ferreira CE, Barrera J. featsel: a framework for benchmarking of feature selection algorithms and cost functions [Internet]. SoftwareX. 2017 ; 6 193-197.[citado 2024 abr. 19 ] Available from: https://doi.org/10.1016/j.softx.2017.07.005 -
Vancouver
Reis M da S, Estrela G, Ferreira CE, Barrera J. featsel: a framework for benchmarking of feature selection algorithms and cost functions [Internet]. SoftwareX. 2017 ; 6 193-197.[citado 2024 abr. 19 ] Available from: https://doi.org/10.1016/j.softx.2017.07.005 - Optimal Boolean lattice-based algorithms for the U-curve optimization problem
- A combinatorial optimization technique for the sequential decomposition of erosions and dilations
- Finding optimal sequential decompositions of erosions and dilations
- A combinatorial optimization technique for the sequential decomposition of erosions and dilations
- An efficient, parallelized algorithm for optimal conditional entropy-based feature selection
- A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem
- A PTAS for the metric case of the optimum weighted source–destination communication spanning tree problem
- The node capacitated graph pertitioning problem: a computational study
- The biclique k-clustering problem in bipartite graphs and its application in bioinformatics
- A dynamic programming algorithm for the tree mapping problem
Informações sobre o DOI: 10.1016/j.softx.2017.07.005 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 | 2845248.pdf | Direct link |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
