human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "deep weakly supervised anomaly detection"):
  Abstract: Anomaly detection is typically posited as an unsupervised learning task in the literature due to the prohibitive cost and difficulty to obtain large-scale labeled anomaly data, but this ignores the fact that a very small number (e.g.,, a few dozens) of labeled anomalies can often be made available with small/trivial cost in many real-world anomaly detection applications. To leverage such labeled anomaly data, we study an important anomaly detection problem termed weakly-supervised anomaly detection, in which, in addition to a large amount of unlabeled data, a limited number of labeled anomalies are available during modeling. Learning with the small labeled anomaly data enables anomaly-informed modeling, which helps identify anomalies of interest and address the notorious high false positives in unsupervised anomaly detection. However, the problem is especially challenging, since (i) the limited amount of labeled anomaly data often, if not always, cannot cover all types of anomalies and (ii) the unlabeled data is often dominated by normal instances but has anomaly contamination. We address the problem by formulating it as a pairwise relation prediction task. Particularly, our approach defines a two-stream ordinal regression neural network to learn the relation of randomly sampled instance pairs, i.e., whether the instance pair contains two labeled anomalies, one labeled anomaly, or just unlabeled data instances. The resulting model effectively leverages both the labeled and unlabeled data to substantially augment the training data and learn well-generalized representations of normality and abnormality. Comprehensive empirical results on 40 real-world datasets show that our approach (i) significantly outperforms four state-of-the-art methods in detecting both of the known and previously unseen anomalies and (ii) is substantially more data-efficient.

Includes members:
  Member "deep anomaly detection with deviation networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "self trained deep ordinal regression for end to end video anomaly detection")
  Member "deep semi supervised anomaly detection":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "compact surjective encoding autoencoder for unsupervised novelty detection")
  Member "efficient training for positive unlabeled learning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on exploring undetermined relationships for visual relationship detection")
  Member "adversarially learned anomaly detection":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "memory augmented generative adversarial networks for anomaly detection")
  Member "learning representations of ultrahigh dimensional data for random distance based outlier detection":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "outlier detection ensemble with embedded feature selection")
  Member "one class adversarial nets for fraud detection":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "compact surjective encoding autoencoder for unsupervised novelty detection")
  Member "unsupervised anomaly detection with generative adversarial networks to guide marker discovery":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "compact surjective encoding autoencoder for unsupervised novelty detection")
  Member "prototypical networks for few shot learning":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "intelligence physics and information the tradeoff between accuracy and simplicity in machine learning")

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.LG(Machine Learning)