Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Diego P. P. Mesquita"'
Publikováno v:
Pattern Analysis and Applications. 23:1293-1303
Incomplete data are often neglected when designing machine learning methods. A popular strategy adopted by practitioners to circumvent this consists of taking a preprocessing step to fill the missing components. These preprocessing algorithms are des
Publikováno v:
Neural Processing Letters. 50:2345-2372
In this paper, we propose a method to design Neural Networks with Random Weights in the presence of incomplete data. We present a method, under the general assumption that the data is missing-at-random, to estimate the weights of the output layer as
Autor:
Amauri H. Souza Júnior, Diego P. P. Mesquita, João P. P. Gomes, Francesco Corona, Juvêncio S. Nobre
Publikováno v:
APPLIED SOFT COMPUTING. 77:356-365
This paper discusses a method to estimate the expected value of the Gaussian kernel in the presence of incomplete data. We show how, under the general assumption of a missing-at-random mechanism, the expected value of the Gaussian kernel function has
Autor:
Gabriel Jonas Duarte, Diego P. P. Mesquita, Erik Jhones Freitas do Nascimento, Amauri H. Souza Júnior, Tamara Arruda Pereira
Publikováno v:
Anais do 15. Congresso Brasileiro de Inteligência Computacional.
Graph neural networks (GNNs) have become the de facto approach for supervised learning on graph data.To train these networks, most practitioners employ the categorical cross-entropy (CE) loss. We can attribute this largely to the probabilistic interp
Publikováno v:
ESANN 2021 proceedings.
Autor:
Leonardo Ramos Rodrigues, Roberto Kawakami Harrop Galvão, João P. P. Gomes, Diego P. P. Mesquita, Saulo A. F. Oliveira
Publikováno v:
Applied Soft Computing. 70:1135-1145
Randomization based methods for training neural networks have gained increasing attention in recent years and achieved remarkable performances on a wide variety of tasks. The interest in such methods relies on the fact that standard gradient based le
Publikováno v:
New Generation Computing. 36:41-58
Co-training is a framework for semi-supervised learning that has attracted much attention due to its good performance and easy adaptation for various learning algorithms. In a recent work, Caldas et al. proposed a co-training-based method using the r
Publikováno v:
Neurocomputing. 248:11-18
This paper proposes a method to estimate the expected value of the Euclidean distance between two possibly incomplete feature vectors. Under the Missing at Random assumption, we show that the Euclidean distance can be modeled by a Nakagami distributi
Publikováno v:
Neural Processing Letters. 46:751-766
Minimal Learning Machine (MLM) is a recently proposed supervised learning algorithm with performance comparable to most state-of-the-art machine learning methods. In this work, we propose ensemble methods for classification and regression using MLMs.
Publikováno v:
Applied Soft Computing. 49:1085-1093
Graphical abstractDisplay Omitted HighlightsWe propose the use of classification with reject option for software defect prediction (SDP) as a way to incorporate additional knowledge in the SDP process.We propose two variants of the extreme learning m