Strict Very Fast Decision Tree: a memory conservative algorithm for data stream mining (2018)
Source: Pattern Recognition Letters. Unidade: ICMC
Subjects: MINERAÇÃO DE DADOS, ANÁLISE DE SÉRIES TEMPORAIS, APRENDIZADO COMPUTACIONAL, ALGORITMOS ÚTEIS E ESPECÍFICOS
ABNT
COSTA, Victor Guilherme Turrisi da e CARVALHO, André Carlos Ponce de Leon Ferreira de e BARDON JUNIOR, Sylvio. Strict Very Fast Decision Tree: a memory conservative algorithm for data stream mining. Pattern Recognition Letters, v. 116, p. 22-28, 2018Tradução . . Disponível em: https://doi.org/10.1016/j.patrec.2018.09.004. Acesso em: 07 out. 2024.APA
Costa, V. G. T. da, Carvalho, A. C. P. de L. F. de, & Bardon Junior, S. (2018). Strict Very Fast Decision Tree: a memory conservative algorithm for data stream mining. Pattern Recognition Letters, 116, 22-28. doi:10.1016/j.patrec.2018.09.004NLM
Costa VGT da, Carvalho ACP de LF de, Bardon Junior S. Strict Very Fast Decision Tree: a memory conservative algorithm for data stream mining [Internet]. Pattern Recognition Letters. 2018 ; 116 22-28.[citado 2024 out. 07 ] Available from: https://doi.org/10.1016/j.patrec.2018.09.004Vancouver
Costa VGT da, Carvalho ACP de LF de, Bardon Junior S. Strict Very Fast Decision Tree: a memory conservative algorithm for data stream mining [Internet]. Pattern Recognition Letters. 2018 ; 116 22-28.[citado 2024 out. 07 ] Available from: https://doi.org/10.1016/j.patrec.2018.09.004