The full text of this article
On mining micro-array data by Order-Preserving Submatrix
by Lin Cheung, David W. Cheung, Ben Kao, Kevin Y. Yip, Michael K. Ng
International Journal of Bioinformatics Research and Applications (IJBRA), Vol. 3, No. 1, 2007
Abstract: We study the problem of pattern-based subspace clustering which is clustering by pattern similarity finds objects that exhibit a coherent pattern of rises and falls in subspaces. Applications of pattern-based subspace clustering include DNA micro-array data analysis. Our goal is to devise pattern-based clustering methods that are capable of: discovering useful patterns of various shapes, and discovering all significant patterns. Our approach is to extend the idea of Order-Preserving Submatrix (OPSM). We devise a novel algorithm for mining OPSM, show that OPSM can be generalised to cover most existing pattern-based clustering models and propose a number of extensions to the original OPSM model.
Online publication date: Tue, 26-Dec-2006
is only available to individual subscribers or to users at subscribing institutions.
Go to Inderscience Online Journals to access the Full Text of this article.
Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.
Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Bioinformatics Research and Applications (IJBRA):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable).
See our Orders page to subscribe.
If you still need assistance, please email email@example.com