Murilo Coelho Naldi

Dr. Murilo Coelho Naldi

Federal University of São Carlos, São Carlos, São Paulo, Brazil
orcid

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 March 2019 in IEEE Transactions on Big Data
Verified
Journal Article
Open access
JSJoelson Antonio dos Santos
Joelson Antonio dos Santos
TSTalat Iqbal Syed
Talat Iqbal Syed
Murilo Coelho NaldiMurilo Coelho Naldi
Murilo Coelho Naldi
RCRicardo J. G. B. Campello
Ricardo J. G. B. Campello
JSJoerg Sander
Joerg Sander
Hierarchical density-based clustering is a powerful tool for exploratory data analysis, which can play an important role in the understanding and organization of datasets. However, its applicability to large datasets is limited because the computational complexity of hierarchical clustering methods has a quadratic lower bound in the number of objects to be clustered. MapReduce is a popular programming model to speed up data mining and machine learning algorithms operating on large, possibly distributed datasets. In the literature, there have been attempts to parallelize algorithms such as Single-Linkage, which in principle can also be extended to the broader scope of hierarchical density-based clustering, but hierarchical clustering algorithms are inherently difficult to parallelize with MapReduce. In this paper, we discuss why adapting previous approaches to parallelize Single-Linkage clustering using MapReduce leads to very inefficient solutions when one wants to compute density-based clustering hierarchies. Preliminarily, we discuss one such solution, which is based on an exact, yet very computationally demanding, random blocks parallelization scheme. To be able to efficiently apply hierarchical density-based clustering to large datasets using MapReduce, we then propose a different parallelization scheme that computes an approximate clustering hierarchy based on a much faster, recursive sampling approach. This approach is based on HDBSCAN*, the state-of-the-art hierarchical density-based clustering algorithm, combined with a data summarization technique called data bubbles. The proposed method is evaluated in terms of both runtime and quality of the approximation on a number of datasets, showing its effectiveness and scalability.

1 January 2020 in Computers in Biology and Medicine
Verified
Journal Article
Closed access
Larissa F. Rodrigues MoreiraLarissa F. Rodrigues Moreira
Larissa F. Rodrigues Moreira
Murilo Coelho NaldiMurilo Coelho Naldi
Murilo Coelho Naldi
JMJoão Fernando Mari
João Fernando Mari

1 September 2015 in Neurocomputing
Verified
Journal Article
Closed access
Murilo Coelho NaldiMurilo Coelho Naldi
Murilo Coelho Naldi
RCR.J.G.B. Campello
R.J.G.B. Campello

7 June 2021 in The European Physical Journal Special Topics
Verified
Journal Article
Closed access
PDF file
AVAlan Demétrius Baria Valejo
Alan Demétrius Baria Valejo
WSWellington de Oliveira dos Santos
Wellington de Oliveira dos Santos
Murilo Coelho NaldiMurilo Coelho Naldi
Murilo Coelho Naldi
Liang ZhaoLiang Zhao
Liang Zhao

25 June 2022 in Applied Sciences
Verified
Journal Article
Open access
PDF file
PCPaulo Gustavo Lopes Cândido
Paulo Gustavo Lopes Cândido
JSJonathan De Andrade Silva
Jonathan De Andrade Silva
EFElaine Ribeiro Faria
Elaine Ribeiro Faria
Murilo Coelho NaldiMurilo Coelho Naldi
Murilo Coelho Naldi
The increasing volume and velocity of the continuously generated data (data stream) challenge machine learning algorithms, which must evolve to fit real-world problems. The data stream clustering algorithms face issues such as the rapidly increasing volume of the data, the variety of the number of clusters, and their shapes. The present work aims to improve the accuracy of sequential clustering batches of data streams for scenarios in which clusters evolve dynamically and continuously, automatically estimating their number. In order to achieve this goal, three evolutionary algorithms are presented, along with three novel algorithms designed to deal with clusters of normal distribution based on goodness-of-fit tests in the context of scalable batch stream clustering with automatic estimation of the number of clusters. All of them are developed on top of MapReduce, Discretized-Stream models, and the most recent MPC frameworks to provide scalability, reliability, resilience, and flexibility. The proposed algorithms are experimentally compared with state-of-the-art methods and present the best results for accuracy for normally distributed data sets, reaching their goal.

19 December 2025 in IEEE Access
Verified
Journal Article
Open access
GMGuilherme Henrique Messias
Guilherme Henrique Messias
TBTiago Gonçalves Botelho
Tiago Gonçalves Botelho
SISylvia Iasulaitis
Sylvia Iasulaitis
Murilo Coelho NaldiMurilo Coelho Naldi
Murilo Coelho Naldi
AVAlan Demétrius Baria Valejo
Alan Demétrius Baria Valejo
The objective of node clustering is to identify distinct groups of vertices in a graph, ensuring that similar nodes are grouped together while dissimilar ones remain apart. Building on the success of graph neural networks (GNNs) in tasks such as node classification and link prediction, several clustering strategies have been developed. Although these methods are highly effective, many share similar strengths and weaknesses, which are often difficult to discern in the absence of a clear taxonomy. Previous studies have attempted to categorize node clustering algorithms; however, most are not restricted to GNN-based methods and instead encompass a wide variety of graph learning techniques. Furthermore, despite significant progress in community detection, valuable insights from this area remain underexplored in the context of GNN-based clustering. To bridge this gap and provide a structured overview of the field, we conducted a Systematic Literature Review (SLR) on node clustering in homogeneous networks using GNNs. A total of 84 articles were reviewed based on 20 inclusion and exclusion criteria. From this analysis, we propose a comprehensive taxonomy that integrates both deep clustering and node embedding models. The findings reveal key research gaps, including the absence of transformer-based models, the high computational cost of some approaches, and dataset bias arising from the over-reliance on widely used benchmarks. The proposed taxonomy offers a clearer framework for understanding existing methodologies and guiding future research directions in GNN-based node clustering.