Dataset Information

Diagnostic performance of classification trees and hematological functions in hematologic disorders: an application of multidimensional scaling and cluster analysis

ABSTRACT:

Background

Several hematological indices have been already proposed to discriminate between iron deficiency anemia (IDA) and β‐thalassemia trait (βTT). This study compared the diagnostic performance of different hematological discrimination indices with decision trees and support vector machines, so as to discriminate IDA from βTT using multidimensional scaling and cluster analysis. In addition, decision trees were used to determine the diagnostic classification scheme of patients.

Methods

Consisting of 1178 patients with hypochromic microcytic anemia (708 patients with βTT and 470 patients with IDA), this cross-sectional study compared the diagnostic performance of 43 hematological discrimination indices with classification tree algorithms and support vector machines in order to discriminate IDA from βTT. Moreover, multidimensional scaling and cluster analysis were used to identify the homogeneous subgroups of discrimination methods with similar performance.

Results

All the classification tree algorithms except the LOTUS tree algorithm showed acceptable accuracy measures for discrimination between IDA and βTT in comparison with other hematological discrimination indices. The results indicated that the CRUISE and C5.0 tree algorithms had better diagnostic performance and efficiency among other discrimination methods. Moreover, the AUC of CRUISE and C5.0 tree algorithms indicated more precise classification with values of 0.940 and 0.999, indicating excellent diagnostic accuracy of such models. Moreover, the CRUISE and C5.0 tree algorithms showed that mean corpuscular volume can be considered as the main variable in discrimination between IDA and βTT.

Conclusions

CRUISE and C5.0 tree algorithms as powerful methods in data mining techniques can be used to develop accurate differential methods along with other laboratory parameters for the discrimination of IDA and βTT. In addition, the multidimensional scaling method and cluster analysis can be considered as the most appropriate techniques to determine the discrimination indices with similar performance for future hematological studies.

Supplementary Information

The online version contains supplementary material available at 10.1186/s12911-021-01678-5.

SUBMITTER: Rahim F

PROVIDER: S-EPMC8579574 | biostudies-literature |

REPOSITORIES: biostudies-literature

ACCESS DATA

Similar Datasets

Project description:BackgroundMulti-dimensional scaling (MDS) is aimed to represent high dimensional data in a low dimensional space with preservation of the similarities between data points. This reduction in dimensionality is crucial for analyzing and revealing the genuine structure hidden in the data. For noisy data, dimension reduction can effectively reduce the effect of noise on the embedded structure. For large data set, dimension reduction can effectively reduce information retrieval complexity. Thus, MDS techniques are used in many applications of data mining and gene network research. However, although there have been a number of studies that applied MDS techniques to genomics research, the number of analyzed data points was restricted by the high computational complexity of MDS. In general, a non-metric MDS method is faster than a metric MDS, but it does not preserve the true relationships. The computational complexity of most metric MDS methods is over O(N2), so that it is difficult to process a data set of a large number of genes N, such as in the case of whole genome microarray data.ResultsWe developed a new rapid metric MDS method with a low computational complexity, making metric MDS applicable for large data sets. Computer simulation showed that the new method of split-and-combine MDS (SC-MDS) is fast, accurate and efficient. Our empirical studies using microarray data on the yeast cell cycle showed that the performance of K-means in the reduced dimensional space is similar to or slightly better than that of K-means in the original space, but about three times faster to obtain the clustering results. Our clustering results using SC-MDS are more stable than those in the original space. Hence, the proposed SC-MDS is useful for analyzing whole genome data.ConclusionOur new method reduces the computational complexity from O(N3) to O(N) when the dimension of the feature space is far less than the number of genes N, and it successfully reconstructs the low dimensional representation as does the classical MDS. Its performance depends on the grouping method and the minimal number of the intersection points between groups. Feasible methods for grouping methods are suggested; each group must contain both neighboring and far apart data points. Our method can represent high dimensional large data set in a low dimensional space not only efficiently but also effectively.