Pattern Classification, Part 1This unique text/professional reference provides the information you need to choose the most appropriate method for a given class of problems, presenting an in-depth, systematic account of the major topics in pattern recognition today. A new edition of a classic work that helped define the field for over a quarter century, this practical book updates and expands the original work, focusing on pattern classification and the immense progress it has experienced in recent years."--BOOK JACKET. |
From inside the book
Results 1-3 of 85
Page 472
... mean is , of course , î = n Xi . ( 22 ) Likewise the estimate of the accuracy of the mean is the sample variance , given by n 1 ô2 = ' ( x ; — îî ) 2 . ( n 1 ) ( 23 ) MEDIAN MODE LEAVE - ONE - OUT Suppose we were instead interested in ...
... mean is , of course , î = n Xi . ( 22 ) Likewise the estimate of the accuracy of the mean is the sample variance , given by n 1 ô2 = ' ( x ; — îî ) 2 . ( n 1 ) ( 23 ) MEDIAN MODE LEAVE - ONE - OUT Suppose we were instead interested in ...
Page 510
... mean of a distribution is merely the sample mean of the distribution from which some portion a ( e.g. , 0.1 ) of the highest and of the lowest points have been deleted . The trimmed mean is , of course , less sensitive to the presence ...
... mean of a distribution is merely the sample mean of the distribution from which some portion a ( e.g. , 0.1 ) of the highest and of the lowest points have been deleted . The trimmed mean is , of course , less sensitive to the presence ...
Page 558
... mean of the full data set . Under the null hypothesis , the distribution for J. ( 1 ) is approximately normal with mean ndo2 and variance 2ndo1 ( Problem 40 ) . Suppose now that we partition the set of samples into two subsets Di and D2 ...
... mean of the full data set . Under the null hypothesis , the distribution for J. ( 1 ) is approximately normal with mean ndo2 and variance 2ndo1 ( Problem 40 ) . Suppose now that we partition the set of samples into two subsets Di and D2 ...
Contents
MAXIMUMLIKELIHOOD AND BAYESIAN | 84 |
NONPARAMETRIC TECHNIQUES | 161 |
LINEAR DISCRIMINANT FUNCTIONS | 215 |
Copyright | |
10 other sections not shown
Other editions - View all
Computer Manual in MATLAB to accompany Pattern Classification David G. Stork,Elad Yom-Tov No preview available - 2004 |
Computer Manual in MATLAB to accompany Pattern Classification David G. Stork,Elad Yom-Tov No preview available - 2004 |
Common terms and phrases
approach assume backpropagation Bayes Bayesian bias binary Boltzmann calculate Chapter cluster centers component classifiers Consider convergence corresponding covariance matrix criterion function d-dimensional data set decision boundary defined denote derivation discriminant function distance distribution entropy error rate feature space FIGURE Gaussian given gradient descent Hidden Markov Models hidden units independent input iteration jackknife estimate labeled large number learning algorithm maximum-likelihood estimate mean methods minimize minimum minimum description length mixture density nearest-neighbor neural networks node nonlinear normal number of clusters number of samples obtain optimal output units p(xw parameters pattern recognition Perceptron points prior probabilities probability density problem procedure random variables randomly Section sequence shown shows simple solution split statistical statistically independent string Suppose target tion training data training error training patterns training set tree two-category unsupervised learning variance w₁ weight vector x₁ zero