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 "fast matrix factorization with non uniform weights on missing data"):
  Abstract: Matrix factorization (MF) has been widely used to discover the low-rank structure and to predict the missing entries of data matrix. In many real-world learning systems, the data matrix can be very high-dimensional but sparse. This poses an imbalanced learning problem, since the scale of missing entries is usually much larger than that of observed entries, but they cannot be ignored due to the valuable negative signal. For efficiency concern, existing work typically applies a uniform weight on missing entries to allow a fast learning algorithm. However, this simplification will decrease modeling fidelity, resulting in suboptimal performance for downstream applications. #R##N#In this work, we weight the missing data non-uniformly, and more generically, we allow any weighting strategy on the missing data. To address the efficiency challenge, we propose a fast learning method, for which the time complexity is determined by the number of observed entries in the data matrix, rather than the matrix size. The key idea is two-fold: 1) we apply truncated SVD on the weight matrix to get a more compact representation of the weights, and 2) we learn MF parameters with element-wise alternating least squares (eALS) and memorize the key intermediate variables to avoid repeating computations that are unnecessary. We conduct extensive experiments on two recommendation benchmarks, demonstrating the correctness, efficiency, and effectiveness of our fast eALS method.

Includes members:
  Member "learning heterogeneous knowledge base embeddings for explainable recommendation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a survey on knowledge graph based recommender systems")
  Member "adversarial personalized ranking for recommendation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "adversarial ranking attack and defense")
  Member "attributed social network embedding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "deep collaborative embedding for information cascade prediction")
  Member "neural factorization machines for sparse predictive analytics":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "parameter efficient transfer from sequential behaviors for user profiling and recommendation")
  Member "decorrelation of neutral vector variables theory and applications":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "importance of small probability events in big data information measures applications and challenges")
  Member "neural collaborative filtering":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "advances in collaborative filtering and ranking")
  Member "fast matrix factorization for online recommendation with implicit feedback":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "learning to hash with graph neural networks for recommender systems")
  Member "a generic coordinate descent framework for learning from implicit feedback":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "estimation action reflection towards deep interaction between conversational and recommender systems")

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)