File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Fast network component analysis for gene regulation networks

TitleFast network component analysis for gene regulation networks
Authors
Issue Date2007
Citation
Machine Learning For Signal Processing 17 - Proceedings Of The 2007 Ieee Signal Processing Society Workshop, Mlsp, 2007, p. 21-26 How to Cite?
AbstractNew advancement in microarray technologies has made it possible to reconstruct gene regulation networks from mass gene expression data measured by microarray. Typically, gene regulation networks are sparse networks. This sparse topology knowledge can be exploited to develop algorithms for network reconstruction. In this direction, a method called network component analysis (NCA) has been developed recently. A major disadvantage of the original NCA algorithm is that it is very time consuming, and it also has convergence problem as an iterative approach. In this paper we propose several fast, non-iterative NCA algorithms. They are basically based on matrix computation. The algorithms demonstrate good performance when applied to a hypothetical and a real gene regulation network. © 2007 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/99657
References

 

DC FieldValueLanguage
dc.contributor.authorChang, Cen_HK
dc.contributor.authorDing, Zen_HK
dc.contributor.authorHung, YSen_HK
dc.contributor.authorFung, PCWen_HK
dc.date.accessioned2010-09-25T18:39:09Z-
dc.date.available2010-09-25T18:39:09Z-
dc.date.issued2007en_HK
dc.identifier.citationMachine Learning For Signal Processing 17 - Proceedings Of The 2007 Ieee Signal Processing Society Workshop, Mlsp, 2007, p. 21-26en_HK
dc.identifier.urihttp://hdl.handle.net/10722/99657-
dc.description.abstractNew advancement in microarray technologies has made it possible to reconstruct gene regulation networks from mass gene expression data measured by microarray. Typically, gene regulation networks are sparse networks. This sparse topology knowledge can be exploited to develop algorithms for network reconstruction. In this direction, a method called network component analysis (NCA) has been developed recently. A major disadvantage of the original NCA algorithm is that it is very time consuming, and it also has convergence problem as an iterative approach. In this paper we propose several fast, non-iterative NCA algorithms. They are basically based on matrix computation. The algorithms demonstrate good performance when applied to a hypothetical and a real gene regulation network. © 2007 IEEE.en_HK
dc.languageengen_HK
dc.relation.ispartofMachine Learning for Signal Processing 17 - Proceedings of the 2007 IEEE Signal Processing Society Workshop, MLSPen_HK
dc.titleFast network component analysis for gene regulation networksen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailChang, C: cqchang@eee.hku.hken_HK
dc.identifier.emailHung, YS: yshung@hkucc.hku.hken_HK
dc.identifier.authorityChang, C=rp00095en_HK
dc.identifier.authorityHung, YS=rp00220en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/MLSP.2007.4414276en_HK
dc.identifier.scopuseid_2-s2.0-48149092313en_HK
dc.identifier.hkuros131511en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-48149092313&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage21en_HK
dc.identifier.epage26en_HK
dc.identifier.scopusauthoridChang, C=7407033052en_HK
dc.identifier.scopusauthoridDing, Z=7401550510en_HK
dc.identifier.scopusauthoridHung, YS=8091656200en_HK
dc.identifier.scopusauthoridFung, PCW=7101613315en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats