Convolutional Neural Networks in Process Mining and Data Analytics for Prediction Accuracy

: For the reliable prediction and analysis of large amounts of data, big data analytics may be applied in many disciplines. They facilitate the discovery of important information in large amounts of data that would otherwise be obscured. Almost all organizations stored their data in the cloud as event logs over the last few decades. These data can be utilized to extract useful information, which can be used to boost an organization’s productivity and effectiveness by identifying, monitoring, and optimizing its processes. Supporting operations, recognizing faults in running processes, predicting event length, and predicting the next activity are all ways of accomplishing this. As part of our strategy, we provide a data collection and machine learning technique. Process mining can help you achieve these objectives. The major enabler of data-driven approaches in process mining is predictive process monitoring. Deep learning has been used in the realm of predictive monitoring to provide accurate future activity predictions in a running trace by analyzing data from previous events. Using image-based data engineering and convolutional neural networks, the next activity in a business process has been forecast in this paper (CNN). The use of CNN in process mining and data analytics guarantees that the proposed system has high accuracy in predicting the next activity in a business process. The experimental evaluation shows that the proposed CNN algorithm is faster at training and inference than the Long Short-Term Memory (LSTM) approach, even when the process has longer races.

Introduction
Process mining is used to compare the events of a processor to enhance the process. In process mining, event logs are collected, which contain a set of events, including the activity, time-stamp, and case identifier, as well as case attributes, if available. These data should be from the same case, or the event attributes should be similar for all the events. Data analytics is used to analyze, clean, transform, and model the data to discover some useful information that can be used to reach a conclusion and to support perfect decisionmaking, which helps to effectively maintain the business processes. Advancements in information systems enable the management of an enormous number of event logs for a business process. The data extracted from the event logs are analyzed by the processmining approach and provide a better understanding of the processes to the business developers and end-users. Recently, in process mining, predictive process monitoring has been considered the main enabler of data-driven approaches. The prediction of future events in a business is extremely important to facilitate seamless decision-making in varying environments and reduce the effect of uncertainty. In business process analysis, predictive analytics is applied to predict running traces using the patterns associated with historical event logs. This can be carried out by predicting the next activity in an activity domain, its timestamp, and the time needed for completion of a cycle until a trace is determined. The major advantage of performing this task is that, by predicting the next activity, the expectations of the next activity are guaranteed to be achieved and, by predicting the remaining cycle time, one can avoid violating deadlines.
There are some existing solutions for predictive process monitoring based on process discovery algorithms using formal language models such as transition systems and Petri nets. These methods demonstrate the way of executing the logged processes. The drawback of such methods is that the situations of pre-and post-activities are hard to describe since the real business processes are unstructured [1]. The process discovery algorithms mostly produce spaghetti-like models [2,3] that are difficult to predict. Moreover, the growth of machine learning in predictive analytics induces everyone to use it to predict business process activities by analyzing the history of events to obtain accurate perceptions of future activities. Machine learning approaches such as the Nave Bayes classifier [4], predictive clustering tree inducer [5], and parametric regression [6] are already being explored in predictive process analytics. These techniques make use of the patterns obtained from the activity sequences of a running trace, the time taken for its execution, and other traces of data from business processes that are accessible at the time of execution.
In addition to machine learning approaches, deep learning approaches such as Deep Neural Networks have recently attracted attention in the predictive analytics of process mining [7]. Deep Learning is a category of neural network architecture in which the input is given as metadata, which is then processed using several layers to obtain the outcome. A major advantage of using deep learning is the presence of a unique function called automatic feature extraction, which can be applied to solve a variety of complex problems. In this paper, business process behavior is predicted using a Deep Learning-based Convolutional Neural Network by developing a predictive process monitoring model.
The predictive process monitoring of a business process is conducted by predicting the next activity in the running traces of a business event based on the event logs and the process execution data. If the final state of a running case is predicted in advance, then the business manager can create valuable outcomes by avoiding any unwanted delays or barriers in the process. At present, this prediction trending due to its benefits for business management and the availability of many previous process execution data [8]. Figure 1 shows the method of process monitoring and control. In this paper, a convolutional neural network algorithm is used to predict the next activity in an event trace from the event logs of a business process. To achieve this, a data engineering scheme is first designed to detect the spatial structure in the sequential order of event traces and transform these into spatial data. In other words, each trace of the history of event logs is converted into a set of prefix traces, which are then transformed into 2D images. The 2D images generated for the prefix traces of a historical event log are trained using the CNN architecture to generate a deep learning model to predict the next activity in an ongoing process. The feasibility of this predictive analysis was investigated using Helpdesk event logs and illustrates that this CNN-based predictive analytic model provides highly accurate next-activity prediction compared with the existing methods briefed in the literature and obtained with the deep learning-based LSTM approach. The remaining part of this study is organized as related works that describe the literature review of various existing methods that are carried out in the predictive process monitoring task in Section 2, a proposed methodology that describes the data engineering scheme and the involvement of CNN architecture in the prediction of the next activity in Section 3, and, finally, this study is concluded in Section 4.

Related Works
A framework for the prediction of business process monitoring is described in [9]. This provides the users with continuous recommendations and predictions related to the business activities that are to be performed and the input values needed, and minimizes the possibility of violating business constraints. The constraints of the business process can be specified using Linear Temporal Logic (LTL), even during the process execution. This framework depends on the sequence of the activities performed in an event and the attributes obtained after the activity. The method can be applied to both recommendation and prediction. A decision tree algorithm is used for this purpose. To predict an activity, the decision tree evaluates the likelihood of its satisfying the business constraints for the given attributes. To recommend an activity, the decision tree algorithm selects the attributes that maximize the likelihood of satisfying business constraints. This framework is implemented in the ProM toolset and validated using a real-life dataset of cancer patients, obtained from a Dutch academic hospital. The use of Long Short-Term Memory (LSTM) neural networks in predictive process monitoring by considering the process metrics is explained in [10]. The next activity in a process and its time-stamp are predicted in this paper. Additionally, this method predicts the case results and aggregate performance indicators. In this paper, the author suggests that the use of deep learning approaches is the next step in the research into predictions of the next activity and the remaining time in business processes. In [11], a framework is established that supports the prediction of business processes. The next activity is predicted by training the model with historical logs containing previous processes and this method is designed so that the results can be visualized. The domain experts compare these visualizations based on their experience. The model analysis technique is used for complex visualizations.
A weaker bias-based predictive modeling system named RegPFA artifact is designed and described in [12]. It has two components, namely, the RegPFA Predictor, which acts as the predictive model, and the RegPFA Analyzer, which performs visualization and analysis. The probabilistic model is fitted into a dataset that holds details of previous activity, which help to predict the future of the currently running activity. A visualization of the model is also designed to verify how the proposed probabilistic model works. This model was evaluated on both synthetic and real-world datasets and was found to be effective and outperform suitable benchmarks. Ref. [7] uses a deep recurrent neural network (RNN) to predict the next activity and case remainders in the business process. The specialization of this approach is that it uses separate data for training and validation to eliminate the overfitting problem, empirically assessing the parameters of neural networks, understanding and visualizing the states of neural networks, and encoding the information regarding timings. Most of the existing methods for the prediction of the next activity use logs of event behavior that have been completely executed; however, in [8], the next activity prediction is based on an analysis of the running events that have not yet been completed. This framework is designed for transforming event forecasting using the sliding window method. Process mining notifies the future activities of a running event. The ability to foresee future insights helps with decision-making.
The completion time of an ongoing process was predicted using process mining, which is demonstrated in [6]. This approach uses a configurable set of abstractions that help balance the problem of under-fitting and over-fitting. The model was trained on real-life event logs and implemented in ProM. The developed model was evaluated using real-life cases from two Dutch municipalities. This method differs from the existing approaches as the predictive model is explicit, can adjust the degree of abstraction based on the requirements and amount of data, and provides improved diagnostics and a better performance. The cycle time prediction was performed in [6] to answer the question, "When will the case be finished?" This method uses a parametric regression of the data available in the logs. By comparing the current event with the log of past events, the remaining cycle time can be predicted. This regression-based system was found to be better than the Nave approach in terms of performance but needs improvements when no case-data variables are assumed.
The assumption of the case-data variable is a human-based approach, since it requires more knowledge of the process. In [13], the remaining time in a service execution was carried out using stochastic Petri nets with arbitrary firing delays. This method considers the previous event data along with the expected event information. This makes this system predict the remaining time with better quality. Implementation is conducted using the ProM tool. As this method employs Petri Nets, the parallelism in the business process can be naturally captured, as can the resources.
In [2], the process mining approach is shown to be applicable to both structured and unstructured processes to discover and improve the processes. An example of the structured process is the Lasagna process, and an example of the unstructured process is the Spaghetti process, which has been explained in the paper. The process discovered in the Lasagna process is the initiation point for a wide range of analysis techniques used to improve the process. The spaghetti process analysis is challenging, although the probable benefits are significant. The distributed learning of process models for prediction and recommendation of the next activity through "Nested Prediction Model" learning, based on the Nave Bayes classifier, are given in [4]. In this method, the frequent and recurrent activity sequences are first identified and, for each sequence, the predictive model is learned. By using a parallel and distributed solution, huge event logs are processed, which enable realistic decision-making without a perfect model. The datasets used in this system are the BPI2013, which holds the event logs of Volvo IT Belgium, and the BPI2015, which holds the event logs of five Dutch municipalities. In [3], a co-training technique for multiple view methods based on process mining was presented. Here, the author shows that there are many process-mining algorithms used to mine the event logs and deliver valuable models to describe the process execution. The developed models are similar to the spaghetti process and are difficult to recognize, as complex, real-life events are more flexible and less structured based on the expectations of stakeholders. This type of model is only used when all probable actions are combined into a single model, resulting in a set of traces being immediately considered in the event log. This issue can be eliminated by the use of trace clustering in preprocessing. Trace clustering means that the event log is split up into similar traces of a cluster to handle various actions and supports, discovering the process models. The developed clustering model is evaluated using machine learning and process mining metrics.
The authors of [14] declare that several techniques use distinct datasets, experimental setup, evaluation metrics, etc., to overcome the problems with the monitoring of predictive processes, but they all result in a poor capability and an uncertain depiction of the advantages and applicability of various methods. Hence, to solve this issue, a detailed survey of outcome-oriented predictive process-monitoring techniques and their evaluation procedures are described in this paper. The review results are more reliable and accurate regarding the Area Under the ROC Curve (AUC) while using lossy sequence encoding. A deep-learning-based prediction of the next event using a gated convolutional neural network (GCNN) and a key-value-predict attention network (KVP) is described in [15]. This method makes use of process data properties such as repetitiveness, variation, and sparsity for evaluation and describes the impact of these properties on the prediction accuracy of various deep learning structures. This method is evaluated for classification properties such as the generalization and handling of class imbalances. This paper guides the researchers in selecting, validating, and benchmarking the models for predictive process monitoring. This paper also highlights the need for various process data properties in the history of events and the reporting of various performance indicators to attain the desired outcomes. In this paper, the research is continued using convolutional neural networks, which are a robust class of deep neural network architecture that can be used for several applications related to speech recognition and computer vision [16,17]. Some researchers proved that CNN provides a higher accuracy for image data with a clear spatial structure [18,19]. The CNN algorithm works well due to the local filtering and max-pooling layers in its architecture.
A convolutional neural network (CNN) is a deep learning neural network designed to process structured arrays of data, such as images [20]. Convolutional neural networks are especially adept at detecting image patterns, such as lines, gradients, circles, and even eyes and faces. Deep learning has been implemented in the field of predictive monitoring to produce accurate predictions of future activity in a running trace by studying data from past events. Using CNN in process mining and data analytics ensures the high accuracy of the proposed system in predicting the next business process activity. Even with lengthier traces, the experimental evaluation demonstrates that the proposed CNN process is faster at training and inference than the Long Short-Term Memory (LSTM) method. The classifier utilized CNN to retrieve the data's high-level attributes. The proposed model comprises a series of fully integrated CNNs and layers.

Proposed Methodology
The methodology of the proposed business process predictive model is explained as follows: In this method, an image-like data engineering scheme is first structured, which converts the set of prefix traces into 2D image-like data structures, and then the CNN architecture is applied to the historical log of events to predict the next traces of an ongoing process. An event log is supposed to contain data related to the activities involved in an event of a business process and its duration for completion. An event is characterized by two features: the action performed in an event and its time-stamp, which includes the date and time at which it happens. The activity domain is a set of several different activities that occur in an event, based on which the business process predictive model is constructed. An event log consists of a set of events. Each of these events is associated with a specific, unique tracing. This is also represented as a bag of traces. A trace denotes the business process of a business process execution. The sub-sequence of a trace is called a "prefix trace," which considers the initial state of a trace until its end.
The prefix trace can be depicted from an activity perspective, i.e., the frequency or control flow of an activity and its performance, i.e., time consumption. This paper considers both perspectives to generate 2D image-like structures. The log of events is first converted to a labeled imagery dataset. For each prefix trace of a trace in an event log, a 2D image is constructed to depict the labeled prefix trace with its future activity. The activity channel measures the number of times that an activity takes place in a prefix trace, from the beginning to the end of the activity. The performance channel measures the duration of the activity from the beginning, to its last occurrence in a prefix trace before its end. As this paper mainly focuses on recent activities, the last occurrence of activity is considered in this paper. From this, it is possible to figure out how long the current execution has been occurring.
Consider an event as E, event log as L, activity as A, activity domain as AD, timestamp as Ts, and the trace as T.
Here, an event E i corresponds to the activity A i with a timestamp Ts i . The trace T is a finite sequence of l distinct events with Ts i < Ts j , 1 ≤ i < j ≤ l. Let l = |T| events, the prefix trace PT k is the sequence of first k successive events of T with 1 ≤ k < l.
From a prefix trace with l length, l − 1 prefix traces could be extracted. Let us now consider A k+1 as the next activity of a task related to PT k . Where PT k = E 1 , E 2 , . . . , E k .
Each event consists of (A i , Ts i ) pair with 1 ≤ i ≤ k. PT k is depicted as a 2D image I k of k × m, where k is prefix trace length and m is activity domain size. The imagery rows of I k are successive indices of events, while the imagery columns of I k are the various activities of an activation domain. Every imagery pixel (x, y) of I k is a 2D vector consisting of an activity channel as its row and a performance channel as its column. The activity channel is the measure of the number of times an activity occurred in PT k from Ts 1 to Ts x , whereas the performance channel is the measure of the time duration between Ts 1 and Ts x , until the last activity before PT k . The reason behind the contemplation of the latest occurrence of inactivity is that, in this paper, the recent predictions are used to predict the next activity. Using this method, the recent activities are predicted in the proposed method.
An event log fragment is given in Table 1. This provides the trace ID, activity domain, and timestamp of a helpdesk. Six activities are considered in this experiment. These are raise ticket (R), inspect ticket (I), verify ticket (V), decision (D), reject ticket (RJ), and accept ticket (AT). Each of these events is linked to a particular trace, which resembles an activity in the activity domain and its equivalent timestamp. Table 2 provides a data matrix of the prefix traces of activity and performance channels and imagery representations of both the activity channel and performance channels are given in gray-scale in Figure 2. Table 1. Event log fragment with prefix trace and next activity.

Trace ID Prefix Trace ID Prefix Trace
Next Activity   The generated imagery dataset is now trained with a CNN architecture as a business process analytic, customized to predict the next activity in an ongoing trace. There is a problem with the use of deep learning analytics in the predictive process: the training dataset should have images of the same size, whereas the number of rows in an image of a prefix trace can differ according to its length. This problem can be overcome by generating the images with several fixed rows, which are then projected as the length of the longest prefix trace in event history. The empty values are assigned as '0' in these imagery rows. The CNN extends a basic, fully connected, feed-forward neural network model with additional features, such as a convolution layer, pooling layer, and weight sharing. The CNN comprises single or multiple pairs of convolution layers and max-pool layers. The convolution layer in a CNN architecture is placed onto a set of filters, which are simulated over the entire input to process trivial input parts. The output of the pooling layer is a low-resolution form of the output obtained from the convolution layer. In higher layers, several broad filters are used to process the complex regions of a low-resolution input. Finally, the fully connected layer combines all the inputs and produces the outcome.
The generated imagery dataset is now trained with a CNN architecture as a business process analytic, customized to predict the next activity in an ongoing trace, as depicted in Figure 2 (a 2D image representation of a prefix trace). There is a problem with the use of deep learning analytics in the predictive process. The training dataset should have images of the same size, whereas the number of rows in the image of a prefix trace can differ according to its length. This problem can be overcome by generating images with several fixed rows, which are then projected as the length of the longest prefix trace in event history. The empty values are assigned as '0' in these imagery rows. The CNN extends a basic, fully connected, feed-forward neural network model with additional features, such as a convolution layer, pooling layer, and weight sharing. The CNN comprises single or multiple pairs of convolution layers and a max-pool layer. The convolution layer in CNN architecture is placed on a set of filters, which are simulated over the entire input to process trivial input parts. The output of the pooling layer is a low-resolution form of the output obtained from the convolution layer. This enables the translation invariance and tolerance to small variations in the pattern positions in the input. In higher layers, several broad filters are used to process the complex regions of a low-resolution input. Finally, the fully connected layer combines all the inputs and produces the outcome, as shown in the Figure 2 (a 2D Image representation of a prefix trace in (a) the Performance Channel). The input of the CNN architecture is fed into the first convolutional layer, where a set of filters are applied. Each filter is a square matrix that serves as the kernel, which uses only a small part of the input, called a node, from the whole image to exploit the hidden local correlation. Feature maps are generated by applying the convolution operator to the input image. The activation function is generated by applying a nonlinear function to each of the feature maps. The values of the feature maps for the first convolution layer are computed by convoluting the input map with the respective kernel and the linear activation function.
After passing an image through a convolutional layer, the output is passed to an activation function. The sigmoid function is a typical activation function, as expressed in The activation function can be any of the nonlinear functions that are differentiable and continuous, which is similar to the back-propagation learning algorithm. The activation function used in this paper is Relu, and is expressed in Equation (2). The ReLU function, also known as the rectified linear unit, is the same as taking the positive component of the input: A pooling layer is introduced before each of the convolution layers to attain spatial invariance and minimizes the dimensions of feature maps, preserves relevant details, and removes unwanted information. Usually, a pooling operation would be a summation, averaging, maximum, or combining of such operations. The pooling operation used in this paper is max-pooling, since it provided the best results in some existing studies.
In the proposed approach, three pairs of convolution layer and max-pool layer are used, as shown in Figure 3. The layers at the end are the fully connected structures, which are similar to those of a feed-forward neural network. This layer combines the various local structures extracted in the low layers to generate the final prediction output. The activation function provides the convolutional neural network nonlinearity. In the absence of the activation function, all neural network layers could be reduced to single matrix multiplication. This paper uses a softmax activation function in the output layer, which is expressed as follows: where H = Number of nodes. When a ReLU function is applied to the output of the first layer, the result is a higher contrast that brings out the vertical lines and gets rid of the noise caused by other features that are not vertical.

Experimental Results
The proposed predictive model is implemented in Python and evaluated to predict the next activity. This evaluation aims to first determine the feasibility of transforming spatial data from temporal data, then validate the efficiency of the image-like structures and the prediction accuracy of convolutional neural networks. In this paper, a benchmark dataset named "Helpdesk event log of an Italian Software Company" was used to evaluate the proposed model. This dataset consists of nine activities of a business process, with a total of 13,710 events and 3804 traces of length, ranging from 1 to 14. A fake event is added at the end of each trace. In a ticketing management system, every trace is started with a new ticket. The loss function is minimized by performing Adam Optimization to achieve effective stochastic optimization through the computation of first-order gradients, only with less memory, along with the computation of network weights with batch size 128 based on the running average of the first moment and second-moment estimates. This process is described in Algorithm 1.
Three pairs of convolution layers and a max-pool layer comprise the CNN architecture. The pooling layer is formed of two strides and the sliding window is of size 2 × 2. The generated feature maps are flattened and given to the denser output layer of the softmax unit. The CNN architecture is trained on the same Helpdesk event log benchmark dataset. Batch normalization is performed by transferring the input from the convolution later to the max-pool layer. The application of batch normalization increases the speed of the training process by reducing the sensitivity of the weight initialization without any increase in the overfitting of the training dataset.
After all of the logs are resolved and closed, the traces are removed. A total of 70% of the traces in the event log are taken into consideration for training, while the remaining 30% of the traces are taken into consideration for testing. The following activity may be predicted for each of the testing traces in Figure 4, which depicts the distribution of training and testing classes in the Helpdesk Event Log. Temporal order is maintained between the training trace and the testing trace. This is so that the predictive model can be trained using the past data and its performance can then be evaluated using the incoming data. The distribution of training courses to testing classes can be seen in Figure 4, which is part of the Helpdesk event log. The third activity takes place at the beginning of the traces. In both the training and the testing phases, no labeled prefix traces are present. It was predicted that, after the conclusion of the running trace, this would be the subsequent activity.  (2,2), inputShape = inputShape, padding=same, kernelInitializer = glorot_uniform, kernelRegularizer = tensorflow.keras.regularizers.l2(reg))) model.add(BatchNormalization()) model.add (Activation(Relu)) model.add(Max_pool2D(size = (2, 2))) (model, reg) ← (generate feature of train and verify input shape) end if 8. Continue the process for 5 epochs with pooling layer of stride 2 and sliding window of size 2 × 2 model.add(Flatten()) model.add(Dense(numOfClasses, activation = softmax, name = actOutput)) accuracy = modelEvauluation 9.
Output: Average of the accuracies of epochs Overfitting of the training data can be avoided by validating the proposed model with the validation dataset, which is 20% of the training dataset. Once the loss function stops improving the validation dataset for a specific number of iterations, the training procedure will be stopped. Training is performed on five trials, and the performance of the predictive model is calculated by averaging those trials.
The CNN and LSTM deep learning models were implemented on the benchmark Helpdesk event log dataset. We created two files for this purpose, one for training and one for testing the data. In the first section, it was necessary to create an LSTM model to demonstrate prediction using the same dataset. Since we initially created two files, one for training and one for testing, in the initial step, training data were created by designing, training and storing the model. After showing the required information on the screen, we created another routine, which was implemented in the file, loaded the model, and generated random sequences of numbers that were written and evaluated on the screen. Using the same routine as the previous implementation, the user should be allowed to enter a string indicating a prediction operation and, once the string has been appropriately entered into the model, the outcome should be displayed on the screen. In the first phase, we were required to train the model, save it, and display relevant results for the development of the process on the screen, as well as from each category, based on the results. The second phase required a model comparison.
Finally, in Table 1, we presented a comparison of the accuracy of the CNN and LSTM models, based on their predictions. Table 3 compares the accuracy of the deep-learningbased CNN model and the LSTM model regarding the benchmark Helpdesk event log dataset. With a 73.93 percent accuracy rate, the proposed CNN predictive model based on deep learning performed better than the LSTM model (22).

Conclusions
Process mining is a technique for comparing a processor's events to improve the process. The event logs, which include a collection of events, comprising the activity, timestamp, and case identifier, as well as case characteristics if available, are gathered in process mining. These data should come from the same case, or the event properties should be consistent across all events. Data analytics analyzes, cleans, transforms and models the data to uncover important information, which can be utilized to reach a conclusion and enable excellent decision-making, which aids in the effective operation of corporate processes. This paper describes a Convolutional Neural Network-based next-activity prediction of an event in a business process using process mining and data analytics. Initially, each trace of the historical events is converted into a set of prefix traces, which are then mapped into two-dimensional images. These are called "spatial data". The process data engineering approach is used to convert the temporal data for an event into spatial data, treating them as an image. These are then trained with the CNN to create a model that can predict the next activity in the running processes of a business process. This study illustrates that generating 2D image structures from the traces of event logs is an effective means of modeling the traces in the perception of activity, as well as the performance. The developed predictive model based on 2D images such as data engineering, and CNN produces high accuracy results for the next-activity prediction of a currently running trace in a business process when compared with the LSTM algorithm.


Design and Implementation of Online Intelligent Mental Health Testing Platform

In order to solve the problems of high misevaluation rate and low work efficiency in the process of mental health intelligent evaluation, a method of mental health intelligent evaluation system oriented to the decision tree algorithm is proposed. First, the current research status of mental health intelligent evaluation was analyzed and the framework of mental health intelligent evaluation system was constructed. Then, the mental health intelligent evaluation data were collected and the decision tree algorithm was used to analyze and classify the mental health intelligent evaluation data to obtain the mental health intelligent evaluation results. Finally, specific simulation experiments are used to analyze the feasibility and superiority of the mental health intelligent evaluation system. The experimental results show that the recall rate of each system increases with the increasing number of iterations, and the system has the highest recall rate. Also, it is stable after the number of iterations reaches 20, with good recall and adaptive scheduling performance. The recall rate of comparison system 1 and comparison system 2 fluctuates greatly, and the recall rate is lower than that of the system in this paper. It is proved that the method of the mental health intelligent evaluation system of the decision tree algorithm can effectively solve the problem and improve the accuracy of the mental health intelligent evaluation. The efficiency of mental health intelligent evaluation is improved, and the system stability is better, which can meet the actual requirements of current mental health intelligent evaluation.

Introduction
College students are in the late stages of youth development, and their own physical and psychological activities have changed greatly. ey often experience more negative emotions, and their self-regulation and self-control abilities are not strong yet; therefore, when dealing with problems such as learning, social interaction, friendship, and love, it often causes intense conflicts of psychological contradictions, resulting in disorders and imbalances in psychological development [1]. As the backbone of the future development of the country and society, college students will have serious consequences if their development is affected by psychological factors. Especially when they leave the campus and enter the society, they are very susceptible to the influence or temptation of various bad factors, which will be a fatal blow to the social groups that cultivate them or their parents and teachers even irrelevant [2,3].
In short, the social environment facing college students is constantly changing, and their own learning initiatives, hobbies, academic performances, the expansion of the gap between the rich and the poor in the family, and the pressure of employment competition all have different characteristics in the past. e factors that induce their mental health problems show more complex and diverse characteristics, so it is necessary to use information technology to conduct indepth research on their mental health problems and explore the intervention model [4,5]. e combination of psychological problem analysis and data mining technology is to find hidden regularities in a small amount of data on mental health problems. is is a scientific method to improve students mental health diagnosis by using advanced intelligent means [6].
Most of the theoretical methods use traditional classification and association analysis methods to study mental health problems. However, classification and counting need to know the type of data in advance. However, in practice, we cannot know which mental health problems are among the following freshmen, so it is very difficult to obtain the class label in advance [7]. In addition, the number of students with information health problems is a minority compared to the overall total and can be classified as abnormal. e use of anomaly detection technology has a better effect on discovering these individuals. Finding out the related factors that affect the mental health of college students is a significant problem.
rough the technique of correlation analysis, discovering the frequent patterns and association rules of psychological problems can understand the causes of college students' mental health problems from a deeper level and eliminate hidden dangers in a targeted manner [8]. Zhang et al. gave a design plan of a data mining system for college students' mental health problems. e main method is to use the ID3 algorithm to build a decision tree for classification mining and the Apriori algorithm for association rule mining. From the perspective of this article, there is a good background in psychology research, but the data it uses are only obtained from the mental health test questionnaire, and the object of the study is only students of a certain grade in the author's school. Moreover, the literature is not in-depth enough to master the technology of data mining and the experimental tests conducted [9]. Alghamdi et al. used the decision tree C4.5 algorithm to establish a mental health assessment model, constructed a decision tree, and predicted mental health by extracting rules. is document only uses a relatively simple classification algorithm for applied research and does not involve the analysis of related factors that form college students' mental health problems [10]. Manna and Misra studied the mental health of vocational students in their master's thesis, the main data mining algorithms used are the ID3 decision tree algorithm and the Apriori association rule algorithm to analyze the inherent relationship between psychological problems and their attributes. In addition, the document also studied the psychological data analysis of multidimensional data warehouse model of higher vocational students and designed a prototype system with VB. From the literature, its work is more systematic and comprehensive, but its biggest shortcoming is that it does not analyze the results of data mining, so there is no regular knowledge [11]. In order to improve the effectiveness of mental health intelligent evaluation, a mental health intelligent evaluation system based on a decision tree algorithm is proposed, which can effectively promote the information management of the system, solve the old problems of traditional system resources, give full play to the advantages of the Internet, create a new Internet environment, and effectively solve the psychological problems of contemporary people.

e Overall Structure of the Mental Health Intelligent
Evaluation System. In order to enable people to have an accurate understanding of their own mental health and at the same time to promote the scientific and informatization of mental health guidance, a mental health intelligent evaluation system based on the decision tree algorithm is constructed, and scientific mental health evaluation tools are used to comprehensively and objectively reflect the user's mental health level. e overall structure of the system is shown in Figure 1 [12]. e mental health intelligent evaluation system based on the decision tree algorithm mainly includes four modules: basic information management module, evaluation test question management module, evaluation result analysis module, and personal psychological evaluation module. e basic information management module provides users with the functions of personal information input and evaluation type selection, and after the user submits the above options, the evaluation test question management module provides users with corresponding evaluation test questions. e test questions are divided into three types: selection, question and answer, and test paper composition. After the user selects the assessment item, the system provides the corresponding test questions for them; after the user completes the answer, the evaluation result and corresponding processing are given; and after the answer is completed, the submitted test result can obtain the corresponding detailed single or multiple analysis in the evaluation result analysis module [13].

Functional Modules of the Mental Health Intelligent
Evaluation System 2.2.1. Data Management Section. e basic information management module is the basic function in the system, and its main function is to manage the basic information in the system. is module has the function of personal information synchronization and evaluation type management. e former can synchronize the personal information filled by the user, accurately track the user's real-time personal situation, and ensure the accuracy of the subsequent evaluation of the system in this article. e latter can uniformly manage all the evaluation types in this system, such as mental health, emotional behavior, interpersonal communication, and add or delete evaluation types according to user needs. In the process of using the system, users have multiple types of choices, high versatility, powerful overall system functions, and can be widely used in the crowd [14].

Evaluation Test Question Management Module.
e evaluation test question management module is an important part of the system, and the quality of the evaluation test questions seriously affects the correctness of the evaluation results. is module mainly includes three types of test questions: choice test questions, essay test questions, and test paper grouping questions. e forms of multiple-choice questions are multiple-choice questions, which can be singlechoice or multiple-choice questions, and there is a strong correlation between the test questions. Answers are made in the evaluation test questions through selection, and according to the different answers selected by the user, jumped to different question types to complete the answer, and the answer points of each question are different. e question form of the question and answer test is a question and answer question, which is designed according to the different types of assessment. e test question form of the test paper combination combines the choice test and the essay test, and it combines the abovementioned two test question types with different evaluation types, jumps to the multiple-choice or essay based on the user's answer, and stops the jump after jumping to the essay. e system can effectively reduce the user's psychological precautions through the skipping of thinking in the choice of test questions, increase their interest in testing, make the test easier to be accepted by them, and get a deeper understanding of the user's psychological state through quiz questions [15].

Evaluation Result Analysis Module.
e evaluation result analysis module is responsible for statistically analyzing the psychological evaluation results of users, discovering the psychological problems of users and grasping their psychological conditions at the first time, and providing help to users. is module can provide users with the analysis results of a single evaluation, comprehensive analysis results of multiple evaluations, function of filling in analysis opinions, and effectively and timely obtain user feedback information on the evaluation results [16].

Personal Psychological Assessment Module.
e personal psychological assessment module is the main module in this system, which highlights the significance of this system for users. e evaluation item selection part provides users with all the evaluation items of the system. Users can select the evaluation items according to their own needs. e evaluation question call function can select the corresponding evaluation questions according to the selected evaluation items for users to evaluate and automatically save the answer results of users and give corresponding scores. Finally, the evaluation results of users are processed through the evaluation result processing function, and the processing results are fed back [17].

Data Mining Process.
e client software of the system uses the method of psychological evaluation data mining to realize the analysis of evaluation results, process the obtained user evaluation result data, and establish a database, through the decision tree algorithm to analyze its evaluation results and get an evaluation. Psychological assessment data mining includes extracting data from the database, cleaning the data, selecting the mining mode, and outputting the results. e complete data mining process is shown in Figure 2 [18]. In this paper, an initial dataset is established by using the user's answer results. After data integration, data extraction, data cleaning, and data conversion, a mental health assessment dataset to be mined is obtained.
e decision tree algorithm is applied in the mining process, and the classification of data is obtained through the mining results. us, the specific classification of users' mental health status can be obtained.  When the decision tree deals with the classification problem, it mainly includes two steps: the first is to generate a decision tree classification model through the learning and training set; the second is to classify unknown types of samples through the model. In the classification process of a certain type of sample, the root node is the starting point and a leaf node is the end point, and the sample attributes are gradually tested in the downward direction of the branch. e system applies the C4.5 decision tree algorithm, and the split index is the information gain rate. It solves the problem of bias in selecting value multiattribute when applying information gain to select test attributes [19]. e definition formula of information gain rate is where Gain (S, A) is the information gain of attribute A and SplitInformation (S, A) is the breadth and uniformity of splitting the sample set S according to the attribute A. e decision tree C4.5 algorithm is used to classify the data of the mental health intelligent assessment to provide data support for the system in this paper.
In the process of decision tree generation, the most important thing is to determine the split target. In order to determine the split index in the C4.5 algorithm, it is necessary to compare the size of the attribute information gain rate in each training sample data and select the attribute with the largest information gain rate and higher than or equal to the average value of all attributes as a branch node of the decision tree. For the existence of continuous descriptive attributes, the continuity needs to be segmented to obtain a discrete set of intervals [20]. Discretization methods include where i � 1, 2, . . . , N. According to the abovementioned discretization method, the information gain rate of all attributes in the candidate attribute set is solved, and the test attribute is the attribute with the largest information gain rate. All possible values in the sample set were used to divide the sample to obtain several subsample sets, and the same method was used to continue to divide all the subsample sets, until they cannot be divided and the decision tree is generated. When using the C4.5 algorithm to generate a decision tree, the selected target class affects the determination of each class. Entropy needs to be used when evaluating the decision tree to get Information gain is the effective reduction of information entropy. According to the information entropy, the variable level used for classification can be determined. If there are two classes of class A and class B in the training set  S, and they, respectively, include x and y records belonging to class A and class B, then the formula for determining the total amount of information for a certain record in the training set S is Suppose variable C is the root node of the decision tree, and the subclass of the training set S is S 1 , S 2 , . . . , S k , then S i (i � 1, 2, . . . , k) includes x i and y i records belonging to class A and class B, respectively. Get the information volume formula classified in all subcategories: Suppose variable C is the classification node of the decision tree and its information increment value is the largest among all variable information increment values, then, the information increment formula of variable C is en, the information gain function is defined as . . , D k |S| � − P 1 * log P 1 + P 2 * log P 2 + · · · + P k * log P k ),

Interface of Mental Health Intelligent Evaluation System.
e system platform uses the SQLServe database, which has multiple functions, mainly including data confidentiality, integrity, which can ensure the security of the user data. In terms of specific structure, security functions, and channel adaptability, it has the characteristics of standardization, multipolarization, and diversification. e current interface of the system stays in the management interface of the question and answer test, the user can directly enter the options that need to be viewed, and can directly delete the evaluation record. e operation is convenient, and the user has a high degree of freedom.

Validity Test of is System. 200 employees of this unit
were randomly selected as experimental subjects, the psychological state of college students evaluated by this system and professional psychologists was compared, and the results are shown in Figure 3. According to Figure 3, the psychological evaluation results of the system in this paper are basically consistent with those of professional psychologists, which prove that the system in this paper is not only effective but also has very good evaluation results. At the same time, the number of employees with neurasthenia accounted for the largest proportion, the number of employees with obsessive paranoia and emotional instability were 27% and 22%, respectively, and the number of neurotic and sensitive in communication was less, which was due to the work pressure and competitive pressure of the unit. ese employees can effectively reduce the proportion of the number of psychological problems after a period of mood relief according to the results of the system, which proves that the system in this paper is practical and can provide users with effective solutions to psychological problems.

Data Processing Efficiency Test of Mental Health Evaluation System.
In order to verify the data processing efficiency of the system, the mental health service system for the elderly based on Internet technology and the automatic mental health evaluation system for online forum users based on multifeature fusion are used as the comparison systems. Comparison system 1 and comparison system 2 are used to represent the data processing time results as shown in Figure 4. Analyzing Figure 4, we can see that the data processing time of the system has been lower than that of the other two systems. As the amount of data continues to increase, the data processing time of the three systems has changed. e data processing time of the comparison system 1 and the comparison system 2 increases sharply with the increase of the amount of information, and the fluctuation range is large and the stability is poor. e increase in the data processing time of the system is small, the curve is smoother, and the stability is good, after the data volume reaches 5 × 103 GB. e data processing time gradually stabilizes, which proves that the system in this paper has high data processing efficiency and strong stability.

Mental Health Evaluation Accuracy
Test. Different noises were added to the three systems to evaluate the mental state of employees, and the accuracy of the mental health evaluation of the three systems was tested, and the results are shown in Table 1. It can be seen from Table 1 that with the continuous increase of noise, the mental health evaluation accuracy of the three systems has decreased, but the mental health evaluation accuracy of the system has been above 90%. In addition, the accuracy rate is not much lower and is relatively stable, while the mental health evaluation accuracy of the other two systems is less than 88%. It shows that the different noise of the three systems has the least influence on Journal of Healthcare Engineering the mental health evaluation accuracy of the system in this paper, and the system in this paper has good antinoise performance and high mental health evaluation accuracy.

Mental Health Evaluation Stability Test.
e information recall rate can be used to verify the system's data scheduling capability. e higher the recall rate, the more stable it is and  the better the system's data scheduling capability. e information recall rate of the three systems was tested in the psychological evaluation, and the results are shown in Figure 5. Figure 5 shows the recall rate of three kinds of system with the increasing number of iterations and ascension, and the recall rate of system 3 proposed in this paper is the highest. After smooth and good recall and adaptive scheduling performance comparison, the number of iterations reaches 20. e recall rate of system 1 and system 2 fluctuates greatly, and the recall rate is lower than that of system 3 proposed in this paper.

Discussion
We considered the three languages of Python, NET, and JAVA and finally chose JAVA. Although both Python and Net can develop web projects, JAVA's j2ee architecture is perfect and the web ecology is better, so JAVA was chosen. On the basis of the JAVA language, the back-end uses the MVC mode and uses the MVC development architecture that comes with the Spring framework because Spring is a nonintrusive framework that can minimize the dependence of application code on the framework. e data control layer uses MyBatis, combined with Alibaba's Druid connection pool, which can greatly improve the performance of JAVA applications, while reducing all resource usage and connection creation time. e database uses MySQL of Alibaba Cloud Data. Because MySQL is open source and small in size, the database application and creation can be easily completed in the RDS console. e RD instance can be ready and put into use within a few minutes, and all instances can be managed uniformly. For efficient development, traditional jsp web pages are abandoned, and front-end and back-end development are used. e front-end interface uses HTML and CSS, and JavaScript front-end and back-end separation will increase the front-end work pressure, and reduce the workload of the background. e background does not care about the business realization of the front desk and does not care about the page realization of the front desk. e static interface uses the bootstrap grid layout, and the front-end and back-end interactions use ajax asynchronous requests to obtain the back-end data. e data processing usesjQuery, and the data display layer uses Vue.js because Vue only focuses on the view layer, which can greatly reduce the cost of front-end development, and the front-end and back-end development will not disturb each other.

Conclusion
In order to improve the effectiveness of mental health intelligent evaluation, a mental health intelligent evaluation system based on the decision tree algorithm is constructed, which can fully help users understand their own mental health, solve their psychological problems, and enhance selfawareness. In order to make the system more functional and have better development, it is also necessary to improve the analysis of system evaluation results and the situation of system data loss during a power failure, increase the system's data backup and recording functions, solve the problem of wasted storage space, and improve the system's functions.

Data Availability
e data used to support the findings of this study are available from the corresponding author upon request.

Conflicts of Interest
e authors declare that there are no conflicts of interest regarding the publication of this paper.  Journal of Healthcare Engineering 7