Towards optimal neuronal wiring through estimation of distribution algorithms

Authors:
Laura Anton-Sanchez;Concha Bielza;Pedro Larrañaga
Affiliations:
Technical University of Madrid, Boadilla del Monte, Madrid, Spain;Technical University of Madrid, Boadilla del Monte, Madrid, Spain;Technical University of Madrid, Boadilla del Monte, Madrid, Spain
Venue:
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Year:
2013

Citing 5
Cited 0

A numbering system for binary trees

Communications of the ACM
Computers and Intractability; A Guide to the Theory of NP-Completeness

Computers and Intractability; A Guide to the Theory of NP-Completeness
Comparison of Algorithms for the Degree Constrained Minimum Spanning Tree

Journal of Heuristics
Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators

Artificial Intelligence Review
An ant-based algorithm for finding degree-constrained minimum spanning tree

Proceedings of the 8th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of the greatest challenges of our time is to understand brain functions. Our goal is to study the existence of an optimal neuronal design, defined as the one that has a minimum total wiring. Many researchers have studied the problem of optimal wiring in neuronal trees. Here we propose a new approach. We start from point clouds formed by the branching points of real neuronal trees and we search for the optimal forest from these point clouds. To do this, we formalize the problem as a forest of degree constrained minimum spanning trees (DCMST). Since the DCMST problem is NP-hard, we will try to solve it using estimation of distribution algorithms, particularly in permutation domains.