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 "xdeepfm combining explicit and implicit feature interactions for recommender systems"):
  Abstract: Combinatorial features are essential for the success of many commercial models. Manually crafting these features usually comes with high cost due to the variety, volume and velocity of raw data in web-scale systems. Factorization based models, which measure interactions in terms of vector product, can learn patterns of combinatorial features automatically and generalize to unseen features as well. With the great success of deep neural networks (DNNs) in various fields, recently researchers have proposed several DNN-based factorization model to learn both low- and high-order feature interactions. Despite the powerful ability of learning an arbitrary function from data, plain DNNs generate feature interactions implicitly and at the bit-wise level. In this paper, we propose a novel Compressed Interaction Network (CIN), which aims to generate feature interactions in an explicit fashion and at the vector-wise level. We show that the CIN share some functionalities with convolutional neural networks (CNNs) and recurrent neural networks (RNNs). We further combine a CIN and a classical DNN into one unified model, and named this new model eXtreme Deep Factorization Machine (xDeepFM). On one hand, the xDeepFM is able to learn certain bounded-degree feature interactions explicitly; on the other hand, it can learn arbitrary low- and high-order feature interactions implicitly. We conduct comprehensive experiments on three real-world datasets. Our results demonstrate that xDeepFM outperforms state-of-the-art models. We have released the source code of xDeepFM at https://github.com/Leavingseason/xDeepFM.

Includes members:
  Member "neural factorization machines for sparse predictive analytics":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "parameter efficient transfer from sequential behaviors for user profiling and recommendation")
  Member "neural collaborative filtering":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "advances in collaborative filtering and ranking")
  Member "deep cross network for ad click predictions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "cross gcn enhancing graph convolutional network with k order feature interactions")
  Member "deepfm a factorization machine based neural network for ctr prediction":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "chameleon a deep learning meta architecture for news recommender systems phd thesis")
  Member "attentional factorization machines learning the weight of feature interactions via attention networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "chameleon a deep learning meta architecture for news recommender systems phd thesis")
  Member "cross device user matching based on massive browse logs the runner up solution for the 2016 cikm cup":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "adaptive factorization network learning adaptive order feature interactions")
  Member "wide deep learning for recommender systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "chameleon a deep learning meta architecture for news recommender systems phd thesis")
  Member "product based neural networks for user response prediction":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "autoemb automated embedding dimensionality search in streaming recommendations")

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)