Combinatorial optimization in Biology using Probability Collectives Multi-agent Systems

Authored by Chien-Feng Huang

Date Published: 2012-02-01

DOI: 10.1016/j.eswa.2011.08.078

Sponsors: National Science Council of Taiwan

Platforms: No platforms listed

Model Documentation: Pseudocode Other Narrative Flow charts Mathematical description

Model Code URLs: Model code not found

Abstract

We present a study of Probability Collectives Multi-agent Systems (PCMAS) for combinational optimization problems in Biology. This framework for distributed optimization is deeply connected with both game theory and statistical physics. In contrast to traditional biologically-inspired algorithms, Probability-Collectives (PC) based methods do not update populations of solutions; instead, they update an explicitly parameterized probability distribution p over the space of solutions by a collective of agents. That updating of p arises as the optimization of a functional of p. The functional is chosen so that any p that optimizes it should be p peaked about good solutions. In this paper we demonstrate PCMAS as a promising combinational optimization method for biological network construction. This computational approach to response networks enables robust prediction of activated crucial sub-networks in biological systems under the presence of specific drugs, thereby facilitating the identification of important nodes for potential drug targets and furthering hypotheses about biological and medical problems on a systems level. The application of PCMAS in this context therefore sheds light on how this multi-agent learning methodology advances the current state of research in agent-based models for combinational optimization problems in Biology. (C) 2011 Elsevier Ltd. All rights reserved.

Tags

Multi-agent systems Mycobacterium tuberculosis Biological networks Combinational optimization Probability Collectives