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 "beyond similarity relation embedding with dual attentions for item based recommendation"):
  Abstract: Given the effectiveness and ease of use, Item-based Collaborative Filtering (ICF) methods have been broadly used in industry in recent years. The key of ICF lies in the similarity measurement between items, which however is a coarse-grained numerical value that can hardly capture users' fine-grained preferences toward different latent aspects of items from a representation learning perspective. In this paper, we propose a model called REDA (latent Relation Embedding with Dual Attentions) to address this challenge. REDA is essentially a deep learning based recommendation method that employs an item relation embedding scheme through a neural network structure for inter-item relations representation. A relational user embedding is then proposed by aggregating the relation embeddings between all purchased items of a user, which not only better characterizes user preferences but also alleviates the data sparsity problem. Moreover, to capture valid meta-knowledge that reflects users' desired latent aspects and meanwhile suppress their explosive growth towards overfitting, we further propose a dual attentions mechanism, including a memory attention and a weight attention. A relation-wise optimization method is finally developed for model inference by constructing a personalized ranking loss for item relations. Extensive experiments are implemented on real-world datasets and the proposed model is shown to greatly outperform state-of-the-art methods, especially when the data is sparse.

Includes members:
  Member "latent relational metric learning via memory based attention for collaborative ranking":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "lightgcn simplifying and powering graph convolution network for recommendation")
  Member "collaborative memory network for recommendation systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "lightgcn simplifying and powering graph convolution network for recommendation")
  Member "gamenet graph augmented memory networks for recommending medication combination":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "tri graph information propagation for polypharmacy side effect prediction")
  Member "neural collaborative filtering":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "cross gcn enhancing graph convolutional network with k order feature interactions")
  Member "related pins at pinterest the evolution of a real world recommender system":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "handling position bias for unbiased learning to rank in hotels search")
  Member "key value memory networks for directly reading documents":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "attention over parameters for dialogue systems")
  Member "end to end memory networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "learning video object segmentation from unlabeled videos")

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.IR(Information Retrieval)