22 November 2017 in IEEE Transactions on Cybernetics
Attributed graphs have attracted much attention in recent years. Different from conventional graphs, attributed graphs involve two different types of heterogeneous information, i.e., structural information, which represents the links between the nodes, and attribute information on each of the nodes. Clustering on attributed graphs usually requires the fusion of both types of information in order to identify meaningful clusters. However, most of existing works implement the combination of these two types of information in a ''global'' manner by treating all nodes equally and learning a global weight for the information fusion. To address this issue, this paper proposed a novel weighted K-means algorithm with ''local'' learning for attributed graph clustering, called adaptive fusion of structural and attribute information (Adapt-SA) and analyzed the convergence property of the algorithm. The key advantage of this model is to automatically balance the structural connections and attribute information of each node to learn a fusion weight, and get densely connected clusters with high attribute semantic similarity. Experimental study of weights on both synthetic and real-world data sets showed that the weights learned by Adapt-SA were reasonable, and they reflected which one of these two types of information was more important to decide the membership of a node. We also compared Adapt-SA with the state-of-the-art algorithms on the real-world networks with varieties of characteristics. The experimental results demonstrated that our method outperformed the other algorithms in partitioning an attributed graph into a community structure or other general structures.
17 May 2023 in IEEE Transactions on Geoscience and Remote Sensing
Hyperspectral image (HSI) classification attempts to classify each pixel, which is an important means of obtaining land–cover knowledge. Hyperspectral images are cubic data with spectral–spatial knowledge and can generally be considered as sequential data alongside spectral dimension. Unlike convolutional neural networks (CNNs), which mainly focus on local relationship models in images, transformers have been shown to be a powerful structure for qualifying sequence data. However, it lacks the excellent ability of CNNs in establishing local relationships in images and cannot perform good generalization in case of insufficient data. In addition, the gradient disappearance problem hinders the convergence stability of deep learning networks as the layers get deeper. To address these problems, we propose a Cascaded Convolution-based Transformer with Densely Connected Mechanism (CDCformer) for hyperspectral image classification. First, we propose a cascaded convolution feature tokenization to extract spectral–spatial information, which will introduce some inductive bias properties of CNN into the transformer. In addition, we design a simple and effective densely connected transformer to enhance feature propagation and transfer memorable information from shallow to deep layers. It efficiently improves the performance of the transformer and extracts more discriminative spectral–spatial features from the HSI. Extensive experimental evaluation of three public hyperspectral data sets shows that CDCformer achieves competitive classification results.
1 January 2025 in Knowledge-Based Systems