The Community for Technology Leaders
Green Image
Issue No. 12 - Dec. (2012 vol. 24)
ISSN: 1041-4347
pp: 2218-2231
Yuliang Li , Hong Kong University of Science and Technology, Hong Kong
Wilfred Ng , Hong Kong University of Science and Technology, Hong Kong
Jianlin Feng , Sun Yat-Sen University, Guangzhou
Qiong Fang , Hong Kong University of Science and Technology, Hong Kong
The Order-Preserving SubMatrices (OPSMs) are employed to discover significant biological associations between genes and experiment conditions. Herein, we propose a new relaxed OPSM model by considering the linearity relaxation, which is called the Bucket OPSM (BOPSM) model. An efficient method called ApriBopsm is developed to exhaustively mine such BOPSM patterns. We further generalize the BOPSM model by incorporating the similarity relaxation strategy. We develop a generalized BOPSM model called GeBOPSM and adopt a pattern growing method called SeedGrowth to mine GeBOPSM patterns. Informally, the SeedGrowth algorithm adopts two different growing strategies on rows and columns in order to expand a seed BOPSM into a maximal GeBOPSM pattern. We conduct a series of experiments using both synthetic and biological datasets to study the effectiveness of our proposed relaxed models and the efficiency of the relevant mining methods. The BOPSM model is shown to be able to capture the characteristics of noisy OPSM patterns, and is superior to the strict counterparts. ApriBopsm is also significantly more efficient than OPC-Tree, which is the state-of-the-art OPSM mining method. Compared to all the current relaxed OPSM models, the GeBOPSM model achieves the best performance in terms of the number of mined quality patterns.
Biological system modeling, Gene expression, Data mining, Linearity, Data models, Itemsets, OPSM, Order-preserving submatrix, biclustering, bucket order, linearity relaxation, similarity relaxation
Yuliang Li, Wilfred Ng, Jianlin Feng, Qiong Fang, "Mining Bucket Order-Preserving SubMatrices in Gene Expression Data", IEEE Transactions on Knowledge & Data Engineering, vol. 24, no. , pp. 2218-2231, Dec. 2012, doi:10.1109/TKDE.2011.180
87 ms
(Ver 3.3 (11022016))