Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/24339
Title: A Machine Learning Approach to DNA Microarray Biclustering Analysis
Authors: Kung, SY
Mak, MW 
Keywords: DNA
Biology computing
Data analysis
Data visualisation
Genetics
Learning (artificial intelligence)
Neural nets
Pattern clustering
Issue Date: 2005
Publisher: IEEE
Source: 2005 IEEE Workshop on Machine Learning for Signal Processing, 28-28 September 2005, Mystic, CT, p. 399-404 How to cite?
Abstract: Based on well-established machine learning techniques and neural networks, several biclustering algorithms can be developed for DNA microarray analysis. It has been recognized that genes (even though they may belong to the same gene group) may be co-expressed via a diversity of coherence models. One convincing argument is that a gene may participate in multiple pathways that may or may not be co-active under all conditions. It is biologically more meaningful to cluster both genes and conditions in gene expression data $leading to the so-called biclustering analysis. In addition, we have developed a set of systematic preprocessing methods to effectively comply with various coherence models. This paper will show that the proposed framework enjoys a vital advantage of ease of visualization and analysis. Because a gene may follow more than one coherence models, a multivariate biclustering analysis based on fusion of scores derived from different preprocessing methods appears to be very promising. This is evidenced by our simulation study. In summary, this paper shows that machine learning techniques offers a viable approach to identifying and classifying biologically relevant groups in genes and conditions
URI: http://hdl.handle.net/10397/24339
ISBN: 0-7803-9517-4
DOI: 10.1109/MLSP.2005.1532936
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

33
Last Week
2
Last month
Checked on Aug 21, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.