Bicluster analysis of genome-wide gene expression
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
231 | en_US |
dc.citation.spage |
225 | en_US |
dc.contributor.author |
Chen, Kuanchung | en_US |
dc.contributor.author |
Hu, Yuh-Jyh | en_US |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
Department of Computer Science | en_US |
dc.date.accessioned |
2014-12-08T15:24:42Z | |
dc.date.available |
2014-12-08T15:24:42Z | |
dc.date.issued |
2006 | en_US |
dc.description.abstract |
A number of biclustering approaches have been developed to mitigate the limitations of standard clustering algorithms. They have different problem formulation, search strategy and computational complexity. We proposed a new biclustering method based on the framework of market basket analysis in which a bicluster is described as a frequent itemset. As a feasibility test, we compared it with several standard clustering algorithms on a genome-wide yeast microarray dataset, and it showed very promising results. We later did a comparison between our approach and various current biclustering methods, following a systematic evaluation procedure recently published. The experimental results demonstrate that our new method outperforms the others. | en_US |
dc.identifier.isbn |
1-4244-0623-4 | en_US |
dc.identifier.journal |
Proceedings of the 2006 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/17154 | |
dc.identifier.wosnumber |
WOS:000245066100031 | |
dc.language.iso |
en_US | en_US |
dc.subject |
clustering | en_US |
dc.subject |
biclustering | en_US |
dc.subject |
expression | en_US |
dc.subject |
microarray | en_US |
dc.title |
Bicluster analysis of genome-wide gene expression | en_US |
dc.type |
Proceedings Paper | en_US |
檔案
本條目沒有附加檔案。
所屬典藏: 會議論文