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 "traffic prediction based on random connectivity in deep learning with long short term memory"):
  Abstract: Traffic prediction plays an important role in evaluating the performance of telecommunication networks and attracts intense research interests. A significant number of algorithms and models have been proposed to learn knowledge from traffic data and improve the prediction accuracy. In the recent big data era, the relevant research enthusiasm remains and deep learning has been exploited to extract the useful information in depth. In particular, Long Short-Term Memory (LSTM), one kind of Recurrent Neural Network (RNN) schemes, has attracted significant attentions due to the long-range dependency embedded in the sequential traffic data. However, LSTM has considerable computational cost, which can not be tolerated in tasks with stringent latency requirement. In this paper, we propose a deep learning model based on LSTM, called Random Connectivity LSTM (RCLSTM). Compared to the conventional LSTM, RCLSTM achieves a significant breakthrough in the architecture formation of neural network, whose connectivity is determined in a stochastic manner rather than full connected. So, the neural network in RCLSTM can exhibit certain sparsity, which means many neural connections are absent (distinguished from the full connectivity) and thus the number of parameters to be trained is reduced and much fewer computations are required. We apply the RCLSTM solution to predict traffic and validate that the RCLSTM with even 35% neural connectivity still shows a strong capability in traffic prediction. Also, along with increasing the number of training samples, the performance of RCLSTM becomes closer to the conventional LSTM. Moreover, the RCLSTM exhibits even superior prediction accuracy than the conventional LSTM when the length of input traffic sequences increases.

Includes members:
  Member "neural decomposition of time series data for effective generalization":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "time2vec learning a vector representation of time")
  Member "stochasticnet forming deep neural networks via stochastic connectivity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "neural networks on random graphs")

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.NI(Networking and Internet Architecture)