Towards a partitioning of the input space of Boolean networks: Variable selection using bagging

Frank Emmert-Streib, Matthias Dehmer

Tutkimustuotos: KonferenssiartikkeliScientificvertaisarvioitu

Abstrakti

In this paper we present an algorithm that allows to select the input variables of Boolean networks from incomplete data. More precisely, sets of input variables, instead of single variables, are evaluated using mutual information to find the combination that maximizes the mutual information of input and output variables. To account for the incompleteness of the data bootstrap aggregation is used to find a stable solution that is numerically demonstrated to be superior in many cases to the solution found by using the complete data set all at once.

AlkuperäiskieliEnglanti
OtsikkoLecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering
Sivut715-723
Sivumäärä9
Vuosikerta4 LNICST
PainosPART 1
DOI - pysyväislinkit
TilaJulkaistu - 2009
Julkaistu ulkoisestiKyllä
OKM-julkaisutyyppiA4 Artikkeli konferenssijulkaisussa
Tapahtuma1st International Conference on Complex Sciences: Theory and Applications, Complex 2009 - Shanghai, Kiina
Kesto: 23 helmik. 200925 helmik. 2009

Julkaisusarja

NimiLecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering
NumeroPART 1
Vuosikerta4 LNICST
ISSN (painettu)18678211

Conference

Conference1st International Conference on Complex Sciences: Theory and Applications, Complex 2009
Maa/AlueKiina
KaupunkiShanghai
Ajanjakso23/02/0925/02/09

!!ASJC Scopus subject areas

  • Computer Networks and Communications

Sormenjälki

Sukella tutkimusaiheisiin 'Towards a partitioning of the input space of Boolean networks: Variable selection using bagging'. Ne muodostavat yhdessä ainutlaatuisen sormenjäljen.

Siteeraa tätä