Rosalvo Ferreira Oliveira Neto

Rosalvo Ferreira Oliveira Neto

Auto-generated profile, based on publicly available information

Rosalvo Ferreira Oliveira Neto

UNIVASF

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

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

Representative Publications

View All Publications
1 April 2017 in Expert Systems with Applications
Verified
Journal Article
Closed access
RNRosalvo Neto
Rosalvo Neto
PAPaulo Jorge Adeodato
Paulo Jorge Adeodato
ASAna Carolina Salgado
Ana Carolina Salgado

1 April 2008 in International Journal of Data Warehousing and Mining
Verified
Journal Article
Closed access
PDF file
PAPaulo J.L. Adeodato
Paulo J.L. Adeodato
GVGermano C. Vasconcelos
Germano C. Vasconcelos
AAAdrian L. Arnaud
Adrian L. Arnaud
RCRodrigo C.L.V. Cunha
Rodrigo C.L.V. Cunha
DMDomingos S.M.P. Monteiro
Domingos S.M.P. Monteiro
RNRosalvo F.O. Neto
Rosalvo F.O. Neto
This article presents an efficient solution for the PAKDD-2007 Competition cross-selling problem. The solution is based on a thorough approach which involves the creation of new input variables, efficient data preparation and transformation, adequate data sampling strategy and a combination of two of the most robust modeling techniques. Due to the complexity imposed by the very small amount of examples in the target class, the approach for model robustness was to produce the median score of the 11 models developed with an adapted version of the 11-fold cross-validation process and the use of a combination of two robust techniques via stacking, the MLP neural network and the n-tuple classifier. Despite the problem complexity, the performance on the prediction data set (unlabeled samples), measured through KS2 and ROC curves was shown to be very effective and finished as the first runner-up solution of the competition.

18 September 2025 in Archives of Insect Biochemistry and Physiology
Verified
Journal Article
Open access
EFEdilson Alencar Filho
Edilson Alencar Filho
RGR.P. Guimarães
R.P. Guimarães
VSV.C. Santos
V.C. Santos
ABA.B.P. Bispo
A.B.P. Bispo
BPB.A.G. Paranhos
B.A.G. Paranhos
RNR.F. Oliveira Neto
R.F. Oliveira Neto
The Mediterranean fruit fly Ceratitis capitata (Wiedemann) (Diptera: Tephritidae) is one of the most critical agricultural pests, causing economic damage globally due to its wide range of fruit hosts. Conventional insecticides have brought environmental, human health, and resistance challenges, driving interest in semiochemicals as sustainable pest management alternatives. Potential molecular attractants can be assessed experimentally through methods such as electroantennography (EAG) or behavioral assays. Odorant Binding Proteins (OBPs) have been recognized as crucial mediators in detecting these chemical signals. Although isolated compounds can provide mechanistic insights, volatile blends more accurately reflect natural conditions and typically elicit stronger behavioral responses. However, designing effective blends is challenging due to their complexity and regulatory limitations. Therefore, curated molecular databases of potential attractants become essential to accelerate the discovery and reduce cost in research programs, both in vitro and in vivo tests. The in silico molecular approaches, including Molecular Docking, Molecular Dynamics (MD) and Quantitative Structure–Activity Relationships (QSAR), offer cost‐effective methods to prioritize candidates and/or understand ligand‐OBP interactions. In this study, computational methodologies including Machine Learning (ML) based QSAR, molecular docking and MD simulations were integrated to highlight molecular features of standard molecules and identify potential attractors for C. capitata, which are expected to be good OBP binders. Initially, was applied a Bee Colony Algorithm, combined with an final XGBoost Machine Learning model, enabled the identification of five essential molecular descriptors to explain the attractant effect of 20 standard compounds recognized in the literature. Applying this model to an online database of natural products from Brazil (NuBBE—Nuclei of Bioassays, Ecophysiology and Biosynthesis of Natural Products Database), 206 molecules were identified from over 2000 candidates. In a parallel front of investigation, docking‐based virtual screening was performed using the same NuBBE database. Most promissory compounds were discussed based on binding energy, structure/geometry focusing on interactions and estimated volatility, through the evaluation of vapor pressure. MD simulations with the gold standard compound (E,E)‐α‐farnesene provided insights into ligand‐protein interactions. Interestingly, 16 of the top 20 ranked compounds after dockings were predicted as attractors by the XGBoost model. Finally, the curated database of 206 compounds, the great contribution of this paper (beyond the model), can be used to assertively select molecules for experimental tests of future blends or isolated compounds.

1 November 2017
Verified
Conference Paper
Closed access
JRJardel Ribeiro
Jardel Ribeiro
JHJonas Henrique
Jonas Henrique
RRRodrigo Ribeiro
Rodrigo Ribeiro
RNRosalvo Neto
Rosalvo Neto
This study intends to help data mining developers to get better performance when obtaining the most frequent N-grams in Text Mining projects. The process of building new variables is one of the oldest and still challenging problems in Data Mining projects. The most frequent N-grams are commonly used as input variables in Text Mining projects. The N-grams represent the occurrence of N items in sequence in a given text. The items can be letters or words. This paper presents a performance comparison between the two main approaches of data storage, relational and NoSQL databases in the task of obtaining the most frequent N-grams. Validation of the study was executed using a database from a known benchmark from an international competition organized by PAN@CLEF 2013. The one-tailed paired t-test showed that NoSQL approach is statistically superior to the relational approach with a confidence level of 95%.

29 December 2018 in Cadernos de Educação Tecnologia e Sociedade
Verified
Journal Article
Open access
PDF file
LBLucas Florêncio de Brito
Lucas Florêncio de Brito
RRRicardo Argenton Ramos
Ricardo Argenton Ramos
RNRosalvo Ferreira de Oliveira Neto
Rosalvo Ferreira de Oliveira Neto
BLBrauliro Gonçalves Leal
Brauliro Gonçalves Leal
One of the causes of bad software planning is the lack of qualified professionals and that in order to improve their quality it is necessary to improve the quality of teaching in the Software Engineering area. Educational games present themselves as a promising alternative as a method of teaching support, since they are able to teach while they entertain, motivating the student to learn, however, there is still a need to evaluate the real benefits of this didactic resource. Thus, this work evaluated qualitatively and quantitatively the game SimulES (Software Engineering Simulator), an educational cards game that simulates the software process development. Applying it to Computer Engineering students at UNIVASF in the Software Engineering II discipline, with the purpose of inferring its effectiveness in teaching software project management. The application of the game was done with 22 students in the semester of 2017.1 and to measure the quality of learning obtained through the game was applied a questionnaire that uses Kirkpatrick reaction concepts, ARCS Model, User Experience in Games and BLOOM Taxonomy. The result of the analysis by t Student test showed that the game's activities are fun, enjoyable and challenging, as well as being able to motivate students to learn software project management and contribute to learning that content.

1 July 2010
Verified
Conference Paper
Closed access
PAPaulo J. L. Adeodato
Paulo J. L. Adeodato
RNRosalvo F. Oliveira Neto
Rosalvo F. Oliveira Neto
RAM-based neural networks have been in the market long before the MultiLayer Perceptrons but their developments have been concentrated in a few periods and research groups. Recently, one of the winners of the PAKDD 2007 Competition used a variation of one of such architectures in their data mining solution. Now, that approach for binary decision problems has been refined and is presented in this paper as the pRAM n-tuple Classifier. It consists of a single layer neural network inspired by the n-tuple classifier but with advantages in several aspects: (1) it does not need special binary encoding for continuous variables, (2) it generalizes smoothly, and (3) its performance improves with the increase in the amount of training examples without saturating. Experimental comparison carried out on the Proben1 benchmark problems against MultiLayer Perceptrons shows that there is no statistically significant difference between them. The pRAM n-tuple Classifier also has the advantage of using all modeling data for training once that it does not require a validation set, which is particularly important for problems with small data sets.