《模式识别》课程教学资源（书籍文献）Neural Networks for Classification - A Survey

EEE TRANSACTIONS ON SYSTEMS,MAN,AND CYBERNETICS-PART C:APPLICATIONS AND REVIEWS,VOL.30,NO.4,NOVEMBER 2000 451 Neural Networks for Classification:A Survey Guoqiang Peter Zhang Abstract-Classification is one of the most active research and [79.Since any classification procedure seeks a functional application areas of neural networks.The literature is vast and relationship between the group membership and the attributes growing.This paper summarizes the some of the most important developments in neural network classification research.Specifi- of the object,accurate identification of this underlying function cally,the issues of posterior probability estimation,the link be- is doubtlessly important.Third,neural networks are nonlinear tween neural and conventional classifiers,learning and general- models,which makes them flexible in modeling real world ization tradeoff in classification,the feature variable selection,as complex relationships.Finally,neural networks are able to well as the effect of misclassification costs are examined.Our pur- estimate the posterior probabilities,which provides the basis pose is to provide a synthesis of the published research in this area for establishing classification rule and performing statistical and stimulate further research interests and efforts in the identi- fied topics. analysis [138]. Index Terms-Bayesian classifier,classification,ensemble On the other hand.the effectiveness of neural network clas- methods,feature variable selection,learning and generalization, sification has been tested empirically.Neural networks have misclassification costs,neural networks. been successfully applied to a variety of real world classification tasks in industry,business and science [186.Applications in- I.INTRODUCTION clude bankruptcy prediction [2],[96],[101],[167],[187],[195], handwriting recognition [61],[92],[98],[100],[113],speech YLASSIFICATION is one of the most frequently en- recognition[25l,[106],product inspection[9刀，[130]，fault de- countered decision making tasks of human activity.A tection [11],[80],medical diagnosis [19],[20],[30],[31],and classification problem occurs when an object needs to be bond rating [44],[163],[174].A number of performance com- assigned into a predefined group or class based on a number parisons between neural and conventional classifiers have been of observed attributes related to that object.Many problems in made by many studies [36],[82],[115].In addition,several business,science,industry,and medicine can be treated as clas- computer experimental evaluations of neural networks for clas- sification problems.Examples include bankruptcy prediction, sification problems have been conducted under a variety of con- credit scoring,medical diagnosis,quality control,handwritten ditions[127刀，[161]. character recognition,and speech recognition. Traditional statistical classification procedures such as dis- Although significant progress has been made in classification criminant analysis are built on the Bayesian decision theory related areas of neural networks,a number of issues in applying neural networks still remain and have not been solved success- [42].In these procedures,an underlying probability model must be assumed in order to calculate the posterior probability upon fully or completely.In this paper,some theoretical as well as empirical issues of neural networks are reviewed and discussed. which the classification decision is made.One major limitation of the statistical models is that they work well only when the The vast research topics and extensive literature makes it impos- underlying assumptions are satisfied.The effectiveness of these sible for one review to cover all of the work in the filed.This re- view aims to provide a summary of the most important advances methods depends to a large extent on the various assumptions or in neural network classification.The current research status and conditions under which the models are developed.Users must have a good knowledge of both data properties and model capa- issues as well as the future research opportunities are also dis- cussed.Although many types of neural networks can be used bilities before the models can be successfully applied. Neural networks have emerged as an important tool for for classification purposes [105],our focus nonetheless is on the feedforward multilayer networks or multilayer perceptrons classification.The recent vast research activities in neural (MLPs)which are the most widely studied and used neural net- classification have established that neural networks are a promising alternative to various conventional classification work classifiers.Most of the issues discussed in the paper can methods.The advantage of neural networks lies in the fol- also apply to other neural network models. lowing theoretical aspects.First,neural networks are data The overall organization of the paper is as follows.After the driven self-adaptive methods in that they can adjust themselves introduction,we present fundamental issues of neural classifica- tion in Section II,including the Bayesian classification theory, to the data without any explicit specification of functional or the role of posterior probability in classification,posterior prob- distributional form for the underlying model.Second,they are ability estimation via neural networks,and the relationships be- universal functional approximators in that neural networks can tween neural networks and the conventional classifiers.Sec- approximate any function with arbitrary accuracy [37],[78], tion III examines theoretical issues of learning and generaliza- tion in classification as well as various practical approaches to Manuscript received July 28,1999:revised July 6,2000. improving neural classifier performance in learning and gener- G.P.Zhang is with the J.Mack Robinson College of Business,Georgia State University,Atlanta,GA 30303 USA(e-mail:gpzhang@gsu.edu). alization.Feature variable selection and the effect of misclassi- Publisher Item Identifier S 1094-6977(00)11206-4. fication costs-two important problems unique to classification 1094-6977/00S10.00©20001EEE

IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS—PART C: APPLICATIONS AND REVIEWS, VOL. 30, NO. 4, NOVEMBER 2000 451 Neural Networks for Classification: A Survey Guoqiang Peter Zhang Abstract—Classification is one of the most active research and application areas of neural networks. The literature is vast and growing. This paper summarizes the some of the most important developments in neural network classification research. Specifi￾cally, the issues of posterior probability estimation, the link be￾tween neural and conventional classifiers, learning and general￾ization tradeoff in classification, the feature variable selection, as well as the effect of misclassification costs are examined. Our pur￾pose is to provide a synthesis of the published research in this area and stimulate further research interests and efforts in the identi￾fied topics. Index Terms—Bayesian classifier, classification, ensemble methods, feature variable selection, learning and generalization, misclassification costs, neural networks. I. INTRODUCTION CLASSIFICATION is one of the most frequently en￾countered decision making tasks of human activity. A classification problem occurs when an object needs to be assigned into a predefined group or class based on a number of observed attributes related to that object. Many problems in business, science, industry, and medicine can be treated as clas￾sification problems. Examples include bankruptcy prediction, credit scoring, medical diagnosis, quality control, handwritten character recognition, and speech recognition. Traditional statistical classification procedures such as dis￾criminant analysis are built on the Bayesian decision theory [42]. In these procedures, an underlying probability model must be assumed in order to calculate the posterior probability upon which the classification decision is made. One major limitation of the statistical models is that they work well only when the underlying assumptions are satisfied. The effectiveness of these methods depends to a large extent on the various assumptions or conditions under which the models are developed. Users must have a good knowledge of both data properties and model capa￾bilities before the models can be successfully applied. Neural networks have emerged as an important tool for classification. The recent vast research activities in neural classification have established that neural networks are a promising alternative to various conventional classification methods. The advantage of neural networks lies in the fol￾lowing theoretical aspects. First, neural networks are data driven self-adaptive methods in that they can adjust themselves to the data without any explicit specification of functional or distributional form for the underlying model. Second, they are universal functional approximators in that neural networks can approximate any function with arbitrary accuracy [37], [78], Manuscript received July 28, 1999; revised July 6, 2000. G. P. Zhang is with the J. Mack Robinson College of Business, Georgia State University, Atlanta, GA 30303 USA (e-mail: gpzhang@gsu.edu). Publisher Item Identifier S 1094-6977(00)11206-4. [79]. Since any classification procedure seeks a functional relationship between the group membership and the attributes of the object, accurate identification of this underlying function is doubtlessly important. Third, neural networks are nonlinear models, which makes them flexible in modeling real world complex relationships. Finally, neural networks are able to estimate the posterior probabilities, which provides the basis for establishing classification rule and performing statistical analysis [138]. On the other hand, the effectiveness of neural network clas￾sification has been tested empirically. Neural networks have been successfully applied to a variety of real world classification tasks in industry, business and science [186]. Applications in￾clude bankruptcy prediction [2], [96], [101], [167], [187], [195], handwriting recognition [61], [92], [98], [100], [113], speech recognition [25], [106], product inspection [97], [130], fault de￾tection [11], [80], medical diagnosis [19], [20], [30], [31], and bond rating [44], [163], [174]. A number of performance com￾parisons between neural and conventional classifiers have been made by many studies [36], [82], [115]. In addition, several computer experimental evaluations of neural networks for clas￾sification problems have been conducted under a variety of con￾ditions [127], [161]. Although significant progress has been made in classification related areas of neural networks, a number of issues in applying neural networks still remain and have not been solved success￾fully or completely. In this paper, some theoretical as well as empirical issues of neural networks are reviewed and discussed. The vast research topics and extensive literature makes it impos￾sible for one review to cover all of the work in the filed. This re￾view aims to provide a summary of the most important advances in neural network classification. The current research status and issues as well as the future research opportunities are also dis￾cussed. Although many types of neural networks can be used for classification purposes [105], our focus nonetheless is on the feedforward multilayer networks or multilayer perceptrons (MLPs) which are the most widely studied and used neural net￾work classifiers. Most of the issues discussed in the paper can also apply to other neural network models. The overall organization of the paper is as follows. After the introduction, we present fundamental issues of neural classifica￾tion in Section II, including the Bayesian classification theory, the role of posterior probability in classification, posterior prob￾ability estimation via neural networks, and the relationships be￾tween neural networks and the conventional classifiers. Sec￾tion III examines theoretical issues of learning and generaliza￾tion in classification as well as various practical approaches to improving neural classifier performance in learning and gener￾alization. Feature variable selection and the effect of misclassi￾fication costs—two important problems unique to classification 1094–6977/00$10.00 © 2000 IEEE

452 IEEE TRANSACTIONS ON SYSTEMS,MAN,AND CYBERNETICS-PART C:APPLICATIONS AND REVIEWS,VOL.30,NO.4,NOVEMBER 2000 problems-are discussed in Sections IV and V,respectively.Fi-C(x)is also known as the conditional risk function.The op- nally,Section VI concludes the paper. timal Bayesian decision rule that minimizes the overall expected cost is II.NEURAL NETWORKS AND TRADITIONAL CLASSIFIERS A.Bayesian Classification Theory Decide for x if). (5) Bayesian decision theory is the basis of statistical classifi- cation methods [42].It provides the fundamental probability When the misclassification costs are equal (0-1 cost function), model for well-known classification procedures such as the sta- then we have the special case (2)of the Bayesian classification tistical discriminant analysis. rule.Note the role of posterior probabilities in the decision rules Consider a general M-group classification problem in which (2)and(5). each object has an associated attribute vector x ofd dimensions. From(1)and (4)and note that the denominator is common to Let w denote the membership variable that takes a value of wi all classes,Bayesian decision rule (5)is equivalent to:Decidew M if an object is belong to group j.Define Pwi)as the prior for x iff()is the minimum.Consider probability of group j and f(xwias the probability density the special two-group case with two classes of wl and w2.We function.According to the Bayes rule should assign x to class 1 if P(wjlx)=f)P() (1) c21(xX)P(w2)f(x|2)<C2(X)P(w1)f(x|w) f(x or where P(wix)is the posterior probability of group j and f(x)is the probability density function:f(x)= fo u nOP) f(xwj)P(wj). (6) f(x w2)c12()P(w1) Now suppose that an object with a particular feature vector x is observed and a decision is to be made about its group mem- Expression(6)shows the interaction of prior probabilities and bership.The probability of classification error is misclassification cost in defining the classification rule,which can be exploited in building practical classification models to P(Error|x)=∑P(,lx) alleviate the difficulty in estimation of misclassification costs. 千) =1-P(wj x)if we decide wj. B.Posterior Probability Estimation via Neural Networks Hence if the purpose is to minimize the probability of total clas- In classification problems,neural networks provide direct es- sification error(misclassification rate),then we have the fol- timation of the posterior probabilities [58],[138],[156],[178]. lowing widely used Bayesian classification rule The importance of this capability is summarized by Richard and Lippmann [138]: Decide%forxiP代a冈==lMyP氏alX. (2) "Interpretation of network outputs as Bayesian probabilities allows outputs from multiple networks to be combined for This simple rule is the basis for other statistical classifiers. higher level decision making,simplifies creation of rejection For example,linear and quadratic discriminant functions can be thresholds,makes it possible to compensate for difference derived with the assumption of the multivariate normal distribu- between pattern class probabilities in training and test data, tion for the conditional density f(x of attribute vector x. allows output to be used to minimize alternative risk functions. There are two problems in applying the simple Bayes decision and suggests alternative measures of network performance." rule(2).First,in most practical situations,the density functions A neural network for a classification problem can be viewed are not known or can not be assumed to be normal and there- as a mapping function,:Rd-RM,where d-dimensional fore the posterior probabilities can not be determined directly. input x is submitted to the network and an M-vectored network Second,by using(2),the decision goal is simply to minimize output y is obtained to make the classification decision.The net- the probability of misclassifying a new object.In this way,we work is typically built such that an overall error measure such as are indifferent with regard to the consequences of misclassifica- the mean squared errors(MSE)is minimized.From the famous tion errors.In other words,we assume that the misclassification least squares estimation theory in statistics(see [126]),the map- costs for different groups are equal.This may not be the case for ping function x-y which minimizes the expected squared many real world applications where the cost of a wrong assign- error ment is quite different for different groups. If we can assign a cost to a misclassification error,we may Ely-F(x)2 (7) use that information to improve our decision.Let ci(x)be the cost of misclassifying x to group i when it actually belongs to is the conditional expectation of y given x group j.The expected cost associated with assigning x to group i IS (x)=y|. (8) M Ci()=cj(x)P(),i=1,2....,M.(4)In the classification problem,the desired output y is i=1 a vector of binary values and is the jth basis vector

452 IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS—PART C: APPLICATIONS AND REVIEWS, VOL. 30, NO. 4, NOVEMBER 2000 problems—are discussed in Sections IV and V, respectively. Fi￾nally, Section VI concludes the paper. II. NEURAL NETWORKS AND TRADITIONAL CLASSIFIERS A. Bayesian Classification Theory Bayesian decision theory is the basis of statistical classifi￾cation methods [42]. It provides the fundamental probability model for well-known classification procedures such as the sta￾tistical discriminant analysis. Consider a general -group classification problem in which each object has an associated attribute vector of dimensions. Let denote the membership variable that takes a value of if an object is belong to group . Define as the prior probability of group and as the probability density function. According to the Bayes rule (1) where is the posterior probability of group and is the probability density function: . Now suppose that an object with a particular feature vector is observed and a decision is to be made about its group mem￾bership. The probability of classification error is Error if we decide Hence if the purpose is to minimize the probability of total clas￾sification error (misclassification rate), then we have the fol￾lowing widely used Bayesian classification rule Decide for if (2) This simple rule is the basis for other statistical classifiers. For example, linear and quadratic discriminant functions can be derived with the assumption of the multivariate normal distribu￾tion for the conditional density of attribute vector . There are two problems in applying the simple Bayes decision rule (2). First, in most practical situations, the density functions are not known or can not be assumed to be normal and there￾fore the posterior probabilities can not be determined directly. Second, by using (2), the decision goal is simply to minimize the probability of misclassifying a new object. In this way, we are indifferent with regard to the consequences of misclassifica￾tion errors. In other words, we assume that the misclassification costs for different groups are equal. This may not be the case for many real world applications where the cost of a wrong assign￾ment is quite different for different groups. If we can assign a cost to a misclassification error, we may use that information to improve our decision. Let be the cost of misclassifying to group when it actually belongs to group . The expected cost associated with assigning to group is (4) is also known as the conditional risk function. The op￾timal Bayesian decision rule that minimizes the overall expected cost is Decide for if (5) When the misclassification costs are equal (0–1 cost function), then we have the special case (2) of the Bayesian classification rule. Note the role of posterior probabilities in the decision rules (2) and (5). From (1) and (4) and note that the denominator is common to all classes, Bayesian decision rule (5) is equivalent to: Decide for if is the minimum. Consider the special two-group case with two classes of and . We should assign to class 1 if or (6) Expression (6) shows the interaction of prior probabilities and misclassification cost in defining the classification rule, which can be exploited in building practical classification models to alleviate the difficulty in estimation of misclassification costs. B. Posterior Probability Estimation via Neural Networks In classification problems, neural networks provide direct es￾timation of the posterior probabilities [58], [138], [156], [178]. The importance of this capability is summarized by Richard and Lippmann [138]: “Interpretation of network outputs as Bayesian probabilities allows outputs from multiple networks to be combined for higher level decision making, simplifies creation of rejection thresholds, makes it possible to compensate for difference between pattern class probabilities in training and test data, allows output to be used to minimize alternative risk functions, and suggests alternative measures of network performance.” A neural network for a classification problem can be viewed as a mapping function, , where -dimensional input is submitted to the network and an -vectored network output is obtained to make the classification decision. The net￾work is typically built such that an overall error measure such as the mean squared errors (MSE) is minimized. From the famous least squares estimation theory in statistics (see [126]), the map￾ping function which minimizes the expected squared error (7) is the conditional expectation of given (8) In the classification problem, the desired output is a vector of binary values and is the th basis vector

ZHANG:NEURAL NETWORKS FOR CLASSIFICATION 453 ej=(0,...,0,1,0,...,0t if x group j.Hence the networks and statistical classifiers.The direct comparison be- ith element of F(x)is given by tween them may not be possible since neural networks are non- linear model-free method while statistical methods are basically F(x)=Elvilx linear and model based. =1·P(=1|x)+0·P(物=0|x) By appropriate coding of the desired output membership =P(=1|x) values,we may let neural networks directly model some dis- criminant functions.For example,in a two-group classification =P(wjx). (9) problem,if the desired output is coded as 1 if the object is from class I and-1 if it is from class 2.Then,from(9)the neural That is,the least squares estimate for the mapping function in a network estimates the following discriminant function: classification problem is exactly the posterior probability. Neural networks are universal approximators [37]and in theory can approximate any function arbitrarily closely. g(x)=P(w1 x)-P(w2 x). (11) However,the mapping function represented by a network is not perfect due to the local minima problem,suboptimal network The discriminating rule is simply:assign x to w ifg(x)>0 or architecture and the finite sample data in neural network w2 if g(x)<0.Any monotone increasing function of the poste- training.Therefore,it is clear that neural networks actually rior probability can be used to replace the posterior probability in(1 1)to form a different discriminant function but essentially provide estimates of the posterior probabilities. The mean squared error function(7)can be derived [143], the same classification rule [83]as As the statistical counterpart of neural networks,discriminant analysis is a well-known supervised classifier.Gallinari et al. [54]describe a general framework to establish the link between MSE [F(x)-P((x)dx discriminant analysis and neural network models.They find that in quite general conditions the hidden layers of an MLP project the input data onto different clusters in a way that these clus- P(wil x(1-P(wj x))f(x)dx.(10) ters can be further aggregated into different classes.For linear MLPs,the projection performed by the hidden layer is shown theoretically equivalent to the linear discriminant analysis.The The second term of the right-hand side is called the approxima- nonlinear MLPs,on the other hand,have been demonstrated tion error [14]and is independent of neural networks.It reflects through experiments the capability in performing more pow- the inherent irreducible error due to randomness of the data.The erful nonlinear discriminant analysis.Their work helps under- first term termed as the estimation error is affected by the effec- stand the underlying function and behavior of the hidden layer tiveness of neural network mapping.Theoretically speaking,it for classification problems and also explains why the neural net- may need a large network as well as large sample data in order works in principle can provide superior performance over linear to get satisfactory approximation.For example,Funahashi [53] discriminant analysis.The discriminant feature extraction by shows that for the two-group d-dimensional Gaussian classifi- the network with nonlinear hidden nodes has also been demon- cation problem,neural networks with at least 2d hidden nodes strated in Asoh and Otsu [6]and Webb and Lowe [181].Lim. have the capability to approximate the posterior probability with Alder and Hadingham [103]show that neural networks can per- arbitrary accuracy when infinite data is available and the training form quadratic discriminant analysis. proceeds ideally.Empirically,it is found that sample size is crit- Raudys [134],[135]presents a detailed analysis of nonlinear ical in learning but the number of hidden nodes may not be so single layer perceptron(SLP).He shows that during the adap- important [83],[138]. tive training process of SLP,by purposefully controlling the That the outputs of neural networks are least square estimates SLP classifier complexity through adjusting the target values, of the Bayesian a posteriori probabilities is also valid for other learning-steps,number of iterations and using regularization types of cost or error function such as the cross entropy function terms,the decision boundaries of SLP classifiers are equivalent [63],[138].The cross entropy function can be a more appro- or close to those of seven statistical classifiers.These statistical priate criterion than the squared error cost function in training classifiers include the Enclidean distance classifier,the Fisher neural networks for classification problems because of their bi- linear discriminant function,the Fisher linear discriminant nary output characteristic [144].Improved performance and re- function with pseudo-inversion of the covariance matrix,the duced training time have been reported with the cross entropy generalized Fisher linear discriminant function,the regularized function [75],[77].Miyake and Kanaya [116]show that neural linear discriminant analysis,the minimum empirical error networks trained with a generalized mean-squared error objec- classifier,and the maximum margin classifier [134].Kanaya tive function can yield the optimal Bayes rule. and Miyake [88]and Miyake and Kanaya [116]also illustrate theoretically and empirically the link between neural networks C.Neural Networks and Conventional Classifiers and the optimal Bayes rule in statistical decision problems. Statistical pattern classifiers are based on the Bayes decision Logistic regression is another important classification tool. theory in which posterior probabilities play a central role.The In fact,it is a standard statistical approach used in medical fact that neural networks can in fact provide estimates of pos- diagnosis and epidemiologic studies [91].Logistic regression terior probability implicitly establishes the link between neural is often preferred over discriminant analysis in practice [65]

ZHANG: NEURAL NETWORKS FOR CLASSIFICATION 453 if group . Hence the th element of is given by (9) That is, the least squares estimate for the mapping function in a classification problem is exactly the posterior probability. Neural networks are universal approximators [37] and in theory can approximate any function arbitrarily closely. However, the mapping function represented by a network is not perfect due to the local minima problem, suboptimal network architecture and the finite sample data in neural network training. Therefore, it is clear that neural networks actually provide estimates of the posterior probabilities. The mean squared error function (7) can be derived [143], [83] as (10) The second term of the right-hand side is called the approxima￾tion error [14] and is independent of neural networks. It reflects the inherent irreducible error due to randomness of the data. The first term termed as the estimation error is affected by the effec￾tiveness of neural network mapping. Theoretically speaking, it may need a large network as well as large sample data in order to get satisfactory approximation. For example, Funahashi [53] shows that for the two-group -dimensional Gaussian classifi￾cation problem, neural networks with at least hidden nodes have the capability to approximate the posterior probability with arbitrary accuracy when infinite data is available and the training proceeds ideally. Empirically, it is found that sample size is crit￾ical in learning but the number of hidden nodes may not be so important [83], [138]. That the outputs of neural networks are least square estimates of the Bayesian a posteriori probabilities is also valid for other types of cost or error function such as the cross entropy function [63], [138]. The cross entropy function can be a more appro￾priate criterion than the squared error cost function in training neural networks for classification problems because of their bi￾nary output characteristic [144]. Improved performance and re￾duced training time have been reported with the cross entropy function [75], [77]. Miyake and Kanaya [116] show that neural networks trained with a generalized mean-squared error objec￾tive function can yield the optimal Bayes rule. C. Neural Networks and Conventional Classifiers Statistical pattern classifiers are based on the Bayes decision theory in which posterior probabilities play a central role. The fact that neural networks can in fact provide estimates of pos￾terior probability implicitly establishes the link between neural networks and statistical classifiers. The direct comparison be￾tween them may not be possible since neural networks are non￾linear model-free method while statistical methods are basically linear and model based. By appropriate coding of the desired output membership values, we may let neural networks directly model some dis￾criminant functions. For example, in a two-group classification problem, if the desired output is coded as 1 if the object is from class 1 and if it is from class 2. Then, from (9) the neural network estimates the following discriminant function: (11) The discriminating rule is simply: assign to if or if . Any monotone increasing function of the poste￾rior probability can be used to replace the posterior probability in (11) to form a different discriminant function but essentially the same classification rule. As the statistical counterpart of neural networks, discriminant analysis is a well-known supervised classifier. Gallinari et al. [54] describe a general framework to establish the link between discriminant analysis and neural network models. They find that in quite general conditions the hidden layers of an MLP project the input data onto different clusters in a way that these clus￾ters can be further aggregated into different classes. For linear MLPs, the projection performed by the hidden layer is shown theoretically equivalent to the linear discriminant analysis. The nonlinear MLPs, on the other hand, have been demonstrated through experiments the capability in performing more pow￾erful nonlinear discriminant analysis. Their work helps under￾stand the underlying function and behavior of the hidden layer for classification problems and also explains why the neural net￾works in principle can provide superior performance over linear discriminant analysis. The discriminant feature extraction by the network with nonlinear hidden nodes has also been demon￾strated in Asoh and Otsu [6] and Webb and Lowe [181]. Lim, Alder and Hadingham [103] show that neural networks can per￾form quadratic discriminant analysis. Raudys [134], [135] presents a detailed analysis of nonlinear single layer perceptron (SLP). He shows that during the adap￾tive training process of SLP, by purposefully controlling the SLP classifier complexity through adjusting the target values, learning-steps, number of iterations and using regularization terms, the decision boundaries of SLP classifiers are equivalent or close to those of seven statistical classifiers. These statistical classifiers include the Enclidean distance classifier, the Fisher linear discriminant function, the Fisher linear discriminant function with pseudo-inversion of the covariance matrix, the generalized Fisher linear discriminant function, the regularized linear discriminant analysis, the minimum empirical error classifier, and the maximum margin classifier [134]. Kanaya and Miyake [88] and Miyake and Kanaya [116] also illustrate theoretically and empirically the link between neural networks and the optimal Bayes rule in statistical decision problems. Logistic regression is another important classification tool. In fact, it is a standard statistical approach used in medical diagnosis and epidemiologic studies [91]. Logistic regression is often preferred over discriminant analysis in practice [65]

454 IEEE TRANSACTIONS ON SYSTEMS,MAN,AND CYBERNETICS-PART C:APPLICATIONS AND REVIEWS,VOL.30,NO.4,NOVEMBER 2000 [132].In addition,the model can be interpreted as posterior that both underfitting and overfitting will affect generalization probability or odds ratio.It is a simple fact that when the capability ofa model.Therefore a model should be built in such logistic transfer function is used for the output nodes,simple a way that only the underlying systematic pattern of the popu- neural networks without hidden layers are identical to logistic lation is learned and represented by the model. regression models.Another connection is that the maximum The underfitting and overfitting phenomena in many data likelihood function of logistic regression is essentially the modeling procedures can be well analyzed through the cross-entropy cost function which is often used in training well-known bias-plus-variance decomposition of the prediction neural network classifiers.Schumacher et al.[149]make a error.In this section,the basic concepts of bias and variance detailed comparison between neural networks and logistic as well as their connection to neural network classifiers are regression.They find that the added modeling flexibility of discussed.Then the methods to improve learning and gener- neural networks due to hidden layers does not automatically alization ability through bias and/or variance reductions are guarantee their superiority over logistic regression because of reviewed. the possible overfitting and other inherent problems with neural networks [176]. A.Bias and Variance Composition of the Prediction Error Links between neural and other conventional classifiers have Geman et al.[57]give a thorough analysis of the relationship been illustrated by[32],[33],[741,[1391,[1401,[151],[175]. between learning and generalization in neural networks based Ripley [139],[140]empirically compares neural networks with on the concepts of model bias and model variance.A prespec- various classifiers such as classification tree,projection pursuit ified model which is less dependent on the data may misrepre- regression,linear vector quantization,multivariate adaptive re- sent the true functional relationship and have a large bias.On gression splines and nearest neighbor methods. the other hand,a model-free or data-driven model may be too A large number of studies have been devoted to empirical dependent on the specific data and have a large variance.Bias comparisons between neural and conventional classifiers.The and variance are often incompatible.With a fixed data set,the most comprehensive one can be found in Michie et al.[115] effort of reducing one will inevitably cause the other increasing. which reports a large-scale comparative study-the StatLog A good tradeoff between model bias and model variance is nec- project.In this project,three general classification approaches essary and desired in building a useful neural network classifier. of neural networks,statistical classifiers and machine learning Without loss of generality,consider a two-group classifica- with 23 methods are compared using more than 20 different real tion problem in which the binary output variable yE t0,1}is data sets.Their general conclusion is that no single classifier related to a set of input variables(feature vector)x by is the best for all data sets although the feedforward neural networks do have good performance over a wide range of prob- y=F(x)+E lems.Neural networks have also been compared with decision trees [28],[36],[66],[104],[155],discriminant analysis [36], where x)is the target or underlying function and e is assumed [127],[146],[161],[193],CART [7],[40],k-nearest-neighbor to be a zero-mean random variable.From(8)and(9),the target [82],[127],and linear programming method [127]. function is the conditional expectation ofy givenx,that is FX=E(y x=Pw1 x. (12) III.LEARNING AND GENERALIZATION Given a particular training data set Dy of size N,the goal of Learning and generalization is perhaps the most important modeling is to find an estimate,f(x;D),of Fx)such that an topic in neural network research [3],[18],[157],[185].Learning overall estimation error can be minimized.The most commonly is the ability to approximate the underlying behavior adaptively used performance measure is the mean squared error from the training data while generalization is the ability to pre- dict well beyond the training data.Powerful data fitting or func- MSE =E[-f(x;DN))2] tion approximation capability of neural networks also makes =E[(u-F(x)]+(fx;Dx)-Fx).(13) them susceptible to the overfitting problem.The symptom of It is important to notice that the MSE depends on the particular an overfitting model is that it fits the training sample very well data set Dy.A change of the data set and/or sample size may but has poor generalization capability when used for prediction result in a change in the estimation function and hence the esti- purposes.Generalization is a more desirable and critical feature mation error.In most applications,the training data set Dy rep- because the most common use of a classifier is to make good resents a random sample from the population of all possible data prediction on new or unknown objects.A number of practical sets of size N.Considering the random nature of the training network design issues related to learning and generalization in- data,the overall prediction error of the model can be written as clude network size,sample size,model selection,and feature se- lection.Wolpert [188]addresses most of these issues oflearning EDE[(y-f(x;DN) and generalization within a general Bayesian framework. =E[(-F())]+ED[(f(x;DN)-F(x))(14) In general,a simple or inflexible model such as a linear clas- sifier may not have the power to learn enough the underlying re-where Ep denotes the expectation over all possible random lationship and hence underfit the data.On the other hand,com-samples of sample size N.In the following,D will be used plex flexible models such as neural networks tend to overfit the to represent the data set with the fixed sample size N for con- data and cause the model unstable when extrapolating.It is clear venience.Since the first term on the right hand side,E[(y-

454 IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS—PART C: APPLICATIONS AND REVIEWS, VOL. 30, NO. 4, NOVEMBER 2000 [132]. In addition, the model can be interpreted as posterior probability or odds ratio. It is a simple fact that when the logistic transfer function is used for the output nodes, simple neural networks without hidden layers are identical to logistic regression models. Another connection is that the maximum likelihood function of logistic regression is essentially the cross-entropy cost function which is often used in training neural network classifiers. Schumacher et al. [149] make a detailed comparison between neural networks and logistic regression. They find that the added modeling flexibility of neural networks due to hidden layers does not automatically guarantee their superiority over logistic regression because of the possible overfitting and other inherent problems with neural networks [176]. Links between neural and other conventional classifiers have been illustrated by [32], [33], [74], [139], [140], [151], [175]. Ripley [139], [140] empirically compares neural networks with various classifiers such as classification tree, projection pursuit regression, linear vector quantization, multivariate adaptive re￾gression splines and nearest neighbor methods. A large number of studies have been devoted to empirical comparisons between neural and conventional classifiers. The most comprehensive one can be found in Michie et al. [115] which reports a large-scale comparative study—the StatLog project. In this project, three general classification approaches of neural networks, statistical classifiers and machine learning with 23 methods are compared using more than 20 different real data sets. Their general conclusion is that no single classifier is the best for all data sets although the feedforward neural networks do have good performance over a wide range of prob￾lems. Neural networks have also been compared with decision trees [28], [36], [66], [104], [155], discriminant analysis [36], [127], [146], [161], [193], CART [7], [40], -nearest-neighbor [82], [127], and linear programming method [127]. III. LEARNING AND GENERALIZATION Learning and generalization is perhaps the most important topic in neural network research [3], [18], [157], [185]. Learning is the ability to approximate the underlying behavior adaptively from the training data while generalization is the ability to pre￾dict well beyond the training data. Powerful data fitting or func￾tion approximation capability of neural networks also makes them susceptible to the overfitting problem. The symptom of an overfitting model is that it fits the training sample very well but has poor generalization capability when used for prediction purposes. Generalization is a more desirable and critical feature because the most common use of a classifier is to make good prediction on new or unknown objects. A number of practical network design issues related to learning and generalization in￾clude network size, sample size, model selection, and feature se￾lection. Wolpert [188] addresses most of these issues of learning and generalization within a general Bayesian framework. In general, a simple or inflexible model such as a linear clas￾sifier may not have the power to learn enough the underlying re￾lationship and hence underfit the data. On the other hand, com￾plex flexible models such as neural networks tend to overfit the data and cause the model unstable when extrapolating. It is clear that both underfitting and overfitting will affect generalization capability of a model. Therefore a model should be built in such a way that only the underlying systematic pattern of the popu￾lation is learned and represented by the model. The underfitting and overfitting phenomena in many data modeling procedures can be well analyzed through the well-known bias-plus-variance decomposition of the prediction error. In this section, the basic concepts of bias and variance as well as their connection to neural network classifiers are discussed. Then the methods to improve learning and gener￾alization ability through bias and/or variance reductions are reviewed. A. Bias and Variance Composition of the Prediction Error Geman et al. [57] give a thorough analysis of the relationship between learning and generalization in neural networks based on the concepts of model bias and model variance. A prespec￾ified model which is less dependent on the data may misrepre￾sent the true functional relationship and have a large bias. On the other hand, a model-free or data-driven model may be too dependent on the specific data and have a large variance. Bias and variance are often incompatible. With a fixed data set, the effort of reducing one will inevitably cause the other increasing. A good tradeoff between model bias and model variance is nec￾essary and desired in building a useful neural network classifier. Without loss of generality, consider a two-group classifica￾tion problem in which the binary output variable is related to a set of input variables (feature vector) by where is the target or underlying function and is assumed to be a zero-mean random variable. From (8) and (9), the target function is the conditional expectation of given , that is (12) Given a particular training data set of size , the goal of modeling is to find an estimate, , of such that an overall estimation error can be minimized. The most commonly used performance measure is the mean squared error (13) It is important to notice that the MSE depends on the particular data set . A change of the data set and/or sample size may result in a change in the estimation function and hence the esti￾mation error. In most applications, the training data set rep￾resents a random sample from the population of all possible data sets of size . Considering the random nature of the training data, the overall prediction error of the model can be written as (14) where denotes the expectation over all possible random samples of sample size . In the following, will be used to represent the data set with the fixed sample size for con￾venience. Since the first term on the right hand side

ZHANG:NEURAL NETWORKS FOR CLASSIFICATION 455 F(x))2]=Ele2],is independent of both the training sample to produce accurate classification.That simple classifiers often and the underlying function,it reflects the irreducible estima- perform well in practice [76]seems to support Friedman's find- tion error because of the intrinsic noise of the data.The second ings term on the right hand side of(14),therefore,is a nature measure of the effectiveness of f(x;D)as a predictor of y.This term can B.Methods for Reducing Prediction Error be further decomposed as [57] As a flexible"model-free"approach to classification,neural ED[(f(x:D)-E(x2 networks often tend to fit the training data very well and thus have low bias.But the potential risk is the overfitting that causes ={ED[fxD】-E(y|x)}2 high variance in generalization.Dietterich and Kong [41]point +ED{(f(x:D)-ED[f(x;D)]2). (15) out in the machine learning context that the variance is a more important factor than the learning bias in poor prediction perfor- The first term on the right hand side is the square of the bias mance.Breiman [26]finds that neural network classifiers be- and is for simplicity called model bias while the second one is long to unstable prediction methods in that small changes in termed as model variance.This is the famous bias plus variance the training sample could cause large variations in the test re- decomposition of the prediction error. sults.Much attention has been paid to this problem ofoverfitting Ideally,the optimal model that minimizes the overall MSE or high variance in the literature.A majority of research effort in (14)is given by f(;D)=E(yx),which leaves the min- has been devoted to developing methods to reduce the overfit- imum MSE to be the intrinsic error Ele2].In reality,however, ting effect.Such methods include cross validation [118,[184]. because of the randomness of the limited data set D.the esti- training with penalty terms [182],and weight decay and node mate f(x;D)is also a random variable which will hardly be the pruning [137],[148].Weigend [183]analyzes overfitting phe- best possible function E(y x)for a given data set.The bias and nomena by introducing the concept of the effective number of variance terms in(15)hence provide useful information on how hidden nodes.An interesting observation by Dietterich [39]is the estimation differs from the desired function.The model bias that improving the optimization algorithms in training does not measures the extent to which the average of the estimation func- have positive effect on the testing performance and hence the tion over all possible data sets with the same size differs from the overfitting effect may be reduced by "undercomputing." desired function.The model variance,on the other hand,mea- Wang [179]points out the unpredictability of neural networks sures the sensitivity of the estimation function to the training in classification applications in the context of learning and gen- data set.Although it is desirable to have both low bias and low eralization.He proposes a global smoothing training strategy variance,we can not reduce both at the same time for a given by imposing monotonic constraints on network training,which data set because these goals are conflicting.A model that is less seems effective in solving classification problems [5] dependent on the data tends to have low variance but high bias Ensemble method or combining multiple classifiers [21],[8], if the model is incorrect.On the other hand,a model that fits the [64],[67],[87刀，[128]，[129]，[192]is another active research data well tends to have low bias but high variance when applied area to reduce generalization error [153].By averaging or voting to different data sets.Hence a good model should balance well the prediction results from multiple networks,the model vari- between model bias and model variance ance can be significantly reduced.The motivation of combining The work by Geman et al.[57]on bias and variance tradeoff several neural networks is to improve the out-of-sample clas- under the quadratic objective function has stimulated a lot of sification performance over individual classifiers or to guard research interest and activities in the neural network,machine against the failure of individual component networks.It has been learning,and statistical communities.Wolpert [190]extends the shown theoretically that the performance of the ensemble can bias-plus-variance dilemma to a more general bias-variance-co- not be worse than any single model used separately if the pre- variance tradeoff in the Bayesian context.Jacobs [85]studies dictions of individual classifier are unbiased and uncorrelated various properties of bias and variance components for mix- [129].Tumer and Ghosh [172]provide an analytical frame- tures-of-experts architectures.Dietterich and Kong [41],Kong work to understand the reasons why linearly combined neural and Dietterich [94],Breiman [26],Kohavi and Wolpert [93], classifiers work and how to quantify the improvement achieved Tibshirani [168],James and Hastie [86],and Heskes [71]have by combining.Kittler et al.[90]present a general theoretical developed different versions of bias-variance decomposition for framework for classifier ensembles.They review and compare zero-one loss functions of classification problems.These alter- many existing classifier combination schemes and show that native decompositions provide insights into the nature of gen- many different ensemble methods can be treated as special cases eralization error from different perspectives.Each decomposi- of compound classification where all the pattern representations tion formula has its own merits as well as demerits.Noticing are used jointly to make decisions. that all formulations of the bias and variance decomposition in An ensemble can be formed by multiple network architec- classification are in additive forms,Friedman [48]points out tures,same architecture trained with different algorithms,dif- that the bias and variance components are not necessarily addi- ferent initial random weights,or even different classifiers.The tive and instead they can be "interactive in a multiplicative and component networks can also be developed by training with dif- highly nonlinear way."He finds that this interaction may be ex- ferent data such as the resampling data.The mixed combination ploited to reduce classification errors because bias terms may of neural networks with traditional statistical classifiers has also be cancelled by low-variance but potentially high-bias methods been suggested [35],[112]

ZHANG: NEURAL NETWORKS FOR CLASSIFICATION 455 , is independent of both the training sample and the underlying function, it reflects the irreducible estima￾tion error because of the intrinsic noise of the data. The second term on the right hand side of (14), therefore, is a nature measure of the effectiveness of as a predictor of . This term can be further decomposed as [57] (15) The first term on the right hand side is the square of the bias and is for simplicity called model bias while the second one is termed as model variance. This is the famous bias plus variance decomposition of the prediction error. Ideally, the optimal model that minimizes the overall MSE in (14) is given by , which leaves the min￾imum MSE to be the intrinsic error . In reality, however, because of the randomness of the limited data set , the esti￾mate is also a random variable which will hardly be the best possible function for a given data set. The bias and variance terms in (15) hence provide useful information on how the estimation differs from the desired function. The model bias measures the extent to which the average of the estimation func￾tion over all possible data sets with the same size differs from the desired function. The model variance, on the other hand, mea￾sures the sensitivity of the estimation function to the training data set. Although it is desirable to have both low bias and low variance, we can not reduce both at the same time for a given data set because these goals are conflicting. A model that is less dependent on the data tends to have low variance but high bias if the model is incorrect. On the other hand, a model that fits the data well tends to have low bias but high variance when applied to different data sets. Hence a good model should balance well between model bias and model variance. The work by Geman et al. [57] on bias and variance tradeoff under the quadratic objective function has stimulated a lot of research interest and activities in the neural network, machine learning, and statistical communities. Wolpert [190] extends the bias-plus-variance dilemma to a more general bias-variance-co￾variance tradeoff in the Bayesian context. Jacobs [85] studies various properties of bias and variance components for mix￾tures-of-experts architectures. Dietterich and Kong [41], Kong and Dietterich [94], Breiman [26], Kohavi and Wolpert [93], Tibshirani [168], James and Hastie [86], and Heskes [71] have developed different versions of bias-variance decomposition for zero-one loss functions of classification problems. These alter￾native decompositions provide insights into the nature of gen￾eralization error from different perspectives. Each decomposi￾tion formula has its own merits as well as demerits. Noticing that all formulations of the bias and variance decomposition in classification are in additive forms, Friedman [48] points out that the bias and variance components are not necessarily addi￾tive and instead they can be “interactive in a multiplicative and highly nonlinear way.” He finds that this interaction may be ex￾ploited to reduce classification errors because bias terms may be cancelled by low-variance but potentially high-bias methods to produce accurate classification. That simple classifiers often perform well in practice [76] seems to support Friedman’s find￾ings. B. Methods for Reducing Prediction Error As a flexible “model-free” approach to classification, neural networks often tend to fit the training data very well and thus have low bias. But the potential risk is the overfitting that causes high variance in generalization. Dietterich and Kong [41] point out in the machine learning context that the variance is a more important factor than the learning bias in poor prediction perfor￾mance. Breiman [26] finds that neural network classifiers be￾long to unstable prediction methods in that small changes in the training sample could cause large variations in the test re￾sults. Much attention has been paid to this problem of overfitting or high variance in the literature. A majority of research effort has been devoted to developing methods to reduce the overfit￾ting effect. Such methods include cross validation [118], [184], training with penalty terms [182], and weight decay and node pruning [137], [148]. Weigend [183] analyzes overfitting phe￾nomena by introducing the concept of the effective number of hidden nodes. An interesting observation by Dietterich [39] is that improving the optimization algorithms in training does not have positive effect on the testing performance and hence the overfitting effect may be reduced by “undercomputing.” Wang [179] points out the unpredictability of neural networks in classification applications in the context of learning and gen￾eralization. He proposes a global smoothing training strategy by imposing monotonic constraints on network training, which seems effective in solving classification problems [5]. Ensemble method or combining multiple classifiers [21], [8], [64], [67], [87], [128], [129], [192] is another active research area to reduce generalization error [153]. By averaging or voting the prediction results from multiple networks, the model vari￾ance can be significantly reduced. The motivation of combining several neural networks is to improve the out-of-sample clas￾sification performance over individual classifiers or to guard against the failure of individual component networks. It has been shown theoretically that the performance of the ensemble can not be worse than any single model used separately if the pre￾dictions of individual classifier are unbiased and uncorrelated [129]. Tumer and Ghosh [172] provide an analytical frame￾work to understand the reasons why linearly combined neural classifiers work and how to quantify the improvement achieved by combining. Kittler et al. [90] present a general theoretical framework for classifier ensembles. They review and compare many existing classifier combination schemes and show that many different ensemble methods can be treated as special cases of compound classification where all the pattern representations are used jointly to make decisions. An ensemble can be formed by multiple network architec￾tures, same architecture trained with different algorithms, dif￾ferent initial random weights, or even different classifiers. The component networks can also be developed by training with dif￾ferent data such as the resampling data. The mixed combination of neural networks with traditional statistical classifiers has also been suggested [35], [112]

456 IEEE TRANSACTIONS ON SYSTEMS,MAN,AND CYBERNETICS-PART C:APPLICATIONS AND REVIEWS,VOL.30,NO.4,NOVEMBER 2000 There are many different ways of combining individual on previous constructed ensemble's performances with more classifiers [84],[192].The most popular approach to com- weights giving to those cases mostly likely to be misclassified. bining multiple classifiers is via simple average of outputs from Breiman [27]shows that both bagging and arcing can reduce individual classifiers.But combining can also be done with bias but the reduction in variance with these approaches is weighted averaging that treats the contribution or accuracy of much larger. component classifiers differently [68],[67],[84].Nonlinear Although much effort has been devoted in combining combining methods such as Dempster-Shafer belief-based method,several issues remain or have not completely solved. methods [141],[192],rank-based information [1],voting These include the choice of individual classifiers included in schemes [17],and order statistics [173]have been proposed. the ensemble,the size of the ensemble,and the general optimal Wolpert [189]proposes to use two (or more)levels of stacked way to combine individual classifiers.The issue about under networks to improve generalization performance of neural what conditions combining is most effective and what methods network classifiers.The first level networks include a variety should be included is still not completely solved.Combining of neural models trained with leave-one-out cross validation neural classifiers with traditional methods can be a fruitful samples.The outputs from these networks are then used as research area.Since ensemble methods are very effective when inputs to the second level of networks that provide smoothed individual classifiers are negatively related [85]or uncorrelated transformation into the predicted output. [1291.there is a need to develop efficient classifier selection The error reduction of ensemble method is mainly due to schemes to make best use of the advantage of combining. the reduction of the model variance rather than the model bias. Since the ensemble method works better if different classifiers IV.FEATURE VARIABLE SELECTION in the ensemble disagree each other strongly [95],[111],[129], [1411.some of the models in the ensemble could be highly bi- Selection of a set of appropriate input feature variables is an ased.However,the averaging effect may offset the bias and more important issue in building neural as well as other classifiers. importantly decrease the sensitivity of the classifier to the new The purpose of feature variable selection is to find the smallest data.It has been observed [59]that it is generally more desirable set of features that can result in satisfactory predictive perfor- to have an error rate estimator with small variance than an un- mance.Because of the curse of dimensionality [38,it is often biased one with large variance.Empirically a number of studies necessary and beneficial to limit the number of input features in [41],[93]find that the prediction error reduction of ensemble a classifier in order to have a good predictive and less compu- method is mostly accounted for by the reduction in variance. tationally intensive model.Out-of-sample performance can be Although in general,classifier combination can improve gen- improved by using only a small subset of the entire set of vari- eralization performance,correlation among individual classi- ables available.The issue is also closely related to the principle fiers can be harmful to the neural network ensemble [69],[129], of parsimony in model building as well as the model learning [172].Sharkey and Sharkey [154]discuss the need and benefits and generalization discussed in Section III. of ensemble diversity among the members of an ensemble for Numerous statistical feature selection criteria and search al- generalization.Rogova [141]finds that the better performance gorithms have been developed in the pattern recognition liter- of a combined classifier is not necessarily achieved by com- ature 38,[52.Some of these statistical feature selection ap- bining classifiers with better individual performance.Instead, proaches can not be directly applied to neural classifiers due it is more important to have independent classifiers in the en- to nonparametric nature of neural networks.Recently there are semble.His conclusion is in line with that of Perron and Cooper increasing interests in developing feature variable selection or [129]and Krogh and Vedelsby [95]that ensemble classifiers dimension reduction approaches for neural network classifiers. can perform better if individual classifiers considerably disagree Most of the methods are heuristic in nature.Some are proposed with each other. based on the ideas similar to their statistical counterparts.It is One of the ways to reduce correlation among component found under certain circumstances that the performance of a classifiers is to build the ensemble model using different feature neural classifier can be improved by using statistically indepen- variables.In general,classifiers based on different feature dent features [49]. variables are more independent than those based on different One of the most popular methods in feature selection is the architectures with the same feature variables [73],192. principle component analysis(PCA).Principle component anal- Another effective method is training with different data sets. ysis is a statistical technique to reduce dimension without loss of Statistical resampling techniques such as bootstrapping [45]are the intrinsic information contained in the original data.As such. often used to generate multiple samples from original training it is often used as a pre-processing method in neural network data.Two recently developed ensemble methods based on training.One problem with PCA is that it is a kind of unsuper- bootstrap samples are "bagging"[26]and "arcing"classifiers vised learning procedure and does not consider the correlation [27].Bagging (for bootstrap aggregation and combining)and between target outputs and input features.In addition,PCA is arcing (for adaptive resampling and combining)are similar a linear dimension reduction technique.It is not appropriate for methods in that both combine multiple classifiers constructed complex problems with nonlinear correlation structures. from bootstrap samples and vote for classes.The bagging The linear limitation of the PCA can be overcome by directly classifier generates simple bootstrap samples and combines using neural networks to perform dimension reduction.It has by simple majority voting while arcing uses an adaptive been shown that neural networks are able to perform certain bootstrapping scheme which selects bootstrap samples based nonlinear PCA [70],[125],[147].Karhunen and Joutsensalo

456 IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS—PART C: APPLICATIONS AND REVIEWS, VOL. 30, NO. 4, NOVEMBER 2000 There are many different ways of combining individual classifiers [84], [192]. The most popular approach to com￾bining multiple classifiers is via simple average of outputs from individual classifiers. But combining can also be done with weighted averaging that treats the contribution or accuracy of component classifiers differently [68], [67], [84]. Nonlinear combining methods such as Dempster–Shafer belief-based methods [141], [192], rank-based information [1], voting schemes [17], and order statistics [173] have been proposed. Wolpert [189] proposes to use two (or more) levels of stacked networks to improve generalization performance of neural network classifiers. The first level networks include a variety of neural models trained with leave-one-out cross validation samples. The outputs from these networks are then used as inputs to the second level of networks that provide smoothed transformation into the predicted output. The error reduction of ensemble method is mainly due to the reduction of the model variance rather than the model bias. Since the ensemble method works better if different classifiers in the ensemble disagree each other strongly [95], [111], [129], [141], some of the models in the ensemble could be highly bi￾ased. However, the averaging effect may offset the bias and more importantly decrease the sensitivity of the classifier to the new data. It has been observed [59] that it is generally more desirable to have an error rate estimator with small variance than an un￾biased one with large variance. Empirically a number of studies [41], [93] find that the prediction error reduction of ensemble method is mostly accounted for by the reduction in variance. Although in general, classifier combination can improve gen￾eralization performance, correlation among individual classi￾fiers can be harmful to the neural network ensemble [69], [129], [172]. Sharkey and Sharkey [154] discuss the need and benefits of ensemble diversity among the members of an ensemble for generalization. Rogova [141] finds that the better performance of a combined classifier is not necessarily achieved by com￾bining classifiers with better individual performance. Instead, it is more important to have independent classifiers in the en￾semble. His conclusion is in line with that of Perron and Cooper [129] and Krogh and Vedelsby [95] that ensemble classifiers can perform better if individual classifiers considerably disagree with each other. One of the ways to reduce correlation among component classifiers is to build the ensemble model using different feature variables. In general, classifiers based on different feature variables are more independent than those based on different architectures with the same feature variables [73], [192]. Another effective method is training with different data sets. Statistical resampling techniques such as bootstrapping [45] are often used to generate multiple samples from original training data. Two recently developed ensemble methods based on bootstrap samples are “bagging” [26] and “arcing” classifiers [27]. Bagging (for bootstrap aggregation and combining) and arcing (for adaptive resampling and combining) are similar methods in that both combine multiple classifiers constructed from bootstrap samples and vote for classes. The bagging classifier generates simple bootstrap samples and combines by simple majority voting while arcing uses an adaptive bootstrapping scheme which selects bootstrap samples based on previous constructed ensemble’s performances with more weights giving to those cases mostly likely to be misclassified. Breiman [27] shows that both bagging and arcing can reduce bias but the reduction in variance with these approaches is much larger. Although much effort has been devoted in combining method, several issues remain or have not completely solved. These include the choice of individual classifiers included in the ensemble, the size of the ensemble, and the general optimal way to combine individual classifiers. The issue about under what conditions combining is most effective and what methods should be included is still not completely solved. Combining neural classifiers with traditional methods can be a fruitful research area. Since ensemble methods are very effective when individual classifiers are negatively related [85] or uncorrelated [129], there is a need to develop efficient classifier selection schemes to make best use of the advantage of combining. IV. FEATURE VARIABLE SELECTION Selection of a set of appropriate input feature variables is an important issue in building neural as well as other classifiers. The purpose of feature variable selection is to find the smallest set of features that can result in satisfactory predictive perfor￾mance. Because of the curse of dimensionality [38], it is often necessary and beneficial to limit the number of input features in a classifier in order to have a good predictive and less compu￾tationally intensive model. Out-of-sample performance can be improved by using only a small subset of the entire set of vari￾ables available. The issue is also closely related to the principle of parsimony in model building as well as the model learning and generalization discussed in Section III. Numerous statistical feature selection criteria and search al￾gorithms have been developed in the pattern recognition liter￾ature [38], [52]. Some of these statistical feature selection ap￾proaches can not be directly applied to neural classifiers due to nonparametric nature of neural networks. Recently there are increasing interests in developing feature variable selection or dimension reduction approaches for neural network classifiers. Most of the methods are heuristic in nature. Some are proposed based on the ideas similar to their statistical counterparts. It is found under certain circumstances that the performance of a neural classifier can be improved by using statistically indepen￾dent features [49]. One of the most popular methods in feature selection is the principle component analysis (PCA). Principle component anal￾ysis is a statistical technique to reduce dimension without loss of the intrinsic information contained in the original data. As such, it is often used as a pre-processing method in neural network training. One problem with PCA is that it is a kind of unsuper￾vised learning procedure and does not consider the correlation between target outputs and input features. In addition, PCA is a linear dimension reduction technique. It is not appropriate for complex problems with nonlinear correlation structures. The linear limitation of the PCA can be overcome by directly using neural networks to perform dimension reduction. It has been shown that neural networks are able to perform certain nonlinear PCA [70], [125], [147]. Karhunen and Joutsensalo

ZHANG:NEURAL NETWORKS FOR CLASSIFICATION 457 [89]have discussed many aspects of PCA performed by neural Using two simulation problems,they find that the method can networks.Battiti [16]proposes to use mutual information as the identify relevant features on which a more accurate and faster guide to evaluate each feature's information content and select learning neural classifiers can be achieved. features with high information content. Weight elimination and node pruning are techniques often A number of heuristic measures have been proposed to esti- used to remove unnecessary linking weights or input nodes mate the relative importance or contribution of input features during the network training.One of the earlier methods is to the output variable.One of the simplest measures is the sum the optimal brain damage (OBD)[99].With this approach, of the absolute input weights [150]to reflect the impact of that a saliency measure is calculated for each weight based on a input variable on the output.The limitation of this measure simplified diagonal Hessian matrix.Then the weights with is obvious since it does not consider the impact of perhaps the lowest saliency can be eliminated.Based on the idea more important hidden node weights.Another simple measure of OBD,Cibas et al.[34]develop a procedure to remove is the sensitivity index [150]which is the average change in insignificant input nodes.Mozer and Smolensky [119]describe the output variable over the entire range of a particular input a node pruning method based on a saliency measure that is the variable.While intuitively appealing,these measures are not difference of the error between when the node is removed and useful in measuring nonlinear effect of the input variable since when the node is present.Egmont-Petersen et al.[46]propose they don not take consideration of hidden layer weights. a method for pruning input nodes based on four feature metrics. Several saliency measures of input variables explicitly Reed [137]presents a review of some pruning algorithms used consider both input and hidden weights and their interactions in neural network models. on the network output.For example,pseudo weight [133] All selection criteria and search procedures in feature se- is the sum of the product of weights from the input node to lection with neural networks are heuristic in nature and lack the hidden nodes and corresponding weights from the hidden of rigorous statistical tests to justify the removal or addition nodes to the output node.An important saliency measure of features.Hence,their performance may not be consistent is proposed by Garson [55]who partitions the hidden layer and robust in practical applications.Statistical properties of the weights into components associated with each input node and saliency measures as well as the search algorithms must be es- then the percentage of all hidden nodes weights attributable tablished in order to have more general and systematic feature to a particular input node is used to measure the importance selection procedures.More theoretical developments and exper- of that input variable.Garson's measure has been studied by imental investigations are needed in the filed of feature selec- many researchers and some modifications and extensions have tion. been made[22],[56l,[60l,[114],[123].Nath et al.[123] experimentally evaluate the Garson's saliency measure and V.MISCLASSIFICATION COSTS conclude that the measure works very well under a variety of conditions.Sung [162]studies three methods of sensitivity In the literature of neural network classification research and analysis,fuzzy curves,and change of mean square error to application,few studies consider misclassification costs in the rank input feature importance.Steppe and Bauer [158]classify classification decision.In other words,researchers explicitly or all feature saliency measures used in neural networks into implicitly assume equal cost consequences of misclassification. derivative-based and weight-based categories with the former With the equal cost or 0-1 cost function,minimizing the overall measuring the relative changes in either neural network output classification rate is the sole objective.Although assuming 0-1 or the estimated probability oferror and the latter measuring the cost function can simplify the model development,equal cost relative size of the weight vector emanating from each feature. assumption does not represent many real problems in quality Since exhaustive search through all possible subsets of assurance,acceptance sampling,bankruptcy prediction,credit feature variables is often computationally prohibitive,heuristic risk analysis,and medical diagnosis where uneven misclassifi- search procedures such as forward selection and backward cation costs are more appropriate.In these situations,groups are elimination are often used.Based on Garson's measure of often unbalanced and a misclassification error can carry signif- saliency,Glorfeld [60]presents a backward elimination pro- icantly different consequences on different groups. cedure to select more predictive feature variables.Steppe and Victor and Zhang [177]present a detailed investigation on Bauer [159],Steppe et al.[160],and Hu et al.[81]use the the effect of misclassification cost on neural network classi- Bonferroni-type or likelihood-ratio test statistic as the model fiers.They find that misclassification costs can have significant selection criterion and the backward sequential elimination impact on the classification results and the appropriate use approach to select features.Setiono and Liu [152]also develop of cost information can aid in optimal decision making.To a backward elimination method for feature selection.Their deal with asymmetric misclassification cost problem.Lowe method starts with the whole set of available feature variables and Webb [107],[108]suggest using weighted error function and then for each attribute variable,the accuracy of the network and targeting coding to incorporate the prior knowledge about is evaluated with all the weights associated with that variable the relative class importance or different misclassification set to zero.The variable that gives the lowest decrease in accu-costs.The proposed schemes are shown effective in terms of racy is removed.Belue and Bauer [22]propose a confidence improved feature extraction and classification performance. interval method to select salient features.A confidence interval The situations of unequal misclassification costs often occur on the average saliency is constructed to discriminate whether a when groups are very unbalanced.The costs of misclassifying feature has significant contribution to the classification ability. subjects in smaller groups are often much higher.Under the

ZHANG: NEURAL NETWORKS FOR CLASSIFICATION 457 [89] have discussed many aspects of PCA performed by neural networks. Battiti [16] proposes to use mutual information as the guide to evaluate each feature’s information content and select features with high information content. A number of heuristic measures have been proposed to esti￾mate the relative importance or contribution of input features to the output variable. One of the simplest measures is the sum of the absolute input weights [150] to reflect the impact of that input variable on the output. The limitation of this measure is obvious since it does not consider the impact of perhaps more important hidden node weights. Another simple measure is the sensitivity index [150] which is the average change in the output variable over the entire range of a particular input variable. While intuitively appealing, these measures are not useful in measuring nonlinear effect of the input variable since they don not take consideration of hidden layer weights. Several saliency measures of input variables explicitly consider both input and hidden weights and their interactions on the network output. For example, pseudo weight [133] is the sum of the product of weights from the input node to the hidden nodes and corresponding weights from the hidden nodes to the output node. An important saliency measure is proposed by Garson [55] who partitions the hidden layer weights into components associated with each input node and then the percentage of all hidden nodes weights attributable to a particular input node is used to measure the importance of that input variable. Garson’s measure has been studied by many researchers and some modifications and extensions have been made [22], [56], [60], [114], [123]. Nath et al. [123] experimentally evaluate the Garson’s saliency measure and conclude that the measure works very well under a variety of conditions. Sung [162] studies three methods of sensitivity analysis, fuzzy curves, and change of mean square error to rank input feature importance. Steppe and Bauer [158] classify all feature saliency measures used in neural networks into derivative-based and weight-based categories with the former measuring the relative changes in either neural network output or the estimated probability of error and the latter measuring the relative size of the weight vector emanating from each feature. Since exhaustive search through all possible subsets of feature variables is often computationally prohibitive, heuristic search procedures such as forward selection and backward elimination are often used. Based on Garson’s measure of saliency, Glorfeld [60] presents a backward elimination pro￾cedure to select more predictive feature variables. Steppe and Bauer [159], Steppe et al. [160], and Hu et al. [81] use the Bonferroni-type or likelihood-ratio test statistic as the model selection criterion and the backward sequential elimination approach to select features. Setiono and Liu [152] also develop a backward elimination method for feature selection. Their method starts with the whole set of available feature variables and then for each attribute variable, the accuracy of the network is evaluated with all the weights associated with that variable set to zero. The variable that gives the lowest decrease in accu￾racy is removed. Belue and Bauer [22] propose a confidence interval method to select salient features. A confidence interval on the average saliency is constructed to discriminate whether a feature has significant contribution to the classification ability. Using two simulation problems, they find that the method can identify relevant features on which a more accurate and faster learning neural classifiers can be achieved. Weight elimination and node pruning are techniques often used to remove unnecessary linking weights or input nodes during the network training. One of the earlier methods is the optimal brain damage (OBD) [99]. With this approach, a saliency measure is calculated for each weight based on a simplified diagonal Hessian matrix. Then the weights with the lowest saliency can be eliminated. Based on the idea of OBD, Cibas et al. [34] develop a procedure to remove insignificant input nodes. Mozer and Smolensky [119] describe a node pruning method based on a saliency measure that is the difference of the error between when the node is removed and when the node is present. Egmont-Petersen et al. [46] propose a method for pruning input nodes based on four feature metrics. Reed [137] presents a review of some pruning algorithms used in neural network models. All selection criteria and search procedures in feature se￾lection with neural networks are heuristic in nature and lack of rigorous statistical tests to justify the removal or addition of features. Hence, their performance may not be consistent and robust in practical applications. Statistical properties of the saliency measures as well as the search algorithms must be es￾tablished in order to have more general and systematic feature selection procedures. More theoretical developments and exper￾imental investigations are needed in the filed of feature selec￾tion. V. MISCLASSIFICATION COSTS In the literature of neural network classification research and application, few studies consider misclassification costs in the classification decision. In other words, researchers explicitly or implicitly assume equal cost consequences of misclassification. With the equal cost or 0–1 cost function, minimizing the overall classification rate is the sole objective. Although assuming 0–1 cost function can simplify the model development, equal cost assumption does not represent many real problems in quality assurance, acceptance sampling, bankruptcy prediction, credit risk analysis, and medical diagnosis where uneven misclassifi￾cation costs are more appropriate. In these situations, groups are often unbalanced and a misclassification error can carry signif￾icantly different consequences on different groups. Victor and Zhang [177] present a detailed investigation on the effect of misclassification cost on neural network classi￾fiers. They find that misclassification costs can have significant impact on the classification results and the appropriate use of cost information can aid in optimal decision making. To deal with asymmetric misclassification cost problem, Lowe and Webb [107], [108] suggest using weighted error function and targeting coding to incorporate the prior knowledge about the relative class importance or different misclassification costs. The proposed schemes are shown effective in terms of improved feature extraction and classification performance. The situations of unequal misclassification costs often occur when groups are very unbalanced. The costs of misclassifying subjects in smaller groups are often much higher. Under the

458 IEEE TRANSACTIONS ON SYSTEMS,MAN,AND CYBERNETICS-PART C:APPLICATIONS AND REVIEWS,VOL.30,NO.4,NOVEMBER 2000 assumption of equal consequences of misclassification.a sifier combination,and uneven misclassification treatment.In classifier tends to bias toward the larger groups that have more addition,as a practical decision making tool,neural networks observations in the training sample.For some problems such need to be systematically evaluated and compared with other as medical diagnosis,we may know the prior probabilities new and traditional classifiers.Recently,several authors have of group memberships and hence can incorporate them in pointed out the lack of the rigorous comparisons between neural the training sample composition.However,a large training network and other classifiers in the current literature [43],[47], sample is often required in order to have enough representatives [131],[145].This may be one of the major reasons that mixed of smaller groups.Barnard and Botha [13]find that while results are often reported in empirical studies. neural networks are able to make use of the prior probabilities Other research topics related to neural classification include relatively efficiently,the large sample size can improve per- network training [12],[15],[62],[124],[142],model design and formance.An alternative approach in selecting training set is selection [50],[72],[117],[121],[122],[180],[194],sample using equal number of examples from each group.The results size issues [51],[135],[136],Bayesian analysis [102],[109], can be easily extended to test sets with unbalanced groups [110],[120],and wavelet networks [165],[166],[196].These by considering the different prior probabilities in training issues are common to all applications of neural networks and and test sets [24].Lowe and Webb [107]propose a weighted some of them have been previously reviewed [4],[10],[29], error function with a weighting factor to account for different [120],[137],[192].It is clear that research opportunities are group proportions between the training set and the test set. abundant in many aspects of neural classifiers.We believe that In a bankruptcy prediction study,Wilson and Sharda [187] the multidisciplinary nature of the neural network classification investigate the effect of different group compositions in training research will generate more research activities and bring about and test sets on the classification performance.They conclude more fruitful outcomes in the future. that the neural network classifier can have better predictive performance using balanced training sample.However if the REFERENCES test set contains too few members of the more important group, the true model performance may not be correctly determined. [1]K.Al-Ghoneim and B.V.K.V.Kumar,"Learning ranks with neural net- works,"in Proc.SPIE Applications Science Artificial Neural Networks, Although classification costs are difficult to assign in real vol.2492,1995,pp.446-464. problems,ignoring the unequal misclassification risk for dif [2]E.I.Altman,G.Marco,and F.Varetto,"Corporate distress diagnosis: ferent groups may have significant impact on the practical use Comparisons using linear discriminant analysis and neural networks(the Italian experience),"J.Bank.Finance,vol.18,pp.505-529,1994. of the classification.It should be pointed out that a neural clas- [3]B.Amirikian and H.Nishimura,"What size network is good for gener- sifier which minimizes the total number of misclassification er- alization of a specific task of interest?,"Neural Nenvorks.vol.7.no.2. rors may not be useful for situations where different misclassi- pp.321-329,1994 [4]U.Anders and O.Korn,"Model selection in neural networks,"Neural fication errors carry highly uneven consequences or costs.More Nenvorks,vol.12,pp.309-323,1999. research should be devoted to designing effective cost-based [5]N.P.Archer and S.Wang,"Fuzzy set representation of neural network neural network classifiers. classification boundaries,"IEEE Trans.Syst.Man.Cybern.,vol.21,pp. 735-742,1991. [6]H.Asoh and N.Otsu,"Anapproximation ofnonlinear discriminant anal- ysis by multilayer neural networks,"in Proc.Int.Joint Conf.Neural Net- VI.CONCLUSION works,San Diego,CA,1990,pp.III-211-III-216. (7]L.Atlas,R.Cole,J.Connor,M.El-Sharkawi,R.J.Marks II,Y. Classification is the most researched topic ofneural networks. Muthusamy,and E.Barnard,"Performance comparisons between This paper has presented a focused review of several important backpropagation networks and classification trees on three real-world issues and recent developments of neural networks for classi- applications,"in Advances in Neural Information Processing Systems, D.S.Touretzky,Ed.San Mateo,CA:Morgan Kaufmann,1990,vol. fication problems.These include the posterior probability esti- 2,Pp.622-629. mation,the link between neural and conventional classifiers,the [8]R.Avnimelech and N.Intrator,"Boosted mixture of experts:An en- relationship between learning and generalization in neural net- semble learning scheme,"Neural Compu.,vol.11,pp.483-497,1999. [9]A.Babloyantz and V.V.Ivanov,"Neural networks in cardiac arrhyth- work classification,and issues to improve neural classifier per- mias,"in Industrial Applications of Neural Networks,F.F.Soulie and P. formance.Although there are many other research topics that Gallinari,Eds,Singapore:World Scientific,1998,pp.403-417. have been investigated in the literature,we believe that this se- [10]P.F.Baldi and K.Hornik,"Leaming in linear neural networks:A survey,"IEEE Trans.Neural Nenvorks,vol.6,pp.837-858,1995. lected review has covered the most important aspects of neural [11]E.B.Barlett and R.E.Uhrig."Nuclear power plant status diagnostics networks in solving classification problems. using artificial neural networks,"Nucl.Technol.,vol.97,pp.272-281, 1992. The research efforts during the last decade have made signif- [12]E.Barnard,"Optimization for training neural nets,"IEEE Trans.Neural icant progresses in both theoretical development and practical Nenvorks,vol.3,pp.232-240,1992. applications.Neural networks have been demonstrated to be a [13]E.Barnard and E.C.Botha,"Back-propagation uses prior information competitive alternative to traditional classifiers for many prac- efficiently,"IEEE Trans.Neural Nenvorks,vol.4,pp.794-802,1993. [14]R.Barron,"Statistical properties of artificial neural networks,"in Proc. tical classification problems.Numerous insights have also been 28th IEEE Conf.Decision Control,vol.280-285,1989. gained into the neural networks in performing classification as [15]R.Battiti,"First-and second-order methods for learning;between well as other tasks [23],[169].However,while neural networks steepest descent and Newton's method,"Neural Comput,vol.4,pp. 141-166.1992. have shown much promise,many issues still remain unsolved or [16 -,"Using mutual information for selecting features in supervised incompletely solved.As indicated earlier,more research should neural net learning,"IEEE Trans.Neural Nenvorks,vol.5,no.4,pp. 537-550.1994. be devoted to developing more effective and efficient methods [17]R.Battiti and A.M.Colla,"Democracy in neural nets:Voting schemes in neural model identification,feature variable selection,clas- for classification,"Neural Nenvorks,vol.7,no.4,pp.691-709,1994

458 IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS—PART C: APPLICATIONS AND REVIEWS, VOL. 30, NO. 4, NOVEMBER 2000 assumption of equal consequences of misclassification, a classifier tends to bias toward the larger groups that have more observations in the training sample. For some problems such as medical diagnosis, we may know the prior probabilities of group memberships and hence can incorporate them in the training sample composition. However, a large training sample is often required in order to have enough representatives of smaller groups. Barnard and Botha [13] find that while neural networks are able to make use of the prior probabilities relatively efficiently, the large sample size can improve per￾formance. An alternative approach in selecting training set is using equal number of examples from each group. The results can be easily extended to test sets with unbalanced groups by considering the different prior probabilities in training and test sets [24]. Lowe and Webb [107] propose a weighted error function with a weighting factor to account for different group proportions between the training set and the test set. In a bankruptcy prediction study, Wilson and Sharda [187] investigate the effect of different group compositions in training and test sets on the classification performance. They conclude that the neural network classifier can have better predictive performance using balanced training sample. However if the test set contains too few members of the more important group, the true model performance may not be correctly determined. Although classification costs are difficult to assign in real problems, ignoring the unequal misclassification risk for dif￾ferent groups may have significant impact on the practical use of the classification. It should be pointed out that a neural clas￾sifier which minimizes the total number of misclassification er￾rors may not be useful for situations where different misclassi￾fication errors carry highly uneven consequences or costs. More research should be devoted to designing effective cost-based neural network classifiers. VI. CONCLUSION Classification is the most researched topic of neural networks. This paper has presented a focused review of several important issues and recent developments of neural networks for classi￾fication problems. These include the posterior probability esti￾mation, the link between neural and conventional classifiers, the relationship between learning and generalization in neural net￾work classification, and issues to improve neural classifier per￾formance. Although there are many other research topics that have been investigated in the literature, we believe that this se￾lected review has covered the most important aspects of neural networks in solving classification problems. The research efforts during the last decade have made signif￾icant progresses in both theoretical development and practical applications. Neural networks have been demonstrated to be a competitive alternative to traditional classifiers for many prac￾tical classification problems. Numerous insights have also been gained into the neural networks in performing classification as well as other tasks [23], [169]. However, while neural networks have shown much promise, many issues still remain unsolved or incompletely solved. As indicated earlier, more research should be devoted to developing more effective and efficient methods in neural model identification, feature variable selection, clas￾sifier combination, and uneven misclassification treatment. In addition, as a practical decision making tool, neural networks need to be systematically evaluated and compared with other new and traditional classifiers. Recently, several authors have pointed out the lack of the rigorous comparisons between neural network and other classifiers in the current literature [43], [47], [131], [145]. This may be one of the major reasons that mixed results are often reported in empirical studies. Other research topics related to neural classification include network training [12], [15], [62], [124], [142], model design and selection [50], [72], [117], [121], [122], [180], [194], sample size issues [51], [135], [136], Bayesian analysis [102], [109], [110], [120], and wavelet networks [165], [166], [196]. These issues are common to all applications of neural networks and some of them have been previously reviewed [4], [10], [29], [120], [137], [192]. It is clear that research opportunities are abundant in many aspects of neural classifiers. We believe that the multidisciplinary nature of the neural network classification research will generate more research activities and bring about more fruitful outcomes in the future. REFERENCES [1] K. Al-Ghoneim and B. V. K. V. Kumar, “Learning ranks with neural net￾works,” in Proc. SPIE Applications Science Artificial Neural Networks, vol. 2492, 1995, pp. 446–464. [2] E. I. Altman, G. Marco, and F. Varetto, “Corporate distress diagnosis: Comparisons using linear discriminant analysis and neural networks (the Italian experience),” J. Bank. Finance, vol. 18, pp. 505–529, 1994. [3] B. Amirikian and H. Nishimura, “What size network is good for gener￾alization of a specific task of interest?,” Neural Networks, vol. 7, no. 2, pp. 321–329, 1994. [4] U. Anders and O. Korn, “Model selection in neural networks,” Neural Networks, vol. 12, pp. 309–323, 1999. [5] N. P. Archer and S. Wang, “Fuzzy set representation of neural network classification boundaries,” IEEE Trans. Syst., Man, Cybern., vol. 21, pp. 735–742, 1991. [6] H. Asoh and N. Otsu, “An approximation of nonlinear discriminant anal￾ysis by multilayer neural networks,” in Proc. Int. Joint Conf. Neural Net￾works, San Diego, CA, 1990, pp. III-211–III-216. [7] L. Atlas, R. Cole, J. Connor, M. El-Sharkawi, R. J. Marks II, Y. Muthusamy, and E. Barnard, “Performance comparisons between backpropagation networks and classification trees on three real-world applications,” in Advances in Neural Information Processing Systems, D. S. Touretzky, Ed. San Mateo, CA: Morgan Kaufmann, 1990, vol. 2, pp. 622–629. [8] R. Avnimelech and N. Intrator, “Boosted mixture of experts: An en￾semble learning scheme,” Neural Comput., vol. 11, pp. 483–497, 1999. [9] A. Babloyantz and V. V. Ivanov, “Neural networks in cardiac arrhyth￾mias,” in Industrial Applications of Neural Networks, F. F. Soulie and P. Gallinari, Eds, Singapore: World Scientific, 1998, pp. 403–417. [10] P. F. Baldi and K. Hornik, “Learning in linear neural networks: A survey,” IEEE Trans. Neural Networks, vol. 6, pp. 837–858, 1995. [11] E. B. Barlett and R. E. Uhrig, “Nuclear power plant status diagnostics using artificial neural networks,” Nucl. Technol., vol. 97, pp. 272–281, 1992. [12] E. Barnard, “Optimization for training neural nets,” IEEE Trans. Neural Networks, vol. 3, pp. 232–240, 1992. [13] E. Barnard and E. C. Botha, “Back-propagation uses prior information efficiently,” IEEE Trans. Neural Networks, vol. 4, pp. 794–802, 1993. [14] R. Barron, “Statistical properties of artificial neural networks,” in Proc. 28th IEEE Conf. Decision Control, vol. 280–285, 1989. [15] R. Battiti, “First- and second-order methods for learning; between steepest descent and Newton’s method,” Neural Comput., vol. 4, pp. 141–166, 1992. [16] , “Using mutual information for selecting features in supervised neural net learning,” IEEE Trans. Neural Networks, vol. 5, no. 4, pp. 537–550, 1994. [17] R. Battiti and A. M. Colla, “Democracy in neural nets: Voting schemes for classification,” Neural Networks, vol. 7, no. 4, pp. 691–709, 1994

ZHANG:NEURAL NETWORKS FOR CLASSIFICATION 459 [18]E.B.Baum,"What size net gives valid generalization?,"Neural [49]L.-M.Fu,"Analysis of the dimensionality of neural networks for pattem Comput.,vol.1,pp.151-160,1989. recognition, Pattern Recognit.,vol.23,pp.1131-1140,1990. [19]W.G.Baxt,"Use of an artificial neural network for data analysis in [50]O.Fujita,"Statistical estimation of the number of hidden units clinical decision-making:The diagnosis of acute coronary occlusion," for feedforward neural networks,"Neural Networks,vol.11,pp Neural Comput.,vol.2,pp.480-489,1990. 851-859,1998. [20] "Use of an artificial neural network for the diagnosis of myocardial [51]K.Fukunaga and R.R.Hayes,"Effects of sample size in classifier de- infarction,"Am.Internal Med.,vol.115,pp.843-848,1991 sign,"IEEE Trans.Pattern Anal.Machine Intell.,vol.11,pp.873-885 [21] ,"Improving the accuracy of an artificial neural network using mul- 1989. tiple differently trained networks,"Neural Comput.,vol.4,pp.772-780, [52]K.Funahashi,Introduction to Statistical Pattern Recognition. New 1992 York:Academic,1990. [22]L.M.Belue and K.W.Bauer,"Determining input features for multilayer [53] ,"Multilayer neural networks and Bayes decision theory,"Neural perceptrons,"Newrocomputing,vol.7,pp.111-121,1995 Nenvorks,vol.11,pp.209-213,1998. [23]J.M.Benitez,J.L.Castro,and I.Requena,"Are artificial neural [54]P.Gallinari,S.Thiria,R.Badran,and F.Fogelman-Soulie,"On the re- networks black boxes?,"IEEE Trans.Neural Networks,vol.8,pp. lationships between discriminant analysis and multilayer perceptrons," 1156-1164.1997. Neural Nenvorks,vol.4,pp.349-360,1991. [24]C.M.Bishop,Neural Nenvorks for Pattern Recognition. Oxford, [55]G.D.Garson,"Interpreting neural network connection weights,"A/Ex- U.K.:Oxford Univ.Press,1995. Perm,Pp.47-51,1991. [25]H.Bourlard and N.Morgan,"Continuous speech recognition by con- [56]T.D.Gedeon,"Data mining of inputs:Analysis magnitude and func- nectionist statistical methods,"IEEE Trans.Neural Nenvorks,vol.4,pp tional measures,"Int.J.Neural Syst.,vol.8,no.1,pp.209-218,1997. 893-909,1993. [57]S.Geman,E.Bienenstock,and T.Doursat,"Neural networks and the [26]L.Breiman,"Bagging predictors,"Mach.Learn.,vol.26,no.2,pp. bias/variance dilemma,"Neural Comput.,vol.5,pp.1-58,1992. 123-140.1996. [58]H.Gish,"A probabilistic approach to the understanding and training of [27] -"Arcing classifiers,"Ann.Statist.,vol.26,no.3,pp.801-823 neural network classifiers,"in Proc.IEEE Int.Conf Acoustic.Speech. 1998 Signal Processing,1990,pp.1361-1364. [28]D.E.Brown,V.Corruble,and C.L.Pittard,"A comparison of decision [59]N.Glick,"Additive estimators for probabilities of correct classifica- tree classifiers with backpropagation neural networks for multimodal tion,"Pattern Recognit.,vol.10,pp.211-222,1978 classification problems,"Pattern Recognit,vol.26,pp.953-961,1993. [60]L.W.Glorfeld,"A methodology for simplification and interpretation of [29]W.L.Buntine and A.S.Weigend,"Computing second derivatives in backpropagation-based neural networks models,"Expert Syst.Applicat., feed-forward networks:A review,"IEEE Trans.Neural Networks,vol. vol.10,pp.37-54,1996. 5,pp.480-488,1993. [61]I.Guyon,"Applications of neural networks to character recognition," [30]H.B.Burke,"Artificial neural networks for cancer research:Outcome Int.J.Pattern Recognit.Artif.Intell.,vol.5,pp.353-382,1991. prediction,"Sem.Surg.Oncol,vol.10,pp.73-79,1994. [62]M.T.Hagan and M.Henhaj,"Training feedforward networks with [31]H.B.Burke,P.H.Goodman,D.B.Rosen,D.E.Henson,J.N.Wein- the Marquardt algorithm,"IEEE Trans.Neural Networks,vol.5,pp stein,F.E.Harrell,J.R.Marks,D.P.Winchester,and D.G.Bostwick. 989-993,1994 "Artificial neural networks improve the accuracy of cancer survival pre [63]J.B.Hampshire and B.A.Perlmutter,"Equivalence proofs for mul- diction,"Cancer,vol.79,pp.857-862,1997. tilayer perceptron classifiers and the Bayesian discriminant function," [32]B.Cheng and D.Titterington,"Neural networks:A review from a sta- in Proc.1990 Connectionist Models Summer School,D.Touretzky,J. tistical perspective,"Statist.Sci.,vol.9,no.1,pp.2-54,1994. Elman,T.Sejnowski,and G.Hinton,Eds.San Mateo,CA,1990 [33]A.Ciampi and Y.Lechevallier,"Statistical models as building blocks of [64]L.K.Hansen and P.Salamon,"Neural network ensembles,"IEEE Trans neural networks,"Commun.Statist.,vol.26,no.4,pp.991-1009,1997 Pattern Anal.Machine Intell.,vol.12.no.10,pp.993-1001,1990. [34]T.Cibas,F.F.Soulie,P.Gallinari,and S.Raudys,"Variable selection [65]F.E.Harreli and K.L.Lee,"A comparison of the discriminant analysis with neural networks,"Neurocomput.,vol.12,pp.223-248,1996. and logistic regression under multivariate normality,"in Biostatistics. [35]C.S.Cruz and J.R.Dorronsoro,"A nonlinear discriminant algorithm Statistics in Biomedical.Public Health,and Environmental Sciences,P. for feature extraction and data classification,"IEEE Trans.Neural Net- K.Sen,Ed,Amsterdam,The Netherlands:North Holland,1985 works,vol.9,pp.1370-1376,1998 [66]A.Hart,"Using neural networks for classification tasks- -Some experi- [36]S.P.Curram and J.Mingers,"Neural networks,decision tree induction ments on datasets and practical advice,"J Oper:Res.Soc.,vol.43,pp. and discriminant analysis:An empirical comparison,"J.Oper Res.Soc.. 215-226,1992. vol.45,no.4,pp.440-450,1994 [67]S.Hashem and B.Schmeiser,"Improving model accuracy using optimal [37]G.Cybenko,"Approximation by superpositions of a sigmoidal func. linear combinations of trained neural networks,"IEEE Trans.Neural tion,"Math.Contr:Signals Syst.,vol.2,pp.303-314,1989. Nenvorks,vol.6,no.3,pp.792-794,1995. [38]P.A.Devijver and J.Kittler,Pattern Recognition:A Statistical Ap- [68]S.Hashem,"Optimal linear combination of neural networks,"Neural proach.Englewood Cliffs,NJ:Prentice-Hall,1982 Netorks,.ol.10,no.4,pp.599-614,1997 [39]T.G.Dietterich,"Overfitting and undercomputing in machine learning," [69] -"Treating harmful collinearity in neural network ensembles,"in Comput.Surv.,vol.27,no.3,pp.326-327,1995 Combining Artificial Neural Nets:Ensemble and Modular Multi-Net [40]T.G.Dietterich and G.Bakiri,"Solving multiclass learning problems via Systems,A.J.C.Sharkey,Ed. Berlin,Germany:Springer-Verlag, error-correcting output codes,"J.Artif.Intell.Res.,vol.2,pp.263-286. 1999,pp.101-125 1995 [70]J.Hertz,A.Grogh,and R.Palmer,Introduction to the Theory of Neural [41]T.G.Dietterich and E.B.Kong,"Machine learning bias,statistical bias, Computation.Reading,MA:Addison-Wesley,1991. and statistical variance of decision tree algorithms,"Dept.Comput.Sci.. [71]T.Heskes,"Bias/variance decompositions for likelihood-based estima- Oregon State Univ.,Corvallis,Tech.Rep.,1995. tors,"Neural Comput.,vol.10,no.6,pp.1425-1434,1998. [42]P.O.Duda and P.E.Hart,Pattern Classification and Scene Anal- [72]M.Hintz-Madsen,L.K.Hansen,J.Larsen,M.W.Pedersen,and M. ysis.New York:Wiley,1973 Larsen,"Neural classifier construction using regularization,pruning and [43]R.P.W.Duin,"A note on comparing classifiers,"Pattern Recognit.Lett., test error estimation,"Neural Nenorks,vol.11,pp.1659-1670,1998. vol.17,pPp.529-536,1996. [73]T.K.Ho,J.J.Hull,and S.N.Srihari,"Decision combination in multiple [44]S.Dutta and S.Shekhar,"Bond rating:A nonconservative application classifier systems,"IEEE Trans.Pattern Anal.Machine Intell.,vol.16. of neural networks,"in Proc.IEEE Int.Conf.Neural Networks,vol.2, pp.66-75,Jan.1994. San Diego,CA,1988,pp.443-450 [74]L.Holmstrom,P.Koistinen,J.Laaksonen,and E.Oja,"Neural and sta- [45]B.Efron and R.Tibshirani,An Introduction to the Bootstrap. London tistical classifiers-taxonomy and two case studies,"IEEE Trans.Neural U.K.:Chapman Hall,1993 Nenvorks,vol.8,pp.5-17,1997 [46]M.Egmont-Petersen,J.L.Talmon,A.Hasman,and A.W.Ambergen, [75]M.J.Holt and S.Semnani,"Convergence of back propagation in neural "Assessing the importance of features for multi-layer perceptrons,' networks using a log-likelihood cost function,"Electron.Lett.,vol.26. Neural Nenvorks,vol.11,pp.623-635,1998. no.23,pp.1964-1965,1990. [47]A.Flexer,"Statistical evaluation of neural network experiments:Min- [76]R.C.Holte,"Very simple classification rules perform well on most com- imum requirements and current practice,"in Proc.13th Ew:Meeting monly used data sets,"Mach.Learn.,vol.11,pp.63-90,1993. Cybernetics Systems Research,R.Trappl,Ed.,1996,pp.1005-1008. [77]J.J.Hopfield,"Learning algorithms and probability distributions in [48]J.H.Friedman,"On bias,variance,0/1-loss,and the curse of the di- feedforward and feedback networks,"Proc.Nat.Acad.Sci.,vol.84, mensionality,"Data Mining Knowl.Disc.,vol.1,pp.55-77,1997. Pp.8429-8433,1987

ZHANG: NEURAL NETWORKS FOR CLASSIFICATION 459 [18] E. B. Baum, “What size net gives valid generalization?,” Neural Comput., vol. 1, pp. 151–160, 1989. [19] W. G. Baxt, “Use of an artificial neural network for data analysis in clinical decision-making: The diagnosis of acute coronary occlusion,” Neural Comput., vol. 2, pp. 480–489, 1990. [20] , “Use of an artificial neural network for the diagnosis of myocardial infarction,” Ann. Internal Med., vol. 115, pp. 843–848, 1991. [21] , “Improving the accuracy of an artificial neural network using mul￾tiple differently trained networks,” Neural Comput., vol. 4, pp. 772–780, 1992. [22] L. M. Belue and K. W. Bauer, “Determining input features for multilayer perceptrons,” Neurocomputing, vol. 7, pp. 111–121, 1995. [23] J. M. Benitez, J. L. Castro, and I. Requena, “Are artificial neural networks black boxes?,” IEEE Trans. Neural Networks, vol. 8, pp. 1156–1164, 1997. [24] C. M. Bishop, Neural Networks for Pattern Recognition. Oxford, U.K.: Oxford Univ. Press, 1995. [25] H. Bourlard and N. Morgan, “Continuous speech recognition by con￾nectionist statistical methods,” IEEE Trans. Neural Networks, vol. 4, pp. 893–909, 1993. [26] L. Breiman, “Bagging predictors,” Mach. Learn., vol. 26, no. 2, pp. 123–140, 1996. [27] , “Arcing classifiers,” Ann. Statist., vol. 26, no. 3, pp. 801–823, 1998. [28] D. E. Brown, V. Corruble, and C. L. Pittard, “A comparison of decision tree classifiers with backpropagation neural networks for multimodal classification problems,” Pattern Recognit., vol. 26, pp. 953–961, 1993. [29] W. L. Buntine and A. S. Weigend, “Computing second derivatives in feed-forward networks: A review,” IEEE Trans. Neural Networks, vol. 5, pp. 480–488, 1993. [30] H. B. Burke, “Artificial neural networks for cancer research: Outcome prediction,” Sem. Surg. Oncol., vol. 10, pp. 73–79, 1994. [31] H. B. Burke, P. H. Goodman, D. B. Rosen, D. E. Henson, J. N. Wein￾stein, F. E. Harrell, J. R. Marks, D. P. Winchester, and D. G. Bostwick, “Artificial neural networks improve the accuracy of cancer survival pre￾diction,” Cancer, vol. 79, pp. 857–862, 1997. [32] B. Cheng and D. Titterington, “Neural networks: A review from a sta￾tistical perspective,” Statist. Sci., vol. 9, no. 1, pp. 2–54, 1994. [33] A. Ciampi and Y. Lechevallier, “Statistical models as building blocks of neural networks,” Commun. Statist., vol. 26, no. 4, pp. 991–1009, 1997. [34] T. Cibas, F. F. Soulie, P. Gallinari, and S. Raudys, “Variable selection with neural networks,” Neurocomput., vol. 12, pp. 223–248, 1996. [35] C. S. Cruz and J. R. Dorronsoro, “A nonlinear discriminant algorithm for feature extraction and data classification,” IEEE Trans. Neural Net￾works, vol. 9, pp. 1370–1376, 1998. [36] S. P. Curram and J. Mingers, “Neural networks, decision tree induction and discriminant analysis: An empirical comparison,” J. Oper. Res. Soc., vol. 45, no. 4, pp. 440–450, 1994. [37] G. Cybenko, “Approximation by superpositions of a sigmoidal func￾tion,” Math. Contr. Signals Syst., vol. 2, pp. 303–314, 1989. [38] P. A. Devijver and J. Kittler, Pattern Recognition: A Statistical Ap￾proach. Englewood Cliffs, NJ: Prentice-Hall, 1982. [39] T. G. Dietterich, “Overfitting and undercomputing in machine learning,” Comput. Surv., vol. 27, no. 3, pp. 326–327, 1995. [40] T. G. Dietterich and G. Bakiri, “Solving multiclass learning problems via error-correcting output codes,” J. Artif. Intell. Res., vol. 2, pp. 263–286, 1995. [41] T. G. Dietterich and E. B. Kong, “Machine learning bias, statistical bias, and statistical variance of decision tree algorithms,” Dept. Comput. Sci., Oregon State Univ., Corvallis, Tech. Rep., 1995. [42] P. O. Duda and P. E. Hart, Pattern Classification and Scene Anal￾ysis. New York: Wiley, 1973. [43] R. P. W. Duin, “A note on comparing classifiers,” Pattern Recognit. Lett., vol. 17, pp. 529–536, 1996. [44] S. Dutta and S. Shekhar, “Bond rating: A nonconservative application of neural networks,” in Proc. IEEE Int. Conf. Neural Networks, vol. 2, San Diego, CA, 1988, pp. 443–450. [45] B. Efron and R. Tibshirani, An Introduction to the Bootstrap. London, U.K.: Chapman & Hall, 1993. [46] M. Egmont-Petersen, J. L. Talmon, A. Hasman, and A. W. Ambergen, “Assessing the importance of features for multi-layer perceptrons,” Neural Networks, vol. 11, pp. 623–635, 1998. [47] A. Flexer, “Statistical evaluation of neural network experiments: Min￾imum requirements and current practice,” in Proc. 13th Eur. Meeting Cybernetics Systems Research, R. Trappl, Ed., 1996, pp. 1005–1008. [48] J. H. Friedman, “On bias, variance, 0=1-loss, and the curse of the di￾mensionality,” Data Mining Knowl. Disc., vol. 1, pp. 55–77, 1997. [49] L.-M. Fu, “Analysis of the dimensionality of neural networks for pattern recognition,” Pattern Recognit., vol. 23, pp. 1131–1140, 1990. [50] O. Fujita, “Statistical estimation of the number of hidden units for feedforward neural networks,” Neural Networks, vol. 11, pp. 851–859, 1998. [51] K. Fukunaga and R. R. Hayes, “Effects of sample size in classifier de￾sign,” IEEE Trans. Pattern Anal. Machine Intell., vol. 11, pp. 873–885, 1989. [52] K. Funahashi, Introduction to Statistical Pattern Recognition. New York: Academic, 1990. [53] , “Multilayer neural networks and Bayes decision theory,” Neural Networks, vol. 11, pp. 209–213, 1998. [54] P. Gallinari, S. Thiria, R. Badran, and F. Fogelman-Soulie, “On the re￾lationships between discriminant analysis and multilayer perceptrons,” Neural Networks, vol. 4, pp. 349–360, 1991. [55] G. D. Garson, “Interpreting neural network connection weights,” AI Ex￾pert, pp. 47–51, 1991. [56] T. D. Gedeon, “Data mining of inputs: Analysis magnitude and func￾tional measures,” Int. J. Neural Syst., vol. 8, no. 1, pp. 209–218, 1997. [57] S. Geman, E. Bienenstock, and T. Doursat, “Neural networks and the bias/variance dilemma,” Neural Comput., vol. 5, pp. 1–58, 1992. [58] H. Gish, “A probabilistic approach to the understanding and training of neural network classifiers,” in Proc. IEEE Int. Conf. Acoustic, Speech, Signal Processing, 1990, pp. 1361–1364. [59] N. Glick, “Additive estimators for probabilities of correct classifica￾tion,” Pattern Recognit., vol. 10, pp. 211–222, 1978. [60] L. W. Glorfeld, “A methodology for simplification and interpretation of backpropagation-based neural networks models,” Expert Syst. Applicat., vol. 10, pp. 37–54, 1996. [61] I. Guyon, “Applications of neural networks to character recognition,” Int. J. Pattern Recognit. Artif. Intell., vol. 5, pp. 353–382, 1991. [62] M. T. Hagan and M. Henhaj, “Training feedforward networks with the Marquardt algorithm,” IEEE Trans. Neural Networks, vol. 5, pp. 989–993, 1994. [63] J. B. Hampshire and B. A. Perlmutter, “Equivalence proofs for mul￾tilayer perceptron classifiers and the Bayesian discriminant function,” in Proc. 1990 Connectionist Models Summer School, D. Touretzky, J. Elman, T. Sejnowski, and G. Hinton, Eds. San Mateo, CA, 1990. [64] L. K. Hansen and P. Salamon, “Neural network ensembles,” IEEE Trans. Pattern Anal. Machine Intell., vol. 12, no. 10, pp. 993–1001, 1990. [65] F. E. Harreli and K. L. Lee, “A comparison of the discriminant analysis and logistic regression under multivariate normality,” in Biostatistics: Statistics in Biomedical, Public Health, and Environmental Sciences, P. K. Sen, Ed, Amsterdam, The Netherlands: North Holland, 1985. [66] A. Hart, “Using neural networks for classification tasks—Some experi￾ments on datasets and practical advice,” J. Oper. Res. Soc., vol. 43, pp. 215–226, 1992. [67] S. Hashem and B. Schmeiser, “Improving model accuracy using optimal linear combinations of trained neural networks,” IEEE Trans. Neural Networks, vol. 6, no. 3, pp. 792–794, 1995. [68] S. Hashem, “Optimal linear combination of neural networks,” Neural Networks, vol. 10, no. 4, pp. 599–614, 1997. [69] , “Treating harmful collinearity in neural network ensembles,” in Combining Artificial Neural Nets: Ensemble and Modular Multi-Net Systems, A. J. C. Sharkey, Ed. Berlin, Germany: Springer-Verlag, 1999, pp. 101–125. [70] J. Hertz, A. Grogh, and R. Palmer, Introduction to the Theory of Neural Computation. Reading, MA: Addison-Wesley, 1991. [71] T. Heskes, “Bias/variance decompositions for likelihood-based estima￾tors,” Neural Comput., vol. 10, no. 6, pp. 1425–1434, 1998. [72] M. Hintz-Madsen, L. K. Hansen, J. Larsen, M. W. Pedersen, and M. Larsen, “Neural classifier construction using regularization, pruning and test error estimation,” Neural Networks, vol. 11, pp. 1659–1670, 1998. [73] T. K. Ho, J. J. Hull, and S. N. Srihari, “Decision combination in multiple classifier systems,” IEEE Trans. Pattern Anal. Machine Intell., vol. 16, pp. 66–75, Jan. 1994. [74] L. Holmstrom, P. Koistinen, J. Laaksonen, and E. Oja, “Neural and sta￾tistical classifiers-taxonomy and two case studies,” IEEE Trans. Neural Networks, vol. 8, pp. 5–17, 1997. [75] M. J. Holt and S. Semnani, “Convergence of back propagation in neural networks using a log-likelihood cost function,” Electron. Lett., vol. 26, no. 23, pp. 1964–1965, 1990. [76] R. C. Holte, “Very simple classification rules perform well on most com￾monly used data sets,” Mach. Learn., vol. 11, pp. 63–90, 1993. [77] J. J. Hopfield, “Learning algorithms and probability distributions in feedforward and feedback networks,” Proc. Nat. Acad. Sci., vol. 84, pp. 8429–8433, 1987

460 IEEE TRANSACTIONS ON SYSTEMS,MAN,AND CYBERNETICS-PART C:APPLICATIONS AND REVIEWS,VOL.30,NO.4,NOVEMBER 2000 [78]K.Hornik,"Approximation capabilities of multilayer feedforward net- [104]T.S.Lim,W.Y.Loh,and Y.S.Shih,"An empirical comparison of deci- works."Neural Nenvorks,vol.4,pp.251-257,1991. sion trees and other classification methods,"Dept.Statistics,Univ.Wis- (79]K.Homik,M.Stinchcombe,and H.White,"Multilayer feedforward consin,Madison,Tech.Rep.979,1998 networks are universal approximators,"Neural Nenorks,vol.2,pp. [105]R.P.Lippmann,"Pattern classification using neural networks,"EEE 359-366.1989. Commumn.Mag.,pp.47-64,Nov.1989. [80]J.C.Hoskins,K.M.Kaliyur,and D.M.Himmelblau,"Incipient fault [106] ,"Review of neural networks for speech recognition,"Neural detection and diagnosis using artificial neural networks,"in Proc.Int. Comput.,vol.1,Pp.1-38,1989, Joint Conf.Neural Networks,1990,pp.81-86. [107]D.Lowe and A.R.Webb,"Exploiting prior knowledge in network op- [81]M.Y.Hu,M.S.Hung,M.S.Shanker,and H.Chen,"Using neural timization:An illustration form medical prognosis,"Network Comput. networks to predict performance of sino-foreign joint ventures,"Int.J. Neural Syst,vol.1,pp.299-323,1990 Comput.Intell.Organ..vol.1,no.3,pp.134-143,1996. [1081 ,"Optimized feature extraction and the Bayes decision in feed-for- [82]W.Y.Huang and R.P.Lippmann,"Comparisons between neural net and ward classifier networks,"IEEE Trans.Pattern Anal.Machine Intell., conventional classifiers,"in IEEE Ist Int.Conf Neural Nenvorks,San vol.13,pp.355-364,1991. Diego,CA,1987,pp.485-493. [109]D.C.MacKay,"Bayesian interpolation,"Neural Comput.,vol.4,pp. [83]M.S.Hung,M.Y.Hu,M.S.Shanker,and B.E.Patuwo,"Estimating 415-447.1992. posterior probabilities in classification problems with neural networks," [110] -,"A practical Bayesian framework for backpropagation networks," Int.J.Comput.Intell.Organ.,vol.1,no.1,pp.49-60,1996. Neural Comput.,vol.4,pp.448-472,1992. [84]R.A.Jacobs,"Methods for combining experts'probability assess- [111]G.Mani,"Lowering variance of decisions by using artificial neural net- ments,"Neural Comput.,vol.7,pp.867-888,1995. work portfolios,"Neural Comput.,vol.3,pp.484-486,1991. [85] "Bias/variance analyzes of mixtures-of-experts architectures," [112]I.S.Markham and C.T.Ragsdale,"Combining neural networks and Neural Comput.,vol.9,pp.369-383,1997. statistical predictions to solve the classification problem in discriminant [86]G.James and T.Hastie,"Generalizations of the bias/variance decom- analysis,"Decis.Sci.,vol.26,pp.229-241,1995. position for prediction error,"Dept.Statistics,Stanford Univ.,Stanford, [113]G.L.Martin and G.L.Pitman,"Recognizing hand-printed letter and CA,Tech.Rep.,1997. digits using backpropagation learning,"Neural Comput.,vol.3,pp. [87]C.Ji and S.Ma,"Combinations of weak classifiers,"IEEE Trans.Neural 258-267,1991. Nenvorks,vol.8,pp.32-42,Jan.1997 [114]B.Mak and R.W.Blanning,"An empirical measure of element contri- [88]F.Kanaya and S.Miyake,"Bayes statistical behavior and valid gener- bution in neural networks,"IEEE Trans.Syst..Man.Cybern.C,vol.28. alization of pattern classifying neural networks,"IEEE Trans.Neural pp.561-564,Now.1998. Nenvorks,vol.2,no.4,pp.471-475,1991. [115]D.Michie,D.J.Spiegelhalter,and C.C.Taylor,Eds.,Machine Learning [89]J.Karhunen and J.Joutsensalo,"Generalizations of principal compo- Neural.and Statistical Classification,London,U.K.:Ellis Horwood. nent analysis,optimization problems and neural networks,"Neural Net- 1994 work,vol.8,Pp.549-562,1995. [116]S.Miyake and F.Kanaya,"A neural network approach to a Bayesian [90]J.Kittler,M.Hatef,R.P.W.Duin,and J.Matas,"On combining classi- statistical decision problem,"IEEE Trans.Neural Nenworks,vol.2,pp. fiers,"IEEE Trans.Pattern Anal.Machine Intell.,vol.20,pp.226-239 538-540,1991. 1998 [117]J.Moody and J.Utans,"Architecture selection strategies for neural net- [91]D.G.Kleinbaum,L.L.Kupper,and L.E.Chambless,"Logistic regres- works:Application to corporate bond rating prediction,"in Neural Net- sion analysis of epidemiologic data,"Theory Practice.Commun.Statist. works in the Capital Markets,A.-P.Refenes,Ed.New York:Wiley. A,vol.11,Pp.485-547,1982 1995,Pp.277-300. (92]S.Knerr,L.Personnaz,and G.Dreyfus,"Handwritten digit recognition [118]N.Morgan and H.Bourlard,"Generalization and parameter estimation by neural networks with single-layer training,"IEEE Trans.Neural Net- in feedforward nets:Some experiments,"Adv.Neural Inform.Process. 1wok,vol.3,pp.962-968,1992 st.,vol.2,Pp.630-637,1990. [93]R.Kohavi and D.H.Wolpert,"Bias plus variance decomposition for [119]M.C.Mozer and P.Smolensky,"Skeletonization:A technique for zero-one loss functions,"in Proc.13th Int.Conf.Machine Learning trimming the fat from a network via relevance assessment," 1996,pp.275-283. in Advances in Neural Information Processing Systems,D.S. [94]E.B.Kong and T.G.Dietterich,"Error-correcting output coding corrects Touretzky,Ed. San Mateo,CA:Morgan Kaufmann,1989,vol.1,pp. bias and variance,"in Proc.12th Int.Conf.Machine Learning,1995,pp 107-115 313-321. [120]P.Muller and D.R.Insua,"Issues in Bayesian analysis of neural network [95]A.Krogh and J.Vedelsby,"Neural network ensembles,cross validation, models,"Neural Comput.,vol.10,pp.749-770,1998 and active learning,"Adv.Neural Inform.Process.,vol.7,pp.231-238 [121]N.Murata,S.Yoshizawa,and S.Amari,"Learning curves,model 1995. selection and complexity of neural networks,"in Advances in [96]R.C.Lacher,P.K.Coats,S.C.Sharma,and L.F.Fant,"A neural net- Neural Information Processing Systems.5,S.J.Hanson,J.D. work for classifying the financial health of a firm,"Eur:J.Oper.Res., Cowan,and C.L.Giles,Eds.San Mateo,CA:Morgan Kaufmann, vol.85,pp.53-65,1995 1993,pp.607-614. [97]J.Lampinen,S.Smolander,and M.Korhonen,"Wood surface inspection [122] "Network information criterion determining the number of hidden system based on generic visual features,"in Industrial Applications of units for artificial neural network models,"IEEE Trans.Neural Net- Neural Nenvorks,F.F.Soulie and P.Gallinari,Eds,Singapore:World works,vol.5,Pp.865-872,1994 Scientific,1998,pp.35-42. [123]R.Nath,B.Rajagopalan,and R.Ryker,"Determining the saliency of [98]Y.Le Cun,B.Boser,J.S.Denker,D.Henderson,R.E.Howard,W. input variables in neural network classifiers,"Comput.Oper:Res.,vol. Hubberd,and L.D.Jackel,"Handwritten digit recognition with a back- 24,Pp.767-773,1997. propagation network,"Adv.Neural Inform.Process Syst.,vol.2,pp. [124]V.Nedelikovic,"A novel multilayer neural networks training algorithm 396-404.1990. that minimizes the probability of classification error,"/EEE Trans. [99]Y.Le Cun,J.S.Denker,and S.A.Solla,"Optimal brain damage," Neural Nerworks,vol.4,pp.650-659,1993. in Advances in Neural Information Processing Systems,D.S [125]E.Oja,"Neural networks,principle components,and subspace,"Int. Touretzky,Ed.San Mateo,CA:Morgan Kaufmann,1990,vol.2,pp Neural Syst.,vol.1,pp.61-68,1989. 598-605. [126]A.Papoulix,Probability,Random Variables,and Stochastic Pro- [100]D.S.Lee,S.N.Sriharia,and R.Gaborski,"Bayesian and neural-net- cesses. New York:McGraw-Hill,1965. work pattern recognition:A theoretical connection and empirical results [127]E.Patwo,M.Y.Hu,and M.S.Hung,"Two-group classification using with handwritten characters,"in Artificial Neural Nerworks and Statis- neural networks,"Decis.Sci,vol.24,no.4.pp.825-845,1993. tical Pattern Recognition,I.K.Sethi and A.K.Jain,Eds.New York: [128]M.P.Perrone,"Putting it all together:Methods for combining neural Elsevier,1991,pp.89-108. networks,"in Advances in Neural Information Processing Systems,J. [101]M.Leshno and Y.Spector,"Neural network prediction analysis:The D.Cowan,G.Tesauro,and J.Alspector,Eds. San Mateo,CA:Morgan bankruptcy case,"Neurocomput.,vol.10,pp.125-147,1996. Kaufmann,1994,vol.6,pp.1188-1189 [102]M.S.Lewicki,"Bayesian modeling and classification of neural signals," [129]M.P.Perrone and L.N.Cooper,"When networks disagree:Ensemble Neural Compu,vol.6,pp.1005-1030,1994. methods for hybrid neural networks,"in Neural Nenvorks for Speech [103]G.S.Lim,M.Alder,and P.Hadingham,"Adaptive quadratic neural and Image Processing,R.J.Mammone,Ed.London,U.K.:Chapman nets,"Pattern Recognit.Lett.,vol.13,pp.325-329,1992 &Hall,1993,pp.126-142

460 IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS—PART C: APPLICATIONS AND REVIEWS, VOL. 30, NO. 4, NOVEMBER 2000 [78] K. Hornik, “Approximation capabilities of multilayer feedforward net￾works,” Neural Networks, vol. 4, pp. 251–257, 1991. [79] K. Hornik, M. Stinchcombe, and H. White, “Multilayer feedforward networks are universal approximators,” Neural Networks, vol. 2, pp. 359–366, 1989. [80] J. C. Hoskins, K. M. Kaliyur, and D. M. Himmelblau, “Incipient fault detection and diagnosis using artificial neural networks,” in Proc. Int. Joint Conf. Neural Networks, 1990, pp. 81–86. [81] M. Y. Hu, M. S. Hung, M. S. Shanker, and H. Chen, “Using neural networks to predict performance of sino-foreign joint ventures,” Int. J. Comput. Intell. Organ., vol. 1, no. 3, pp. 134–143, 1996. [82] W. Y. Huang and R. P. Lippmann, “Comparisons between neural net and conventional classifiers,” in IEEE 1st Int. Conf. Neural Networks, San Diego, CA, 1987, pp. 485–493. [83] M. S. Hung, M. Y. Hu, M. S. Shanker, and B. E. Patuwo, “Estimating posterior probabilities in classification problems with neural networks,” Int. J. Comput. Intell. Organ., vol. 1, no. 1, pp. 49–60, 1996. [84] R. A. Jacobs, “Methods for combining experts’ probability assess￾ments,” Neural Comput., vol. 7, pp. 867–888, 1995. [85] , “Bias/variance analyzes of mixtures-of-experts architectures,” Neural Comput., vol. 9, pp. 369–383, 1997. [86] G. James and T. Hastie, “Generalizations of the bias/variance decom￾position for prediction error,” Dept. Statistics, Stanford Univ., Stanford, CA, Tech. Rep., 1997. [87] C. Ji and S. Ma, “Combinations of weak classifiers,” IEEE Trans. Neural Networks, vol. 8, pp. 32–42, Jan. 1997. [88] F. Kanaya and S. Miyake, “Bayes statistical behavior and valid gener￾alization of pattern classifying neural networks,” IEEE Trans. Neural Networks, vol. 2, no. 4, pp. 471–475, 1991. [89] J. Karhunen and J. Joutsensalo, “Generalizations of principal compo￾nent analysis, optimization problems and neural networks,” Neural Net￾works, vol. 8, pp. 549–562, 1995. [90] J. Kittler, M. Hatef, R. P. W. Duin, and J. Matas, “On combining classi￾fiers,” IEEE Trans. Pattern Anal. Machine Intell., vol. 20, pp. 226–239, 1998. [91] D. G. Kleinbaum, L. L. Kupper, and L. E. Chambless, “Logistic regres￾sion analysis of epidemiologic data,” Theory Practice, Commun. Statist. A, vol. 11, pp. 485–547, 1982. [92] S. Knerr, L. Personnaz, and G. Dreyfus, “Handwritten digit recognition by neural networks with single-layer training,” IEEE Trans. Neural Net￾works, vol. 3, pp. 962–968, 1992. [93] R. Kohavi and D. H. Wolpert, “Bias plus variance decomposition for zero-one loss functions,” in Proc. 13th Int. Conf. Machine Learning, 1996, pp. 275–283. [94] E. B. Kong and T. G. Dietterich, “Error-correcting output coding corrects bias and variance,” in Proc. 12th Int. Conf. Machine Learning, 1995, pp. 313–321. [95] A. Krogh and J. Vedelsby, “Neural network ensembles, cross validation, and active learning,” Adv. Neural Inform. Process., vol. 7, pp. 231–238, 1995. [96] R. C. Lacher, P. K. Coats, S. C. Sharma, and L. F. Fant, “A neural net￾work for classifying the financial health of a firm,” Eur. J. Oper. Res., vol. 85, pp. 53–65, 1995. [97] J. Lampinen, S. Smolander, and M. Korhonen, “Wood surface inspection system based on generic visual features,” in Industrial Applications of Neural Networks, F. F. Soulie and P. Gallinari, Eds, Singapore: World Scientific, 1998, pp. 35–42. [98] Y. Le Cun, B. Boser, J. S. Denker, D. Henderson, R. E. Howard, W. Hubberd, and L. D. Jackel, “Handwritten digit recognition with a back￾propagation network,” Adv. Neural Inform. Process Syst., vol. 2, pp. 396–404, 1990. [99] Y. Le Cun, J. S. Denker, and S. A. Solla, “Optimal brain damage,” in Advances in Neural Information Processing Systems, D. S. Touretzky, Ed. San Mateo, CA: Morgan Kaufmann, 1990, vol. 2, pp. 598–605. [100] D. S. Lee, S. N. Sriharia, and R. Gaborski, “Bayesian and neural-net￾work pattern recognition: A theoretical connection and empirical results with handwritten characters,” in Artificial Neural Networks and Statis￾tical Pattern Recognition, I. K. Sethi and A. K. Jain, Eds. New York: Elsevier, 1991, pp. 89–108. [101] M. Leshno and Y. Spector, “Neural network prediction analysis: The bankruptcy case,” Neurocomput., vol. 10, pp. 125–147, 1996. [102] M. S. Lewicki, “Bayesian modeling and classification of neural signals,” Neural Comput., vol. 6, pp. 1005–1030, 1994. [103] G. S. Lim, M. Alder, and P. Hadingham, “Adaptive quadratic neural nets,” Pattern Recognit. Lett., vol. 13, pp. 325–329, 1992. [104] T. S. Lim, W. Y. Loh, and Y. S. Shih, “An empirical comparison of deci￾sion trees and other classification methods,” Dept. Statistics, Univ. Wis￾consin, Madison, Tech. Rep. 979, 1998. [105] R. P. Lippmann, “Pattern classification using neural networks,” IEEE Commun. Mag., pp. 47–64, Nov. 1989. [106] , “Review of neural networks for speech recognition,” Neural Comput., vol. 1, pp. 1–38, 1989. [107] D. Lowe and A. R. Webb, “Exploiting prior knowledge in network op￾timization: An illustration form medical prognosis,” Network Comput. Neural Syst., vol. 1, pp. 299–323, 1990. [108] , “Optimized feature extraction and the Bayes decision in feed-for￾ward classifier networks,” IEEE Trans. Pattern Anal. Machine Intell., vol. 13, pp. 355–364, 1991. [109] D. C. MacKay, “Bayesian interpolation,” Neural Comput., vol. 4, pp. 415–447, 1992. [110] , “A practical Bayesian framework for backpropagation networks,” Neural Comput., vol. 4, pp. 448–472, 1992. [111] G. Mani, “Lowering variance of decisions by using artificial neural net￾work portfolios,” Neural Comput., vol. 3, pp. 484–486, 1991. [112] I. S. Markham and C. T. Ragsdale, “Combining neural networks and statistical predictions to solve the classification problem in discriminant analysis,” Decis. Sci., vol. 26, pp. 229–241, 1995. [113] G. L. Martin and G. L. Pitman, “Recognizing hand-printed letter and digits using backpropagation learning,” Neural Comput., vol. 3, pp. 258–267, 1991. [114] B. Mak and R. W. Blanning, “An empirical measure of element contri￾bution in neural networks,” IEEE Trans. Syst., Man, Cybern. C, vol. 28, pp. 561–564, Nov. 1998. [115] D. Michie, D. J. Spiegelhalter, and C. C. Taylor, Eds., Machine Learning, Neural, and Statistical Classification, London, U.K.: Ellis Horwood, 1994. [116] S. Miyake and F. Kanaya, “A neural network approach to a Bayesian statistical decision problem,” IEEE Trans. Neural Networks, vol. 2, pp. 538–540, 1991. [117] J. Moody and J. Utans, “Architecture selection strategies for neural net￾works: Application to corporate bond rating prediction,” in Neural Net￾works in the Capital Markets, A.-P. Refenes, Ed. New York: Wiley, 1995, pp. 277–300. [118] N. Morgan and H. Bourlard, “Generalization and parameter estimation in feedforward nets: Some experiments,” Adv. Neural Inform. Process. Syst., vol. 2, pp. 630–637, 1990. [119] M. C. Mozer and P. Smolensky, “Skeletonization: A technique for trimming the fat from a network via relevance assessment,” in Advances in Neural Information Processing Systems, D. S. Touretzky, Ed. San Mateo, CA: Morgan Kaufmann, 1989, vol. 1, pp. 107–115. [120] P. Muller and D. R. Insua, “Issues in Bayesian analysis of neural network models,” Neural Comput., vol. 10, pp. 749–770, 1998. [121] N. Murata, S. Yoshizawa, and S. Amari, “Learning curves, model selection and complexity of neural networks,” in Advances in Neural Information Processing Systems, 5, S. J. Hanson, J. D. Cowan, and C. L. Giles, Eds. San Mateo, CA: Morgan Kaufmann, 1993, pp. 607–614. [122] , “Network information criterion determining the number of hidden units for artificial neural network models,” IEEE Trans. Neural Net￾works, vol. 5, pp. 865–872, 1994. [123] R. Nath, B. Rajagopalan, and R. Ryker, “Determining the saliency of input variables in neural network classifiers,” Comput. Oper. Res., vol. 24, pp. 767–773, 1997. [124] V. Nedeljkovic, “A novel multilayer neural networks training algorithm that minimizes the probability of classification error,” IEEE Trans. Neural Networks, vol. 4, pp. 650–659, 1993. [125] E. Oja, “Neural networks, principle components, and subspace,” Int. J. Neural Syst., vol. 1, pp. 61–68, 1989. [126] A. Papoulix, Probability, Random Variables, and Stochastic Pro￾cesses. New York: McGraw-Hill, 1965. [127] E. Patwo, M. Y. Hu, and M. S. Hung, “Two-group classification using neural networks,” Decis. Sci., vol. 24, no. 4, pp. 825–845, 1993. [128] M. P. Perrone, “Putting it all together: Methods for combining neural networks,” in Advances in Neural Information Processing Systems, J. D. Cowan, G. Tesauro, and J. Alspector, Eds. San Mateo, CA: Morgan Kaufmann, 1994, vol. 6, pp. 1188–1189. [129] M. P. Perrone and L. N. Cooper, “When networks disagree: Ensemble methods for hybrid neural networks,” in Neural Networks for Speech and Image Processing, R. J. Mammone, Ed. London, U.K.: Chapman & Hall, 1993, pp. 126–142