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 "efficient inner product approximation in hybrid spaces"):
  Abstract: Many emerging use cases of data mining and machine learning operate on large datasets with data from heterogeneous sources, specifically with both sparse and dense components. For example, dense deep neural network embedding vectors are often used in conjunction with sparse textual features to provide high dimensional hybrid representation of documents. Efficient search in such hybrid spaces is very challenging as the techniques that perform well for sparse vectors have little overlap with those that work well for dense vectors. Popular techniques like Locality Sensitive Hashing (LSH) and its data-dependent variants also do not give good accuracy in high dimensional hybrid spaces. Even though hybrid scenarios are becoming more prevalent, currently there exist no efficient techniques in literature that are both fast and accurate. In this paper, we propose a technique that approximates the inner product computation in hybrid vectors, leading to substantial speedup in search while maintaining high accuracy. We also propose efficient data structures that exploit modern computer architectures, resulting in orders of magnitude faster search than the existing baselines. The performance of the proposed method is demonstrated on several datasets including a very large scale industrial dataset containing one billion vectors in a billion dimensional space, achieving over 10x speedup and higher accuracy against competitive baselines.

Includes members:
  Member "deep cross network for ad click predictions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "cross gcn enhancing graph convolutional network with k order feature interactions")
  Member "accelerated nearest neighbor search with quick adc":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "quicker adc unlocking the hidden potential of product quantization with simd")
  Member "bolt accelerated data mining with fast vector compression":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the space complexity of inner product filters")
  Member "attentional factorization machines learning the weight of feature interactions via attention networks":
    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 "practical and optimal lsh for angular distance":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "differentiable reasoning over a virtual knowledge base")
  Member "quantization based fast inner product search":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "pre training tasks for embedding based large scale retrieval")
  Member "distributed representations of sentences and documents":
    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 "stacked quantizers for compositional vector compression":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "asymmetric correlation quantization hashing for cross modal retrieval")

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)