Junior Barrera

Junior Barrera

Auto-generated profile, based on publicly available information

Junior Barrera

Department of Computer Science, Institute of Mathematics and Statistics, University of São Paulo, São Paulo, Brazil

Research Focus & Metrics

Academic Career Length

33Years (1994-Present)

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

Representative Publications

View All Publications
18 July 2006 in Pattern Analysis and Applications
Verified
Journal Article
Closed access
PDF file
DMDavid C. Martins
David C. Martins
RCRoberto M. Cesar
Roberto M. Cesar
JBJunior Barrera
Junior Barrera

1 January 2000 in Fundamenta Informaticae
Verified
Journal Article
Closed access
PDF file
JBJ. Barrera
J. Barrera
RTR. Terada
R. Terada
RHRoberto Hirata
Roberto Hirata
NHNina S. T. Hirata
Nina S. T. Hirata
An important aspect of mathematical morphology is the description of complete lattice operators by a formal language, the Morphological Language (ML), whose vocabulary is composed of infimum, supremum, dilations, erosions, anti-dilations and anti-ero

24 April 2020 in Entropy
Verified
Journal Article
Open access
PDF file
GEGustavo Estrela
Gustavo Estrela
MGMARCO Gubitoso
MARCO Gubitoso
CFCarlos Ferreira
Carlos Ferreira
JBJunior Barrera
Junior Barrera
MRMarcelo S. Reis
Marcelo S. Reis
In Machine Learning, feature selection is an important step in classifier design. It consists of finding a subset of features that is optimum for a given cost function. One possibility to solve feature selection is to organize all possible feature subsets into a Boolean lattice and to exploit the fact that the costs of chains in that lattice describe U-shaped curves. Minimization of such cost function is known as the U-curve problem. Recently, a study proposed U-Curve Search (UCS), an optimal algorithm for that problem, which was successfully used for feature selection. However, despite of the algorithm optimality, the UCS required time in computational assays was exponential on the number of features. Here, we report that such scalability issue arises due to the fact that the U-curve problem is NP-hard. In the sequence, we introduce the Parallel U-Curve Search (PUCS), a new algorithm for the U-curve problem. In PUCS, we present a novel way to partition the search space into smaller Boolean lattices, thus rendering the algorithm highly parallelizable. We also provide computational assays with both synthetic data and Machine Learning datasets, where the PUCS performance was assessed against UCS and other golden standard algorithms in feature selection.

21 April 2022 in São Paulo Journal of Mathematical Sciences
Verified
Journal Article
Closed access
PDF file
JBJunior Barrera
Junior Barrera
Ronaldo HashimotoRonaldo Hashimoto
Ronaldo Hashimoto
NHNina S. T. Hirata
Nina S. T. Hirata
RHRoberto Hirata
Roberto Hirata
MRMarcelo S. Reis
Marcelo S. Reis

1 July 2004 in Computers in Biology and Medicine
Verified
Journal Article
Closed access
JBJunior Barrera
Junior Barrera
RCRoberto M Cesar
Roberto M Cesar
JFJoão E. Ferreira
João E. Ferreira
MGMARCO Gubitoso
MARCO Gubitoso