Obserwuj
Antonio Cavalcante Araujo Neto
Antonio Cavalcante Araujo Neto
Postdoctoral Fellow - University of Alberta
Zweryfikowany adres z ualberta.ca - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Efficient computation of multiple density-based clustering hierarchies
ACA Neto, J Sander, RJGB Campello, MA Nascimento
2017 IEEE International Conference on Data Mining (ICDM), 991-996, 2017
232017
Efficient computation and visualization of multiple density-based clustering hierarchies
ACA Neto, J Sander, RJGB Campello, MA Nascimento
IEEE Transactions on Knowledge and Data Engineering 33 (8), 3075-3089, 2019
202019
A distributed approach for privacy preservation in the publication of trajectory data
FT Brito, ACA Neto, CF Costa, ALC Mendonça, JC Machado
Proceedings of the 2nd Workshop on Privacy in Geographic Information …, 2015
122015
Efficient and Distributed DBScan Algorithm Using MapReduce to Detect Density Areas on Traffic Data
TLC da Silva, AC Araújo Neto, RP Magalhães, VAE de Farias, ...
16th International Conference on Enterprise Information Systems (ICEIS 2014), 2014
102014
G2P: A partitioning approach for processing dbscan with mapreduce
AC Araujo Neto, TL Coelho da Silva, VAE de Farias, JAF Macêdo, ...
Web and Wireless Geographical Information Systems: 14th International …, 2015
72015
Análise em Big Data e um Estudo de Caso utilizando Ambientes de Computação em Nuvem
TLC da Silva, AC Araújo Neto, FRC Sousa, JAF de Macêdo, JC Machado
62013
Mustache: A multiple clustering hierarchies explorer
ACA Neto, MA Nascimento, J Sander, RJGB Campello
Proceedings of the VLDB Endowment 11 (12), 2058-2061, 2018
52018
Towards an Efficient and Distributed DBSCAN Algorithm Using MapReduce.
TLC da Silva, ACA Neto, RP Magalhães, VAE de Farias, JAF de Macêdo, ...
ICEIS (Revised Selected Papers), 75-90, 2014
4*2014
Core-SG: efficient computation of multiple MSTS for density-based methods
ACA Neto, MC Naldi, RJGB Campello, J Sander
2022 IEEE 38th International Conference on Data Engineering (ICDE), 951-964, 2022
32022
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–9