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 "index based high dimensional cosine threshold querying with optimality guarantees"):
  Abstract: Given a database of vectors, a cosine threshold query returns all vectors in the database having cosine similarity to a query vector above a given threshold {\theta}. These queries arise naturally in many applications, such as document retrieval, image search, and mass spectrometry. The present paper considers the efficient evaluation of such queries, providing novel optimality guarantees and exhibiting good performance on real datasets. We take as a starting point Fagin's well-known Threshold Algorithm (TA), which can be used to answer cosine threshold queries as follows: an inverted index is first built from the database vectors during pre-processing; at query time, the algorithm traverses the index partially to gather a set of candidate vectors to be later verified for {\theta}-similarity. However, directly applying TA in its raw form misses significant optimization opportunities. Indeed, we first show that one can take advantage of the fact that the vectors can be assumed to be normalized, to obtain an improved, tight stopping condition for index traversal and to efficiently compute it incrementally. Then we show that one can take advantage of data skewness to obtain better traversal strategies. In particular, we show a novel traversal strategy that exploits a common data skewness condition which holds in multiple domains including mass spectrometry, documents, and image databases. We show that under the skewness assumption, the new traversal strategy has a strong, near-optimal performance guarantee. The techniques developed in the paper are quite general since they can be applied to a large class of similarity functions beyond cosine.

Includes members:
  Member "hd index pushing the scalability accuracy boundary for approximate knn search in high dimensional spaces":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "mmlsh a practical and efficient technique for processing approximate nearest neighbor queries on multimedia data")
  Member "flash randomized algorithms accelerated over cpu gpu for ultra high dimensional similarity search":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "approximate similarity search under edit distance using locality sensitive hashing")
  Member "on the complexity of inner product similarity join":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "lsf join locality sensitive filtering for distributed all pairs set similarity under skew")
  Member "cosine similarity search with multi index hashing":
    also connected through other hyperedges:
      (none)
  Member "practical and optimal lsh for angular distance":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "differentiable reasoning over a virtual knowledge base")
  Member "fast exact max kernel search":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "to index or not to index optimizing exact maximum inner product search")
  Member "optimal aggregation algorithms for middleware":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "finding interesting frames in deep video analytics a top k approach")

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.DB(Databases)