DC Field | Value | Language |
---|---|---|
dc.contributor.author | Carla S. Moller-Levet | ko |
dc.contributor.author | Cho, Kwang-Hyun | ko |
dc.contributor.author | Hujun Yin | ko |
dc.contributor.author | OIaf Wolkenhauer | ko |
dc.date.accessioned | 2013-03-04T23:02:34Z | - |
dc.date.available | 2013-03-04T23:02:34Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2004-07 | - |
dc.identifier.citation | IEEE INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN04), v.2, pp.1191 - 1195 | - |
dc.identifier.issn | 1098-7576 | - |
dc.identifier.uri | http://hdl.handle.net/10203/84440 | - |
dc.description.abstract | Gene expression time-series are discrete, noisy, short and usually unevenly sample& Most existing methods used to "npare.expression -profiles operate directly on the time points. While.modelling the profiles can lead to more generalised, smooth characterisation of gene expressions. In this paper.a Radial Basis Function neural network is employed to model .gene expression time-series. The .Orthogonal Least Square method, used for selection of centres, is further combined with a width optimisation scheme. The experiments on a number of expression dalasets have shown the advantages of the approach in terms of generalisation and approximation. The results on ,known datasets have indeed.coincided with biological interpretations. | - |
dc.language | English | - |
dc.publisher | IEEE | - |
dc.title | Modeling gene expression time-series with radial basis function neural networks | - |
dc.type | Article | - |
dc.type.rims | ART | - |
dc.citation.volume | 2 | - |
dc.citation.beginningpage | 1191 | - |
dc.citation.endingpage | 1195 | - |
dc.citation.publicationname | IEEE INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN04) | - |
dc.contributor.localauthor | Cho, Kwang-Hyun | - |
dc.contributor.nonIdAuthor | Carla S. Moller-Levet | - |
dc.contributor.nonIdAuthor | Hujun Yin | - |
dc.contributor.nonIdAuthor | OIaf Wolkenhauer | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.