Research Article  Open Access
Jae Kwon Kim, Mun Joo Choi, Jong Sik Lee, Jun Hyuk Hong, ChoungSoo Kim, Seong Il Seo, Chang Wook Jeong, SeokSoo Byun, Kyo Chul Koo, Byung Ha Chung, Yong Hyun Park, Ji Youl Lee, In Young Choi, "A Deep Belief Network and DempsterShaferBased Multiclassifier for the Pathology Stage of Prostate Cancer", Journal of Healthcare Engineering, vol. 2018, Article ID 4651582, 8 pages, 2018. https://doi.org/10.1155/2018/4651582
A Deep Belief Network and DempsterShaferBased Multiclassifier for the Pathology Stage of Prostate Cancer
Abstract
Object. Pathologic prediction of prostate cancer can be made by predicting the patient’s prostate metastasis prior to surgery based on biopsy information. Because biopsy variables associated with pathology have uncertainty regarding individual patient differences, a method for classification according to these variables is needed. Method. We propose a deep belief network and DempsterShafer (DBNDS) based multiclassifier for the pathologic prediction of prostate cancer. The DBNDS learns prostatespecific antigen (PSA), Gleason score, and clinical T stage variable information using three DBNs. Uncertainty regarding the predicted output was removed from the DBN and combined with information from DS to make a correct decision. Result. The new method was validated on pathology data from 6342 patients with prostate cancer. The pathology stages consisted of organconfined disease (OCD; 3892 patients) and nonorganconfined disease (NOCD; 2453 patients). The results showed that the accuracy of the proposed DBNDS was 81.27%, which is higher than the 64.14% of the Partin table. Conclusion. The proposed DBNDS is more effective than other methods in predicting pathology stage. The performance is high because of the linear combination using the results of pathologyrelated features. The proposed method may be effective in decision support for prostate cancer treatment.
1. Introduction
Prostate cancer is the most common cancer in men, with around 1.1 million cases diagnosed and approximately 309,000 deaths in men worldwide in 2012 [1]. It is estimated that 40–50% of men may also have potentially extraprostatic disease [2].
Carcinectomy and radiotherapy are the typical treatments for prostate cancer [3]. The choice of treatment for prostate cancer requires extensive experience and analysis of treatment cases. Pathological staging is the process of predicting the likelihood of prostate cancer disease spreading in a patient prior to treatment. The clinical stage evaluation is based on data gathered from clinical tests that are available prior to treatment or the surgical removal of the tumor. Cancer staging evaluation occurs both before and after the tumor is removed: the clinical and pathological stages, respectively [4]. Pathologic staging is determined after the removal of the tumor tissue and after surgery. This is more likely to be more accurate than clinical staging because it evaluates the direct nature of the disease. Therefore, the prediction of pathological stages using clinical data analysis is an important factor in the treatment of prostate cancer [5].
Pathologic staging prediction is very important because it provides physicians with optimal treatment and management strategies. For example, radical prostatectomy (RP), the surgical removal of the prostate gland, provides the best opportunity for cure when prostate cancer is localized and accurate prediction of the pathology stage can provide the most beneficial treatment approach [6–8]. Currently, Partin tables are used to predict the prognostic clinical outcome for prostate cancer, which are based on statistical methods such as logistic regression [9, 10]. The Partin tables use clinical test data including prostatespecific antigen (PSA) level, Gleason score, and clinical T stage to predict the pathology stage. While the Partin tables have been verified from 2001 to 2011, there are questions about their applicability to current patients following environmental changes [11]. Thus, a new classification method using machine learning is needed to provide an accurate prediction of the pathology stage [12].
Deep belief networks (DBN) are a deep learning technique and is an effective method for classification prediction [13, 14]. As DBN supports both unsupervised and supervised learning, it is possible to effectively learn about uncertain data relationships [15, 16]. Because PSA level, Gleason score, and clinical T stage for stage prediction have uncertainties in each patient, a combination of evidence for each variable is needed. The DempsterShafer theory (DS) is a technique used to fuse information based on trust values [17, 18]. The DS allows the combination of evidence from different sources to arrive at a degree of belief (represented by a mathematical object called a “belief function”) that considered all available evidence [19, 20]. This technique is a method for fusing information using a stochastic calculation method for belief values [21]. This allows fusion of the classification results of each variable to the pathology stage.
In this paper, we propose a DBNDSbased multiclassifier for pathologic stage prediction of prostate cancer. The proposed DBNDS uses patient PSA level, Gleason score, and clinical T stage and three DBNs to predict the pathology stage by combining the predicted information from the classifier. The classifiers are created by learning data according to features. When output values are generated using each learned DBN classifier, the final predicted result is provided by stochastically calculating the predicted output from each DBN classifier using DS. This paper is organized as follows: Section 2 presents the proposed technique and its process. Section 3 explains the experiments and presents their outcomes. Finally, Section 4 presents the conclusions.
2. Materials and Methods
2.1. Data Set
The study data comprised 6345 male patients extracted from the Korean Prostate Cancer Registry (KPCR) which is extended from Smart Prostate Cancer Data Base (SPCDB) at six tertiary medical centers in Korea [22]. The three input variables consist of initial PSA, Gleason score, TRUS volume, and clinical T stage. Two output variables consisting of pathologic T stage (pT2a, pT2b, pT3a, pT3b, and pT3c) and N stage (pN1) were used. The output variables are transformed using the guidelines of the American Joint Committee on Cancer (AJCC), which were used to identify the pathologic stage as organconfined disease (OCD; pT2+) or nonorganconfined disease (NOCD; pT3+ or N+) [23]. For the experiments, the data from the KPCR were divided into a training set 70% (4039 patients) and a validation set 30% (2306 patients).
2.2. Deep Belief Network
A deep belief network (DBN) is a generative graphical model or a type of deep neural network composed of multiple layers of latent variables, with connections between the layers but not between the units within each layer. The DBN is composed of restricted Boltzmann machine (RBM) layers. The learning method in the DBN is done by configuring the visible layer and hidden layer 1 into a single RBM. The DBN is composed of multiple layers of RBMs [24]. The RBMs consist of visible and hidden unit layers. Once learning is complete, hidden layers 1 and 2 are trained via the RBM by giving a new input as a value of the hidden layer 1. As such, learning is performed up to the last layer sequentially [25]. One classification technique using the DBN is back propagation, which is configured in the uppermost layer in the DBN [26]. This technique shows better results than an artificial neural network (ANN), which uses a connection intensity that is arbitrarily selected.
In this study, we constructed a classifier for three input and two output variables to construct a multiclassifier, as shown in Figure 1. We created one classifier for each variable. Our idea was to use multiclassifiers for each variable [27]. The purpose of this study was to make a linear combination of the predictions of the classifiers using DS [28]. Therefore, one variable must be converted into several input values. As PSA levels are continuous data, they were converted into binary numbers and configured as an input node. Because Gleason score and the clinical T stage are categorical data, they constitute an input node by constructing data in flag form.
2.3. DempsterShaferBased Information Fusion
DempsterShafer (DS) is a mathematical theory that deals with the uncertainty and inaccuracy problems presented by Arthur Dempster and Glenn Shafer [29]. The DS provides an effective method for establishing evidence intervals using belief and likelihood values for the data set. The DS can support the combination of information. As a result, it is possible to use a combination rule to set various information as an evidence value and to calculate the result of all the evidence [30].
The DS expresses the degree of certainty as a section and sets mutually exclusive hypotheses such as probability. The set of objects is called the environment and is denoted by θ. The θ can have several elements such as , and the number of subsets is . When θ has only one element, it is called an identification frame. A set of subsets is called a power set and is denoted by θ. The degree to which θ is supported by any evidence is called the basic probability assignment function (1). The is mapped to a probability value of 0 for an empty set, and the sum of is 1 for all subsets of θ (2).
Belief , which is the belief value for any hypothesis (hypnosis; belief in a hypothesis is constituted by the sum of the masses of all sets enclosed by subjective probabilities) by given evidence, as shown in
The degree of trust depends on the reliability of the given evidence and on the overall environmental impact; the ratio of the degree is expressed by e. where is a value between 0 and 1 and is true if and false if . The DS calculates the value of a new belief through the process of fusion between different evidence. Thus, the convergence between the evidence can be expressed as (5); if , then the convergence value of the two evidence is zero.
The DS expresses the confidence measure for as and the term as the interval. This interval is called the “evidential interval.” Plausibility means the extent to which the hypothesis is not negated based on evidence (empty period except for true and false intervals), which means the maximum likelihood of being trusted. has a range from 0 to 1 (true and false), can be defined as in (7) and has a value of [0,1]. Likewise, the likelihood values can express the process of fusion from multiple evidence as well as the fusion of belief values.
In this study, three output data predicted from a multiclassifier were fused and calculated. The calculation process using DS shown in the figure as DBN#1 (initial PSA) was set to , DBN#2 (Gleason score) was set to , and DBN#3 (clinical T stage) was set to . For the output data, the empty set of each of , , and is given by
As described above, , , and were obtained, and then is combined. The combination of is shown in
Next, the interval of the pass and fail of the evidential interval are summarized as
As described above, the evidential interval section is constructed for OCD and NOCD, and the higher probability value of OCD and NOCD was set as the final output value.
Uncertainty data processing is a critical issue in the data fusion process. The DS and the Bayesian methods were compared to deal with this uncertainty. Unlike Bayesian inference, DS can contribute different levels of information to each source. In addition, a popular approach to data fusion has been established; unlike the Bayesian method, reliability can be assigned to all subsets of a hypothetical group, making it possible to form distributions for all subsets [31].
3. Result
3.1. Dataset Description
The characteristics of the initial PSA variable in the OCD and NOCD groups are shown in Table 1. Among the 6345 men, the average PSA levels in the OCD and NOCD groups in the training set were 9.535 and 18.606 ng/mL, respectively. In general, the level in the OCD group was higher, and the validation set also shows a difference of 9.377 and 17.899 ng/mL in the OCD and NOCD groups, respectively. The difference in values between the training and validation sets was not large. Although a high number of patients were observed at maximum, this is not a problem for analysis because they were only a fraction of the outlier compared to the mean.

The Gleason scores in the OCD and NOCD groups are shown in Table 2. Patients with OCD had a high Gleason score of 6. The NOCD group had scores of 6 or more. The difference between the OCD and NOCD groups was significant. In the scores below 5, OCD is more distributed than NOCD, and even more than 9 patients showed more NOCD patients.

The clinical T stages in the OCD and NOCD groups are shown in Table 3. Most patients were T2+. T1a occurred only in patients with OCD. In addition, many patients that are distributed in OCD until T1+ and patients with T3+ belong to NOCD. Although all variables are bounded by OCD and NOCD, there are many patients who belong to the same distributions.

3.2. DBNDS Based Multiclassifier
The proposed DBN and DSbased multiclassifier is shown in Figure 2. The training set was first changed to binary form. The initial PSA values were expressed as nine binary numbers based on the highest value (440 ng/mL). The Gleason score was composed of nine flags ranging from 3 to 10. The clinical T stage consisted of eight flags from T1a to T3b. The binary data of each of these variables was learned by the DBN classifier; that is, the first DBN consisted of nine input nodes because it was the input data of the initial PSA binary data. The output nodes of all classifiers were composed of two so that OCD and NOCD could be calculated with probability. The DBN consisted of three RBM layers, with the number of nodes of each RBM the same as the number of input nodes. Unsupervised learning was performed 100 times in total, while supervised learning using back propagation was performed 1000 times. Finally, we calculated the probability of the output variables as DS and determined the final number of m_{4}(OCD) and m_{4}(NOCD) as the final outputs.
3.3. Experiments
To evaluate the DBNDSbased multiclassifier, the entire data set was divided into a 70% training set and a 30% testing set. The control groups included Decision Tree C4.5, naive Bayesian (NB), logistic regression (LR), back propagation (BP), support vector machine (SVM), random forest (RF), deep belief network, and Partin tables. The experiments compared the sensitivity, specificity, accuracy, and area under the curve (AUC) using confusion matrix [31] and receiver operating characteristics (ROC) curve analysis [32]. The experimental results of confusion matrix are shown in Table 4.

In general, the results from a training set are better than those of a validation set because of differences in dataset volumes. Sensitivity was defined as the probability of correctly matching NOCD. Because NOCD has less data than OCD, it is difficult to match. The proposed method has a 61.77% improved performance compared to those of the other models. In other words, the probability of matching NOCD is very important because it is a prediction of the risk of the pathology stage. Specificity was defined as the probability of correctly matching OCD. NB had the highest specificity, with 93.78%, but its sensitivity was low. The proposed method showed 93.56% higher performance than those of the other models. The accuracy was defined as the probability of predicting both NOCD and OCD. The proposed model had the highest accuracy, at 81.27%. The AUCs are shown in Figure 3 and Table 5.

The ROC curve has the highest DBNDS of 0.777. The error of all models was about 0.01, and the values were all 0.000, so the experimental results of the ROC curves were usable. The DBNDS predicted each of the three classifiers constructed for each variable separately and combined them into one. In this paper, we propose a new classification method for the classifier. The proposed method is based on the classification of two classifiers. In addition, as the DS computes probability, if one classifier predicts NOCD at a high number and the two classifiers predict a low number for OCD, then the NOCD is finally predicted based on the belief value of the DS algorithm.
Next, the DBNDS was evaluated. The result of the confusion matrix for DBNDS is shown in Table 6. In addition, the results of the ROC curve analysis are shown in Figure 4 and Table 7. DBN#1 learned the initial PSA. DBN#2 learned the Gleason score, while DBN#3 learned the clinical T stage.


Among the three variables, the initial PSA level had the highest prediction rate. The PSA level is closely related to pathologic stage and is the most important parameter in prostate cancer. Variables combined with PSA showed a high prediction rate. In other words, the reason for the high prediction rate was that the Gleason score and clinical T stage also affect the pathology. However, the combination of Gleason score and clinical T stage had a lower accuracy than that predicted by the initial PSA level alone. The two variables are uncertain because they are diagnosed according to the doctor’s experience. However, when combined with PSA level, the performance was much higher. In this study, we found that initial PSA was the most important predictor, and that the Gleason score and clinical T stage were also important predictors.
4. Discussion and Conclusion
Prediction models for pathology staging of prostate cancer are based on clinical tests and can be used to predict the spread of cancer. It is possible to diagnose cancer more precisely at the postoperative, pathological stage and to determine the degree of metastasis of prostate cancer.
We proposed a DBNDSbased multiclassifier approach to predict the pathologic stage of prostate cancer. The proposed method provides a predictive model to improve accuracy through deep learning and information fusion based on the relationship between data measured using clinical tests. The inputs include initial PSA level, Gleason scores, and clinical T stage variables. The output can be OCD or NOCD in pathological staging (pT). This approach was evaluated using an existing validated patient dataset that included 6345 patient records from the KPCR database, which collected data from six tertiary medical institutions.
The performance of the proposed DBNDS was compared with that of the NB, LR, BPN, SVM, RF, DBN, and Partin tables. The results showed that the proposed DBNDS had better sensitivity and accuracy than all other methods.
In a recent pathological staging methodology study, Cosma et al. [4] use a neurofuzzy model, with an approach similar to ours. The results also indicated that the neural networkfuzzybased computational intelligence learning approach is suitable for prostate cancer staging and exceeds the performance of the Partin tables. The neurofuzzy model and our proposed method aim to predict whether a patient has OCD (pT2) or NOCD (pT3+). All methods use the initial PSA level, Gleason scores, and clinical T stage to predict the pathologic stage of prostate cancer, but the DBNDS predicts more patient data than other studies. In addition, it is possible to learn more deeply through the DBNDS in order to improve the prediction performance in the existing DBN. The neurofuzzy model obtained an area under the curve (AUC) of 0.812, while the nomogram of the AJCC achieved an AUC of 0.582. Our proposed DBNDS achieved an AUC of 0.777, compared to 0.620 for the Partin tables. This result is similar to that reported by Cosma et al. [4], although different data sets were used for each study; however, they show a high consistency with the results of the present study.
Currently, the proposed DBNDS method is implemented as a research tool. Once the clinical evaluation is completed, the proposed tool will be developed as an easytouse clinical decision support system that can be accessed by clinicians.
Conflicts of Interest
The authors declare that they have no conflicts of interest.
Acknowledgments
This work was supported by the National Research Foundation of Korea (NRF) grant funded by the Korean Government (NRF2016R1A2B4015922).
References
 “International Agency for Research on Cancer—GLOBOCAN,” 2008, December 2017, http://globocan.iarc.fr/. View at: Google Scholar
 C. Pound, A. W. Partin, M. A. Eisenberger, D. W. Chan, J. D. Pearson, and P. C. Walsh, “Natural history of progression after PSA elevation following radical prostatectomy,” JAMA, vol. 281, no. 17, pp. 1591–1597, 1999. View at: Publisher Site  Google Scholar
 J. E. Oesterling, C. B. Brendler, J. I. Epstein, A. W. Kimball Jr, and P. C. Walsh, “Correlation of clinical stage, serum prostatic acid phosphatase and preoperative Gleason grade with final pathological stage in 275 patients with clinically localized adenocarcinoma of the prostate,” The Journal of Urology, vol. 138, no. 1, pp. 92–98, 1987. View at: Publisher Site  Google Scholar
 G. Cosma, G. Acampora, D. Brown, R. C. Rees, M. Khan, and A. G. Pockley, “Prediction of pathological stage in patients with prostate cancer: a neurofuzzy model,” PLoS One, vol. 11, no. 6, article e0155856, 2016. View at: Publisher Site  Google Scholar
 Y. Matsui, S. Egawa, C. Tsukayama et al., “Artificial neural network analysis for predicting pathological stage of clinically localized prostate cancer in the Japanese population,” Japanese Journal of Clinical Oncology, vol. 32, no. 12, pp. 530–535, 2002. View at: Publisher Site  Google Scholar
 J. Epstein, P. Walsh, M. Carmichael, and C. Brendler, “Pathologic and clinical findings to predict tumor extent of nonpalpable (stage T1 c) prostate cancer,” JAMA, vol. 271, no. 5, pp. 368–374, 1994. View at: Publisher Site  Google Scholar
 M. L. Blute, O. Nativ, H. Zincke, G. M. Farrow, T. Therneau, and M. M. Lieber, “Pattern of failure after radical retropubic prostatectomy for clinically and pathologically localized adenocarcinoma of the prostate: influence of tumor deoxyribonucleic acid ploidy,” The Journal of Urology, vol. 142, no. 5, pp. 1262–1265, 1989. View at: Publisher Site  Google Scholar
 J. I. Epstein, G. Pizov, and P. C. Walsh, “Correlation of pathologic findings with progression after radical retropubic prostatectomy,” Cancer, vol. 71, no. 11, pp. 3582–3593, 1993. View at: Publisher Site  Google Scholar
 A. W. Partin, M. W. Kattan, E. N. Subong et al., “Combination of prostatespecific antigen, clinical stage, and Gleason score to predict pathological stage of localized prostate cancer: a multiinstitutional update,” JAMA, vol. 277, no. 18, pp. 1445–1451, 1997. View at: Publisher Site  Google Scholar
 D. V. Makarov, B. J. Trock, E. B. Humphreys et al., “Updated nomogram to predict pathologic stage of prostate cancer given prostatespecific antigen level, clinical stage, and biopsy Gleason score (Partin tables) based on cases from 2000 to 2005,” Urology, vol. 69, no. 6, pp. 1095–1101, 2007. View at: Publisher Site  Google Scholar
 C. W. Tsao, C. Y. Liu, T. L. Cha et al., “Artificial neural network for predicting pathological stage of clinically localized prostate cancer in a Taiwanese population,” Journal of the Chinese Medical Association, vol. 77, no. 10, pp. 513–518, 2014. View at: Publisher Site  Google Scholar
 A. Tewari, C. Porter, J. Peabody et al., “Predictive modeling techniques in prostate cancer,” Molecular Urology, vol. 5, no. 4, pp. 147–152, 2001. View at: Publisher Site  Google Scholar
 Y. Guo, Y. Liu, A. Oerlemans, S. Lao, S. Wu, and M. S. Lew, “Deep learning for visual understanding: a review,” Neurocomputing, vol. 187, pp. 27–48, 2016. View at: Publisher Site  Google Scholar
 R. Salakhutdinov and G. E. Hinton, “Deep Boltzmann machines,” in Proceedings of the twelfth international conference on artificial intelligence and statistics, AIS TATS 2009, pp. 448–455, Clearwater Beach, FL, USA, 2009. View at: Google Scholar
 L. Honglak, G. Roger, R. Rajesh, and Y. N. Andrew, “Convolutional deep belief networks for scalable unsupervised learning of hierarchical representations,” in Proceedings of the 26th Annual International Conference on Machine Learning  ICML '09, pp. 609–616, Montreal, QC, Canada, 2009. View at: Publisher Site  Google Scholar
 H. Z. Wang, G. B. Wang, G. Q. Li, J. C. Peng, and Y. T. Liu, “Deep belief network based deterministic and probabilistic wind speed forecasting approach,” Applied Energy, vol. 182, pp. 80–93, 2016. View at: Publisher Site  Google Scholar
 R. R. Yager, “On the DempsterShafer framework and new combination rules,” Information Sciences, vol. 41, no. 2, pp. 93–137, 1987. View at: Publisher Site  Google Scholar
 V. Khatibi and G. A. Montazer, “A fuzzyevidential hybrid inference engine for coronary heart disease risk assessment,” Expert Systems with Applications, vol. 37, no. 12, pp. 8536–8542, 2010. View at: Publisher Site  Google Scholar
 A. P. Dempster, “Upper and lower probabilities induced by a multivalued mapping,” The Annals of Mathematical Statistics, vol. 38, no. 2, pp. 325–339, 1967. View at: Publisher Site  Google Scholar
 G. Shafer and R. Logan, “Implementing Dempster’s rule for hierarchical evidence,” Artificial Intelligence, vol. 33, no. 3, pp. 271–298, 1987. View at: Publisher Site  Google Scholar
 H. A. Moghaddam and S. Chodratnama, “Toward semantic contentbased image retrieval using Dempster–Shafer theory in multilabel classification framework,” International Journal of Multimedia Information Retrieval, vol. 6, no. 4, pp. 317–326, 2017. View at: Publisher Site  Google Scholar
 J. Y. Lee, “Clinical research using smart prostate cancer database system (SPCDB),” Translational Andrology and Urology, vol. 3, p. AB18, 2014. View at: Publisher Site  Google Scholar
 S. B. Edge and C. C. Compton, “The American Joint Committee on Cancer: the 7th edition of the AJCC Cancer Staging Manual and the future of TNM,” Annals of Surgical Oncology, vol. 17, no. 6, pp. 1471–1474, 2010. View at: Publisher Site  Google Scholar
 G. E. Hinton and R. R. Salakhutdinov, “Reducing the dimensionality of data with neural networks,” Science, vol. 313, no. 5786, pp. 504–507, 2006. View at: Publisher Site  Google Scholar
 M. A. Salama, A. E. Hassanien, and A. A. Fahmy, “Deep belief network for clustering and classification of a continuous data,” in The 10th IEEE International Symposium on Signal Processing and Information Technology, pp. 473–477, Luxor, Egypt, 2010. View at: Publisher Site  Google Scholar
 J. Schmidhuber, “Deep learning in neural networks: an overview,” Neural Networks, vol. 61, pp. 85–117, 2015. View at: Publisher Site  Google Scholar
 R. Ranawana and V. Palade, “Multiclassifier systems: review and a roadmap for developers,” International Journal of Hybrid Intelligent Systems, vol. 3, no. 1, pp. 35–61, 2006. View at: Publisher Site  Google Scholar
 A. AlAni and M. Deriche, “A new technique for combining multiple classifiers using the DempsterShafer theory of evidence,” Journal of Artificial Intelligence Research, vol. 17, pp. 333–361, 2002. View at: Google Scholar
 G. Shafer, “The Dempster–Shafer theory,” in Encyclopedia of artificial intelligence (second Ed.), S. C. Shapiro, Ed., pp. 330331, Wiley, New York, NY, USA, 1992. View at: Google Scholar
 O. Basir and X. Yuan, “Engine fault diagnosis based on multisensor information fusion using Dempster–Shafer evidence theory,” Information Fusion, vol. 8, no. 4, pp. 379–386, 2007. View at: Publisher Site  Google Scholar
 S. V. Stehman, “Selecting and interpreting measures of thematic classification accuracy,” Remote Sensing of Environment, vol. 62, no. 1, pp. 77–89, 1997. View at: Publisher Site  Google Scholar
 J. A. Swets, Signal Detection Theory and ROC Analysis in Psychology and Diagnostics: Collected Papers, Psychology Press, New York, 2014.
Copyright
Copyright © 2018 Jae Kwon Kim et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.