Navegando por Autor "Silva, Gustavo Rodrigues Lacerda"
Agora exibindo 1 - 2 de 2
Resultados por página
Opções de Ordenação
Item An advanced pruning method in the architecture of extreme learning machines using L1-regularization and bootstrapping.(2020) Souza, Paulo Vitor de Campos; Torres, Luiz Carlos Bambirra; Silva, Gustavo Rodrigues Lacerda; Braga, Antônio de Pádua; Lughofer, EdwinExtreme learning machines (ELMs) are efficient for classification, regression, and time series prediction, as well as being a clear solution to backpropagation structures to determine values in intermediate layers of the learning model. One of the problems that an ELM may face is due to a large number of neurons in the hidden layer, making the expert model a specific data set. With a large number of neurons in the hidden layer, overfitting is more likely and thus unnecessary information can deterioriate the performance of the neural network. To solve this problem, a pruning method is proposed, called Pruning ELM Using Bootstrapped Lasso BR-ELM, which is based on regularization and resampling techniques, to select the most representative neurons for the model response. This method is based on an ensembled variant of Lasso (achieved through bootstrap replications) and aims to shrink the output weight parameters of the neurons to 0 as many and as much as possible. According to a subset of candidate regressors having significant coefficient values (greater than 0), it is possible to select the best neurons in the hidden layer of the ELM. Finally, pattern classification tests and benchmark regression tests of complex real-world problems are performed by comparing the proposed approach to other pruning models for ELMs. It can be seen that statistically BR-ELM can outperform several related state-of-the-art methods in terms of classification accuracies and model errors (while performing equally to Pruning-ELM P-ELM), and this with a significantly reduced number of finally selected neurons.Item A fuzzy data reduction cluster method based on boundary information for large datasets.(2019) Silva, Gustavo Rodrigues Lacerda; Cirino Neto, Paulo; Torres, Luiz Carlos Bambirra; Braga, Antônio de PáduaThe fuzzy c-means algorithm (FCM) is aimed at computing the membership degree of each data point to its corresponding cluster center. This computation needs to calculate the distance matrix between the cluster center and the data point. The main bottleneck of the FCM algorithm is the computing of the membership matrix for all data points. This work presents a new clustering method, the bdrFCM (boundary data reduction fuzzy c-means). Our algorithm is based on the original FCM proposal, adapted to detect and remove the boundary regions of clusters. Our implementation efforts are directed in two aspects: processing large datasets in less time and reducing the data volume, maintaining the quality of the clusters. A significant volume of real data application ([106 records) was used, and we identified that bdrFCM implementation has good scalability to handle datasets with millions of data points.