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

Frank Emmert-Streib; Matthias Dehmer

doi:10.1007/978-3-642-02466-5_69

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

Frank Emmert-Streib^*
, Matthias Dehmer

^*Corresponding author for this work

Queen's University Belfast
UMIT-The Health and Life Sciences University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

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.

Original language	English
Title of host publication	Complex Sciences - First International Conference, Complex 2009, Revised Papers
Pages	715-723
Number of pages	9
Edition	PART 1
DOIs	https://doi.org/10.1007/978-3-642-02466-5_69
Publication status	Published - 2009
Externally published	Yes
Event	1st International Conference on Complex Sciences: Theory and Applications, Complex 2009 - Shanghai, China Duration: 23 Feb 2009 → 25 Feb 2009

Publication series

Name	Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering
Number	PART 1
Volume	4 LNICST
ISSN (Print)	1867-8211

Conference

Conference	1st International Conference on Complex Sciences: Theory and Applications, Complex 2009
Country/Territory	China
City	Shanghai
Period	23/02/09 → 25/02/09

Keywords

Boolean networks
Bootstrap aggregation
Causality
Mutual Information

Access to Document

10.1007/978-3-642-02466-5_69

Cite this

Emmert-Streib, F., & Dehmer, M. (2009). Towards a partitioning of the input space of Boolean networks: Variable selection using bagging. In Complex Sciences - First International Conference, Complex 2009, Revised Papers (PART 1 ed., pp. 715-723). (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering; Vol. 4 LNICST, No. PART 1). https://doi.org/10.1007/978-3-642-02466-5_69

Emmert-Streib, Frank ; Dehmer, Matthias. / Towards a partitioning of the input space of Boolean networks : Variable selection using bagging. Complex Sciences - First International Conference, Complex 2009, Revised Papers. PART 1. ed. 2009. pp. 715-723 (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering; PART 1).

@inproceedings{2d9cd19caddf4faebe068d726a760aa1,

title = "Towards a partitioning of the input space of Boolean networks: Variable selection using bagging",

abstract = "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.",

keywords = "Boolean networks, Bootstrap aggregation, Causality, Mutual Information",

author = "Frank Emmert-Streib and Matthias Dehmer",

year = "2009",

doi = "10.1007/978-3-642-02466-5\_69",

language = "English",

isbn = "3642024653",

series = "Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering",

number = "PART 1",

pages = "715--723",

booktitle = "Complex Sciences - First International Conference, Complex 2009, Revised Papers",

edition = "PART 1",

note = "1st International Conference on Complex Sciences: Theory and Applications, Complex 2009 ; Conference date: 23-02-2009 Through 25-02-2009",

}

Emmert-Streib, F & Dehmer, M 2009, Towards a partitioning of the input space of Boolean networks: Variable selection using bagging. in Complex Sciences - First International Conference, Complex 2009, Revised Papers. PART 1 edn, Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, no. PART 1, vol. 4 LNICST, pp. 715-723, 1st International Conference on Complex Sciences: Theory and Applications, Complex 2009, Shanghai, China, 23/02/09. https://doi.org/10.1007/978-3-642-02466-5_69

Towards a partitioning of the input space of Boolean networks: Variable selection using bagging. / Emmert-Streib, Frank; Dehmer, Matthias.
Complex Sciences - First International Conference, Complex 2009, Revised Papers. PART 1. ed. 2009. p. 715-723 (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering; Vol. 4 LNICST, No. PART 1).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Towards a partitioning of the input space of Boolean networks

T2 - 1st International Conference on Complex Sciences: Theory and Applications, Complex 2009

AU - Emmert-Streib, Frank

AU - Dehmer, Matthias

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

KW - Boolean networks

KW - Bootstrap aggregation

KW - Causality

KW - Mutual Information

UR - https://www.scopus.com/pages/publications/84885887482

U2 - 10.1007/978-3-642-02466-5_69

DO - 10.1007/978-3-642-02466-5_69

M3 - Conference contribution

AN - SCOPUS:84885887482

SN - 3642024653

SN - 9783642024658

T3 - Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering

SP - 715

EP - 723

BT - Complex Sciences - First International Conference, Complex 2009, Revised Papers

Y2 - 23 February 2009 through 25 February 2009

ER -

Emmert-Streib F, Dehmer M. Towards a partitioning of the input space of Boolean networks: Variable selection using bagging. In Complex Sciences - First International Conference, Complex 2009, Revised Papers. PART 1 ed. 2009. p. 715-723. (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering; PART 1). doi: 10.1007/978-3-642-02466-5_69

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

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this