Class Label-aware Graph Anomaly Detection

• URL: http://arxiv.org/abs/2308.11669v1
• Date: Tue, 22 Aug 2023 09:46:12 GMT
• Title: Class Label-aware Graph Anomaly Detection
• Abstract summary: We study the utility of class labels for unsupervised GAD. We propose a Class Label-aware Graph Anomaly Detection framework (CLAD) Experiments on ten datasets demonstrate the superior performance of CLAD in comparison to existing unsupervised GAD methods.
• Score: 23.977594208998237
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Unsupervised GAD methods assume the lack of anomaly labels, i.e., whether a node is anomalous or not. One common observation we made from previous unsupervised methods is that they not only assume the absence of such anomaly labels, but also the absence of class labels (the class a node belongs to used in a general node classification task). In this work, we study the utility of class labels for unsupervised GAD; in particular, how they enhance the detection of structural anomalies. To this end, we propose a Class Label-aware Graph Anomaly Detection framework (CLAD) that utilizes a limited amount of labeled nodes to enhance the performance of unsupervised GAD. Extensive experiments on ten datasets demonstrate the superior performance of CLAD in comparison to existing unsupervised GAD methods, even in the absence of ground-truth class label information. The source code for CLAD is available at \url{https://github.com/jhkim611/CLAD}.

Related papers

• DebGCD: Debiased Learning with Distribution Guidance for Generalized Category Discovery [14.222473509173357]
  We tackle the problem of Generalized Category Discovery (GCD) In GCD, an inherent label bias exists between known and unknown classes due to the lack of ground-truth labels for the latter. We introduce DebGCD, a underlineDebiased learning with distribution guidance framework for underlineGCD.
  arXiv  Detail & Related papers  (2025-04-07T07:56:01Z)
• Semi-Supervised Hierarchical Multi-Label Classifier Based on Local Information [1.6574413179773761]
  Semi-supervised hierarchical multi-label classifier based on local information (SSHMC-BLI) SSHMC-BLI builds pseudo-labels for each unlabeled instance from the paths of labels of its labeled neighbors. Experiments on 12 challenging datasets from functional genomics show that making use of unlabeled along with labeled data can help to improve the performance of a supervised hierarchical classifier trained only on labeled data.
  arXiv  Detail & Related papers  (2024-04-30T20:16:40Z)
• Active Generalized Category Discovery [60.69060965936214]
  Generalized Category Discovery (GCD) endeavors to cluster unlabeled samples from both novel and old classes. We take the spirit of active learning and propose a new setting called Active Generalized Category Discovery (AGCD) Our method achieves state-of-the-art performance on both generic and fine-grained datasets.
  arXiv  Detail & Related papers  (2024-03-07T07:12:24Z)
• Credible Teacher for Semi-Supervised Object Detection in Open Scene [106.25850299007674]
  In Open Scene Semi-Supervised Object Detection (O-SSOD), unlabeled data may contain unknown objects not observed in the labeled data. It is detrimental to the current methods that mainly rely on self-training, as more uncertainty leads to the lower localization and classification precision of pseudo labels. We propose Credible Teacher, an end-to-end framework to prevent uncertain pseudo labels from misleading the model.
  arXiv  Detail & Related papers  (2024-01-01T08:19:21Z)
• No Representation Rules Them All in Category Discovery [115.53747187400626]
  We tackle the problem of Generalized Category Discovery (GCD) Given a dataset with labelled and unlabelled images, the task is to cluster all images in the unlabelled subset. We present a synthetic dataset, named 'Clevr-4', for category discovery.
  arXiv  Detail & Related papers  (2023-11-28T18:59:46Z)
• Towards Semi-supervised Universal Graph Classification [6.339931887475018]
  We study the problem of semi-supervised universal graph classification. This problem is challenging due to a severe lack of labels and potential class shifts. We propose a novel graph neural network framework named UGNN, which makes the best of unlabeled data from the subgraph perspective.
  arXiv  Detail & Related papers  (2023-05-31T06:58:34Z)
• Plug-and-Play Pseudo Label Correction Network for Unsupervised Person Re-identification [36.3733132520186]
  We propose a graph-based pseudo label correction network (GLC) to refine the pseudo labels in the manner of supervised clustering. GLC learns to rectify the initial noisy labels by means of the relationship constraints between samples on the k Nearest Neighbor graph. Our method is widely compatible with various clustering-based methods and promotes the state-of-the-art performance consistently.
  arXiv  Detail & Related papers  (2022-06-14T05:59:37Z)
• Rethinking Pseudo Labels for Semi-Supervised Object Detection [84.697097472401]
  We introduce certainty-aware pseudo labels tailored for object detection. We dynamically adjust the thresholds used to generate pseudo labels and reweight loss functions for each category to alleviate the class imbalance problem. Our approach improves supervised baselines by up to 10% AP using only 1-10% labeled data from COCO.
  arXiv  Detail & Related papers  (2021-06-01T01:32:03Z)
• Active Learning for Node Classification: The Additional Learning Ability from Unlabelled Nodes [33.97571297149204]
  Given a limited labelling budget, active learning aims to improve performance by carefully choosing which nodes to label. Our empirical study shows that existing active learning methods for node classification are considerably outperformed by a simple method. We propose a novel latent space clustering-based active learning method for node classification (LSCALE)
  arXiv  Detail & Related papers  (2020-12-13T13:59:48Z)
• Unsupervised Object Detection with LiDAR Clues [70.73881791310495]
  We present the first practical method for unsupervised object detection with the aid of LiDAR clues. In our approach, candidate object segments based on 3D point clouds are firstly generated. Then, an iterative segment labeling process is conducted to assign segment labels and to train a segment labeling network. The labeling process is carefully designed so as to mitigate the issue of long-tailed and open-ended distribution.
  arXiv  Detail & Related papers  (2020-11-25T18:59:54Z)
• No Subclass Left Behind: Fine-Grained Robustness in Coarse-Grained Classification Problems [20.253644336965042]
  In real-world classification tasks, each class often comprises multiple finer-grained "subclasses" As the subclass labels are frequently unavailable, models trained using only the coarser-grained class labels often exhibit highly variable performance across different subclasses. We propose GEORGE, a method to both measure and mitigate hidden stratification even when subclass labels are unknown.
  arXiv  Detail & Related papers  (2020-11-25T18:50:32Z)
• Structured Prediction with Partial Labelling through the Infimum Loss [85.4940853372503]
  The goal of weak supervision is to enable models to learn using only forms of labelling which are cheaper to collect. This is a type of incomplete annotation where, for each datapoint, supervision is cast as a set of labels containing the real one. This paper provides a unified framework based on structured prediction and on the concept of infimum loss to deal with partial labelling.
  arXiv  Detail & Related papers  (2020-03-02T13:59:41Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.