56 research outputs found
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
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
Domain-adaptive Message Passing Graph Neural Network
Cross-network node classification (CNNC), which aims to classify nodes in a
label-deficient target network by transferring the knowledge from a source
network with abundant labels, draws increasing attention recently. To address
CNNC, we propose a domain-adaptive message passing graph neural network
(DM-GNN), which integrates graph neural network (GNN) with conditional
adversarial domain adaptation. DM-GNN is capable of learning informative
representations for node classification that are also transferrable across
networks. Firstly, a GNN encoder is constructed by dual feature extractors to
separate ego-embedding learning from neighbor-embedding learning so as to
jointly capture commonality and discrimination between connected nodes.
Secondly, a label propagation node classifier is proposed to refine each node's
label prediction by combining its own prediction and its neighbors' prediction.
In addition, a label-aware propagation scheme is devised for the labeled source
network to promote intra-class propagation while avoiding inter-class
propagation, thus yielding label-discriminative source embeddings. Thirdly,
conditional adversarial domain adaptation is performed to take the
neighborhood-refined class-label information into account during adversarial
domain adaptation, so that the class-conditional distributions across networks
can be better matched. Comparisons with eleven state-of-the-art methods
demonstrate the effectiveness of the proposed DM-GNN
Multi-view Fuzzy Representation Learning with Rules based Model
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 L_(2,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.Comment: This work has been accepted by IEEE Transactions on Knowledge and
Data Engineerin
Multi-Label Takagi-Sugeno-Kang Fuzzy System
Multi-label classification can effectively identify the relevant labels of an
instance from a given set of labels. However,the modeling of the relationship
between the features and the labels is critical to the classification
performance. To this end, we propose a new multi-label classification method,
called Multi-Label Takagi-Sugeno-Kang Fuzzy System (ML-TSK FS), to improve the
classification performance. The structure of ML-TSK FS is designed using fuzzy
rules to model the relationship between features and labels. The fuzzy system
is trained by integrating fuzzy inference based multi-label correlation
learning with multi-label regression loss. The proposed ML-TSK FS is evaluated
experimentally on 12 benchmark multi-label datasets. 1 The results show that
the performance of ML-TSK FS is competitive with existing methods in terms of
various evaluation metrics, indicating that it is able to model the
feature-label relationship effectively using fuzzy inference rules and enhances
the classification performance.Comment: This work has been accepted by IEEE Transactions on Fuzzy System
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
Adversarial Deep Network Embedding for Cross-network Node Classification
In this paper, the task of cross-network node classification, which leverages
the abundant labeled nodes from a source network to help classify unlabeled
nodes in a target network, is studied. The existing domain adaptation
algorithms generally fail to model the network structural information, and the
current network embedding models mainly focus on single-network applications.
Thus, both of them cannot be directly applied to solve the cross-network node
classification problem. This motivates us to propose an adversarial
cross-network deep network embedding (ACDNE) model to integrate adversarial
domain adaptation with deep network embedding so as to learn network-invariant
node representations that can also well preserve the network structural
information. In ACDNE, the deep network embedding module utilizes two feature
extractors to jointly preserve attributed affinity and topological proximities
between nodes. In addition, a node classifier is incorporated to make node
representations label-discriminative. Moreover, an adversarial domain
adaptation technique is employed to make node representations
network-invariant. Extensive experimental results demonstrate that the proposed
ACDNE model achieves the state-of-the-art performance in cross-network node
classification
- …