The Scientific World Journal
Volume 2015 (2015), Article ID 507925, 8 pages
http://dx.doi.org/10.1155/2015/507925

Research Article

An Ensemble Learning Based Framework for Traditional Chinese Medicine Data Analysis with ICD-10 Labels

Gang Zhang,¹ Yonghui Huang,¹ Ling Zhong,¹ Shanxing Ou,² Yi Zhang,³ and Ziping Li⁴

¹School of Automation, Guangdong University of Technology, Guangzhou 510006, China
²Department of Radiology, Guangzhou General Hospital of Guangzhou Military Command, Guangzhou 510010, China
³Department of Plastic and Reconstructive Surgery, The First Affiliated Hospital of Sun Yat-Sen University, Guangzhou 510080, China
⁴The Second Affiliated Hospital of Guangzhou University of Chinese Medicine, Guangzhou 510120, China

Received 21 January 2015; Accepted 25 June 2015

Academic Editor: Josiah Poon

Copyright © 2015 Gang Zhang 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.

Abstract.

Objective. This study aims to establish a model to analyze clinical experience of TCM veteran doctors. We propose an ensemble learning based framework to analyze clinical records with ICD-10 labels information for effective diagnosis and acupoints recommendation. Methods. We propose an ensemble learning framework for the analysis task. A set of base learners composed of decision tree (DT) and support vector machine (SVM) are trained by bootstrapping the training dataset. The base learners are sorted by accuracy and diversity through nondominated sort (NDS) algorithm and combined through a deep ensemble learning strategy. Results. We evaluate the proposed method with comparison to two currently successful methods on a clinical diagnosis dataset with manually labeled ICD-10 information. ICD-10 label annotation and acupoints recommendation are evaluated for three methods. The proposed method achieves an accuracy rate of 88.2%  ±  2.8% measured by zero-one loss for the first evaluation session and 79.6%  ±  3.6% measured by Hamming loss, which are superior to the other two methods. Conclusion. The proposed ensemble model can effectively model the implied knowledge and experience in historic clinical data records. The computational cost of training a set of base learners is relatively low.

1. Introduction

In the study of Traditional Chinese Medicine (TCM), clinical experience of veteran doctors plays an important role in both theoretical research and clinical research [1]. The clinical experience is often recorded in a semistructural or unstructured manner, since most of them have a relatively long history. Some of them are manually organized in simple categories or even in plain text. In data mining and machine learning applications, structural inputs are required for computational models [2]. However, there is valuable knowledge in these clinical experience records; for example, they can be used for classification or association rule mining to find patterns of disease diagnosis and Chinese medical ZHENG diagnosis, or for identification of core elements of ZHENG, the relation between herbal medicine formula and different ZHENG and disease, and the common law of clinical diagnosis [3, 4].

There are at least three challenges in building the computational model for analysis clinical records of veteran TCM doctors. The first is that the target data record set for analysis is multimodal with many correlated factors, which means that the data samples are not generated from a single model, but several unknown models or their combination. Hence a simple parameter model cannot capture the generative laws of such data [5, 6]. The second is that the prior knowledge from TCM theory and clinical treatment is available, and they are totally informally organized and even ambiguous, which cannot be directly used in building analysis models. The third is that the data is unstructured, which means that effective feature representations are often unavailable [7].

Currently there some studies on TCM data analysis with machine learning models. We briefly review some work closely related to this work. Di et al. [8] proposed a clinical outcome evaluation model based on local learning for the efficacy of acupuncture neck pain caused by cervical spondylosis. They introduced a local learning method, by defining a distance function between treatment records of each patient. When evaluating the efficacy of acupuncture for a patient, the model selects samples most close to the test sample. The model significantly reduces the computational cost when the dataset is large. However, their model requires a structural input and cannot process data stored in plain text. Liang et al. [9] proposed a multiview KNN method for subjective data of TCM acupuncture treatment to evaluate the therapeutic effect of neck pain. They regard the clinical records as data samples with multiple view, each of which refers to a subset of attributes. And different views are disjointed from each other. The model fully makes use of information from different views. A boosting-style method is used to combine models associated with different views together. Zhang et al. [10, 11] proposed a kernel decision tree method for TCM data analysis. Their model processes data in a feature space induced by a kernel function, which is effective for the multimodal data. However, the prior knowledge cannot be explicitly expressed in the feature space, which limits its further application.

To tackle the aforementioned challenges, in this paper, we propose to adopt the recently proposed deep ensemble learning method to build our analysis model. Deep ensemble learning is an extension of ensemble learning, which is a famous topic in machine learning research [12–14]. Ensemble learning makes a weighted combination of a set of base learners to form a combined learner as the final model. Equation (1) shows the general form of ensemble of base learners:

where is a set of base learners of at least some difference and is a weight vector with constraints . To avoid the overfitting problem of the ensemble learner , a regularization prior should be imposed on [15]. A common regularization prior is the sparsity of , meaning that more in is preferable. Or one can impose a normal distribution on .

The quality of the set of base learners and fully controls the performance of the ensemble learner [16]. There are three methods to determine the best ensemble of a set of base learners [17]. The first is the selective ensemble, which selects small parts of base learners by some criteria and combines them using a majority voting strategy. This kind of method in fact imposes a prior on that only a small number of elements in can be nonzero, as well as the equal weight for each remaining learner. The second method finds the optimal through solving an optimization as follows:

This kind of method finds the optimal such that the ensemble achieves the minimal loss and the best regularization on the evaluation set parameterized by . Since the optimization problem is not convex for most loss evaluation functions, it may not be solved analytically. The third method is an iterative method that initializes the weights randomly and adjusts them through a iterative procedure. The famous Adaboost algorithm falls into this kind [18]. The Adaboost algorithm adopts very simple principle when finding the optimal weights; that is, if a candidate base learner has a good performance on the training dataset and is different from others, its weight can be increased by the algorithm. The idea of Adaboost is to find a subset of base learners of high quality whose diversity is also high [19].

However, the above three methods do not fully meet the requirement of the problem of TCM data analysis. The concept class implied in our dataset is of complex structure, or in another word, its VC dimension is extremely large, leading to a complex class boundary. Simple or shallow function classes may suffer from lack of representation capability. Motivated by the current research process of ensemble learning and deep learning, we propose to use deep ensemble learning for our analysis task. Different from classical ensemble learning, deep ensemble learning tries to tackle the problem of multimodal analysis and extends the bound of generalization ability of the ensemble learner. A key advantage of deep ensemble learning is that deep models can be used as base learners, which extends the representation capability to a great extent [20, 21].

Figure 1 shows the main idea of this paper, as well as an example of the clinical data to be analyzed.

Figure 1: The main idea of this paper.

Deep ensemble learning method adopts a capacity-conscious criterion to evaluate the quality of base learners. Different from the famous accuracy-diversity selective ensemble framework, the deep ensemble learning methods try to directly minimize the error bound according to the current training dataset.

The remainder of this paper is organized as follows. In Section 2 we present the main methods, including the self-adaptive region cutting method, stacked autoencoder training algorithm, and MIML model. In Section 3 we present the settings of evaluation of the proposed method and report the evaluation results on a real clinical dataset at different multiple-label classification criteria. And finally we conclude the paper in Section 4.

2. Deep Ensemble Learning

2.1. Problem Definition

Before going further, we formally define the problem to be solved. Let be a set of TCM clinical records and the corresponding ICD-10 labels, where is the representation of each data sample in . Each element of is denoted as , indicating whether an acupoint or ZHENG is included in the treatment plan. The acupoint and ZHENG information are extracted through a simple key word matching procedure. is an ICD-10 label associated with the th record. is the TCM diagnosis of the th clinical sample. When an acupoint or ZHENG is found, the correspond element in is set to 1, and 0 otherwise. The goal is to find a function that achieves minimal loss on a training dataset , given a predefined loss function, for example, zero-one loss.

2.2. Selective Ensemble and Learners Sorting

Selective ensemble is an ensemble strategy that sorts the base learners with some criteria and then selects the learners at the top of the list to ensemble. Three criteria are used in this study. The first is accuracy, which evaluates how the model output matches the ground truth label [22]. Since the output of is a pair of labels, that is, , the simple zero-one loss is not suitable in this case. We define a new accuracy as follows:

where , , and are parameters controlling the importance of TCM diagnosis, ICD-10, and both. The indicator function if and 0 otherwise. is also an indicator function that evaluates two tuples.

The second criterion is diversity which evaluates the difference between base learners. According to the theory of ensemble learning, an ensemble of learners that are different from each other may achieve better performance. There are some diversity definitions proposed in the literature of ensemble learning [23]. A simple way is to compare the results of each learner on the whole evaluation dataset. In this study, there are two target variables for prediction and the diversity for a learner given that a dataset is defined as follows:

since returns a tuple, in the definition we use Hamming distance when evaluating the difference between two tuples. is an indicator function in which if , and 0 otherwise. stands for the ensemble learner of majority voting. The intuition of this definition is that if the output of a learner is away from that of the ensemble learner , it is assigned with large diversity [24].

To this end, we are able to sort all learners by both their accuracy and diversity. We use a sorting strategy named nondominated sort (NDS) to get a reasonable sorting. The rule NDS is that if the accuracy and diversity of can dominate those of , should be ahead of in the queue. When the accuracy and diversity of and cannot dominate each other, we add the rank of accuracy and diversity to form a single rank . And the learner of small should be ahead of the other [25]. Table 1 shows an example of 6 learners sorted by NDS.

Table 1: An example of 6 learners and their rankings.

Learner number
Accuracy rank
Diversity rank
Sum rank
NDS rank

Learner 1
1
2
3
1

Learner 2
2
3
5
3

Learner 3
5
4
9
4

Learner 4
4
6
10
5

Learner 5
3
1
4
2

Learner 6
6
5
11
6

In Table 1, the column Sum Rank stands for the sum of rank of accuracy and diversity of an individual learner. And the column NDS Rank stands for the ranking by NDS algorithm. Learner 1 dominates Learner 2 at both the rankings of accuracy and diversity. Hence the ranking of Learner 1 is prior to Learner 2. But Learner 3 and Learner 4 cannot dominate each other. In such case, NDS uses the Sum Rank for sorting, which adds the ranking of accuracy and diversity together. Finally, we get a fully sorted list of all learners in the base set, and we select the top of the base set size to form an ensemble learner.

2.3. Deep Boosting

With the definition of accuracy and diversity of the base learners, we can sort the learners based on their quality. To further get an optimal weight for combination, an iterative procedure can be applied to search valuable data samples in the training dataset as well as updating the weights. Adaboost is a famous algorithm to find optimal ensemble weights. Algorithm 1 shows the main steps of Adaboost.

Require:

      : The size of ensemble : The training data set

Ensure:

      : The weight vector for ensemble

(1) Define a uniform distribution on all samples in

(2) for   to   do

(3)     train with a

(4)     Calculate

(5)     if    then

(6)        break

(7)     end if

(8)     Set

(9)     Update

(10)  for   to   do

(11)      

(12)  end for

(13) end for

(14) return  

Algorithm 1: Adaboost.

In Adaboost, a uniform distribution is imposed on the training dataset . Each round the combination weights and the distribution are both updated according to the performance of the current learner on the whole training dataset. If a sample is misclassified by some learners, it would be chosen again with high probability, which is controlled by the distribution .

When it comes to deep ensemble learning, a different sample selection and weight update strategy is implemented. The main idea of deep ensemble learning is described as follows. Firstly the initial distribution is set to . Then try to solve the optimization problem as follows:

Cortes et al. [26] proposed an algorithm to solve the above optimization problem, and a vector of optimal weights can be determined. Finally, for a test example , the result can be . For a binary output, a sign function can be applied on , in which if and 0 otherwise.

2.4. Base Learners

The quality of base learners affects the performance of the ensemble significantly. In this study, we use two kinds of base learners. The first is decision tree (DT) and the second is support vector machine (SVM). Note that both types of learners implement shallow models with two layers. For DT, a path from a leaf to the root is in fact a conjunctive normal form (CNF), and the root performs an OR operation of all paths in the tree; that is, . For SVM, the model is structured with a kernel operation between the test sample and the samples of the training dataset and then summarizes with a normalized weight vector; that is, . For either DT or SVM, a three-layer model can be obtained by ensemble the trained base learners with a vector of learned weights.

The DT and SVM models are implemented by the famous WEKA project [27]. And in order to be invoked in MATLAB environment, we use the Spider project to generate a MATLAB interface for WEKA. To train each learner, a sampling procedure is launched on the training dataset with replacement, resulting in some difference between the training datasets of each learner. The size of the set of base learners is denoted as , including DTs and SVMs with default parameter settings. In our evaluation, we set and to build a relative large set of base learners, leading to a sufficient ensemble.

3. Evaluations

3.1. Dataset and Settings

We evaluate the proposed on a real clinical dataset gathered from some veteran TCM doctors, composing 2835 records. There are 21 different types of diseases in the dataset attached with 4 kinds of feature groups. The first group is the ICD-10 label vector. There are 31 ICD-10 labels concerning this study. But for each data record, there is only one ICD-10 label that can be attached. We use a boolean vector with 31 elements to indicate which ICD-10 label is attached among all labels. The second group contains the patient’s information, including age, gender, job type, history of disease, weight, and height. All this information is placed in a real vector with 11 elements. The third group contains the diagnosis and ZHENG description of the patient in Chinese. The raw data of this field is in plain text which is not easy to process directly. We process them with a key word matching procedure. 4000 key words including the name of diseases, name of acupoints, ZHENG description, and severity description are predefined. And the diagnosis description text is matched with the set of key words. A boolean vector records the matching result whose element indicates whether the corresponding word exists in the text description. Finally the fourth group describes the acupoints proposed by the doctor for acupuncture treatment. In this study 53 acupoints are considered for analysis. Table 2 shows the feature of the evaluation dataset.

Table 2: Description of the evaluation dataset.

Number
Name
Type
Description

1
ICD-10 label
Boolean vector
The ICD-10 labels associated with the record

2
BasicInfo
Real vector
Patient’s basic information, 11-ary

3
Diagnosis text feature
Boolean vector
4000-ary

4
Acupoints
Boolean vector
Acupoints in the patient’s acupuncture plan, 53-ary

To make a clear presentation, Table 3 shows some examples of the dataset. Note that the name of acupoints and diagnosis description are originally in Chinese. We translate them into English for presentation in the table.

Table 3: Description of the evaluation dataset.

No.
Name
Sample data

1
ICD-10 labels
Fibromyalgia: M79.7

2
BasicInfo
Age: 33, gender: male, weight: 68, height: 171, and job type: heavy

3
Diagnosis text
The sequela of stroke hemiplegia: there has been some recovery, for many years has not double knee joint pain, were migratory, Jigzhi healed, recently accompanied by low back pain, pale tongue slightly red, and moss white veins fine strings

4
Acupoints
Huantiao, Yinmen, Taixi, Yaoyangguan, Changqiang, and YangChi (right)

3.2. Evaluation Criteria and Methods for Comparison

To evaluate the effectiveness of the proposed method, we perform two types of evaluation. The first is to evaluate the prediction of ICD-10 labels given a diagnosis description and patient’s basic information, as well as the acupoints for treatment. A zero-one loss function is adopted to evaluate the accuracy of the model output. Equation (6) shows the accuracy evaluated by a zero-one loss function:

where . is an indicator function where if and 0 otherwise.

For the second type of evaluation, we want to illustrate the effect of acupoint recommendation for a treatment plan given the basic information of a patient. This type of evaluation can be regarded as a multilabel classification problem. In this case, we adopt a Hamming loss to evaluate the accuracy. Equation (7) gives the definition of the Hamming loss:

In (7), is the ground truth labels associated with , and is the learner to be evaluated. The Hamming loss function evaluates how many sample-label pairs are misclassified by the learner .

We also implement two current state-of-the-art methods for the problem to be tackled in this paper and evaluate them on the same dataset, to further show the effectiveness of the proposed method. The first method is the multiview KNN method proposed by Liang et al. [9]. The second is a deep learning based method, which proposed a convolutional neural network for healthcare data decision making [28]. The motivation of choosing these two methods is twofold. The first is that both of them (Liang et al. [9, 28]) are proposed for TCM data analysis, which is similar to the theme of this study. And the evaluation dataset is the same as that used in this study. The second is that these two methods reflect two different directions for medical data analysis. The multiview KNN method in fact obeys the local learning and ensemble learning principles, leading to shallow model and transductive learning, which means that it is not necessary to derive a general model for the problem. The convolutional neural network method attempts to derive a classification function of powerful ability so as to express arbitrary complex classification boundary. For brevity, we denote these two methods as MV-KNN and CNN. The parameters of MV-KNN and CNN are set to default as they are proposed.

3.3. Evaluation Results

We use a tenfold validation strategy for evaluation. The whole dataset is randomly divided into 10 parts with equal sizes. In each round, 9 parts are used to train the model and the remainder for test. We randomly divide the dataset 20 times. For each time a tenfold validation is run. Totally there are 200 runs. The mean loss and stand derivation are recorded in either kind of evaluation. Table 4 shows the ICD-10 annotation accuracy of each type of disease.

Table 4: ICD-10 annotation accuracy of each type of disease (%).

No.
Name
Size
DEL
MV-KNN
CNN

1
Arthralgia syndrome
481
82.4 ± 2.7
83.1 ± 2.8
84.2 ± 3.4

2
Acne
75
90.2 ± 2.1
86.4 ± 2.3
85.3 ± 3.1

3
Epilepsy
26
89.1 ± 2.5
88.0 ± 1.9
86.9 ± 2.4

4
Tinnitus and deafness
68
83.1 ± 2.6
81.0 ± 3.1
85.2 ± 3.6

5
Abdominal pain
96
84.7 ± 2.7
81.3 ± 2.9
82.8 ± 3.4

6
Allergic rhinitis
376
89.2 ± 2.1
84.1 ± 2.8
85.3 ± 3.0

7
Neck and shoulder pain
110
91.4 ± 1.9
88.4 ± 2.1
86.0 ± 2.5

8
Cervical spondylosis
33
92.6 ± 2.2
87.7 ± 2.9
90.5 ± 3.1

9
Cough
96
88.5 ± 2.7
86.9 ± 3.1
87.1 ± 3.9

10
Facial paralysis
89
82.7 ± 1.3
78.8 ± 2.5
79.1 ± 3.0

11
Traumatic brain injury
47
85.8 ± 2.1
86.0 ± 2.9
85.1 ± 2.6

12
Migraine
33
93.0 ± 2.9
88.7 ± 3.2
89.4 ± 3.6

13
Ankylosing spondylitis
33
91.9 ± 2.0
90.0 ± 3.6
91.1 ± 3.9

14
Insomnia
47
90.2 ± 2.2
84.5 ± 3.3
88.5 ± 3.6

15
Headache
145
86.6 ± 2.5
87.1 ± 3.2
89.2 ± 3.8

16
Flaccidity syndrome
124
87.2 ± 1.9
83.1 ± 2.8
84.4 ± 3.1

17
Stomachache
145
89.2 ± 2.4
86.5 ± 2.8
87.2 ± 3.1

18
Asthma
355
90.6 ± 2.1
88.2 ± 2.9
88.6 ± 2.9

19
Palpitation
33
90.2 ± 2.5
89.9 ± 3.1
86.5 ± 3.4

20
Lumbocrural pain
397
88.1 ± 2.3
82.1 ± 3.2
87.2 ± 3.8

21
Urticaria and rubella
26
85.4 ± 2.3
84.2 ± 3.1
84.9 ± 3.0

22
Total
2835
88.2 ± 2.8
85.6 ± 3.4
86.4 ± 3.9

The column DEL stands for the accuracy of the proposed method. In Table 4, we boldface the best result in each row. At the last of the table, we summarize the accuracy of three methods. It can be seen that the proposed method has best performance in the annotation of 17 (totally 21) types of diseases. Moreover, in a multiple-label classification perspective, the proposed method also achieves the best result for all diseases to be annotated, as shown in the last row of Table 4. It can be concluded that the proposed method is effective for the annotation of the concerned diseases. The proposed method achieves best performance among all three methods for types of disease and for average results of all diseases, which indicates that the proposed method is statistically better than the other two methods.

For the second part of evaluation, we want to see the accuracy of acupoints recommendation for treatment. We compare the ground truth acupoints suggested by experienced doctors with the model output. Note that in this part MV-KNN and CNN are not suitable for this case. Henceforth we only report the accuracy measured by Hamming loss and the variance of the whole accuracy of the proposed method. Table 5 shows the results of this session of evaluation.

Table 5: Acupoints recommendation accuracy of each type of disease (%).

No.
Name
Accuracy
No.
Name
Accuracy

1
Arthralgia syndrome
77.9
2
Acne
82.3

3
Epilepsy
80.6
4
Tinnitus and deafness
75.6

5
Abdominal pain
76.8
6
Allergic rhinitis
77.2

7
Neck and shoulder pain
81.0
8
Cervical spondylosis
80.5

9
Cough
82.4
10
Facial paralysis
76.5

11
Traumatic brain injury
79.1
12
Migraine
78.4

13
Ankylosing spondylitis
78.3
14
Insomnia
81.4

15
Headache
80.0
16
Flaccidity syndrome
75.9

17
Stomachache
83.0
18
Asthma
81.2

19
Palpitation
82.2
20
Lumbocrural pain
80.1

21
Urticaria and rubella
77.9
—
—
—

22
Total
79.6 ± 3.6
—
—
—

4. Conclusions

In this paper, we proposed an ensemble learning framework for ICD-10 label annotation and acupoints recommendation. The model analyzes the clinical diagnosis records in plain text, acupoints for acupuncture treatment, and the patient’s basic information and performs multilabel classification to annotate correct ICD-10 labels for each clinical record. At the same time, the model recommends acupoints for personal treatment, which provides valuable support for doctor’s diagnosis decision. The proposed method adopts the recently proposed deep ensemble learning to find the optimal weight vector for combination of base learners. Different from the traditional Adaboost method, the deep ensemble learning can achieve better generalization ability when given a set of base learners with powerful representation ability. Decision tree and support vector machine classifiers are implemented as the base learners. We set up our evaluation on a real clinical dataset gathered from several veteran doctors, with comparison to two previously proposed successful methods. We achieve an accuracy of 88.2% in ICD-10 labels annotation evaluated by the zero-one loss function and 79.6% in acupoints recommendation evaluated by the Hamming loss function, either of which is superior to the two previous methods.

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

Acknowledgments

This work is supported by the National Natural Science Foundation of China (no. 81373883), the Natural Science Foundation of Guangdong Province of China (no. S2013040012898), the Science and Technology Planning Project of Guangdong Province of China (no. 2013B010404019), the College Student Career and Innovation Training Plan Project of Guangdong Province (yj201311845015, yj201311845023, yj201311845031, and xj201411845025), the Higher Education Research Funding of Guangdong University of Technology (no. GJ2014Y17), and the Science and Technology Project of Huadu District of Guangzhou (no. 14ZK0024).

References

S. Qiao, C. Tang, H. Jin, J. Peng, D. Davis, and N. Han, “KISTCM: knowledge discovery system for traditional Chinese medicine,” Applied Intelligence, vol. 32, no. 3, pp. 346–363, 2010.

Y. Wang, Z. Yu, L. Chen et al., “Supervised methods for symptom name recognition in free-text clinical records of traditional Chinese medicine: an empirical study,” Journal of Biomedical Informatics, vol. 47, pp. 91–104, 2014.

Y. Feng, Z. Wu, X. Zhou, Z. Zhou, and W. Fan, “Methodological review: knowledge discovery in traditional Chinese medicine: state of the art and perspectives,” Artificial Intelligence in Medicine, vol. 38, no. 3, pp. 219–236, 2006.

N. L. Zhang, S. Yuan, T. Chen, and Y. Wang, “Latent tree models and diagnosis in traditional chinese medicine,” Artificial Intelligence in Medicine, vol. 42, no. 3, pp. 229–245, 2008.

Y. Wang, Z. Yu, Y. Jiang, Y. Liu, L. Chen, and Y. Liu, “A framework and its empirical study of automatic diagnosis of traditional Chinese medicine utilizing raw free-text clinical records,” Journal of Biomedical Informatics, vol. 45, no. 2, pp. 210–223, 2012.

F. Zou, D. Yang, S. Li, J. Xu, and C. Zhou, “Level set method based tongue segmentation in traditional chinese medicine,” in Proceedings of the IASTED International Conference on Graphics and Visualization in Engineering (GVE '07), pp. 37–40, ACTA Press, Anaheim, Calif, USA, 2007, http://dl.acm.org/citation.cfm?id=1712936.1712945.

S. Lukman, Y. He, and S.-C. Hui, “Computational methods for traditional Chinese medicine: a survey,” Computer Methods and Programs in Biomedicine, vol. 88, no. 3, pp. 283–294, 2007.

Z. Di, H.-L. Zhang, G. Zhang et al., “A clinical outcome evaluation model with local sample selection: a study on efficacy of acupuncture for cervical spondylosis,” in Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine Workshops (BIBMW '11), pp. 829–833, IEEE Computer Society, November 2011.

Z. Liang, G. Zhang, G. Li, and W. Fu, “An algorithm for acupuncture clinical assessment based on multi-view KNN,” Journal of Computational Information Systems, vol. 8, no. 21, pp. 9105–9112, 2012.

G. Zhang, Z. Liang, J. Yin, W. Fu, and G.-Z. Li, “A similarity based learning framework for interim analysis of outcome prediction of acupuncture for neck pain,” International Journal of Data Mining and Bioinformatics, vol. 8, no. 4, pp. 381–395, 2013.

N. Rooney, H. Wang, and P. S. Taylor, “An investigation into the application of ensemble learning for entailment classification,” Information Processing and Management, vol. 50, no. 1, pp. 87–103, 2014.

V. Kuznetsov, M. Mohri, and U. Syed, “Multi-class deep boosting,” in Advances in Neural Information Processing Systems, Z. Ghahramani, M. Welling, C. Cortes, N. Lawrence, and K. Weinberger, Eds., vol. 27, pp. 2501–2509, Curran Associates, 2014.

D. Akdemir and J.-L. Jannink, “Ensemble learning with trees and rules: supervised, semi-supervised, unsupervised,” Intelligent Data Analysis, vol. 18, no. 5, pp. 857–872, 2014.

M. Uchida, Y. Maehara, and H. Shioya, “Unsupervised weight parameter estimation method for ensemble learning,” Journal of Mathematical Modelling and Algorithms, vol. 10, no. 4, pp. 307–322, 2011.

Q. L. Zhao, Y. H. Jiang, and M. Xu, “Incremental learning by heterogeneous bagging ensemble,” in Advanced Data Mining and Applications: 6th International Conference, ADMA 2010, Chongqing, China, November 19–21, 2010, Proceedings, Part II, vol. 6441 of Lecture Notes in Computer Science, pp. 1–12, Springer, Berlin, Germany, 2010.

V. Pisetta, P.-E. Jouve, and D. A. Zighed, “Learning with ensembles of randomized trees: new insights,” in Machine Learning and Knowledge Discovery in Databases: European Conference, ECML PKDD 2010, Barcelona, Spain, September 20–24, 2010, Proceedings, Part III, vol. 6323 of Lecture Notes in Computer Science, pp. 67–82, Springer, Berlin, Germany, 2010.

H. Yu and J. Ni, “An improved ensemble learning method for classifying high-dimensional and imbalanced biomedicine data,” IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 11, no. 4, pp. 657–666, 2014.

F. Bellal, H. Elghazel, and A. Aussem, “A semi-supervised feature ranking method with ensemble learning,” Pattern Recognition Letters, vol. 33, no. 10, pp. 1426–1433, 2012.

C. Zhang and Y. Ma, Ensemble Machine Learning: Methods and Applications, Springer, New York, NY, USA, 2012.

X. S. Zhang, B. Shrestha, S. Yoon et al., “An ensemble architecture for learning complex problem-solving techniques from demonstration,” ACM Transactions on Intelligent Systems and Technology, vol. 3, no. 4, article 75, 2012.

J. Tian, M. Li, F. Chen, and J. Kou, “Coevolutionary learning of neural network ensemble for complex classification tasks,” Pattern Recognition, vol. 45, no. 4, pp. 1373–1385, 2012.

I. Choi, K. Park, and H. Shin, “Sharpened graph ensemble for semi-supervised learning,” Intelligent Data Analysis, vol. 17, no. 3, pp. 387–398, 2013.

C.-X. Zhang, J.-S. Zhang, N.-N. Ji, and G. Guo, “Learning ensemble classifiers via restricted Boltzmann machines,” Pattern Recognition Letters, vol. 36, no. 1, pp. 161–170, 2014.

J. Liao, Totally corrective boosting algorithms that maximize the margin [Ph.D. thesis], University of California, Santa Cruz, Calif, USA, 2006.

Q. Wang, L. Zhang, M. Chi, and J. Guo, “MTForest: ensemble decision trees based on multi-task learning,” in Proceedings of the 18th European Conference on Artificial Intelligence (ECAI '08), pp. 122–126, IOS Press, Amsterdam, The Netherlands, 2008.

C. Cortes, M. Mohri, and U. Syed, “Deep boosting,” in Proceedings of the 31st International Conference on Machine Learning (ICML '14), Beijing, China, June 2014.

R. R. Bouckaert, E. Frank, M. A. Hall et al., “WEKA—experiences with a java open-source project,” Journal of Machine Learning Research, vol. 11, pp. 2533–2541, 2010.

Z. Liang, G. Zhang, J. X. Huang, and Q. V. Hu, “Deep learning for healthcare decision making with EMRs,” in Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine (BIBM '14), pp. 556–559, November 2014.