- About this Journal ·
- Abstracting and Indexing ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents

Evidence-Based Complementary and Alternative Medicine

Volume 2013 (2013), Article ID 493626, 6 pages

http://dx.doi.org/10.1155/2013/493626

## Zheng Classification with Missing Feature Values Using Local-Validity Approach

^{1}School of Continuing Education, Shanghai Jiao Tong University, Shanghai 200240, China^{2}Provincial Key Laboratory for Computer Information Processing Technology, Soochow University, Suzhou 215006, China^{3}Department of Computer Science & Engineering, Shanghai Jiao Tong University, Shanghai 200240, China^{4}Center of Traditional Chinese Medicine Information Science and Technology, Shanghai University of TCM, Shanghai 201203, China

Received 26 July 2013; Revised 15 October 2013; Accepted 15 October 2013

Academic Editor: Shi-bing Su

Copyright © 2013 Yan Wang and Lizhuang Ma. 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

Zheng classification is a very important step in the diagnosis of traditional Chinese medicine (TCM). In clinical practice of TCM, feature values are often missing and incomplete cases. The performance of Zheng classification is strictly related to rates of missing feature values. Based on the pattern of the missing feature values, a new approach named local-validity is proposed to classify zheng classification with missing feature values. Firstly, the maximum submatrix for the given dataset is constructed and local-validity method finds subsets of cases for which all of the feature values are available. To reduce the computational scale and improve the classification accuracy, the method clusters subsets with similar patterns to form local-validity subsets. Finally, the proposed method trains a classifier for each local-validity subset and combines the outputs of individual classifiers to diagnose zheng classification. The proposed method is applied to the real liver cirrhosis dataset and three public datasets. Experimental results show that classification performance of local-validity method is superior to the widely used methods under missing feature values.

#### 1. Introduction

##### 1.1. The Concept of Zheng Classification

Traditional Chinese medicine (TCM) is one of the most important complementary medicines used increasingly in the world [1]. Zheng classification enables the doctor to determine the stage that the disease developed and the location of the disease [2]. Zheng classification is the method of recognizing and diagnosing diseases by analyzing patient information based on TCM theories and the doctor’s experiences [3].

In an attempt to achieve effective and objective standard of Zheng classification, various data mining approaches are used to construct the classifier on TCM dataset. Figure 1 shows the process of intelligent Zheng classification.

##### 1.2. Missing Feature Values: The Literature Review

In clinical practice of traditional Chinese medicine, feature values are often missing and incomplete cases. Missing feature values could be caused by various reasons, such as error of data measure, error of data understanding, erroneous human imputation, or restriction of data collecting [4, 5]. The performance of intelligent Zheng classification model in TCM is strictly related to the rate of missing feature values, but most common methods are short of the ability to solve the missing feature problem [4–6].

At present, the most common strategy for dealing with absent values is essentially to ignore them [7]. The cases with missing feature values are deleted before constructing the Zheng classification model [7]. Although improving the classification performance in some degree, deletion may discard some important information within the missing feature values, especially under the condition of insufficient TCM data. So deleting the data with missing feature values directly is difficult to meet the TCM clinical application.

Considering the shortcomings of the deletion method, imputation solution comes into being. Imputation is the substitution of a missing feature value with a meaningful estimate. Evidence theory is used to predict the missing feature values [8]. However, the evidence function should be learned in advance. The literature [9, 10] fills the missing feature by statistics method and Bayesian model, respectively. Nevertheless, these methods need to know probability distribution, which is difficult to be acquired in fact. In some applications, expert experience could be used to form the complete feature values. However, the prediction method for missing data by experts is subjective.

In recent decades, data mining imputation methods are beginning to attract much attention [11]. Logistic regression [12], subspace [4], neural network [13], and rough sets theory [14] have been applied to deal with missing feature values. These methods construct a predictive model to estimate the missing feature values from information within cases. However, imputation method will introduce new noise into cases, and the classification accuracy will decrease subsequently.

When dealing with the missing feature values, deletion and imputation methods will change the original dataset more or less. To avoid the problem of deletion and imputation methods, the literature [15–17] presents a selective Bayes classifier for classifying missing values with a simpler formula for computing gain ratio. Nevertheless, the method needs to satisfy the premise that features should be independent of each other. In TCM clinical practice, it is difficult to guarantee the characteristics of independence.

To overcome the limitation of the methods mentioned above, the proposed local-validity approach need not estimate the missing feature values or remove the deficient cases. It focuses on constructing intelligent Zheng classifier on the original cases directly. Firstly, the method finds the local-validity subset (LVS) within dataset and constructs the Zheng classifier on each LVS. Finally, the performance of each individual classifier is assessed and combined depending on the classification matrix to estimate the final output.

The rest of the paper is organized as follows. Section 2 describes the dataset and the ideas of the proposed local-validity method. The experimental results based on the method are shown in Section 3. Finally, conclusion is given in Section 4.

#### 2. Material and Methods

##### 2.1. Description of Dataset

153 liver cirrhosis cases with three different Zheng classifications (i.e., stasis-heat smoldering zheng, damp-heat smoldering zheng, and liver-kidney yin deficiency zheng) have been collected from Shanghai University of Traditional Chinese Medicine. The dataset includes 52 cases with stasis-heat smoldering zheng, 61 cases with damp-heat smoldering zheng and 40 cases with liver-kidney yin deficiency zheng. Each case includes 40 TCM features selected by clinicians as the significant factors to identify the liver cirrhosis zheng.

Features are encoded using the four-value ordinal scales measured by the severity degree:(i)1 representing no corresponding symptoms;(ii)2 for the normal level;(iii)3 for the medium serious level;(iv)4 representing the most serious.

Among all features, twenty-three features are missing in varying degrees. In this paper, the missing percentage is defined as where denotes the number of cases with missing feature values and denotes the total number of cases.

The list of these features and the corresponding missing percentage are shown in Table 1.

##### 2.2. The Proposed Local-Validity Approach

As mentioned above, the local-validity idea overcomes the limitations discussed in the previous section. The flowchart of the proposed approach is shown in Figure 2. The subsequent subsections are organized as follows. First, the TCM zheng classification system with missing feature values is defined. Then, we describe how LVS is selected and how the individual classifier is trained on every LVS. Finally, we present how the individual classification results are combined to boost up the classification performance.

###### 2.2.1. Definition of Zheng Classification System

Zheng classification system with missing feature values in TCM can be viewed as a 3-tuple , where is a nonempty finite set of cases and is a nonempty finite set of features. For and , denote the value that holds on feature . Then, in zheng classification system with missing feature values, and that satisfies . Here, we assume that the missing feature values are denoted by “*.”

An example of zheng classification system with missing feature values is shown in Table 2.

###### 2.2.2. Finding Local-Validity Subsets

It is common that the number of missing feature values is () in TCM clinical application. Based on the maximum sub-matrix theory, the missing feature values are considered as barrier points. The local-validity approach enumerates the maximum feature vector with complete values. Thus, the proposed method starts with a binary matrix whose element is defined as

The element if the th feature is missing in the th case.

The matrix of the dataset presented in Table 2 is given as follows:

Matrix finds the maximum feature vector (MFV) that covers the most complete data. Each MFV identifies a local-validity pattern ; the formula of is as follows: satisfing ().

Thus, the corresponding local-validity pattern corresponding to Table 2 is

Each pattern maps the corresponding LVS.

LVS is a collection of the cases that have no missing values for a specific feature subset and the collection of LVS includes all of the cases in the original data. The formula of LVS is as satisfing , where represents the th local-validity subset.

Four LVS can be found from the dataset presented in Table 2 and Figure 3 shows two of them.

The process of finding local-validity subset can be described as follows.(1)For an original given dataset, generate matrix .(2)In feature space, traverse matrix to generate maximum feature vector.(3)For each feature vector, find the corresponding LVS.

As the feature missing percentage ascends, the number of LVS will increase. The large number of LVS will affect the computation complexity. Then, this problem will be translated into a clustering problem. LVS with the similar pattern will be merged.

###### 2.2.3. Clustering Local-Validity Subsets with Similar Patterns

It is desirable to cover the entire data with as few local-validity subsets as possible and obtain the overall best performance.

The preliminary research results [17] show that there are inherent consistencies between mutual information and subset aggregate.

Considering the cross entropy between two local-validity subsets, where is the Gaussian kernel and is the variance of Gauss function. is the number of cases in subset and represents .

Then, the mutual information between and can be defined as follows: where represents the number of cases that belongs to two subsets at the same time.

The larger is, the stronger the correlation degree between and is. Based on -nearest neighbor algorithm, the subset with strong correlation degree is clustered to form a new subset. In this paper, the th cluster is represented by a set of LVS indices .

###### 2.2.4. Constructing the Zheng Classification Matrix

Once LVS is chosen, an individual zheng classifier is needed for each . In TCM zheng classification previous studies [18], the zheng classification matrix is proposed to merge the outputs of multizheng classifiers under the complete dataset.

Under missing feature values, in order to boost up the zheng classification performance, the complete degree is introduced into the zheng classification matrix to estimate the final output. Then, zheng classification matrix is updated as where represents the performance that a new case is diagnosed as under the local-validity subset.

#### 3. Experimental Results

##### 3.1. Local-Validity versus Other Methods on Liver Cirrhosis Dataset

To evaluate the performance of the proposed method, we carried out experiments on a real TCM liver cirrhosis dataset with missing data. Description of the dataset is presented in Table 1.

To analyze the improvement in zheng classification accuracy, three different methods are used to deal with the missing values.

The zheng classification accuracy is first estimated by simply removing the cases with missing values. Then, mean value imputation method is applied to impute missing feature values. Finally, the proposed local-validity approach is applied on the original dataset directly.

Considering the liver cirrhosis data is not sufficient, ten times 10-fold cross-validation is used for the assessment of classification performance. In cross validation, the data is split into ten approximately equal partitions and each in turn is used for testing and the remainder is used for training. That is, use nine-tenths for training and one-tenth for testing and repeat the procedure ten times so that, in the end, every case has been used exactly once for testing [19].

To get a reliable error estimate, the cross-validation process is repeated for 10 times, and the results are averaged [19].

The average classification accuracies are listed in Table 3. The best performance is emphasized using a boldfaced font.

As seen in Table 3, the performance of local-validity approach outperforms the deletion and imputation methods on liver cirrhosis dataset.

It should be pointed out that there are 23 feature values missing in original 40 features. Simply, deletion may introduce substantial biases, and imputation will introduce noise. With the increase of missing rate, problems of deletion and imputation will be more obvious. On the other hand, local-validity method constructs the zheng classification on the original dataset directly. The method can avoid the noise and biases problems.

##### 3.2. Local-Validity versus Other Methods on Other Datasets

We also do experiments on three public datasets: lymphography, SPECT heart, and breast cancer.

Because these three datasets are complete, the diagnosis performance can be evaluated effectively. We replace randomly the feature value with “*” based on different missing percentages in these three public datasets. The results are shown in Table 4.

From Tables 4(a), 4(b), and 4(c), it can be seen that the performance of local-validity method is lower than that of deletion and imputation with . With and , the proposed method performs well than other methods on three datasets. This shows that the performance of local-validity method is more stable than that of the other two methods, and the effect will be more obvious with the number increment of the missing cases.

In summary, the proposed local-validity algorithm is applicable to the dataset with small number of cases and a large percentage of missing values.

#### 4. Conclusions

Although various machine-learning algorithms have been used to construct the zheng classification model in TCM, most of them deal with complete feature values. In fact, missing feature values are inevitable in TCM clinical application. Therefore, methods of constructing zheng classifier for missing data deserve more attention.

By analyzing missing data processing methods, this paper presents a local-validity approach for zheng classification with missing feature values. The proposed approach contains the following characteristics.(1)Instead of deleting or imputing the absent values, the proposed approach discovers the local-validity subsets from the original cases. Therefore, the proposed approach avoids the introduction of noise data.(2)Our method constructs zheng classifier on the original dataset directly and needs no assumption about the missing mechanism.(3)During the local-validity subset discovery phase, the formula for computation of the local-validity subset is presented. Then, the zheng classification matrix is described to combine the classification results of multi-individual classifiers.(4)Through experiments, we can conclude that the proposed method is an appropriate solution to missing feature values problems in TCM zheng classification. The results show that the proposed approach outperforms the deletion and imputation methods as the amount of missing feature values increases.(5)Further research is under way concerning the relationship between the scale of local-validity subset and classification accuracy in order to get the optimum diagnostic result.

#### Conflict of Interests

The authors declare that they have no conflict of interests.

#### Acknowledgments

The research is sponsored by Open Research Fund of Jiangsu Provincial Key Laboratory for Computer Information Processing Technology (no. KJS1226) and Biomedical Engineering Cross Funds of Shanghai Jiao Tong University (no. YG2012MS28). The authors gratefully acknowledge all the researchers from the Shanghai University of Traditional Chinese Medicine for the TCM databases.

#### References

- S. K. Pal, “Complementary and alternative medicine: an overview,”
*Current Science*, vol. 82, no. 5, pp. 518–524, 2002. View at Scopus - B. Flaws and P. Sionneau,
*The Treatment of Modern Western Medical Diseases with Chinese Medicine*, Blue Poppy Press, 2005. - J. Si, L. Sun, N. Dai, et al., “Study of sEGF level in chronicatrophic gastritis with either Chinese traditional medicine or Western medicine,”
*Journal of Zhejiang University Science*, vol. 3, no. 2, pp. 243–246, 2002. - L. Nanni, A. Lumini, and S. Brahnam, “A classifier ensemble approach for the missing feature problem,”
*Artificial Intelligence in Medicine*, vol. 55, no. 1, pp. 37–50, 2012. View at Publisher · View at Google Scholar · View at Scopus - R. Polikar, J. DePasquale, H. S. Mohammed, G. Brown, and L. I. Kuncheva, “Learn++.MF: a random subspace approach for the missing feature problem,”
*Pattern Recognition*, vol. 43, no. 11, pp. 3817–3832, 2010. View at Publisher · View at Google Scholar · View at Scopus - G. Z. Li, S. X. Yan, M. Y. You, et al., “Intelligent ZHENG classification of hypertension depending on ML-kNN and information fusion,”
*Evidence-Based Complementary and Alternative Medicine*, vol. 2012, Article ID 837245, 5 pages, 2012. View at Publisher · View at Google Scholar - H.-B. Qu, L.-F. Mao, and J. Wang, “Method for self-extracting diagnostic rules of blood stasis syndrome based on decision tree,”
*Chinese Journal of Biomedical Engineering*, vol. 24, no. 6, pp. 709–727, 2005. View at Scopus - M. A. Boujelben, Y. D. Smet, A. Frikha, and H. Chabchoub, “Building a binary outranking relation in uncertain, imprecise and multi-experts contexts: the application of evidence theory,”
*International Journal of Approximate Reasoning*, vol. 50, no. 8, pp. 1259–1278, 2009. View at Publisher · View at Google Scholar · View at Scopus - A. S. Salama, “Topological solution of missing attribute values problem in incomplete information tables,”
*Information Sciences*, vol. 180, no. 5, pp. 631–639, 2010. View at Publisher · View at Google Scholar · View at Scopus - Z. Huang, J. Li, H. Su, G. S. Watts, and H. Chen, “Large-scale regulatory network analysis from microarray data: modified Bayesian network learning and association rule mining,”
*Decision Support Systems*, vol. 43, no. 4, pp. 1207–1225, 2007. View at Publisher · View at Google Scholar · View at Scopus - M. Ghannad-Rezaie, H. Soltanian-Zadeh, H. Ying, and M. Dong, “Selection-fusion approach for classification of datasets with missing values,”
*Pattern Recognition*, vol. 43, no. 6, pp. 2340–2350, 2010. View at Publisher · View at Google Scholar · View at Scopus - D. Williams, X. Liao, Y. Xue, L. Carin, and B. Krishnapuram, “On classification with incomplete data,”
*IEEE Transactions on Pattern Analysis and Machine Intelligence*, vol. 29, no. 3, pp. 427–436, 2007. View at Publisher · View at Google Scholar · View at Scopus - I. A. Gheyas and L. S. Smith, “A neural network-based framework for the reconstruction of incomplete data sets,”
*Neurocomputing*, vol. 73, no. 16–18, pp. 3039–3065, 2010. View at Publisher · View at Google Scholar · View at Scopus - X.-Y. Shao, X.-Z. Chu, H.-B. Qiu, L. Gao, and J. Yan, “An expert system using rough sets theory for aided conceptual design of ship's engine room automation,”
*Expert Systems with Applications*, vol. 36, no. 2, pp. 3223–3233, 2009. View at Publisher · View at Google Scholar · View at Scopus - J. Chen, H. Huang, F. Tian, and S. Tian, “A selective Bayes Classifier for classifying incomplete data based on gain ratio,”
*Knowledge-Based Systems*, vol. 21, no. 7, pp. 530–534, 2008. View at Publisher · View at Google Scholar · View at Scopus - F. Smeraldi, M. Defoin-Platel, and M. Saqi, “Handling missing features with boosting algorithms for protein-protein interaction prediction,”
*Lecture Notes in Computer Science*, vol. 6254, pp. 132–147, 2010. View at Publisher · View at Google Scholar · View at Scopus - Y. Wang, Y. Gao, R. Shen, and F. Yang, “Selective ensemble approach for classification of datasets with incomplete values,”
*Advances in Intelligent and Soft Computing*, vol. 122, pp. 281–286, 2011. View at Publisher · View at Google Scholar · View at Scopus - Y. Wang, L. Ma, and P. Liu, “Feature selection and syndrome prediction for liver cirrhosis in traditional Chinese medicine,”
*Computer Methods and Programs in Biomedicine*, vol. 95, no. 3, pp. 249–257, 2009. View at Publisher · View at Google Scholar · View at Scopus - I. H. Witten and E. Frank,
*Data Mining Practical Machine Learning Tools and Techniques*, Morgan Kaufmann Press, San Francisco, Calif, USA, 2005.