Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Raul Fonseca Neto

dblp:73/2464 · DBLP profile ↗
← Back
14ranked-venue papers
1as first author
3since 2021 · last 2026
0000-0002-2282-5746ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 12 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2Applied, interdisciplinary, general and emerging computing · 2 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%
Artificial intelligence
1 paper
Kernel, tree and ensemble methods · 100%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Kernel, tree and ensemble methods
ensemble learning
0.212016
Version Space Reduction Based on Ensembles of Dissimilar Balanced Perceptrons · IJCAI 2016
Bioinformatics and computational biology
feature selection
0.212015
Feature Selection from Microarray Data via an Ordered Search with Projected Margin · IJCAI 2015
Bioinformatics and computational biology
gene expression analysis
0.212015
Feature Selection from Microarray Data via an Ordered Search with Projected Margin · IJCAI 2015
Bioinformatics and computational biology › gene expression analysis
microarray data analysis
0.212015
Feature Selection from Microarray Data via an Ordered Search with Projected Margin · IJCAI 2015
Data mining › dimensionality reduction
feature selection
0.212015
Feature Selection from Microarray Data via an Ordered Search with Projected Margin · IJCAI 2015

Methods — techniques the papers use, named apart from their topics

projected margin · 0.4ordered search · 0.4perceptron ensembles · 0.2
YearPublicationVenuePosition
2026 Metaheuristic-Optimized Ensemble Learning for Glioma Grading
Lucas Silva Santana, Saulo Moraes Villela, Luiz Maurílio Maciel, Raul Fonseca Neto, Marcelo Bernardes Vieira
ICCSA (3)4
2025 A projected gradient solution to the minimum connector problem with extensions to support vector machines
Raul Fonseca Neto, Saulo Moraes Villela, Antônio de Pádua Braga
Pattern Recognit.1
2021 An evolutionary algorithm for large margin classification
Renan Motta Goulart, Carlos Cristiano H. Borges, Raul Fonseca Neto
Soft Comput.3
2020 A Music Classification model based on metric learning applied to MP3 audio files
Angelo Cesar Mendes da Silva, Maurício Archanjo Nunes Coelho, Raul Fonseca Neto
Expert Syst. Appl.3
2020 A kernel based learning method for non-stationary two-player repeated games
Renan Motta Goulart, Saul de Castro Leite, Raul Fonseca Neto
Knowl. Based Syst.3
2019 A best-first branch-and-bound search for solving the transductive inference problem using support vector machines
Hygor Xavier Araújo, Raul Fonseca Neto, Saulo Moraes Villela
ESANN2
2018 An Approximative Bayes-Optimal Kernel Classifier Based on Version Space Reduction
abstract
The Bayes-optimal classifier is defined as a classifier that induces an hypothesis able to minimize the prediction error for any given sample in binary classification problems. Finding the Bayes-optimal classifier is an intractable problem. It is known that it is approximately equivalent to the center of mass of the version space, which is given by the set of all classifiers consistent with the training set. Previously solutions to find the center of mass are not feasible, as they present a high computational cost, and do not work properly in non-linear separable problems. Aiming to solve these problems, this paper presents the Dual Version Space Reduction Machine (Dual VSRM), an effective kernel method to approximate the center of mass of the version space. The Dual VSRM algorithm employs successive reductions of the version space based on an oracle's decision. As an oracle, we propose the Ensemble of Dissimilar Balanced Kernel Perceptrons (EBPK). EBPK enhances the accuracy of each individual classifier by balancing the final hyperplane solution while maximizing the diversity of its components by applying a dissimilarity measure. In order to evaluate the proposed methods, we conduct an experimental evaluation on 7 datasets. We compare the performance of our proposed methods against several baselines. Our results for EBKP indicate the strategies for improving individual accuracy and diversity of the ensemble components work properly. Also, the Dual VSRM consistently outperforms the baselines, indicating that the proposed method generates a better approximation to the center of mass.
Karen Braga Enes, Saulo Moraes Villela, Gisele L. Pappa, Raul Fonseca Neto
ICMLA4
2016 Version Space Reduction Based on Ensembles of Dissimilar Balanced Perceptrons
Karen Braga Enes, Saulo Moraes Villela, Raul Fonseca Neto
IJCAI3
2016 Incremental p-margin algorithm for classification with arbitrary norm
Saulo Moraes Villela, Saul de Castro Leite, Raul Fonseca Neto
Pattern Recognit.3
2016 A dual method for solving the nonlinear structured prediction problem
Maurício Archanjo Nunes Coelho, Carlos Cristiano H. Borges, Raul Fonseca Neto
Pattern Recognit. Lett.3
2015 Feature Selection from Microarray Data via an Ordered Search with Projected Margin
Saulo Moraes Villela, Saul de Castro Leite, Raul Fonseca Neto
IJCAI3
2013 Online algorithm based on support vectors for orthogonal regression
Roberto C. S. N. P. Souza, Saul de Castro Leite, Carlos Cristiano H. Borges, Raul Fonseca Neto
Pattern Recognit. Lett.4
2012 Perceptron Models for Online Structured Prediction
Maurício Archanjo Nunes Coelho, Raul Fonseca Neto, Carlos Cristiano H. Borges
IDEAL2
2008 Incremental margin algorithm for large margin classifiers
Saul de Castro Leite, Raul Fonseca Neto
Neurocomputing2