Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/21747
Title: EEW-SC : Enhanced entropy-weighting subspace clustering for high dimensional gene expression data clustering analysis
Authors: Deng, Z
Choi, KS 
Chung, FL 
Wang, S
Keywords: ε-Insensitive robustness distance
Clustering ensemble
Entropy weighting
Gene expression clustering analysis
Subspace clustering
Issue Date: 2011
Publisher: Elsevier
Source: Applied soft computing, 2011, v. 11, no. 8, p. 4798-4806 How to cite?
Journal: Applied soft computing 
Abstract: Clustering technology has been used extensively for the analysis of gene expression data. Among various clustering methods, soft subspace clustering algorithms developed in recent years have demonstrated more promising performance than most traditional clustering algorithms and hard subspace clustering algorithms. Many soft subspace clustering algorithms have effectively utilized the within-cluster information, such as the within-cluster compactness, to develop the corresponding algorithms but few of them pay enough attention to other important information, such as the between-cluster information. Thus, it deserves further study to enhance soft subspace clustering by integrating more useful information in the clustering procedure. In this study, enhanced subspace clustering techniques are investigated for the clustering analysis of high dimensional gene expression data by integrating the within-cluster and between-cluster information simultaneously. First, a new optimization objective function is presented by integrating the fuzzy within-class compactness and the between-cluster separation in the weighting subspace. The corresponding learning rules for clustering are then derived based on the proposed objective function and a new soft subspace clustering algorithm, named as Enhanced Entropy-Weighting Subspace Clustering (EEW-SC), is proposed. The performance of the proposed algorithm on the clustering analysis of various high dimensional gene expression datasets is experimentally compared with that of several competitive subspace clustering algorithms. Our experimental studies demonstrate that the proposed algorithm can obtain better performance than most of the existing soft subspace clustering algorithms.
URI: http://hdl.handle.net/10397/21747
ISSN: 1568-4946
EISSN: 1872-9681
DOI: 10.1016/j.asoc.2011.07.002
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

17
Last Week
0
Last month
1
Citations as of Jul 28, 2017

WEB OF SCIENCETM
Citations

13
Last Week
0
Last month
0
Citations as of Aug 4, 2017

Page view(s)

40
Last Week
2
Last month
Checked on Aug 14, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.