SWINN: efficient nearest neighbor search in sliding windows using graphs (2024)
Fonte: Information Fusion. Unidade: ICMC
Assuntos: APRENDIZADO COMPUTACIONAL, ANÁLISE DE SÉRIES TEMPORAIS, ALGORITMOS PARA PROCESSAMENTO
ABNT
MASTELINI, Saulo Martiello et al. SWINN: efficient nearest neighbor search in sliding windows using graphs. Information Fusion, v. 101, n. Ja 2024, p. 1-17, 2024Tradução . . Disponível em: https://doi.org/10.1016/j.inffus.2023.101979. Acesso em: 07 set. 2024.APA
Mastelini, S. M., Veloso, B., Halford, M., Carvalho, A. C. P. de L. F. de, & Gama, J. (2024). SWINN: efficient nearest neighbor search in sliding windows using graphs. Information Fusion, 101( Ja 2024), 1-17. doi:10.1016/j.inffus.2023.101979NLM
Mastelini SM, Veloso B, Halford M, Carvalho ACP de LF de, Gama J. SWINN: efficient nearest neighbor search in sliding windows using graphs [Internet]. Information Fusion. 2024 ; 101( Ja 2024): 1-17.[citado 2024 set. 07 ] Available from: https://doi.org/10.1016/j.inffus.2023.101979Vancouver
Mastelini SM, Veloso B, Halford M, Carvalho ACP de LF de, Gama J. SWINN: efficient nearest neighbor search in sliding windows using graphs [Internet]. Information Fusion. 2024 ; 101( Ja 2024): 1-17.[citado 2024 set. 07 ] Available from: https://doi.org/10.1016/j.inffus.2023.101979