DC Field | Value | Language |
---|---|---|
dc.contributor.author | Jung, SH | ko |
dc.contributor.author | Cho, Kwang-Hyun | ko |
dc.date.accessioned | 2013-03-04T21:41:13Z | - |
dc.date.available | 2013-03-04T21:41:13Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2004 | - |
dc.identifier.citation | ARTIFICIAL INTELLIGENCE AND SIMULATION BOOK SERIES: LECTURE NOTES IN COMPUTER SCIENCE, v.3397, pp.428 - 439 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | http://hdl.handle.net/10203/84248 | - |
dc.description.abstract | This paper investigates applying a genetic algorithm and an evolutionary programming for identification of gene interaction networks from gene expression data. To this end, we employ recurrent neural networks to model gene interaction networks and make use of an artificial gene expression data set from literature to validate the proposed approach. We find that the proposed approach using the genetic algorithm and evolutionary programming can result in better parameter estimates compared with the other previous approach. We also find that any a priori knowledge such as zero relations between genes can further help the identification process whenever it is available. | - |
dc.language | English | - |
dc.publisher | SPRINGER-VERLAG BERLIN | - |
dc.title | Identification of gene interaction networks based on evolutionary computation | - |
dc.type | Article | - |
dc.identifier.wosid | 000228359600046 | - |
dc.identifier.scopusid | 2-s2.0-26844448333 | - |
dc.type.rims | ART | - |
dc.citation.volume | 3397 | - |
dc.citation.beginningpage | 428 | - |
dc.citation.endingpage | 439 | - |
dc.citation.publicationname | ARTIFICIAL INTELLIGENCE AND SIMULATION BOOK SERIES: LECTURE NOTES IN COMPUTER SCIENCE | - |
dc.contributor.localauthor | Cho, Kwang-Hyun | - |
dc.contributor.nonIdAuthor | Jung, SH | - |
dc.type.journalArticle | Article; Proceedings Paper | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.