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 "compositional coding for collaborative filtering"):
  Abstract: Efficiency is crucial to the online recommender systems. Representing users and items as binary vectors for Collaborative Filtering (CF) can achieve fast user-item affinity computation in the Hamming space, in recent years, we have witnessed an emerging research effort in exploiting binary hashing techniques for CF methods. However, CF with binary codes naturally suffers from low accuracy due to limited representation capability in each bit, which impedes it from modeling complex structure of the data. #R##N#In this work, we attempt to improve the efficiency without hurting the model performance by utilizing both the accuracy of real-valued vectors and the efficiency of binary codes to represent users/items. In particular, we propose the Compositional Coding for Collaborative Filtering (CCCF) framework, which not only gains better recommendation efficiency than the state-of-the-art binarized CF approaches but also achieves even higher accuracy than the real-valued CF method. Specifically, CCCF innovatively represents each user/item with a set of binary vectors, which are associated with a sparse real-value weight vector. Each value of the weight vector encodes the importance of the corresponding binary vector to the user/item. The continuous weight vectors greatly enhances the representation capability of binary codes, and its sparsity guarantees the processing speed. Furthermore, an integer weight approximation scheme is proposed to further accelerate the speed. Based on the CCCF framework, we design an efficient discrete optimization algorithm to learn its parameters. Extensive experiments on three real-world datasets show that our method outperforms the state-of-the-art binarized CF methods (even achieves better performance than the real-valued CF method) by a large margin in terms of both recommendation accuracy and efficiency.

Includes members:
  Member "discrete factorization machines for fast feature based recommendation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "candidate generation with binary codes for large scale top n recommendation")
  Member "aspect aware latent factor model rating prediction with ratings and reviews":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "recommender systems based on generative adversarial networks a problem driven perspective")
  Member "hash embeddings for efficient word representations":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "compressing gradient optimizers via count sketches")
  Member "collaborative filtering with social local models":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "beyond personalization social content recommendation for creator equality and consumer satisfaction")
  Member "learning k way d dimensional discrete code for compact embedding representations":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "learning multi granular quantized embeddings for large vocab categorical features in recommender systems")
  Member "compressing word embeddings via deep compositional code learning":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "understanding the downstream instability of word embeddings")
  Member "neural attentive session based recommendation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "attentive item2vec neural attentive user representations")
  Member "bpr bayesian personalized ranking from implicit feedback":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "chameleon a deep learning meta architecture for news recommender systems phd thesis")

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)