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 "towards a near universal time series data mining tool introducing the matrix profile"):
  Abstract: Author(s): Yeh, Michael Chin-Chia | Advisor(s): Keogh, Eamonn | Abstract: The last decade has seen a flurry of research on all-pairs-similarity-search (or, self-join) for text, DNA, and a handful of other datatypes, and these systems have been applied to many diverse data mining problems. Surprisingly, however, little progress has been made on addressing this problem for time series subsequences. In this thesis, we have introduced a near universal time series data mining tool called matrix profile which solves the all-pairs-similarity-search problem and caches the output in an easy-to-access fashion. The proposed algorithm is not only parameter-free, exact and scalable, but also applicable for both single and multidimensional time series. By building time series data mining methods on top of matrix profile, many time series data mining tasks (e.g., motif discovery, discord discovery, shapelet discovery, semantic segmentation, and clustering) can be efficiently solved. Because the same matrix profile can be shared by a diverse set of time series data mining methods, matrix profile is versatile and computed-once-use-many-times data structure. We demonstrate the utility of matrix profile for many time series data mining problems, including motif discovery, discord discovery, weakly labeled time series classification, and representation learning on domains as diverse as seismology, entomology, music processing, bioinformatics, human activity monitoring, electrical power-demand monitoring, and medicine. We hope the matrix profile is not the end but the beginning of many more time series data mining projects.

Includes members:
  Member "struc2vec learning node representations from structural identity":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "cube2net efficient query specific network construction with data cube organization")
  Member "learning from hidden traits joint factor analysis and latent clustering":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "federated clustering via matrix factorization models from model averaging to gradient sharing")
  Member "asap prioritizing attention via time series smoothing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "at a glance pixel approximate entropy as a measure of line chart complexity")
  Member "m tsne a framework for visualizing high dimensional multivariate time series":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "quantitative evaluation of time dependent multidimensional projection techniques")
  Member "joint deep modeling of users and items using reviews for recommendation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "chameleon a deep learning meta architecture for news recommender systems phd thesis")
  Member "transnets learning to transform for recommendation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "chameleon a deep learning meta architecture for news recommender systems phd thesis")
  Member "distributed and parallel time series feature extraction for industrial big data applications":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "probabilistic modeling for novelty detection with applications to fraud identification")
  Member "node2vec scalable feature learning for networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "deep graph matching consensus")

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)