1 January 2019 in Tetrahedron Letters
22 May 2023 in IEEE Transactions on Neural Networks and Learning Systems
Multiview data are widespread in real-world applications, and multiview clustering is a commonly used technique to effectively mine the data. Most of the existing algorithms perform multiview clustering by mining the commonly hidden space between views. Although this strategy is effective, there are two challenges that still need to be addressed to further improve the performance. First, how to design an efficient hidden space learning method so that the learned hidden spaces contain both shared and specific information of multiview data. Second, how to design an efficient mechanism to make the learned hidden space more suitable for the clustering task. In this study, a novel one-step multiview fuzzy clustering (OMFC-CS) method is proposed to address the two challenges by collaborative learning between the common and specific space information. To tackle the first challenge, we propose a mechanism to extract the common and specific information simultaneously based on matrix factorization. For the second challenge, we design a one-step learning framework to integrate the learning of common and specific spaces and the learning of fuzzy partitions. The integration is achieved in the framework by performing the two learning processes alternately and thereby yielding mutual benefit. Furthermore, the Shannon entropy strategy is introduced to obtain the optimal views weight assignment during clustering. The experimental results based on benchmark multiview datasets demonstrate that the proposed OMFC-CS outperforms many existing methods.
19 July 2023 in IEEE Transactions on Knowledge and Data Engineering
Unsupervised multi-view representation learning has been extensively studied for mining multi-view data. However, some critical challenges remain. On the one hand, the existing methods cannot explore multi-view data comprehensively since they usually learn a common representation between views, given that multi-view data contains both the common information between views and the specific information within each view. On the other hand, to mine the nonlinear relationship between data, kernel or neural network methods are commonly used for multi-view representation learning. However, these methods are lacking in interpretability. To this end, this paper proposes a new multi-view fuzzy representation learning method based on the interpretable Takagi-Sugeno-Kang (TSK) fuzzy system (MVRL_FS). The method realizes multi-view representation learning from two aspects. First, multi-view data are transformed into a high-dimensional fuzzy feature space, while the common information between views and specific information of each view are explored simultaneously. Second, a new regularization method based on L2,1-norm regression is proposed to mine the consistency information between views, while the geometric structure of the data is preserved through the Laplacian graph. Finally, extensive experiments on many benchmark multi-view datasets are conducted to validate the superiority of the proposed method.
10 August 2023 in Information Sciences
1 November 2024 in IEEE Transactions on Fuzzy Systems
Multi-view anchor graph clustering has been a prominent research area in recent years, leading to the development of several effective and efficient methods. However, three challenges are faced by current multi-view anchor graph clustering methods. First, real-world data often exhibit uncertainty and poor discriminability, leading to suboptimal anchor graphs when directly extracted from the original data. Second, most existing methods assume the presence of common information between views and primarily explore it for clustering, thus neglecting view specific information. Third, further exploration and exploitation of the learned anchor graph to enhance clustering performance remains an open research question. To address these issues, a novel dual anchor graph fuzzy clustering method is proposed in this paper. First, a novel matrix factorization based dual anchor graph learning method is proposed to address the first two issues by extracting highly discriminative hidden representations for each view and subsequently deriving both common and specific anchor graphs from these hidden representations. Then, to address the third issue, a novel anchor graph fuzzy clustering method is developed with cooperative learning to exploit and utilize the common and specific anchor graphs fully. Meanwhile, a fuzzy membership structure preservation mechanism with dual anchor graphs is constructed to enhance clustering performance. Finally, negative Shannon entropy is further introduced to adaptively adjust the view weighing. Extensive experiments on several datasets demonstrate the effectiveness of the proposed method.
20 September 2024 in IEEE Transactions on Fuzzy Systems
Graph data modeling is non-trivial due to the challenges to ensure model interpretability and handle data uncertainty. While methods derived from deep learning models, such as graph neural networks (GNNs), are able to handle graph data, the interpretability is limited. Graph fuzzy systems (GFSs) based on the fuzzy rules and fuzzy inference have been proposed to improve interpretability, but the existing methods are developed for whole graph prediction only and cannot deal with node prediction which is a more common task in graph data modeling. To tackle the challenges, a novel GFS for node prediction (GFS-node) is investigated in this study. For this purpose, the concepts, framework, and algorithms of GFS-node are systematically developed. First, several related concepts are defined, including the node fuzzy rule base, node fuzzy set, and node consequent processing module (NCPM). A general framework for GFS-node is then presented, where the construction of antecedents and consequents of fuzzy rules are analyzed. Furthermore, a concrete implementation method of GFS-node is designed. Specially, the kernel K virtual central nodes clustering (KVCN) algorithm is proposed to develop the algorithm for antecedent generation, and the linear message passing network (LMPN) is adopted to develop the algorithm for consequent generation and learning. Experiments are carried out on multiple benchmark datasets, and the results show that GFS-node combine the advantages of both traditional FSs and classical GNNs for node prediction