Unsupervised graph anomaly detection (GAD) has received increasing attention in recent years. It aims to identify anomalous data patterns using only unlabeled node information from graph-structured data. However, prevailing unsupervised GAD methods typically assume complete node attributes and structural information-a condition that is seldom satisfied in real-world scenarios due to privacy constraints, collection errors, or dynamic node arrivals. Standard imputation strategies risk "repairing" rare anomalous nodes so that they appear normal, thereby introducing imputation bias into the detection process. Moreover, when both node attributes and edges are missing simultaneously, estimation errors in one view can contaminate the other, causing cross-view interference that further degrades detection performance. To address these challenges, we propose M²V-UGAD, a multiple-missing-values-resistant unsupervised GAD framework for incomplete graphs. Specifically, we introduce a dual-pathway encoder that independently reconstructs missing node attributes and graph structure, preventing errors in one view from propagating to the other. The two pathways are then fused and regularized within a joint latent space such that normal nodes occupy a compact inner manifold while anomalies lie on an outer shell. Finally, to mitigate imputation bias, we sample latent codes just outside the normal region and decode them into realistic node features and subgraphs, yielding hard negative examples that sharpen the decision boundary. Experiments on seven public benchmarks show that M²V-UGAD consistently outperforms existing unsupervised GAD methods across a range of missing rates.

Fuzzy logic-based graph neural networks (FL-GNN) have recently garnered growing attention in node classification, which aims to enhance the ability of GNN in modeling uncertain relationships between nodes. However, existing FL-GNN typically assume that nodes in the source domain (training set) and target domain (test set) follow the identical data distribution and class sets. Real-world scenarios often exhibit significant distribution shifts and target domain even contains classes that were not present in the source domain, termed open-set cross-domain node classification (OSCD-NC), which seriously damages their superior performance. Thus, how to leverage the strong uncertain knowledge representation capacity of FL-GNN to learn a well-defined boundary between seen and unseen classes for improving OSCD-NC performance remains an open and underexplored research problem. In this paper, we propose an effective domain-adaptive fuzzy graph diffusion network (DFGDN) for OSCD-NC. Specifically, with the help of a fuzzy adjacency matrix, fuzzy graph diffusion networks are proposed to generate robust fuzzy node representations by adaptively enhancing feature collaboration between low-pass and high-pass graph filters. Then, a peer ($M$+1)-class classifier is introduced to learn a rough class boundary by measuring their class prediction probability difference for target domain. After that, the ($M$+1)-means clustering and decoder modules are simultaneously designed to discover more supervision guidance from target domain for learned class boundary optimization. Finally, we jointly optimize the above modules in an adversarial manner via classification loss, classifier discrepancy loss and mean squared error loss, which further improves the accuracy of the learned class boundary by pulling seen nodes from the source domain and target domain closer, and pushing unseen nodes away. Extensive experiments on three cross-domain data pairs and various openness rates demonstrate the effectiveness of the proposed DFGDN framework.

Graphs play a pivotal role in multimedia applications by integrating information to model complex relationships. Recently, graph class-incremental learning (GCIL) has garnered attention, allowing graph neural networks (GNNs) to adapt to evolving graph analytical tasks by incrementally learning new class knowledge while retaining knowledge of old classes. Existing GCIL methods primarily focus on a closed-set assumption, where all test samples are presumed to belong to previously known classes. Such assumption restricts their applicability in real-world scenarios, where unknown classes naturally emerge during inference, and are absent during training. In this paper, we explore a more challenging open-set graph class-incremental learning scenario with two intertwined challenges: catastrophic forgetting of old classes, which impairs the detection of unknown classes, and inadequate open-set recognition, which destabilizes the retention of learned knowledge. To address the above problems, a novel OGCIL framework is proposed, which utilizes pseudo-sample embedding generation to effectively mitigate catastrophic forgetting and enable robust detection of unknown classes. To be specific, a prototypical conditional variational autoencoder is designed to synthesize node embeddings for old classes, enabling knowledge replay without storing raw graph data. To handle unknown classes, we employ a mixing-based strategy to generate out-of-distribution (OOD) samples from pseudo in-distribution and current node embeddings. A novel prototypical hypersphere classification loss is further proposed, which anchors in-distribution embeddings to their respective class prototypes, while repelling OOD embeddings away. Instead of assigning all unknown samples into one cluster, our proposed objective function explicitly models them as outliers through prototype-aware rejection regions, ensuring a robust open-set recognition. Extensive experiments on five benchmarks demonstrate the effectiveness of OGCIL over existing GCIL and open-set GNN methods.

Remote sensing data from real-world scenarios manifests a long-tailed distribution, with the continuous emergence of new classes over time. Nevertheless, the existing class-incremental remote sensing classification models neglect the above long-tailed distribution phenomenon, which seriously damages their overall superior performance. Meanwhile, long-tail class-incremental learning developed in other areas focuses only on the classifier decision boundary optimization of the tail-class, while neglecting the robustness of the feature backbone. The feature backbone trained on the base classes causes a serious significant distribution shift for the incremental classes owing to the distributional differences between base and incremental classes. To solve these issues, we propose a continually evolved feature and classifiers learning (CEF-CL) framework for long-tail class-incremental remote sensing scene classification. Specifically, tail-class data are scaled and grafted onto head-class data to diversify the semantic information of the tail-class leveraging the rich context of the head classes, which can improve the generalization of the feature backbone. And then, an adaptive multi-scale feature fusion (AMFF) module is proposed to couple feature maps of head and tail classes scale by scale for generating virtual tail-class features that deeply perceive head-class information, which can further enhance the reliability of classifier decision boundary optimization. Furthermore, examples from old classes are regarded as pseudo-tail classes to participate in incremental learning, which greatly alleviates catastrophic forgetting of old classes. Extensive experiments on two remote sensing benchmarks demonstrate the superiority of the proposed CEF-CL in comparison with existing class-incremental learning.

Unsupervised graph-structure learning (GSL) which aims to learn an effective graph structure applied to arbitrary downstream tasks by data itself without any labels' guidance, has recently received increasing attention in various real applications. Although several existing unsupervised GSL has achieved superior performance in different graph analytical tasks, how to utilize the popular graph masked autoencoder to sufficiently acquire effective supervision information from the data itself for improving the effectiveness of learned graph structure has been not effectively explored so far. To tackle the above issue, we present a multilevel contrastive graph masked autoencoder (MCGMAE) for unsupervised GSL. Specifically, we first introduce a graph masked autoencoder with the dual feature masking strategy to reconstruct the same input graph-structured data under the original structure generated by the data itself and learned graph-structure scenarios, respectively. And then, the inter- and intra-class contrastive loss is introduced to maximize the mutual information in feature and graph-structure reconstruction levels simultaneously. More importantly, the above inter- and intra-class contrastive loss is also applied to the graph encoder module for further strengthening their agreement at the feature-encoder level. In comparison to the existing unsupervised GSL, our proposed MCGMAE can effectively improve the training robustness of the unsupervised GSL via different-level supervision information from the data itself. Extensive experiments on three graph analytical tasks and eight datasets validate the effectiveness of the proposed MCGMAE.

Recently emerged label noise-resistant graph representation learning (LNR-GRL) has received increasing attention, which aims to enhance the generalization of graph neural networks (GNNs) in semi-supervised node classification with noisy and limited labels. Most of the existing LNR-GRL tend to introduce more complex sample selection strategies developed in nongraph areas to distinguish more noisy nodes to alleviate their misguidance. However, these proposed methods neglect the importance of inaccurate graph structure relationships rectification, and information collaboration between inaccurate graph structure relationships and noisy node label rectification in improving the quality of noisy node identification and its rectified node labels. To solve the above-mentioned issues, we propose a novel multiplex experts governance collaboration (MEGC) framework for LNR-GRL. Specifically, an unsupervised graph structure governance expert is first designed to rectify inaccurate graph structure relationships. Based on the rectified graph structure, a simple label noise governance expert is proposed to accurately identify noisy node labels and further improve the quality of noisy nodes’ rectified labels and unlabeled nodes’ pseudo-labels. Finally, the above-proposed governance experts can be effectively combined with GNNs to jointly guide their training via the introduced cross-view graph contrastive loss and cross-entropy loss, which can maximally limit the effect of noisy node labels and discover more effective supervision guidance from data itself for GNNs optimization. Extensive experiments on three benchmarks, two label noise types, four noise rates, and four training label rates demonstrate the superiority of the proposed method in comparison to the existing LNR-GRL methods.

Few-shot graph anomaly detection (GAD) has recently garnered increasing attention, which aims to discern anomalous patterns among abundant unlabeled test nodes under the guidance of a limited number of labeled training nodes. Existing few-shot GAD approaches typically adopt meta-training methods trained on richly labeled auxiliary networks to facilitate rapid adaptation to target networks that possess sparse labels. However, these proposed methods often assume that the auxiliary and target networks exist in the same data distributions-an assumption rarely holds in practical settings. This paper explores a more prevalent and complex scenario of cross-domain few-shot GAD, where the goal is to identify anomalies within sparsely labeled target graphs using auxiliary graphs from a related, yet distinct domain. The challenge here is nontrivial owing to inherent data distribution discrepancies between the source and target domains, compounded by the uncertainties of sparse labeling in the target domain. In this paper, we propose a simple and effective framework, termed CDFS-GAD, specifically designed to tackle the aforementioned challenges. CDFS-GAD first introduces a domain-adaptive graph contrastive learning module, which is aimed at enhancing cross-domain feature alignment. Then, a prompt tuning module is further designed to extract domain-specific features tailored to each domain. Moreover, a domain-adaptive hypersphere classification loss is proposed to enhance the discrimination between normal and anomalous instances under minimal supervision, utilizing domain-sensitive norms. Lastly, a self-training strategy is introduced to further refine the predicted scores, enhancing its reliability in few-shot settings. Extensive experiments on twelve real-world cross-domain data pairs demonstrate the effectiveness of the proposed CDFS-GAD framework in comparison to various existing GAD methods including unsupervised, semi-supervised, few-shot and cross-domain GAD methods.

Few-shot class-incremental learning has recently received significant research focus in remote sensing scene classification (FSCIL-RSSC). The success of FSCIL-RSSC relies on the robustness of the feature backbone and classifiers. Existing works focus on improving classifier adaptation, but little attention is paid to the importance of backbone robustness on the recognition ability of new class samples’ embeddings. Due to the large distribution shift between old and new classes, FSCIL-RSSC using high-layer (single-scale) features may not adapt flawlessly to new categories. To solve the issue, we put forward a gradient guided multiscale feature collaboration network (G-MFCN) for FSCIL-RSSC. Specifically, we introduce a parallel hierarchy strategy to simultaneously capture the multifeature discriminative information of the same sample. Then, a gradient guide block is designed to automatically pick out the optimal values of different convolution blocks for multifeature fusion. Finally, the classical feature pyramid network is introduced for multiscale fusion to obtain more obvious discriminative features of RSSC. More importantly, our proposed G-MFCN is a simple and adaptable module, which can combine any existing FSCIL frameworks to further improve the optimized classifiers’ effectiveness for the FSCIL-RSSC scenario. Extensive experiments on four benchmarks demonstrate that the proposed G-MFCN achieves significant improvements in comparison to existing FSCIL-RSSC methods.

Class-incremental (CI) learning has recently received extensive research interest in remote sensing scene classification (CI-RSSC). The existing CI-RSSC methods’ superior performance seriously relies on old (base classes) and new classes (incremental classes) sampled independently from an identical distribution (dataset). In real-world RSSC scenarios, there exist significant distribution shifts between old and new classes, leading to the existing CI-RSSC methods being unable to adjust flawlessly to these new classes. In this article, we propose a novel cross-domain (CD) CI-RSSC framework to solve the above-mentioned problems, termed CDCI-RSSC. Specifically, a modular sharing-based dynamic extension module is first designed, which only updates specialized modules to extract new class feature embeddings for reducing memory footprint. Then, an effective dynamic alignment guided domain adaptive module (DAM) is further proposed to calculate the dynamic weights of each sample in various fields, which can minimize distribution shifts between source and target domains. Finally, a foreground enhancement module (FEM) is introduced to alleviate the issue of complex background interference in RSSC by increasing the weight of critical regions. Compared with the existing CI-RSSC and CD-RSSC, our proposed CDCI-RSSC framework surmounts the challenge of handling the distribution shifts between source (base session) and target domains (incremental session) while alleviating the limitations of continuous learning of new classes. Extensive experiments on three CDCI scenarios show that the CDCI-RSSC model achieves significant performance improvements in comparison to existing CI-RSSC and CD-RSSC methods.

In recent years, few-shot learning has received increasing attention in the Internet of Things areas. Few-shot learning aims to distinguish unseen classes with a few labeled samples from each class. Most recently transductive few-shot studies highly rely on the static geometry distributions generated on the feature space during the label propagation process between unseen class instances. However, these recent methods fail to guarantee that the generated graph structure preserves the true distributions between data properly. In this article, we propose a novel dynamic graph structure preserving (DGSP) model for few-shot learning. Specifically, we formulate the objective function of DGSP by simultaneously considering the data correlations from the feature space and the label space to update the generated graph structure, which can reasonably revise the inappropriate or mistaken local geometry relationships. Then, we design an efficient alternating optimization algorithm to jointly learn the label prediction matrix and the optimal graph structure, the latter of which can be formulated as a linear programming problem. Moreover, our proposed DGSP can be easily combined with any backbone networks during the learning process. We conduct extensive experimental results across different benchmarks, backbones, and task settings, and our method achieves state-of-the-art performance compared with methods based on transductive few-shot learning.

Graph neural networks (GNNs) with missing node features have recently received increasing interest. Such missing node features seriously hurt the performance of the existing GNNs. Some recent methods have been proposed to reconstruct the missing node features by the information propagation among nodes with known and unknown attributes. Although these methods have achieved superior performance, how to exactly exploit the complex data correlations among nodes to reconstruct missing node features is still a great challenge. To solve the above problem, we propose a self-supervised guided hypergraph feature propagation (SGHFP). Specifically, the feature hypergraph is first generated according to the node features with missing information. And then, the reconstructed node features produced by the previous iteration are fed to a two-layer GNNs to construct a pseudo-label hypergraph. Before each iteration, the constructed feature hypergraph and pseudo-label hypergraph are fused effectively, which can better preserve the higher-order data correlations among nodes. After then, we apply the fused hypergraph to the feature propagation for reconstructing missing features. Finally, the reconstructed node features by multi-iteration optimization are applied to the downstream semi-supervised classification task. Extensive experiments demonstrate that the proposed SGHFP outperforms the existing semi-supervised classification with missing node feature methods.

In recent years, graph neural networks (GNN) have achieved significant developments in a variety of graph analytical tasks. Nevertheless, GNN’s superior performance will suffer from serious damage when the collected node features or structure relationships are partially missing owning to numerous unpredictable factors. Recently emerged graph completion learning (GCL) has received increasing attention, which aims to reconstruct the missing node features or structure relationships under the guidance of a specifically supervised task. Although these proposed GCL methods have made great success, they still exist the following problems: the reliance on labels, the bias of the reconstructed node features and structure relationships. Besides, the generalization ability of the existing GCL still faces a huge challenge when both collected node features and structure relationships are partially missing at the same time. To solve the above issues, we propose a more general GCL framework with the aid of self-supervised learning for improving the task performance of the existing GNN variants on graphs with features and structure missing, termed unsupervised GCL (UGCL). Specifically, to avoid the mismatch between missing node features and structure during the message-passing process of GNN, we separate the feature reconstruction and structure reconstruction and design its personalized model in turn. Then, a dual contrastive loss on the structure level and feature level is introduced to maximize the mutual information of node representations from feature reconstructing and structure reconstructing paths for providing more supervision signals. Finally, the reconstructed node features and structure can be applied to the downstream node classification task. Extensive experiments on eight datasets demonstrate the effectiveness of our proposed method.

Few-shot class-incremental learning (FSCIL) has recently attracted extensive attention in various areas. Existing FSCIL methods highly depend on the robustness of the feature backbone pre-trained on base classes. In recent years, different Transformer variants have obtained significant processes in the feature representation learning of massive fields. Nevertheless, the progress of the Transformer in FSCIL scenarios has not achieved the potential promised in other fields so far. In this paper, we develop a semantic-visual guided Transformer (SV-T) to enhance the feature extracting capacity of the pre-trained feature backbone on incremental classes. Specifically, we first utilize the visual (image) labels provided by the base classes to supervise the optimization of the Transformer. And then, a text encoder is introduced to automatically generate the corresponding semantic (text) labels for each image from the base classes. Finally, the constructed semantic labels are further applied to the Transformer for guiding its hyperparameters updating. Our SV-T can take full advantage of more supervision information from base classes and further enhance the training robustness of the feature backbone. More importantly, our SV-T is an independent method, which can directly apply to the existing FSCIL architectures for acquiring embeddings of various incremental classes. Extensive experiments on three benchmarks, two FSCIL architectures, and two Transformer variants show that our proposed SV-T obtains a significant improvement in comparison to the existing state-of-the-art FSCIL methods.

Recent weakly supervised semantic segmentation methods generate pseudolabels to recover the lost position information in weak labels for training the segmentation network. Unfortunately, those pseudolabels often contain mislabeled regions and inaccurate boundaries due to the incomplete recovery of position information. It turns out that the result of semantic segmentation becomes determinate to a certain degree. In this article, we decompose the position information into two components: high-level semantic information and low-level physical information, and develop a componentwise approach to recover each component independently. Specifically, we propose a simple yet effective pseudolabels updating mechanism to iteratively correct mislabeled regions inside objects to precisely refine high-level semantic information. To reconstruct low-level physical information, we utilize a customized superpixel-based random walk mechanism to trim the boundaries. Finally, we design a novel network architecture, namely, a dual-feedback network (DFN), to integrate the two mechanisms into a unified model. Experiments on benchmark datasets show that DFN outperforms the existing state-of-the-art methods in terms of intersection-over-union (mIoU).

Abstract Skeleton‐based action recognition is an inspired yet challenging task in computer vision. Recently, the latest graph convolutional network (GCN), which generalises well‐established convolutional neural networks to non‐Euclidean structures, is proven to be highly successful for action recognition from body skeleton data. However, the GCN architecture has not been fully studied. In this work, a Fisher vector (FV) encoding based GCN architecture (FV‐GCN) is proposed, which exceeds the limitations of existing GCN‐based methods by combining the GCN model with FV encoding. A channel‐wise spatial–temporal aggregation function to preserve spatial–temporal information in the whole action clip and integrate it into the FV‐GCN architecture is also presented. Since FV is different from the GCN structure, this hybrid architecture that incorporates the advantages of both algorithms can discover complementary information of feature representation effectively. On two challenging human action datasets, kinetics, and NTU‐RGBD, improved performance is demonstrated over the baseline method, and the FV‐GCN is better or comparable to some state‐of‐the‐art methods.

Over the past few years, graph representation learning (GRL) has received widespread attention on the feature representations of the non-Euclidean data. As a typical model of GRL, graph convolutional networks (GCN) fuse the graph Laplacian-based static sample structural information. GCN thus generalizes convolutional neural networks to acquire the sample representations with the variously high-order structures. However, most of existing GCN-based variants depend on the static data structural relationships. It will result in the extracted data features lacking of representativeness during the convolution process. To solve this problem, dynamic graph learning convolutional networks (DGLCN) on the application of semi-supervised classification are proposed. First, we introduce a definition of dynamic spectral graph convolution operation. It constantly optimizes the high-order structural relationships between data points according to the loss values of the loss function, and then fits the local geometry information of data exactly. After optimizing our proposed definition with the one-order Chebyshev polynomial, we can obtain a single-layer convolution rule of DGLCN. Due to the fusion of the optimized structural information in the learning process, multi-layer DGLCN can extract richer sample features to improve classification performance. Substantial experiments are conducted on citation network datasets to prove the effectiveness of DGLCN. Experiment results demonstrate that the proposed DGLCN obtains a superior classification performance compared to several existing semi-supervised classification models.

Currently, deep learning (DL) algorithms have achieved great success in many applications including computer vision and natural language processing. Many different kinds of DL models have been reported, such as DeepWalk, LINE, diffusionconvolutional neural networks, graph convolutional networks (GCN), and so on. The GCN algorithm is a variant of convolutional neural network and achieves significant superiority by using a one‐order localised spectral graph filter. However, only a one‐order polynomial in the Laplacian of GCN has been approximated and implemented, which ignores undirect neighbour structure information. The lack of rich structure information reduces the performance of the neural networks in the graph structure data. In this study, the authors deduce and simplify the formula of two‐order spectral graph convolutions to preserve rich local information. Furthermore, they build a layerwise GCN based on this two‐order approximation, i.e. two‐order GCN (TGCN) for semi‐supervised classification. With the two‐order polynomial in the Laplacian, the proposed TGCN model can assimilate abundant localised structure information of graph data and then boosts the classification significantly. To evaluate the proposed solution, extensive experiments are conducted on several popular datasets including the Citeseer, Cora, and PubMed dataset. Experimental results demonstrate that the proposed TGCN outperforms the state‐of‐art methods.