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 "prototype selection based on clustering and conformance metrics for model discovery"):
  Abstract: Process discovery aims at automatically creating process models on the basis of event data captured during the execution of business processes. Process discovery algorithms tend to use all of the event data to discover a process model. This attitude sometimes leads to discover imprecise and/or complex process models that may conceal important information of processes. To address this problem, several techniques, from data filtering to model repair, have been elaborated in the literature. In this paper, we introduce a new incremental prototype selection algorithm based on clustering of process instances. The method aims to iteratively compute a unique process model with a different set of selected prototypes, i.e., representative of whole event data and stops when conformance metrics decrease. The proposed method has been implemented in both the ProM and the RapidProM platforms. We applied the proposed method on several real event data with state-of-the-art, process discovery algorithms. Results show that using the proposed method leads to improve the general quality of discovered process models.

Includes members:
  Member "rapidprom mine your processes and not just your data":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "discovering more precise process models from event logs by filtering out chaotic activities")
  Member "mining local process models":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "towards intelligent robotic process automation for bpmers")

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)