Alan Santos Campos
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Alan Santos Campos has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Charlan Dellon da Silva Alves
PEC, COPPE/UFRJ, Rio de Janeiro, Brazil
3 shared publications - Ronaldo Malheiros Gregório
PPGMMC, ICE/UFRRJ, Seropédica, Brazil
3 shared publications - Marcelo Dib Cruz2 shared publications
Helainy Ignacio de Almeida Torres
1 shared publication- Nelson Maculan
Systems Engineering and Computer Science Program-Applied Mathematics (COPPE/IM), Federal University of Rio de Janeiro, Rio de Janeiro, Brazil
1 shared publication - Sérgio Assunção Monteiro
Departamento de Administração, ESPM, Rio de Janeiro, Brazil
1 shared publication
Latest Publications
- Open Access
- 5 September 2026
- Published by Springer Nature in Soft Computing
- Vol. 30 (9) , 5843-5870
A new perspective on centroid algorithms for unsupervised discrete clustering in Riemannian manifolds: an approach via optimization
Clustering is an unsupervised learning technique used to discover hidden structures in data. By identifying patterns and similarities among objects, this methodology enables the organization of datasets into homogeneous groups. This work presents a new perspective on a specific class of partition-based algorithms for unsupervised discrete clustering in complete finite-dimensional Riemannian manifolds by introducing statistical shape analyses to classify clusters and improve label selection. To achieve this aim, we extend the statistical concepts of skewness and kurtosis to Riemannian settings, based on vector operations in the tangent plane at each point of the manifold. Assumptions regarding the injectivity radius and the boundedness of the sectional curvature are initially adopted to enable local convex analysis. Nevertheless, the well-posedness of Riemannian weighted centroids is ensured by analyzing the coercivity and quasiconvexity properties of the distance function’s powers. In addition, we demonstrate that well-posedness and continuity extend to any positive power of the distance function, rather than being limited to powers greater than or equal to 1. Computational experiments involving diffusion tensor imaging and hyperspectral image segmentation are performed. We also present a statistical analysis to demonstrate the practical applicability and computational performance of our technique compared with leading clustering approaches. Ultimately, our methodology is applicable to any field where data modeling resides in a complete finite-dimensional Riemannian manifold.
- 5 September 2026
- Published by Springer Nature in Soft Computing
- Vol. 30 (9) , 5843-5870
Open AccessA new perspective on centroid algorithms for unsupervised discrete clustering in Riemannian manifolds: an approach via optimization
Clustering is an unsupervised learning technique used to discover hidden structures in data. By identifying patterns and similarities among objects, this methodology enables the organization of datasets into homogeneous groups. This work presents a new perspective on a specific class of partition-based algorithms for unsupervised discrete clustering in complete finite-dimensional Riemannian manifolds by introducing statistical shape analyses to classify clusters and improve label selection. To achieve this aim, we extend the statistical concepts of skewness and kurtosis to Riemannian settings, based on vector operations in the tangent plane at each point of the manifold. Assumptions regarding the injectivity radius and the boundedness of the sectional curvature are initially adopted to enable local convex analysis. Nevertheless, the well-posedness of Riemannian weighted centroids is ensured by analyzing the coercivity and quasiconvexity properties of the distance function’s powers. In addition, we demonstrate that well-posedness and continuity extend to any positive power of the distance function, rather than being limited to powers greater than or equal to 1. Computational experiments involving diffusion tensor imaging and hyperspectral image segmentation are performed. We also present a statistical analysis to demonstrate the practical applicability and computational performance of our technique compared with leading clustering approaches. Ultimately, our methodology is applicable to any field where data modeling resides in a complete finite-dimensional Riemannian manifold.
- 7 August 2026
- Published by Elsevier in Pattern Recognition Letters
- Vol. 208, 177-184
Metric-based supervised classification of SPD diffusion tensor images
- 7 August 2026
- Published by Elsevier in Pattern Recognition Letters
- Vol. 208, 177-184
Metric-based supervised classification of SPD diffusion tensor images
- 14 March 2026
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 485
A generalized k–Lα centroids algorithm for DT-MRI segmentation
- 14 March 2026
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 485
A generalized k–Lα centroids algorithm for DT-MRI segmentation