A Survey on Soft Subspace Clustering

Subspace clustering (SC) is a promising clustering technology to identify clusters based on their associations with subspaces in high dimensional spaces. SC can be classified into hard subspace clustering (HSC) and soft subspace clustering (SSC). While HSC algorithms have been extensively studied and well accepted by the scientific community, SSC algorithms are relatively new but gaining more attention in recent years due to better adaptability. In the paper, a comprehensive survey on existing SSC algorithms and the recent development are presented. The SSC algorithms are classified systematically into three main categories, namely, conventional SSC (CSSC), independent SSC (ISSC) and extended SSC (XSSC). The characteristics of these algorithms are highlighted and the potential future development of SSC is also discussed.Comment: This paper has been published in Information Sciences Journal in 201

Unsupervised Algorithms for Microarray Sample Stratification

The amount of data made available by microarrays gives researchers the opportunity to delve into the complexity of biological systems. However, the noisy and extremely high-dimensional nature of this kind of data poses significant challenges. Microarrays allow for the parallel measurement of thousands of molecular objects spanning different layers of interactions. In order to be able to discover hidden patterns, the most disparate analytical techniques have been proposed. Here, we describe the basic methodologies to approach the analysis of microarray datasets that focus on the task of (sub)group discovery.Peer reviewe

Multiple source transfer learning for dynamic multiobjective optimization

Recently, dynamic multiobjective evolutionary algorithms (DMOEAs) with transfer learning have become popular for solving dynamic multiobjective optimization problems (DMOPs), as the used transfer learning methods in DMOEAs can effectively generate a good initial population for the new environment. However, most of them only transfer non-dominated solutions from the previous one or two environments, which cannot fully exploit all historical information and may easily induce negative transfer as only limited knowledge is available. To address this problem, this paper presents a multiple source transfer learning method for DMOEA, called MSTL-DMOEA, which runs two transfer learning procedures to fully exploit the historical information from all previous environments. First, to select some representative solutions for knowledge transfer, one clustering-based manifold transfer learning is run to cluster non-dominated solutions of the last environment to obtain their centroids, which are then fed into the manifold transfer learning model to predict the corresponding centroids for the new environment. After that, multiple source transfer learning is further run by using multisource TrAdaboost, which can fully exploit information from the above centroids in new environment and old centroids from all previous environments, aiming to construct a more accurate prediction model. This way, MSTL-DMOEA can predict an initial population with better quality for the new environment. The experimental results also validate the superiority of MSTL-DMOEA over several competitive state-of-the-art DMOEAs in solving various kinds of DMOPs