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

Sparse Multiview Task-Centralized Ensemble Learning for ASD Diagnosis Based on Age- and Sex-Related Functional Connectivity Patterns

Autism spectrum disorder (ASD) is an age- and sex-related neurodevelopmental disorder that alters the brain's functional connectivity (FC). The changes caused by ASD are associated with different age- and sex-related patterns in neuroimaging data. However, most contemporary computer-assisted ASD diagnosis methods ignore the aforementioned age-/sex-related patterns. In this paper, we propose a novel sparse multiview task-centralized (Sparse-MVTC) ensemble classification method for image-based ASD diagnosis. Specifically, with the age and sex information of each subject, we formulate the classification as a multitask learning problem, where each task corresponds to learning upon a specific age/sex group. We also extract multiview features per subject to better reveal the FC changes. Then, in Sparse-MVTC learning, we select a certain central task and treat the rest as auxiliary tasks. By considering both task-task and view-view relationships between the central task and each auxiliary task, we can learn better upon the entire dataset. Finally, by selecting the central task, in turn, we are able to derive multiple classifiers for each task/group. An ensemble strategy is further adopted, such that the final diagnosis can be integrated for each subject. Our comprehensive experiments on the ABIDE database demonstrate that our proposed Sparse-MVTC ensemble learning can significantly outperform the state-of-the-art classification methods for ASD diagnosis

A Robust Multilabel Method Integrating Rule-based Transparent Model, Soft Label Correlation Learning and Label Noise Resistance

Model transparency, label correlation learning and the robust-ness to label noise are crucial for multilabel learning. However, few existing methods study these three characteristics simultaneously. To address this challenge, we propose the robust multilabel Takagi-Sugeno-Kang fuzzy system (R-MLTSK-FS) with three mechanisms. First, we design a soft label learning mechanism to reduce the effect of label noise by explicitly measuring the interactions between labels, which is also the basis of the other two mechanisms. Second, the rule-based TSK FS is used as the base model to efficiently model the inference relationship be-tween features and soft labels in a more transparent way than many existing multilabel models. Third, to further improve the performance of multilabel learning, we build a correlation enhancement learning mechanism based on the soft label space and the fuzzy feature space. Extensive experiments are conducted to demonstrate the superiority of the proposed method.Comment: This paper has been accepted by IEEE Transactions on Fuzzy System

Recent progress in Ti-based nanocomposite anodes for lithium ion batteries

Studying on the anode materials with high energy densities for next-generation lithium-ion batteries (LIBs) is the key for the wide application for electrochemical energy storage devices. Ti-based compounds as promising anode materials are known for their outstanding high-rate capacity and cycling stability as well as improved safety over graphite. However, Ti-based materials still suffer from the low capacity, thus largely limiting their commercialized application. Here, we present an overview of the recent development of Ti-based anode materials in LIBs, and special emphasis is placed on capacity enhancement by rational design of hybrid nanocomposites with conversion-/ alloying-type anodes. This review is expected to provide a guidance for designing novel Ti-based materials for energy storage and conversion. Keywords: lithium-ion batteries (LIBs) anode titania lithium titanateNational Natural Science Foundation (China) (51472137)National Natural Science Foundation (China) (51772163

Ensemble Feature Selection Method with Fast Transfer Model

Compared with the traditional ensemble feature selection methods, the recently-developed ensemble feature selection with block-regularized [m×2] cross-validation (EFSBCV) not only has a variance of the estimator smaller than that of random [m×2] cross-validation, but also enhances the selection probability of important features and reduces the selection probability of noise features. However, the adopted linear regression model without the use of the bias term in EFSBCV may easily lead to underfitting. Moreover, EFSBCV does not consider the importance of each feature subset. Aiming at these two problems, an ensemble feature selection method called EFSFT (ensemble feature selection method using fast transfer model) is proposed in this paper. The basic idea is that the base feature selector in EFSBCV adopts the fast transfer model in this paper, so as to introduce the bias term. EFSFT transfers 2m subsets of features as the source knowledge, and then recalculates the weight of each feature subset, and the linear model fitting ability with the addition of bias terms is better. The results on real datasets show that compared with EFSBCV, the average FP value by EFSFT reduces up to 58%, proving that EFSFT has more advantages in removing noise features. In contrast to least-squares support vector machine (LSSVM), the average TP value by EFSFT increases up to 5%, which clearly indicates the superiority of EFSFT over LSSVM in choosing important features

Fault Diagnosis of Rotating Machinery Bearings Based on Improved DCNN and WOA-DELM

A bearing is a critical component in the transmission of rotating machinery. However, due to prolonged exposure to heavy loads and high-speed environments, rolling bearings are highly susceptible to faults, Hence, it is crucial to enhance bearing fault diagnosis to ensure safe and reliable operation of rotating machinery. In order to achieve this, a rotating machinery fault diagnosis method based on a deep convolutional neural network (DCNN) and Whale Optimization Algorithm (WOA) optimized Deep Extreme Learning Machine (DELM) is proposed in this paper. DCNN is a combination of the Efficient Channel Attention Net (ECA-Net) and Bi-directional Long Short-Term Memory (BiLSTM). In this method, firstly, a DCNN classification network is constructed. The ECA-Net and BiLSTM are brought into the deep convolutional neural network to extract critical features. Next, the WOA is used to optimize the weight of the initial input layer of DELM to build the WOA-DELM classifier model. Finally, the features extracted by the Improved DCNN (IDCNN) are sent to the WOA-DELM model for bearing fault diagnosis. The diagnostic capability of the proposed IDCNN-WOA-DELM method was evaluated through multiple-condition fault diagnosis experiments using the CWRU-bearing dataset with various settings, and comparative tests against other methods were conducted as well. The results indicate that the proposed method demonstrates good diagnostic performance

Graph Fuzzy System: Concepts, Models and Algorithms

Fuzzy systems (FSs) have enjoyed wide applications in various fields, including pattern recognition, intelligent control, data mining and bioinformatics, which is attributed to the strong interpretation and learning ability. In traditional application scenarios, FSs are mainly applied to model Euclidean space data and cannot be used to handle graph data of non-Euclidean structure in nature, such as social networks and traffic route maps. Therefore, development of FS modeling method that is suitable for graph data and can retain the advantages of traditional FSs is an important research. To meet this challenge, a new type of FS for graph data modeling called Graph Fuzzy System (GFS) is proposed in this paper, where the concepts, modeling framework and construction algorithms are systematically developed. First, GFS related concepts, including graph fuzzy rule base, graph fuzzy sets and graph consequent processing unit (GCPU), are defined. A GFS modeling framework is then constructed and the antecedents and consequents of the GFS are presented and analyzed. Finally, a learning framework of GFS is proposed, in which a kernel K-prototype graph clustering (K2PGC) is proposed to develop the construction algorithm for the GFS antecedent generation, and then based on graph neural network (GNNs), consequent parameters learning algorithm is proposed for GFS. Specifically, three different versions of the GFS implementation algorithm are developed for comprehensive evaluations with experiments on various benchmark graph classification datasets. The results demonstrate that the proposed GFS inherits the advantages of both existing mainstream GNNs methods and conventional FSs methods while achieving better performance than the counterparts.Comment: This paper has been submitted to a journa