Guided evolutionary search for boolean networks in the density classification problem

Página do item simplificado
dc.contributor.authorde Mattos T.
dc.contributor.authorde Oliveira P.P.B.
dc.date.accessioned2024-03-12T23:55:51Z
dc.date.available2024-03-12T23:55:51Z
dc.date.issued2019
dc.description.abstract© Springer International Publishing AG, part of Springer Nature 2019.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 fixed points, a behavior found in the context of the density classification 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. Here, we rely on evolutionary searches in order to find rules and network topologies with good performance in the task. All nodes’ neighborhoods are assumed to be defined by non-regular and bidirectional links, and the Boolean function of the network initialized by the local majority rule. Two evolutionary searches are carried out: first, in the space of network topologies, guided by a parameter (ω ) 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. The results clearly make it evident the key and successful role of the ω parameter in looking for solutions to the task at issue.
dc.description.firstpage69
dc.description.lastpage77
dc.description.volume800
dc.identifier.doi10.1007/978-3-319-94649-8_9
dc.identifier.issn2194-5357
dc.identifier.urihttps://dspace.mackenzie.br/handle/10899/35416
dc.relation.ispartofAdvances in Intelligent Systems and Computing
dc.rightsAcesso Restrito
dc.subject.otherlanguageBoolean networks
dc.subject.otherlanguageCellular automata
dc.subject.otherlanguageDensity classification
dc.subject.otherlanguageEvolutionary computation
dc.titleGuided evolutionary search for boolean networks in the density classification problem
dc.typeArtigo de evento
local.scopus.citations2
local.scopus.eid2-s2.0-85050006952
local.scopus.subjectBi-directional links
local.scopus.subjectBoolean Networks
local.scopus.subjectDensity classification problems
local.scopus.subjectDensity classifications
local.scopus.subjectEvolutionary search
local.scopus.subjectGlobal behaviors
local.scopus.subjectGlobal configuration
local.scopus.subjectLocal majority rules
local.scopus.updated2024-05-01
local.scopus.urlhttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85050006952&origin=inward
Arquivos
Coleções
Artigo de evento