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 84
Page 81
... Calculate the mean and standard deviation of your histogram , and plot it ( e ) Repeat the above for 105 and for 106. Discuss your results . Section 2.8 6. Explore how the empirical error does or does not approach the Bhattacharyya ...
... Calculate the mean and standard deviation of your histogram , and plot it ( e ) Repeat the above for 105 and for 106. Discuss your results . Section 2.8 6. Explore how the empirical error does or does not approach the Bhattacharyya ...
Page 346
... Calculate the optimum learning rate opt by Eq . 36 , and confirm that this value is consistent with your results in part ( a ) . ( c ) Calculate the weight update by the Quickprop rule of Eq . 53 . Section 6.8 12. Demonstrate that ...
... Calculate the optimum learning rate opt by Eq . 36 , and confirm that this value is consistent with your results in part ( a ) . ( c ) Calculate the weight update by the Quickprop rule of Eq . 53 . Section 6.8 12. Demonstrate that ...
Page 367
... calculate [ S ; Sjaaoclamped randomize states s¿ anneal network with input clamped but output free at final , low T , calculate [ S ; S ; la clamped w¡¡ ← w¡¡ + n / T [ [ $ i $ ; la aclamped - [ $ i $ j la clamped ] kmax or convergence ...
... calculate [ S ; Sjaaoclamped randomize states s¿ anneal network with input clamped but output free at final , low T , calculate [ S ; S ; la clamped w¡¡ ← w¡¡ + n / T [ [ $ i $ ; la aclamped - [ $ i $ j la clamped ] kmax or convergence ...
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
analysis 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 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