Busca evolutiva por redes booleanas na tarefa de classificação de densidade
Arquivos
Tipo
Dissertação
Data de publicação
2018-05-02
Periódico
Citações (Scopus)
Autores
Mattos, Thiago de
Orientador
Oliveira, Pedro Paulo Balbi de
Título da Revista
ISSN da Revista
Título de Volume
Membros da banca
Ruivo , Eurico Luiz Prospero
Heredia Ruz, Gonzalo Andrés
Heredia Ruz, Gonzalo Andrés
Programa
Engenharia Elétrica
Resumo
Boolean networks consist of nodes that represent binary variables, which are computed as a function of the values represented by their adjacent nodes. This local processing entails global behaviors, such as the convergence to _xed points, a behavior found in the context of the density classi_cation problem, where the aim is the network's convergence to a fixed point of the prevailing node value in the initial global configuration of the network; in other words, a global decision is targeted, but according to a constrained,
non-global action. In this work, we rely on evolutionary searches in order to _nd rules
and network topologies with good performance in the task. All nodes' neighborhoods are
assumed to be de_ned by non-regular and bidirectional links, and the Boolean function
of the network initialized by the local majority rule. Firstly, is carried out a search in the
space of network topologies, guided by the ω metric, related to the "small-worldness" of
the networks, and then, in the space of Boolean functions, but constraining the network
topologies to the best family identified in the previous experiment..
Descrição
Palavras-chave
redes booleanas , autômatos celulares , classificação de densidade , computação evolutiva
Assuntos Scopus
Citação
MATTOS, Thiago de. Busca evolutiva por redes booleanas na tarefa de classificação de densidade. 2018. 95 f. Dissertação( Engenharia Elétrica) - Universidade Presbiteriana Mackenzie, São Paulo.