DocumentCode
120029
Title
Construction of Probabilistic Boolean Network for Credit Default Data
Author
Ruochen Liang ; Yushan Qiu ; Wai Ki Ching
Author_Institution
Dept. of Math., Univ. of Hong Kong, Hong Kong, China
fYear
2014
fDate
4-6 July 2014
Firstpage
11
Lastpage
15
Abstract
In this article, we consider the problem of construction of Probabilistic Boolean Networks (PBNs). Previous works have shown that Boolean Networks (BNs) and PBNs have many potential applications in modeling genetic regulatory networks and credit default data. A PBN can be considered as a Markov chain process and the construction of a PBN is an inverse problem. Given the transition probability matrix of the PBN, we try to find a set of BNs with probabilities constituting the given PBN. We propose a revised estimation method based on entropy approach to estimate the model parameters. Practical real credit default data are employed to demonstrate our proposed method.
Keywords
Boolean algebra; Markov processes; entropy; estimation theory; genetics; inverse problems; matrix algebra; network theory (graphs); parameter estimation; probability; Markov chain process; PBN; credit default data; entropy approach; genetic regulatory networks; inverse problem; model parameter estimation; probabilistic Boolean networks; revised estimation method; transition probability matrix; Boolean functions; Entropy; Heuristic algorithms; Inverse problems; Markov processes; Mathematical model; Probabilistic logic; Boolean Networks; Inverse Problem; Probabilistic Boolean Networks; Transition Probability Matrix;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Sciences and Optimization (CSO), 2014 Seventh International Joint Conference on
Conference_Location
Beijing
Print_ISBN
978-1-4799-5371-4
Type
conf
DOI
10.1109/CSO.2014.11
Filename
6923626
Link To Document