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 "an estimation of distribution algorithm for nurse scheduling"):
  Abstract: Schedules can be built in a similar way to a human scheduler by using a set of rules that involve domain knowledge. This paper presents an Estimation of Distribution Algorithm (EDA) for the nurse scheduling problem, which involves choosing a suitable scheduling rule from a set for the assignment of each nurse. Unlike previous work that used Genetic Algorithms (GAs) to implement implicit learning, the learning in the proposed algorithm is explicit, i.e. we identify and mix building blocks directly. The EDA is applied to implement such explicit learning by building a Bayesian network of the joint distribution of solutions. The conditional probability of each variable in the network is computed according to an initial set of promising solutions. Subsequently, each new instance for each variable is generated by using the corresponding conditional probabilities, until all variables have been generated, i.e. in our case, a new rule string has been obtained. Another set of rule strings will be generated in this way, some of which will replace previous strings based on fitness selection. If stopping conditions are not met, the conditional probabilities for all nodes in the Bayesian network are updated again using the current set of promising rule strings. Computational results from 52 real data instances demonstrate the success of this approach. It is also suggested that the learning mechanism in the proposed approach might be suitable for other scheduling problems.

Includes members:
  Member "a tutorial on learning with bayesian networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a content based deep intrusion detection system")
  Member "enhanced direct and indirect genetic algorithm approaches for a mall layout and tenant selection problem":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a bayesian optimisation algorithm for the nurse scheduling problem")
  Member "an indirect genetic algorithm for a nurse scheduling problem":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a greedy double swap heuristic for nurse scheduling")
  Member "building better nurse scheduling algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "solving nurse scheduling problem using constraint programming technique")
  Member "an indirect genetic algorithm for set covering problems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "chemical reaction optimization for the set covering problem")
  Member "exploiting problem structure in a genetic algorithm approach to a nurse rostering problem":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "solving nurse scheduling problem using constraint programming technique")

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.NE(Neural and Evolutionary Computing)