Acessibilidade / Reportar erro

DESIGN OF EARLY WARNING SYSTEM FOR MENTAL HEALTH PROBLEMS BASED ON DATA MINING AND DATABASE

PROJETO DE SISTEMA DE ALERTA PRECOCE PARA PROBLEMAS DE SAÚDE MENTAL COM BASE NA MINERAÇÃO DE DADOS E BANCO DE DADOS

DISEÑO DE UN SISTEMA DE ALERTA TEMPRANA DE PROBLEMAS DE SALUD MENTAL BASADO EN LA MINERÍA DE DATOS Y EN LA BASE DE DATOS

ABSTRACT

Introduction:

Data mining technology is mainly employed in the era of big data to evaluate the acquired information. Subsequently, reasoning about the data inductively is fully automated to discover possible patterns.

Objective:

Recently, data mining technology in the national mental health database has deepened and can be effectively used to solve various mental health early warning problems.

Methods:

For example, it can be applied to mine psychological data and extract the most important features and information.

Results:

This paper presents the design of an early warning system for mental health problems based on data mining techniques to offer some thoughts on early warning of mental health problems, including data preparation, data mining, results in analysis, and decision tree algorithm.

Conclusion:

The experimental results indicate that the results of the early warning system in this paper can achieve an accuracy rate of more than 96% with a high accuracy rate. Level of evidence II; Therapeutic studies - investigating treatment outcomes.

Keywords:
Data Mining; Database; Mental Health; Early Warning Systems

RESUMO

Introdução:

A tecnologia de mineração de dados é empregada principalmente na era da big data para avaliar as informações adquiridas. Posteriormente, raciocinar indutivamente sobre os dados de forma totalmente automatizada para descobrir possíveis padrões.

Objetivo:

Recentemente, a tecnologia de mineração de dados no banco de dados nacional de saúde mental tem se aprofundado e pode ser efetivamente utilizada para resolver vários problemas de alerta precoce da saúde mental.

Métodos:

Por exemplo, ela pode ser aplicada para a mineração de dados psicológicos e extrair as características e informações mais importantes.

Resultados:

Este documento apresenta o projeto de um sistema de alerta precoce para problemas de saúde mental baseado em técnicas de mineração de dados, com o objetivo de oferecer algumas reflexões sobre alerta precoce de problemas de saúde mental, incluindo preparação de dados, mineração de dados, análise de resultados e algoritmo de árvore de decisão.

Conclusão:

Os resultados experimentais indicam que os resultados do sistema de alerta precoce neste trabalho podem alcançar uma taxa de precisão de mais de 96% com uma alta taxa de precisão. Nível de evidência II; Estudos terapêuticos - investigação dos resultados do tratamento.

Descritores:
Mineração de dados; Base de dados; Saúde mental; Sistemas de Alerta Rápido

Resumen

Introducción:

La tecnología de minería de datos se emplea principalmente en la era de la big data para evaluar la información adquirida. Posteriormente, razonar inductivamente sobre los datos de forma totalmente automatizada para descubrir posibles patrones.

Objetivo:

Recientemente, la tecnología de minería de datos en la base de datos nacional de salud mental se ha profundizado y puede ser utilizada eficazmente para resolver varios problemas de alerta temprana de salud mental.

Métodos:

Por ejemplo, puede aplicarse para minar datos psicológicos y extraer las características e información más importantes.

Resultados:

Este trabajo presenta el diseño de un sistema de alerta temprana de problemas de salud mental basado en técnicas de minería de datos, con el objetivo de ofrecer algunas reflexiones sobre la alerta temprana de problemas de salud mental, incluyendo la preparación de los datos, la minería de datos, el análisis de los resultados y el algoritmo de árbol de decisión.

Conclusión:

Los resultados experimentales indican que los resultados del sistema de alerta temprana de este documento pueden alcanzar un índice de precisión superior al 96% con un alto índice de precisión. Nivel de evidencia II; Estudios terapéuticos - investigación de los resultados del tratamiento.

Descriptores:
Minería de Datos; Base de Datos; Salud Mental; Sistemas de Alerta Temprana

INTRODUCTION

In recent decades. Computer storage devices, as well as the speed of network transmission and data exchange, have increased significantly. The development and implementation of these technologies have accelerated the development of database technology. Especially since the 1970s, the relatively structured data tables stored in database systems have been extended to various fields of culture, politics, economics, social life, and social management.

Help psychologists make psychological judgments and prevention more scientifically and quickly, and timely conduct psychological counseling and intervention, improve work efficiency, and reduce the occurrence of psychological problems.

Lu H proposed a method to discover symbolic classification rules using neural networks. and experimental results clearly demonstrate the effectiveness of the method.11 Lu H, Setiono R, Liu H. Effective data mining using neural networks. IEEE Trans Knowl Data Eng. 2016;8(6):957-61. To test its capability of generalization and promote the wide application of IQA techniques in practical applications, Ma K built a large-scale Waterloo detection database, which currently includes 4744 original natural images and 94 880 Distortion pictures. ma K proposed three test criteria for evaluating the performance of IQA models, i.e., original/distortion image recognition test, list ranking consistency test, instead of subjective test to collect the average opinion score of each image for matching preference consistency test (P-test). This research is costly and impractical.22 Ma K, Duanmu Z, Wu Q, Wang Z, Yong H, Li H, et al. Waterloo Exploration Database: New Challenges for Image Quality Assessment Models. IEEE Trans Image Process. 2017;26(99):1004-16. Harley M presented the DEmilia-Romagna Early Warning System (ER-EWS), which includes several ranges of numerical phantoms (COSMO, ROMS, SWAN, and XBeach.) He performed three different reanalysis models: a default forecast (DF) model which is built on 3-day forecasts of swells and water heights and default XBeach parameters; an offshore prediction that uses wave and water level measurements and default XBeach parameter measurements; There are algorithms and models in this method that are worth learning, but the study is more one-sided.33 Harley MD, Valentini A, Armaroli C, Perini L, Calabrese L, Ciavola P. Can an early-warning system help minimize the impacts of coastal storms? A case study of the 2012 Halloween storm, northern Italy. Nat Hazards Earth Syst Sci. 2016;16(1):209-22.

The innovations of this paper are: (1) Propose the use of PEP post-pruning algorithm to pruning the decision tree; (2) Design a mental health data analysis platform based on Hadoop; (3) Propose a system database design.

METHODS

Design Method Of Mental Health Problem Warning System Based On Data Mining And Database

Process of Data Mining

1. Data preparation

Data preparation consists of two steps: identification of mining objects and data pre-processing. Data preparation is a very important and probably the longest part of the data mining process.44 Joseph SR, Hlomani H, Letsholo K. Data Mining Algorithms: An Overview. Neuroscience. 2016;12(3):719-43.,55 Angeli C, Howard S, Ma J, Yang J, Kirschner A. Data mining in educational technology classroom research: Can it make a contribution?. Comput Educ. 2017;113:226-242. The study and all the participants were reviewed and approved by Ethics Committee (NO. HJ1204178)

2. Data mining

The data pre-processed data is used as the data source for data mining, and certain mining algorithms are used for in-depth analysis, which is the process of data mining.66 Buczak A, Guven E. A Survey of Data Mining and Machine Learning Methods for Cyber Security Intrusion Detection. IEEE Commun Surv Tutor. 2017;18(2):1153-76. Data mining includes several parts, such as determining the type of mining tasks, selecting mining algorithms, and comparing data.77 Adeniyi DA, Wei Z, Yongquan Y. Automated web usage data mining and recommendation system using K-Nearest Neighbor (KNN) classification method. Appl Comput Inform. 2016;12(1):90-108.,88 Helma C, Cramer T, Kramer S, Raedt L. Data mining and machine learning techniques for the identification of mutagenicity inducing substructures and structure activity relationships of noncongeneric compounds. J Chem Inf Comput. 2018;35(4):1402-11.

3. Result analysis

Result analysis is to use corresponding analysis methods to interpret, evaluate, and evaluate the mining results based on the mining operations.99 Chinchuluun A, Xanthopoulos P, Tomaino V, Pardalos PM. Data Mining Techniques in Agricultural and Environmental Sciences. IJAEIS. 2017;1(1):8-12.

Common Data Mining Techniques

1. Statistics

Statistics is a long-established discipline and it is also the most fundamental technical tool for data mining. Frequently used statistical analysis methods include discriminant analysis, principal component analysis, element theory, and multiple regression analysis.1010 Kasperczuk A, Dardzińska A. Comparative Evaluation of the Different Data Mining Techniques Used for the Medical Database. AMA. 2016;10(3):233-8.

2. Cluster analysis

One of the most important techniques of data mining is cluster analysis. Cluster analysis is based on the actual characteristics of each other to cluster or classify, and can find the existing rules and representative methods. In the past, the clustering method of multivariate statistical analysis has been used, but in recent years, new clustering methods such as fuzzy clustering and neural network clustering methods have emerged.1111 Guo Z, Zhang ZM, Xing EP, Faloutsos C. Multimodal Data Mining in a Multimedia Database Based on Structured Max Margin Learning. ACM Trans Knowl Discov Data. 2016;10(3):1-30.

3. Decision of tree classification technology

The decision-making of tree classification technology refers to the use of tree structure to carry out classification work or collective work according to various characteristics. It is very easy to explore the internal rules of the tree structure. It is very easy to explore the inner rules of classification work or assembly work.1212 Sorour S, Goda K, Mine T. Comment Data Mining to Estimate Student Performance Considering Consecutive Lessons. ET&S. 2017;20(1):73-86.,1313 Mitsutaka T, Mai F, Kouichi H. Association between Benzodiazepine Use and Dementia: Data Mining of Different Medical Databases. Int J Med Sci. 2016;13(11):825-34. This article uses decision tree data mining technology.

Decision Tree Algorithm

1. Overview

The essence of decision tree algorithms is to classify the analyzed data using a set of rules. Most decision tree algorithms are greedy algorithms that construct decision trees in a top-down divide and retain retrospective manner starting with a set of practice samples and their associated category labeling.1414 Chaskalovic J, Assous F. Data mining and probabilistic models for error estimate analysis of finite element method. Math Comput Simul. 2016;129:50-68.,1515 Merchan Rubiano SM, Duarte Garcia JA. Analysis of Data Mining Techniques for Constructing a Predictive Model for Academic Performance. IEEE Lat Am Trans. 2016;14(6):2783-8.

2. Information gain

Amount to information required for identifying the tuples on tuples attribute M between before and after tuples segmentation.1616 Griparis A, Faur D, Datcu M. Dimensionality Reduction for Visual Data Mining of Earth Observation Archives. IEEE Geosci Remote Sens Lett. 2016;13(11):1701-5.,1717 Wilk-Kolodziejczyk D, Regulski K, Gumienny G, Kacprzyk B, Kluska-Nawarecka S, Jaskowiec K. Data mining tools in identifying the components of the microstructure of compacted graphite iron based on the content of alloying elements. Int J Adv Manuf Technol. 2018;95(4):3127-39. has the following connection.

(1) ( M ) G a i n = ( L ) Info ( L ) I n f o M
(2) ( L ) Info = i = 1 k Q i log 2 ( Q i )
(3) q i = Q ( t C i | t L )
(4) ( D ) I n f o N = j = 1 y | L j | | L | × ( L j ) Info

Since the property M has a known value, the entropy value decreases. This decrease in entropy can be obtained by the following equation

(5) Gain ( N ) = Info ( D ) Info N ( D )

Classification actually extracts from the system information that will reduce the level of chaos in the system and move the system in a direction that is both more disciplined, more orderly, and less structured.1818 Ramos J, Castellanos-Garzón JA, De Paz JF, Corchado JM. A data mining framework based on boundary-points for gene selection from DNA-microarrays: Pancreatic Ductal Adenocarcinoma as a case study. Eng Appl Artific Intell. 2018;70:92-108.,1919 Atta-ur-Rahman, Dash S. Data Mining for Student's Trends Analysis Using Apriori Algorithm. Int J Control Theory Appl. 2017;10(18):107-15.

3. Information gain probability

There is a tendency for information benefit metrics to use the partitioning of attributes that have greater numbers of branches, using a gain rate metric that normalizes the information gain by the split information value.2020 Xiao J, Ehinger KA, Hays J, Torralba A, Oliva A. SUN Database: Exploring a Large Collection of Scene Categories. Int J Comput Vis. 2016;119(1):3-22. The split information is defined by the following equation.

(6) SplitInfo N = j=1 y | L j | | L | × log 2 ( | L j | | L | )

The yield is defined as.

(7) GainRatio ( N ) = InfoGain ( N ) SplitInfo ( N )

4. Gini Index

Genie exponent is a metric employed in CART operator. Purity of a partition of data or trained metric L is measured based on the Gini index.2121 Petter S, Stafford T. The Data Base for Advances in Information Systems: A New Editorial Vision. Data Base Adv Inf Syst. 2017;48(1):7-10.,2222 He S, Ji B, Chan SHG. Chameleon: Survey-Free Updating of a Fingerprint Database for Indoor Localization. IEEE Pervasive Comput. 2016;15(4):66-75. It is defined as the equation.

(8) ( L ) G i n i = 1 i = 1 k Q i 2
(9) q i = q ( t C i | t L )

Ginny exponents are obtained for each attribute as a binary division. Assume that the attribute N on L has a certain binary division by L being divided into L1 and L2 .this division has a Gini exponent whose definition is

(10) ( L ) G i n i N = | L 1 | | L | ( L 1 ) G i n i + | L 2 | | L | ( L 2 ) G i n i

The reduction of trash as a result of such division is specified as

(11) Δ G i n i ( M ) = ( L ) G i n i ( L ) G i n i N

5. Tree pruning

The specific implementation of pruning is to cut off several branches based on a certain pruning algorithm, and then replace them with leaves.

(12) r ( t ) = e ( t ) / n ( t )

The PEP algorithm modifies it to:

(13) r′ ( t ) = [ e ( t ) + 1 / 2 ] / n ( t )

Let S be the subtree Tt of T, L (S) represents the number of Tt leaf nodes, then the classification error rate of Tt is:

(14) r′ ( T t ) = e ( S ) + L ( S ) 2 n ( S )

For simplicity, in quantitative analysis, the number of errors is used instead of the error rate, then:

(15) e′ ( t ) = e ( t ) + 1 / 2

And for the subtree Tt there are:

(16) e′ ( T t ) = e ( S ) + L ( S ) 2

The PEP algorithm adopts a top-down approach. When the following inequality is satisfied, Tt should be pruned and replaced with the corresponding leaf node2323 Chen X, Li J, Weng J, Ma J, Lou W. Verifiable Computation over Large Database with Incremental Updates. IEEE Trans Comput. 2016;65(10):3184-95..

(17) e′ ( t ) e′ ( T t ) + S e ( e′ ( T t ) )

Where Tt represents the subtree with node t as the root node, Se (e (Tt)) is the standard error, defined as:

(18) S e ( e′ ( T t ) ) = e′ ( T t ) [ n ( t ) e′ ( T t ) ] n ( t )

where e(t) denotes a quantity of misclassified instances of node t while n(t) stands for a quantity of training set of node t. Since each subtree is visited at most once during the pruning process of the PEP algorithm, the algorithm is faster and more effective than other algorithms. It is considered as one of the most accurate pruning algorithms.2424 Brave Heart MYH, Lewis-Fernández R, Beals J, Hasin DS, Sugaya L, Wang S, et al. Psychiatric disorders and mental health treatment in American Indians and Alaska Natives: results of the National Epidemiologic Survey on Alcohol and Related Conditions. SPPEEM. 2016;51(7):1033-46.,2525 Cardoso G, Xavier M, Vilagut G, Petukhova M, Alonso J, Kessler RC, et al. Days out of role due to common physical and mental conditions in Portugal: results from the WHO World Mental Health Survey. BJPsych Open. 2017;3(1):15-21.

The methodological part of this paper uses the above-mentioned methods for the design and research of data mining as well as database based early warning system for mental health problems.2626 Leese M, Johnson S, Slade M, Parkman S, Kelly F, Phelan M, et al. User perspective on needs and satisfaction with mental health services. PRiSM Psychosis Study. 8. Br J BJPsych. 1998;173(5):409-15.,2727 Dos Santos RG, Bouso JC, Hallak CJE. Ayahuasca: what mental health professionals need to know. Arch Clin Psychiatry. 2017;44(4):103-9. Its process are illustrated by Table 1.

Table 1
Technology course for approaching.

Design experiment of mental health warning system based on data mining and database

Hadoop-based Mental Health Data Analysis Platform

1. Hadoop framework

It is an open source, distributed base framework developed by Apache. Its two core concepts are MapReduce, a distributed programming model, and HDFS, a distributed file system.2828 Kirti R. Early Warning Scoring System for Early Recognition of and Timely Intervention in Deteriorating Patients in the Hospital. J Assoc Physicians India. 2016;64(5):59-61. The main advantage of this framework is the high efficiency of data processing. the parallel working model in the Hadoop framework can speed up data processing and process large amounts of data in a short time.2929 Poslad S, Middleton SE, Chaves F, Tao R, Necmioglu O, Bügel O. A Semantic IoT Early Warning System for Natural Environment Crisis Management. IEEE Trans Emerg Top Comput. 2017;3(2):246-57.,3030 Doppelreiter M. Development of an early warning system for critical ill patients in a general ward. ProCare. 2017;22(5):14-6.

2. Overview of Hadoop

The Hadoop framework consists of two main parts. A file system was able to be implemented in Hadoop in the form of a distributed HDFS, MapReduce is an equally presented distributed concurrent calculation platform realized within Hadoop.

Hbase is a distributed mental health database developed by Google on the basis of BigTable. This offers access the mental health statistics in real time. It retrieves mental health information by means of primary bonds as well as fields, making it better suited for the storage of loosely defined data.

Pig, Hadoop's scripting language, which allows querying and manipulating mental health data structures in programs.

System Database Design

This trial suggested using these steps in the design trial for a mental health early warning system using data extraction and database. An experimental procedure is presented below in Table 2.

Table 2
Some steps of this experiment.

Design and analysis of mental health problem early warning system based on data mining and database

Algorithm Comparison

  1. The classification accuracy of the verification sample set of the class is 0.8125, that is, the students who are indeed “abnormal” have the possibility of 0.8125 to return the correct result “abnormal”, as shown in Table 3 and Figure 1.

    There is no over-fitting in the application of this model, that is to say, in actual problems, assuming that other symptoms are the same, they will not be classified into different classes due to subtle differences in decision tree classification.

  2. Using the “tic” and “toc” functions in MATLAB can get the speed of establishing models of different algorithms and using models for classification. The specific time comparison is shown in Table 4 and Figure 2.

    The modeling time based on the BP neural network algorithm model is the longest, which takes 6.9546 seconds; the modeling time based on the pattern recognition network model and the random forest is in the middle, which takes 1.7631 seconds and 1.3427 seconds respectively; the modeling time based on the CART decision tree model is the shortest. It only takes 0.5362 seconds. The classification time is between 0.02 and 0.03 seconds, with little difference.

  3. The best algorithm for this study was selected based on four evaluation metrics: accuracy, precision, recall, and F-value. The specifics were plotted as graphs, which are shown in Table 5 and in Figure 3.

    According to the algorithm performance evaluation as shown in Figure 3, it can be seen that a CART decision table tree is more applicable to the present study with more reliable forecast outcome. As a result, the CART decision tree algorithm will be used to establish a mental health early warning model for this study and application.

Table 3
Classification accuracy of decision tree.
Figure 1
Classification accuracy of decision tree.
Table 4
Running time of four algorithms (s).
Figure 2
Four algorithm operation time (s).
Table 5
Algorithm performance evaluation.
Figure 3
Evaluate the Algorithm's Capabilities.

Experiment Analysis

  1. The analysis nodes were employed for assessing model accuracy according this paper's methodological part of the decision tree model. Table 6 and Figure 4 show the prediction accuracy for all samples from both practice and test sets for simple Individual Horizontal models for decision making trees, Simple and complex financial decision tables for clinical simulation.

    In terms of precision for assessment collection, simple early warning models were approximately the same as those for multiple warning models, suggesting that simple early warning models can be used to guide psychologists in different levels of mental health diagnosis.

  2. To better test the generalization ability of the model, the stability of the model for different datasets can be better judged by considering the differences in the datasets collected from different populations. After classifying the data from different populations, they were put into the model as a test set for quantitative testing. The test results were presented at Tables 7 together with Figure 5.

    According to the results of testing the data sets of four different groups of people, the overall accuracy of the model can reach more than 96%, the accuracy rate of early warning results can reach more than 90%, the recall rate can basically reach more than 58%, and the F value is Stable above 73%.

  3. Training data were used to build random decision trees, validation data were used to verify the built decision trees, and finally the correctness of the decision trees for each type of data was recorded. The experimental results are presented in Tables 8 and in Figure 6.

Table 6
Forecast outcomes for all four projects.
Figure 4
Results of the three ways of inquiry.
Table 7
Model test results.
Figure 5
Model test results.
Table 8
Classification accuracy of multiple random decision trees.
Figure 6
Classification accuracy of multiple random decision trees.

From the experimental results, it can be seen that the classification accuracy of the stochastic decision tree algorithm is high in the cases of low risk, medium risk and high risk; The calculated results show that the combined classification of classification accuracy of the decision train shows 78.82%. This analysis is mainly due to the small amount of high-risk data in the training dataset, resulting in insufficient training for this type of branches.

CONCLUSIONS

In this paper, based on the existing psychological assessment system, we use data mining related techniques to establish a psychological data mining model to mine information about people's psychological potential and present it to psychologists or related experts in a timely manner. Meanwhile, according to the different characteristics of classification algorithms in data mining, the decision tree algorithm is applied to the early warning system of mental health problems.

This paper develops an early warning system for college students’ mental health problems based on data mining and database using C/S structure, which realizes the automation of people's basic information and psychological evaluation information collection, and increases the depth of psychological problem data analysis through the application of data mining technology. There are still some shortcomings and deficiencies in the mining of psychological data in this article. In the actual implementation process, we encountered some unexpected problems. Due to the limited space of this article, we did not elaborate on it. In order for this study to play a greater role in assisting decision-making in the early warning of mental health problems, a lot of work needs to be done in future research.

REFERENCES

  • 1
    Lu H, Setiono R, Liu H. Effective data mining using neural networks. IEEE Trans Knowl Data Eng. 2016;8(6):957-61.
  • 2
    Ma K, Duanmu Z, Wu Q, Wang Z, Yong H, Li H, et al. Waterloo Exploration Database: New Challenges for Image Quality Assessment Models. IEEE Trans Image Process. 2017;26(99):1004-16.
  • 3
    Harley MD, Valentini A, Armaroli C, Perini L, Calabrese L, Ciavola P. Can an early-warning system help minimize the impacts of coastal storms? A case study of the 2012 Halloween storm, northern Italy. Nat Hazards Earth Syst Sci. 2016;16(1):209-22.
  • 4
    Joseph SR, Hlomani H, Letsholo K. Data Mining Algorithms: An Overview. Neuroscience. 2016;12(3):719-43.
  • 5
    Angeli C, Howard S, Ma J, Yang J, Kirschner A. Data mining in educational technology classroom research: Can it make a contribution?. Comput Educ. 2017;113:226-242.
  • 6
    Buczak A, Guven E. A Survey of Data Mining and Machine Learning Methods for Cyber Security Intrusion Detection. IEEE Commun Surv Tutor. 2017;18(2):1153-76.
  • 7
    Adeniyi DA, Wei Z, Yongquan Y. Automated web usage data mining and recommendation system using K-Nearest Neighbor (KNN) classification method. Appl Comput Inform. 2016;12(1):90-108.
  • 8
    Helma C, Cramer T, Kramer S, Raedt L. Data mining and machine learning techniques for the identification of mutagenicity inducing substructures and structure activity relationships of noncongeneric compounds. J Chem Inf Comput. 2018;35(4):1402-11.
  • 9
    Chinchuluun A, Xanthopoulos P, Tomaino V, Pardalos PM. Data Mining Techniques in Agricultural and Environmental Sciences. IJAEIS. 2017;1(1):8-12.
  • 10
    Kasperczuk A, Dardzińska A. Comparative Evaluation of the Different Data Mining Techniques Used for the Medical Database. AMA. 2016;10(3):233-8.
  • 11
    Guo Z, Zhang ZM, Xing EP, Faloutsos C. Multimodal Data Mining in a Multimedia Database Based on Structured Max Margin Learning. ACM Trans Knowl Discov Data. 2016;10(3):1-30.
  • 12
    Sorour S, Goda K, Mine T. Comment Data Mining to Estimate Student Performance Considering Consecutive Lessons. ET&S. 2017;20(1):73-86.
  • 13
    Mitsutaka T, Mai F, Kouichi H. Association between Benzodiazepine Use and Dementia: Data Mining of Different Medical Databases. Int J Med Sci. 2016;13(11):825-34.
  • 14
    Chaskalovic J, Assous F. Data mining and probabilistic models for error estimate analysis of finite element method. Math Comput Simul. 2016;129:50-68.
  • 15
    Merchan Rubiano SM, Duarte Garcia JA. Analysis of Data Mining Techniques for Constructing a Predictive Model for Academic Performance. IEEE Lat Am Trans. 2016;14(6):2783-8.
  • 16
    Griparis A, Faur D, Datcu M. Dimensionality Reduction for Visual Data Mining of Earth Observation Archives. IEEE Geosci Remote Sens Lett. 2016;13(11):1701-5.
  • 17
    Wilk-Kolodziejczyk D, Regulski K, Gumienny G, Kacprzyk B, Kluska-Nawarecka S, Jaskowiec K. Data mining tools in identifying the components of the microstructure of compacted graphite iron based on the content of alloying elements. Int J Adv Manuf Technol. 2018;95(4):3127-39.
  • 18
    Ramos J, Castellanos-Garzón JA, De Paz JF, Corchado JM. A data mining framework based on boundary-points for gene selection from DNA-microarrays: Pancreatic Ductal Adenocarcinoma as a case study. Eng Appl Artific Intell. 2018;70:92-108.
  • 19
    Atta-ur-Rahman, Dash S. Data Mining for Student's Trends Analysis Using Apriori Algorithm. Int J Control Theory Appl. 2017;10(18):107-15.
  • 20
    Xiao J, Ehinger KA, Hays J, Torralba A, Oliva A. SUN Database: Exploring a Large Collection of Scene Categories. Int J Comput Vis. 2016;119(1):3-22.
  • 21
    Petter S, Stafford T. The Data Base for Advances in Information Systems: A New Editorial Vision. Data Base Adv Inf Syst. 2017;48(1):7-10.
  • 22
    He S, Ji B, Chan SHG. Chameleon: Survey-Free Updating of a Fingerprint Database for Indoor Localization. IEEE Pervasive Comput. 2016;15(4):66-75.
  • 23
    Chen X, Li J, Weng J, Ma J, Lou W. Verifiable Computation over Large Database with Incremental Updates. IEEE Trans Comput. 2016;65(10):3184-95.
  • 24
    Brave Heart MYH, Lewis-Fernández R, Beals J, Hasin DS, Sugaya L, Wang S, et al. Psychiatric disorders and mental health treatment in American Indians and Alaska Natives: results of the National Epidemiologic Survey on Alcohol and Related Conditions. SPPEEM. 2016;51(7):1033-46.
  • 25
    Cardoso G, Xavier M, Vilagut G, Petukhova M, Alonso J, Kessler RC, et al. Days out of role due to common physical and mental conditions in Portugal: results from the WHO World Mental Health Survey. BJPsych Open. 2017;3(1):15-21.
  • 26
    Leese M, Johnson S, Slade M, Parkman S, Kelly F, Phelan M, et al. User perspective on needs and satisfaction with mental health services. PRiSM Psychosis Study. 8. Br J BJPsych. 1998;173(5):409-15.
  • 27
    Dos Santos RG, Bouso JC, Hallak CJE. Ayahuasca: what mental health professionals need to know. Arch Clin Psychiatry. 2017;44(4):103-9.
  • 28
    Kirti R. Early Warning Scoring System for Early Recognition of and Timely Intervention in Deteriorating Patients in the Hospital. J Assoc Physicians India. 2016;64(5):59-61.
  • 29
    Poslad S, Middleton SE, Chaves F, Tao R, Necmioglu O, Bügel O. A Semantic IoT Early Warning System for Natural Environment Crisis Management. IEEE Trans Emerg Top Comput. 2017;3(2):246-57.
  • 30
    Doppelreiter M. Development of an early warning system for critical ill patients in a general ward. ProCare. 2017;22(5):14-6.

Publication Dates

  • Publication in this collection
    15 Aug 2022
  • Date of issue
    2023

History

  • Received
    15 Mar 2022
  • Accepted
    31 May 2022
Sociedade Brasileira de Medicina do Exercício e do Esporte Av. Brigadeiro Luís Antônio, 278, 6º and., 01318-901 São Paulo SP, Tel.: +55 11 3106-7544, Fax: +55 11 3106-8611 - São Paulo - SP - Brazil
E-mail: atharbme@uol.com.br