Daniel Carlos Guimarães Pedronette
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Daniel Carlos Guimarães Pedronette has a total of 84 co-authors. Here are the top co-authors by number of shared publications:
Ricardo da S. Torres
23 shared publications- Ricardo da Silva Torres
Department of Management and Technology, Universitat Ramon Llull (URL), 08022 Barcelona, Spain
18 shared publications Lucas Pascotti Valem
13 shared publications- Jurandy Almeida
Federal University of Sao Carlos (UFSCar)
12 shared publications - Lucas Pascotti Valem
Universidade de São Paulo (USP)
11 shared publications - Gustavo Rosseto Leticio
São Paulo State University (UNESP), Rio Claro, Brazil
6 shared publications
Latest Publications
- Open Access
- 6 November 2026
- Published by Elsevier in Knowledge-Based Systems
Self-explaining unsupervised prototype-based embeddings via projection and ranking
- 6 November 2026
- Published by Elsevier in Knowledge-Based Systems
Open AccessSelf-explaining unsupervised prototype-based embeddings via projection and ranking
- 17 September 2026
- Published by Springer Nature
- p. 712-727
Context-Aware Intent Retrieval and Classification Based on Graph Convolutional Networks
- 17 September 2026
- Published by Springer Nature
- p. 712-727
Context-Aware Intent Retrieval and Classification Based on Graph Convolutional Networks
- Open Access
- 19 July 2026
- Published by Sociedade Brasileira de Computação
- p. 255-261
Geometria dos Embeddings em Recomendação: GNNs e Transformers sob Manifold Learning
Foram comparados três paradigmas de recomendação - LightGCN, KGAT e SASRec - sob a perspectiva de manifold learning, com o intuito de verificar como cada arquitetura molda a geometria dos embeddings aprendidos. Foram adotados dois protocolos de avaliação: previsão cronológica do próximo item e recomendação geral top-K, ambos com ranqueamento full-corpus. As métricas de Preservação de Vizinhança (NP@10) e Distorção de Distância Local (LDD@10) são definidas com o grafo de interação de itens (Jaccard) como espaço de referência. Em MovieLens-1M, Yelp2018 e Amazon-Book, o SASRec domina a previsão sequencial, enquanto o LightGCN iguala ou supera o KGAT em recomendação geral, contrariando a hipótese de que grafos de conhecimento aprimoram sistematicamente o desempenho. A análise geométrica esclarece esse resultado.
- 19 July 2026
- Published by Sociedade Brasileira de Computação
- p. 255-261
Open AccessGeometria dos Embeddings em Recomendação: GNNs e Transformers sob Manifold Learning
Foram comparados três paradigmas de recomendação - LightGCN, KGAT e SASRec - sob a perspectiva de manifold learning, com o intuito de verificar como cada arquitetura molda a geometria dos embeddings aprendidos. Foram adotados dois protocolos de avaliação: previsão cronológica do próximo item e recomendação geral top-K, ambos com ranqueamento full-corpus. As métricas de Preservação de Vizinhança (NP@10) e Distorção de Distância Local (LDD@10) são definidas com o grafo de interação de itens (Jaccard) como espaço de referência. Em MovieLens-1M, Yelp2018 e Amazon-Book, o SASRec domina a previsão sequencial, enquanto o LightGCN iguala ou supera o KGAT em recomendação geral, contrariando a hipótese de que grafos de conhecimento aprimoram sistematicamente o desempenho. A análise geométrica esclarece esse resultado.
- Open Access
- 15 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 1092-1101
Context-Aware Interpretable Representations for Retrieval and Graph Convolutional Network Classification
- 15 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 1092-1101
Open AccessContext-Aware Interpretable Representations for Retrieval and Graph Convolutional Network Classification
- Open Access
- 6 February 2026
- Published by Elsevier in Data in Brief
- Vol. 65, 112549
A dataset of sugarcane crop yield, production environment, meteorological records, and satellite images of commercial fields in the northeast of São Paulo State, Brazil
- 6 February 2026
- Published by Elsevier in Data in Brief
- Vol. 65, 112549
Open AccessA dataset of sugarcane crop yield, production environment, meteorological records, and satellite images of commercial fields in the northeast of São Paulo State, Brazil
- 31 January 2026
- Published by Elsevier in Pattern Recognition Letters
- Vol. 202, 36-43
A ranked-based framework based on manifold learning for multivariate time series retrieval and classification
- 31 January 2026
- Published by Elsevier in Pattern Recognition Letters
- Vol. 202, 36-43
A ranked-based framework based on manifold learning for multivariate time series retrieval and classification
- Open Access
- 20 January 2026
- Published by Sociedade Brasileira de Computação in Journal of the Brazilian Computer Society
- Vol. 32 (1) , 2252-2273
Aggregating Neighbor Embedding Projection and Rank-Based Manifold Learning for Image Retrieval
Content-based image retrieval (CBIR) has evolved significantly with the advent of deep learning models, yet effectively ranking similar images remains a challenging task, particularly in high-dimensional feature spaces where pairwise distance measures often fail to capture complex contextual relationships and the semantic gap between visual features and high-level concepts persists. In this scenario, manifold learning and rank-based refinement methods have emerged as complementary strategies, respectively improving feature representations and exploiting contextual information embedded in ranked lists, such as neighborhood relationships among images. However, combining projection-based and rank-based strategies to exploit their complementary properties remains a challenging research problem. To address this, this paper proposes a framework that combines neighbor embedding projections with rank-based manifold learning through rank aggregation. Specifically, Uniform Manifold Approximation and Projection (UMAP) is used to generate alternative low-dimensional feature representations, while ranked lists obtained from UMAP projections and rank-based re-ranking methods are combined using the Borda Count aggregation strategy. The experimental evaluation was conducted on several public datasets using deep learning features extracted from ResNet152, Swin Transformer, and DINOv2 models. The results show that the proposed approach can improve retrieval effectiveness in several scenarios, particularly when the baseline representation struggles to achieve high precision values. In addition, the aggregation strategy often improves the quality of the top-ranked positions, leading to competitive Mean Average Precision (MAP) and Precision values across different datasets and feature extractors. These findings suggest that combining projection-based and rank-based manifold learning strategies through rank aggregation can provide complementary contextual information for image retrieval tasks.
- 20 January 2026
- Published by Sociedade Brasileira de Computação in Journal of the Brazilian Computer Society
- Vol. 32 (1) , 2252-2273
Open AccessAggregating Neighbor Embedding Projection and Rank-Based Manifold Learning for Image Retrieval
Content-based image retrieval (CBIR) has evolved significantly with the advent of deep learning models, yet effectively ranking similar images remains a challenging task, particularly in high-dimensional feature spaces where pairwise distance measures often fail to capture complex contextual relationships and the semantic gap between visual features and high-level concepts persists. In this scenario, manifold learning and rank-based refinement methods have emerged as complementary strategies, respectively improving feature representations and exploiting contextual information embedded in ranked lists, such as neighborhood relationships among images. However, combining projection-based and rank-based strategies to exploit their complementary properties remains a challenging research problem. To address this, this paper proposes a framework that combines neighbor embedding projections with rank-based manifold learning through rank aggregation. Specifically, Uniform Manifold Approximation and Projection (UMAP) is used to generate alternative low-dimensional feature representations, while ranked lists obtained from UMAP projections and rank-based re-ranking methods are combined using the Borda Count aggregation strategy. The experimental evaluation was conducted on several public datasets using deep learning features extracted from ResNet152, Swin Transformer, and DINOv2 models. The results show that the proposed approach can improve retrieval effectiveness in several scenarios, particularly when the baseline representation struggles to achieve high precision values. In addition, the aggregation strategy often improves the quality of the top-ranked positions, leading to competitive Mean Average Precision (MAP) and Precision values across different datasets and feature extractors. These findings suggest that combining projection-based and rank-based manifold learning strategies through rank aggregation can provide complementary contextual information for image retrieval tasks.
- Open Access
- 20 January 2026
- Published by Sociedade Brasileira de Computação in Journal of the Brazilian Computer Society
- Vol. 32 (1) , 1731-1754
Graph Neural Networks for Semi-Supervised Image Classification with Multi-Feature Aggregation
Feature extraction involves the identification and extraction of salient characteristics or patterns, including edges, textures, shapes, and color attributes. Contemporary feature extractors predominantly leverage deep learning architectures, such as Convolutional Neural Networks (CNNs) and Vision Transformers (VITs). The availability of diverse feature extractors in the literature provides a wide range of feature representations. Features extracted from an image depend on the specific application, the chosen extractor, and its configuration. Therefore, integrating complementary information by combining distinct extractors offers a promising way to enhance performance. Graph Neural Networks (GNNs), particularly Graph Convolutional Networks (GCNs), have emerged as powerful and widely adopted approaches for semi-supervised image classification, as they effectively leverage both labeled and unlabeled data while exploiting the underlying graph structures that capture relationships among samples. This study proposes a novel approach for GNNs in scenarios where labeled data is scarce, by integrating diverse sets of feature and graph representations derived from various extractors in classification scenarios. Experimental investigations were conducted, encompassing combinations of distinct feature and graph extractors, as well as rank aggregation strategies. The primary contributions of this work are underscored by the experimental findings, which demonstrate that the strategic combination of feature and graph representations, coupled with the application of manifold learning for graph processing, leads to significant improvements in classification accuracy across the majority of experimental conditions. Furthermore, the utilization of rank aggregation techniques to integrate features from different extractors was shown to enhance classification accuracy.
- 20 January 2026
- Published by Sociedade Brasileira de Computação in Journal of the Brazilian Computer Society
- Vol. 32 (1) , 1731-1754
Open AccessGraph Neural Networks for Semi-Supervised Image Classification with Multi-Feature Aggregation
Feature extraction involves the identification and extraction of salient characteristics or patterns, including edges, textures, shapes, and color attributes. Contemporary feature extractors predominantly leverage deep learning architectures, such as Convolutional Neural Networks (CNNs) and Vision Transformers (VITs). The availability of diverse feature extractors in the literature provides a wide range of feature representations. Features extracted from an image depend on the specific application, the chosen extractor, and its configuration. Therefore, integrating complementary information by combining distinct extractors offers a promising way to enhance performance. Graph Neural Networks (GNNs), particularly Graph Convolutional Networks (GCNs), have emerged as powerful and widely adopted approaches for semi-supervised image classification, as they effectively leverage both labeled and unlabeled data while exploiting the underlying graph structures that capture relationships among samples. This study proposes a novel approach for GNNs in scenarios where labeled data is scarce, by integrating diverse sets of feature and graph representations derived from various extractors in classification scenarios. Experimental investigations were conducted, encompassing combinations of distinct feature and graph extractors, as well as rank aggregation strategies. The primary contributions of this work are underscored by the experimental findings, which demonstrate that the strategic combination of feature and graph representations, coupled with the application of manifold learning for graph processing, leads to significant improvements in classification accuracy across the majority of experimental conditions. Furthermore, the utilization of rank aggregation techniques to integrate features from different extractors was shown to enhance classification accuracy.
- Open Access
- 24 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 2576-2591
Optimization in Information Retrieval: A Systematic Review of Techniques for Performance and Scalability
Information Retrieval (IR) systems are fundamental across various domains, from web search engines to enterprise data management, enabling efficient access to relevant information within large-scale digital collections. While research in IR has traditionally prioritized retrieval effectiveness, ensuring the efficiency and scalability of these systems is equally critical, particularly as data volumes and computational demands continue to rise. Over the past decades, substantial progress has been made in optimizing IR systems, with studies addressing indexing strategies, parallelization techniques, and resource-efficient retrieval. However, given the growing need for real-time and large-scale processing, further advancements in optimization techniques remain essential. This systematic review explores key methods that enhance IR performance through memory management, query execution improvements, and algorithmic efficiency. By synthesizing research from 2018 to 2024, we highlight approaches that significantly improve response time, resource utilization, and scalability in IR applications. Our goal is to provide researchers and practitioners with a comprehensive overview of optimization strategies in IR, emphasizing their critical role in modern retrieval systems. While optimization research may not always receive the same level of attention as other IR topics, it remains a foundational aspect of building high-performance, scalable search technologies. This review underscores the ongoing efforts in this area and identifies opportunities for further innovation.
- 24 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 2576-2591
Open AccessOptimization in Information Retrieval: A Systematic Review of Techniques for Performance and Scalability
Information Retrieval (IR) systems are fundamental across various domains, from web search engines to enterprise data management, enabling efficient access to relevant information within large-scale digital collections. While research in IR has traditionally prioritized retrieval effectiveness, ensuring the efficiency and scalability of these systems is equally critical, particularly as data volumes and computational demands continue to rise. Over the past decades, substantial progress has been made in optimizing IR systems, with studies addressing indexing strategies, parallelization techniques, and resource-efficient retrieval. However, given the growing need for real-time and large-scale processing, further advancements in optimization techniques remain essential. This systematic review explores key methods that enhance IR performance through memory management, query execution improvements, and algorithmic efficiency. By synthesizing research from 2018 to 2024, we highlight approaches that significantly improve response time, resource utilization, and scalability in IR applications. Our goal is to provide researchers and practitioners with a comprehensive overview of optimization strategies in IR, emphasizing their critical role in modern retrieval systems. While optimization research may not always receive the same level of attention as other IR topics, it remains a foundational aspect of building high-performance, scalable search technologies. This review underscores the ongoing efforts in this area and identifies opportunities for further innovation.