Computer Science ›› 2007, Vol. 34 ›› Issue (11): 174-177.

Previous Articles     Next Articles

HU Yun, MIAO Duo-Qian, WANG Rui-Zhi, CHEN Min (Department of Computer Science and Engineering of Tongii University, Shanghai 201804)   

  • Online:2018-11-16 Published:2018-11-16

Abstract: Biclustering is a new branch of clustering which is proposed to discover the local homogenous pattern. Based on the score scheme which is proposed by Cheng and Church, this paper uses bottom-up strategy, firstly finds the gene data submatrix using Rough K

Key words: Rough set, K-means clustering, Biclustering, Gene expression data

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!