Skip to content
naulon

No retraction, correction or concern found when last checked on Oct 19, 2026.

Predicting Diabetes Mellitus With Machine Learning Techniques

Quan Zou, Kaiyang Qu, Yamei Luo and 3 more

Frontiers in Genetics · 2018

doi:10.3389/fgene.2018.00515

Abstract

Diabetes mellitus is a chronic disease characterized by hyperglycemia. It may cause many complications. According to the growing morbidity in recent years, in 2040, the world's diabetic patients will reach 642 million, which means that one of the ten adults in the future is suffering from diabetes. There is no doubt that this alarming figure needs great attention. With the rapid development of machine learning, machine learning has been applied to many aspects of medical health. In this study, we used decision tree, random forest and neural network to predict diabetes mellitus. The dataset is the hospital physical examination data in Luzhou, China. It contains 14 attributes. In this study, five-fold cross validation was used to examine the models. In order to verity the universal applicability of the methods, we chose some methods that have the better performance to conduct independent test experiments. We randomly selected 68994 healthy people and diabetic patients' data, respectively as training set. Due to the data unbalance, we randomly extracted 5 times data. And the result is the average of these five experiments. In this study, we used principal component analysis (PCA) and minimum redundancy maximum relevance (mRMR) to reduce the dimensionality. The results showed that prediction with random forest could reach the highest accuracy (ACC = 0.8084) when all the attributes were used.

Full text

From PubMed Central, U.S. National Library of Medicine, as current on Oct 19, 2026. Paragraph numbers are ours, so an answer can point at one.

Introduction

Diabetes is a common chronic disease and poses a great threat to human health. The characteristic of diabetes is that the blood glucose is higher than the normal level, which is caused by defective insulin secretion or its impaired biological effects, or both. Diabetes can lead to chronic damage and dysfunction of various tissues, especially eyes, kidneys, heart, blood vessels and nerves. Diabetes can be divided into two categories, type 1 diabetes (T1D) and type 2 diabetes (T2D). Patients with type 1 diabetes are normally younger, mostly less than 30 years old. The typical clinical symptoms are increased thirst and frequent urination, high blood glucose levels. This type of diabetes cannot be cured effectively with oral medications alone and the patients are required insulin therapy. Type 2 diabetes occurs more commonly in middle-aged and elderly people, which is often associated with the occurrence of obesity, hypertension, dyslipidemia, arteriosclerosis, and other diseases.

With the development of living standards, diabetes is increasingly common in people’s daily life. Therefore, how to quickly and accurately diagnose and analyze diabetes is a topic worthy studying. In medicine, the diagnosis of diabetes is according to fasting blood glucose, glucose tolerance, and random blood glucose levels. The earlier diagnosis is obtained, the much easier we can control it. Machine learning can help people make a preliminary judgment about diabetes mellitus according to their daily physical examination data, and it can serve as a reference for doctors. For machine learning method, how to select the valid features and the correct classifier are the most important problems.

Recently, numerous algorithms are used to predict diabetes, including the traditional machine learning method, such as support vector machine (SVM), decision tree (DT), logistic regression and so on. distinguished diabetes from normal people by using principal component analysis (PCA) and neuro fuzzy inference. used quantum particle swarm optimization (QPSO) algorithm and weighted least squares support vector machine (WLS-SVM) to predict type 2 diabetes proposed a system to predict diabetes, called LDA-MWSVM. In this system, the authors used Linear Discriminant Analysis (LDA) to reduce the dimensions and extract the features. In order to deal with the high dimensional datasets, built prediction models based on logistic regression for different onsets of type 2 diabetes prediction. focused on the glucose, and used support vector regression (SVR) to predict diabetes, which is as a multivariate regression problem. Moreover, more and more studies used ensemble methods to improve the accuracy. proposed a newly ensemble approach, namely rotation forest, which combines 30 machine learning methods. proposed a machine learning method, which changed the SVM prediction rules.

Machine learning methods are widely used in predicting diabetes, and they get preferable results. Decision tree is one of popular machine learning methods in medical field, which has grateful classification power. Random forest generates many decision trees. Neural network is a recently popular machine learning method, which has a better performance in many aspects. So in this study, we used decision tree, random forest (RF) and neural network to predict the diabetes.

Data

The dataset was obtained from hospital physical examination data in Luzhou, China. This dataset is divided two parts: the healthy people and the diabetes. There are two healthy people physical examination data. We used one of healthy people physical examination data that contains 164431 instances as the training set. In the other data set, 13700 samples were randomly selected as an independent test set. The physical data include 14 physical examination indexes: age, pulse rate, breathe, left systolic pressure (LSP), right systolic pressure (RSP), left diastolic pressure (LDP), right diastolic pressure (RDP), height, weight, physique index, fasting glucose, waistline, low density lipoprotein (LDL), and high density lipoprotein (HDL). In the training dataset, there are many missing data. We deleted the abnormal and missing samples to reduce the impact of data processing on result. Consequently, we got 151598 diabetic physical data and 69082 healthy people physical data. So, we randomly selected 68994 healthy people and diabetic patients’ data, respectively as training set. Due to the data unbalance, we randomly extracted 5 times. The final result was the mean value of 5 experiments. The 13,700 patients physical examination data, which were randomly selected as the independent test set, were different from the previous five sets which were used as training set.

Another dataset is Pima Indians diabetics data. In particular, all patients are females at least 21 years old of Pima Indian heritage. The dataset contains 8 attributes which are times of pregnancy, plasma glucose concentration after an 2-h oral glucose tolerance test, diastolic blood pressure, triceps skin fold thickness, 2-h serum insulin, body mass index, diabetes pedigree function and age. In this dataset, the original 786 diabetics data reduces to 392 after deleted the missing data.

Classification

In this section, we used decision tree, RF and neural network as the classifiers. Decision tree and RF can implement in WEKA, which is a free, non-commercial, open source machine learning and data mining software based on JAVA environment. Neural network can be implemented in MATLAB, which is a commercial mathematics software exploited by MathWorks, Inc. It is used for algorithmic development, data visualization, data analysis and provides advanced computational language, and interactive environment for numerical calculation.

Decision Tree

Decision tree is a basic classification and regression method. Decision tree model has a tree structure, which can describe the process of classification instances based on features. It can be considered as a set of if-then rules, which also can be thought of as conditional probability distributions defined in feature space and class space.

Decision tree uses tree structure and the tree begins with a single node representing the training samples. If the samples are all in the same class, the node becomes the leaf and the class marks it. Otherwise, the algorithm chooses the discriminatory attribute as the current node of the decision tree. According to the value of the current decision node attribute, the training samples are divided into serval subsets, each of which forms a branch, and there are serval values that form serval branches. For each subset or branch obtained in the previous step, the previous steps are repeated, recursively forming a decision tree on each of the partitioned samples.

The typical algorithms of decision tree are ID3, C4.5, CART and so on. In this study, we used the J48 decision tree in WEKA. J48 another name is C4.8, which is an upgrade of C4.5. J48 is a top-down, recursive divide and conquer strategy. This method selects an attribute to be root node, generates a branch for each possible attribute value, divides the instance into multiple subsets, and each subset corresponds to a branch of the root node, and then repeats the process recursively on each branch. When all instances have the same classification, the algorithm stop. In J48, the nodes are decided by information gain. According to the following formulas, in each iteration, J48 calculates the information gain of each attribute, and selects the attribute with the largest value of information gain as the node of this iteration.

Attribute A information gain:

Pre-segmentation information entropy:

Distributed information entropy:

Random Forest

RF is a classification by using many decision trees. This algorithm proposed by Breiman. RF is a multifunctional machine learning method. It can perform the tasks of prediction and regression. In addition, RF is based on Bagging and it plays an important role in ensemble machine learning. RF has been employed in several biomedicine research.

RF generates many decision trees, which is very different from decision tree algorithm. When the RF is predicting a new object based on some attributes, each tree in RF will give its own classification result and ‘vote,’ and then the overall output of the forest will be the largest number of taxonomy. In the regression problem, the RF output is the average value of output of all decision trees.

Neural Network

Neural network is a math model, which imitates the animal’s neural network behaviors. This model depends on the complexity of the system to achieve the purpose of processing information by adjusting the relationship between the internal nodes. According to the connections’ style, the neural network model can be divided into forward network and feedback network. In this paper, we used the Neural Pattern Recognition app in MATLAB, which is a two-layer-feed-back network with sigmoid hidden and softmax output neurons. The neural network structural is shown in (Figure 1).

In neural network, there are some important parts, namely input layer, hidden layer and output layer. The input layer is responsible for accepting input data. We can get the results from the output layer. The layer between the input layer and the output layer is called hidden layer. Because they are invisible to the outside. There is no connection between neurons on the same layer. In this network, the number of hidden layers set to 10, which can get a better performance. We suppose the input vector is, the weight vector is, and the activation function is a sigmoid function, then the output is:

and the sigmoid is:

Model Validation

In many studies, authors often used two validation methods, namely hold-out method and k-fold cross validation method, to evaluate the capability of the model. According to the goal of each problem and the size of data, we can choose different methods to solve the problem. In hold-out method, the dataset is divided two parts, training set and test set. The training set is used to train the machine learning algorithm and the test set is used to evaluate the model. The training set is different from test set. In this study, we used this method to verity the universal applicability of the methods. In k-fold cross validation method, the whole dataset is used to train and test the classifier. First, the dataset is average divided into k sections, which called folds. In training process, the method uses the k-1 folds to training the model and onefold is used to test. This process will be repeat k times, and each fold has the chance to be the test set. The final result is the average of all the tests performance of all folds. The advantage of this method is the whole samples in the dataset are trained and tested, which can avoid the higher variance. In this study, we used the five-fold cross validation method.

Feature Selection

Feature selection methods can reduce the number of attributes, which can avoid the redundant features. There are many feature selection methods. In this study, we used PCA and minimum redundancy maximum relevance (mRMR) to reduce the dimensionality.

Principal Component Analysis

PCA obtains the K vectors and unit eigenvectors by solving the characteristic equation of the correlation matrix of the observed variables. The eigenvalues are sorted from large to small, representing the variance of the observed variables explained by K principal components, respectively.

The model for extracting principal component factors is:

where, Fi is the i principal component factor; Tij is the load of the i principal component factor on the j index; m is the number of principal component factors; k is the number of indicators.

The PCA method can reduce the original multiple indicators to one or more comprehensive indicators. This small number of comprehensive indicators can reflect the vast majority of the information reflected by the original indicators, and they are not related to each other, and they can avoid the repeated information. At the same time, the reduction of indicators facilitates further calculation, analysis and evaluation.

We used Statistical Product and Service Solutions (SPSS) to implement the PCA algorithm. SPSS is a general term for a series of software products and related services launched by IBM. It is mainly used for statistical analysis, data mining, predictive analysis and other tasks. SPSS has a friendly visual interface and is easy to operate.

Minimum Redundancy Maximum Relevance

mRMR ensures the features have the max Euclidean distances, or their pairwise have the minimized correlations. Minimum redundancy standards are usually supplemented by the largest relevant standards, such as maximum mutual information and target phenotypes. Two ways can achieve the benefits. First, with the same number of features, mRMR feature set can have a more representative target phenotype for better generalization. Secondly, we can use a smaller mRMR feature set to effectively cover the same space made by a larger regular feature set. For individual categorical variables, the similarity level between each feature is measured by using mutual information. Minimum redundancy is the choice to have the most different features. Similar to mRMR, researchers also developed Maximum Relevance Maximum Distance (MRMD) for features ranking. And they were employed in several biomedicine researches.

Measurement

In this study, we used sensitivity (SN), specificity (SP), accuracy (ACC), and Matthews correlation coefficient (MCC) to measure the classified effectiveness. And the formulas are as follow:

where true positive represents (TP) the number of identified positive samples in the positive set. True negative (TP) means the number of classification negative samples in the negative set. False positive (FP) is the number of the number of identified positive samples in the negative set. And false negative (FN) represents the number of identified negative samples in the positive set. It is often used to evaluate the quality of classification models. The accuracy is defined as the ratio of the number of samples correctly classified by the classifier to the total number of samples. In medical statistics, there are two basic characteristics, sensitivity (SN) and specificity (SP). Sensitivity is the true positive rate, and specificity is the true negative rate. The MCC is a correlation coefficient between the actual classification and the predicted classification. Its value range is [-1, 1]. When the MCC equals one, it indicates a perfect prediction for the subject. When the MCC value is 0, it indicates the predicted result is not as good as the result of random prediction, and -1 means that the predicted classification is completely inconsistent with the actual classification.

Results and Discussion

In the tables, we used Luzhou to represent the dataset from hospital physical examination data in Luzhou, China and Pima Indians represents the Pima Indians diabetics data. The two datasets contain 14 and 8 attributes, respectively.

For better comparison, firstly, we used all features for predicting diabetes. And the results are shown in Table 1.

Through the Table 1, we can get better results. In addition, RF has the best result among the three classifiers when the dataset is Luzhou physical examination. When the dataset is Pima Indians, random forest has similar effects to neural networks. And the decision tree structure of Luzhou dataset is shown in Figure 2, the decision tree structure of Pima Indians dataset is shown in Figure 3. According to Figures 2, 3, we can find the root node is glucose, which can show the glucose has the max information gain, so it confirm the common sense and the clinical diagnosis basis. But there are diabetic patients whose fasting blood glucose is less than 6.8 in Luzhou dataset, we considered the reason maybe they injected insulin before the physical examination to control blood sugar levels.

According to consulting relevant information, we know there are three indicators to determination the diabetes mellitus, which are fasting blood glucose, random blood glucose and blood glucose tolerance. Because the data only has fasting blood glucose in Luzhou dataset and the Pima Indians dataset only has blood glucose tolerance, we used fasting blood glucose and blood glucose tolerance to prediction, respectively. And the results are shown in Table 2.

According to the Table 2, we found in Luzhou dataset J48 has a better performance than the others do, and the accuracy is above 0.76. In the Pima Indians dataset, only using blood glucose tolerance is not good.

Then, we used mRMR to select features. We get the score of each feature. According to the matrix, we chose the first five features, which are height, HDL, fasting glucose, breathe, and LDL, to predict diabetes using Luzhou dataset and select the first three attributes, which are glucose, 2-h serum insulin and age, to predict the Pima Indians dataset. The results are shown in Table 3.

When we use the Luzhou dataset, J48 has the best performance. But the results are not better than using all features. In the Pima Indians dataset, this method, which used RF as the classifier, has the best performance.

Then we used PCA to reduce the features. Because height and weight are related to physical index, we did not use height and weight to using PCA in Luzhou dataset. We used SPSS to analyzing the factors. According to the KMO and Bartlett test, the two datasets can use PCA to reduce the features. And we can get the composition matrix and eigenvalues. According to the composition matrix and total variance interpretation, we can get the new five features for Luzhou dataset and three features for Pima Indians dataset. We use the new features to conduct experiment, and the results are shown in Table 4.

The ACC of Luzhou dataset is less than the above methods. The results show PCA is not suitable for this data. For Pima Indians dataset, the accuracy is better than only use glucose. In this second, neural network has the best performance for predicting diabetes.

In order to explore the importance of other indexes in predicting diabetes, we designed the following experiments by using Luzhou dataset. Firstly, we used the all features without blood glucose to predict diabetes, and the results are shown in Table 5.

And then, we deleted the blood glucose, LDL and HDL which need to go to the hospital for testing data. So there are 11 features in this experiment, and the results are shown in Table 6.

According to the Tables 5, 6, we found the RF is able to predict better diabetes. Although the accuracy is not the best, we can use the prediction as a reference.

According to the above experiments, we summarized the above results and get Figures 4, 5, which can more clearly demonstrate the accuracy of each method in order to make a better comparison.

From the Figures 4, 5, we can find PCA is not very suitable to the two dataset. And using all features has a good performance, especially for the Luzhou dataset. There is not much difference among random forest, decision tree and neural network when the feature set contains blood glucose. When we used the features without blood glucose, random forest has the best performance. But relatively speaking, the neural network performs poorly.

According to the Figure 4, we selected several methods that performed better and conducted independent testing experiments by using Luzhou dataset. So we chose three methods (all features, mRMR and blood glucose) to conduct independent test experiments. The results are shown in Table 7.

According to Table 7, we found the method using all features still has a better result. And the method only using blood glucose is not good, especially using neural network as classifier. The reason for this result may be that the blood glucose contains too little information.

Because Luzhou dataset is collected by ourselves, it is unable to use this data for comparison experiments. In order to compare with the methods in other papers, we used Pima Indians dataset for 10-fold cross validation experiments. The results are shown in Table 8.

Conclusion

Diabetes mellitus is a disease, which can cause many complications. How to exactly predict and diagnose this disease by using machine learning is worthy studying. According to the all above experiments, we found the accuracy of using PCA is not good, and the results of using the all features and using mRMR have better results. The result, which only used fasting glucose, has a better performance especially in Luzhou dataset. It means that the fasting glucose is the most important index for predict, but only using fasting glucose cannot achieve the best result, so if want to predict accurately, we need more indexes. In addition, by comparing the results of three classifications, we can find there is not much difference among random forest, decision tree and neural network, but random forests are obviously better than the another classifiers in some methods. The best result for Luzhou dataset is 0.8084, and the best performance for Pima Indians is 0.7721, which can indicate machine learning can be used for prediction diabetes, but finding suitable attributes, classifier and data mining method are very important. Due to the data, we cannot predict the type of diabetes, so in future we aim to predicting type of diabetes and exploring the proportion of each indicator, which may improve the accuracy of predicting diabetes. We uploaded the Pima Indians dataset in http://121.42.167.206/PIMAINDIANS/data.html.

Author Contributions

QZ designed the experiments. KQ and YL performed the experiments. KQ wrote the paper. DY and YJ analyzed the data. HT provided the data.

Conflict of Interest Statement

The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.

References 59

  1. 1.
  2. 2.

    American Diabetes Association (2012 ). Diagnosis and classification of diabetes mellitus. Diabetes Care 35(Suppl. 1), S64–S71.

    Not in our library10.2337/dc12-s064

  3. 3.

    Bengio Y. Grandvalet Y. (2005 ). Bias in Estimating the Variance of K -Fold Cross-Validation. New York, NY: Springer, 75–95.

    Not in our library10.1007/0-387-24555-3_5

  4. 4.

    Breiman L. (2001 ). Random forest. Mach. Learn. 45 5–32.

    Not in our library10.1023/a:1010933404324

  5. 5.

    Chen X. X. Tang H. Li W. C. Wu H. Chen W. Ding H. (2016 ). Identification of bacterial cell wall lyases via pseudo amino acid composition. Biomed. Res. Int. 2016:1654623.

    Not in our library10.1155/2016/1654623

  6. 6.

    Cox M. E. Edelman D. (2009 ). Tests for screening and diagnosis of type 2 diabetes. Clin. Diabetes 27 132–138.

    Not in our library10.2337/diaclin.27.4.132

  7. 7.

    Duygu ç. Esin D. (2011 ). An automatic diabetes diagnosis system based on LDA-wavelet support vector machine classifier. Expert Syst. Appl. 38 8311–8315. 17138215

    Not in our library

  8. 8.

    Friedl M. A. Brodley C. E. (1997 ). Decision tree classification of land cover from remotely sensed data. Remote Sens. Environ. 61 399–409. 24310365

    Not in our library

  9. 9.

    Georga E. I. Protopappas V. C. Ardigo D. Marina M. Zavaroni I. Polyzos D. (2013 ). Multivariate prediction of subcutaneous glucose concentration in type 1 diabetes patients based on support vector regression. IEEE J. Biomed. Health Inform. 17 71–81.

    Not in our library10.1109/titb.2012.2219876

  10. 10.

    Habibi S. Ahmadi M. Alizadeh S. (2015 ). Type 2 diabetes mellitus screening and risk factors using decision tree: results of data mining. Glob. J. Health Sci. 7 304–310.

    Not in our library10.5539/gjhs.v7n5p304

  11. 11.

    Han L. Luo S. Yu J. Pan L. Chen S. (2015 ). Rule extraction from support vector machines using ensemble learning approach: an application for diagnosis of diabetes. IEEE J. Biomed. Health Inform. 19 728–734.

    Not in our library10.1109/jbhi.2014.2325615

  12. 12.

    Iancu I. Mota M. Iancu E. (2008 ). “Method for the analysing of blood glucose dynamics in diabetes mellitus patients,” in Proceedings of the 2008 IEEE International Conference on Automation, Quality and Testing, Robotics, Cluj-Napoca

    Not in our library10.1109/aqtr.2008.4588883

  13. 13.

    Jackson D. A. (1993 ). Stopping rules in principal components analysis: a comparison of heuristical and statistical approaches. Ecology 74 2204–2214.

    Not in our library10.2307/1939574

  14. 14.

    Jegan C. (2014 ). Classification of diabetes disease using support vector machine. Microcomput. Dev. 3 1797–1801.

    Not in our library

  15. 15.

    Jia C. Zuo Y. Zou Q. (2018 ). O-GlcNAcPRED-II: an integrated classification algorithm for identifying O-GlcNAcylation sites based on fuzzy undersampling and a K-means PCA oversampling technique. Bioinformatics 34 2029–2036.

    Not in our library10.1093/bioinformatics/bty039

  16. 16.

    Jiang Y. Zhou Z. H. (2004 ). Editing training data for kNN classifiers with neural network ensemble. Lect. Notes Comput. Sci. 3173 356–361.

    Not in our library10.1007/978-3-540-28647-9_60

  17. 17.

    Jolliffe I. T. (1998 ). “Principal components analysis,” in Proceedings of the International Conference on Document Analysis and Recognition (Heidelberg: Springer).

    Not in our library

  18. 18.
  19. 19.

    Kim J. H. (2009 ). Estimating classification error rate: repeated cross-validation, repeated hold-out and bootstrap. Comput. Stat. Data Anal. 53 3735–3745.

    Not in our library10.1016/j.csda.2009.04.009

  20. 20.

    Kohabi R. (1996 ). “Scaling up the accuracy of naive-bayes classifiers: a decision-tree hybrid,” in Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, Portland, OR.

    Not in our library

  21. 21.

    Kohavi R. (1995 ). “A study of cross-validation and bootstrap for accuracy estimation and model selection,” in Proceedings of the 14th International Joint Conference on Artificial Intelligence, Montreal.

    Not in our library

  22. 22.

    Krasteva A. Panov V. Krasteva A. Kisselova A. Krastev Z. (2011 ). Oral cavity and systemic diseases—Diabetes Mellitus. Biotechnol. Biotechnol. Equip. 25 2183–2186.

    Not in our library10.5504/bbeq.2011.0022

  23. 23.

    Lee B. J. Kim J. Y. (2016 ). Identification of type 2 diabetes risk factors using phenotypes consisting of anthropometry and triglycerides based on machine learning. IEEE J. Biomed. Health Inform. 20 39–46.

    Not in our library10.1109/jbhi.2015.2396520

  24. 24.

    Li B. Q. Zheng L. L. Feng K. Y. Hu L. L. Huang G. H. Chen L. (2016 ). Prediction of linear B-cell epitopes with mRMR feature selection and analysis. Curr. Bioinform. 11 22–31.

    Not in our library10.2174/1574893611666151119215131

  25. 25.

    Liao Z. Ju Y. Zou Q. (2016 ). Prediction of G protein-coupled receptors with SVM-Prot features and random forest. Scientifica 2016:8309253.

    Not in our library10.1155/2016/8309253

  26. 26.

    Liao Z. J. Wan S. He Y. Zou Q. (2018 ). Classification of small GTPases with hybrid protein features and advanced machine learning techniques. Curr. Bioinform. 13 492–500.

    Not in our library10.2174/1574893612666171121162552

  27. 27.

    Liaw A. Wiener M. (2002 ). Classification and regression by randomforest. R. News 2 18–22.

    Not in our library

  28. 28.

    Lin C. Chen W. Qiu C. Wu Y. Krishnan S. Zou Q. (2014 ). LibD3C: ensemble classifiers with a clustering and dynamic selection strategy. Neurocomputing 123 424–435.

    Not in our library10.1016/j.neucom.2013.08.004

  29. 29.

    Lonappan A. Bindu G. Thomas V. Jacob J. Rajasekaran C. Mathew K. T. (2007 ). Diagnosis of diabetes mellitus using microwaves. J. Electromagnet. Wave. 21 1393–1401.

    Not in our library10.1163/156939307783239429

  30. 30.

    Mukai Y. Tanaka H. Yoshizawa M. Oura O. Sasaki T. Ikeda M. (2012 ). A computational identification method for GPI-anchored proteins by artificial neural network. Curr. Bioinform. 7 125–131.

    Not in our library10.2174/157489312800604390

  31. 31.

    Ozcift A. Gulten A. (2011 ). Classifier ensemble construction with rotation forest to improve medical diagnosis performance of machine learning algorithms. Comput. Methods Programs Biomed. 104 443–451.

    Not in our library10.1016/j.cmpb.2011.03.018

  32. 32.

    Pal M. (2005 ). Random forest classifier for remote sensing classification. Int. J. Remote Sens. 26 217–222.

    Not in our library10.1080/01431160412331269698

  33. 33.

    Polat K. Günes S. (2007 ). An expert system approach based on principal component analysis and adaptive neuro-fuzzy inference system to diagnosis of diabetes disease. Digit. Signal Process. 17 702–710.

    Not in our library10.1016/j.dsp.2006.09.005

  34. 34.

    Polat K. Kodaz H. (2005 ). “The medical applications of attribute weighted artificial immune system (AWAIS): diagnosis of heart and diabetes diseases,” in Proceedings of the 4th International Conference on Artificial Immune Systems, Banff.

    Not in our library

  35. 35.

    Quinlan J. R. (1986 ). Induction on decision tree. Mach. Learn. 1 81–106.

    Not in our library10.1007/bf00116251

  36. 36.

    Quinlan J. R. (1996a ). “Bagging, boosting, and C4.5,” in Proceedings of the Thirteenth National Conference on Artificial Intelligence (Menlo Park, CA: AAAI Press), 725–730.

    Not in our library

  37. 37.

    Quinlan J. R. (1996b ). Improved use of continuous attributes in C4.5. J. Artif. Intell. Res. 4 77–90.

    Not in our library10.1613/jair.279

  38. 38.

    Razavian N. Blecker S. Schmidt A. M. Smith-McLallen A. Nigam S. Sontag D. (2015 ). Population-level prediction of type 2 diabetes from claims data and analysis of risk factors. Big Data 3 277–287.

    Not in our library10.1089/big.2015.0020

  39. 39.

    Refaeilzadeh P. Tang L. Liu H. (2016 ). “Cross-validation,” in Encyclopedia of Database Systems, eds Liu L. TÖzsu M. (New York, NY: Springer), 532–538.

    Not in our library

  40. 40.

    Robertson G. Lehmann E. D. Sandham W. Hamilton D. (2011 ). Blood glucose prediction using artificial neural networks trained with the AIDA diabetes simulator: a proof-of-concept pilot study. J. Electr. Comput. Eng. 2011:681786

    Not in our library10.1155/2011/681786

  41. 41.

    Sakar C. O. Kursun O. Gurgen F. (2012 ). A feature selection method based on kernel canonical correlation analysis and the minimum redundancy-maximum relevance filter method. Expert Syst. Appl. 39 3432–3437.

    Not in our library10.1016/j.eswa.2011.09.031

  42. 42.

    Salzberg S. L. (1994 ). C4.5: programs for machine learning by J. Ross Quinlan. Morgan Kaufmann publishers, Inc., 1993. Mach. Learn. 16 235–240.

    Not in our library

  43. 43.

    Sharma S. Agrawal J. Sharma S. (2014 ). classification through machine learning technique: C4. 5 algorithm based on various entropies. Int. J. Comput. Appl. 82 28–32.

    Not in our library

  44. 44.

    Smith L. I. (2002 ). A tutorial on principal components analysis. Inform. Fusion 51:52.

    Not in our library

  45. 45.

    Su Z. D. Huang Y. Zhang Z. Y. Zhao Y. W. Wang D. Chen W. (2018 ). iLoc-lncRNA: predict the subcellular location of lncRNAs by incorporating octamer composition into general PseKNC. Bioinformatics [Epub ahead of print].

    Not in our library10.1093/bioinformatics/bty508

  46. 46.

    Svetnik V. Liaw A. Tong C. Culberson J. C. Sheridan R. P. Feuston B. P. (2015 ). Random forest: a classification and regression tool for compound classification and QSAR modeling. J. Chem. Inform. Comput. Sci. 43 1947–1958.

    Not in our library10.1021/ci034160g

  47. 47.

    Tang H. Zhao Y. W. Zou P. Zhang C. M. Chen R. Huang P. (2018 ). HBPred: a tool to identify growth hormone-binding proteins. Int. J. Biol. Sci. 14 957–964.

    Not in our library10.7150/ijbs.24174

  48. 48.

    Tang W. Wan S. Yang Z. Teschendorff A. E. Zou Q. (2018 ). Tumor origin detection with tissue-specific miRNA and DNA methylation markers. Bioinformatics 34 398–406.

    Not in our library10.1093/bioinformatics/btx622

  49. 49.

    Wang S. P. Zhang Q. Lu J. Cai Y. D. (2018 ). Analysis and prediction of nitrated tyrosine sites with the mRMR method and support vector machine algorithm. Curr. Bioinform. 13 3–13.

    Not in our library10.2174/1574893611666160608075753

  50. 50.

    Wang X. Paliwal K. K. (2003 ). Feature extraction and dimensionality reduction algorithms and their applications in vowel recognition. Pattern Recogn. 36 2429–2439.

    Not in our library10.1016/s0031-3203(03)00044-x

  51. 51.

    Watkins A. B. Boggess L. (2002 ). “A resource limited artificial immune classifier,” in Proceedings of the 2002 Congress on Evolutionary Computation (CEC2002) (Honolulu, HI: IEEE Press), 926–931.

    Not in our library10.1109/cec.2002.1007049

  52. 52.

    Wei L. Xing P. Shi G. Ji Z. L. Zou Q. (2018 ). Fast prediction of protein methylation sites using a sequence-based feature selection technique. IEEE/ACM Trans. Comput. Biol. Bioinform. [Epub ahead of print].

    Not in our library10.1109/tcbb.2017.2670558

  53. 53.

    Yang H. Qiu W. R. Liu G. Guo F. B. Chen W. Chou K. C. (2018 ). iRSpot-Pse6NC: identifying recombination spots in Saccharomyces cerevisiae by incorporating hexamer composition into general PseKNC. Int. J. Biol. Sci. 14 883–891.

    Not in our library10.7150/ijbs.24616

  54. 54.

    Yang H. Tang H. Chen X. X. Zhang C. J. Zhu P. P. Ding H. (2016 ). Identification of secretory proteins in Mycobacterium tuberculosis using pseudo amino acid composition. Biomed. Res. Int. 2016:5413903.

    Not in our library10.1155/2016/5413903

  55. 55.

    You Y. Cai H. M. Chen J. Z. (2018 ). Low rank representation and its application in bioinformatics. Curr. Bioinform. 13 508–517.

    Not in our library10.2174/1574893612666171121155347

  56. 56.

    Yue C. Xin L. Kewen X. Chang S. (2008 ). “An intelligent diagnosis to type 2 diabetes based on QPSO algorithm and WLS-SVM,” in Proceedings of the 2008 IEEE International Symposium on Intelligent Information Technology Application Workshops, Washington, DC

    Not in our library10.1109/iita.workshops.2008.36

  57. 57.

    Zhao X. Zou Q. Liu B. Liu X. (2014 ). Exploratory predicting protein folding model with random forest and hybrid features. Curr. Proteom. 11 289–299.

    Not in our library10.2174/157016461104150121115154

  58. 58.
  59. 59.

    Zou Q. Zeng J. Cao L. Ji R. (2016b ). A novel features ranking metric with application to scalable visual and bioinformatics data classification. Neurocomputing 173 346–354.

    Not in our library10.1016/j.neucom.2014.12.123

Cited by papers we hold 6

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.