See markov chain monte carlo algorithms
494 |
|
|
---|---|---|
for RBF initialisation, 185 | 55–70 |
kernel methods, 59, 106
Kullback–Leibler distance, 86latent variables, 337, 343
LBG algorithm, 384
learning vector quantisation, 390
likelihood ratio, 7
linear discriminant analysis, 123–158transformation mixture models
least mean squared error procedures, mixture sampling, 160
two-class algorithms, 124–144 multidimensional scaling by transformation,
linear discriminant function, see 352
piecewise, 21 nearest class mean classifier, 21, 36
logistic discrimination, 158–163 neural networks, 169–202
nonlinear feature extraction
multidimensional scaling by transformation, 351
nonparametric discrimination
histogram approximations, 84 Bayesian networks, 88–91marginal independence, 84
imprecision, 258 | Index | ||
---|---|---|---|
maximum weight dependence trees, | reliability, 252, 258 | ||
histogram method, 82, 119
variable cell, 83
kernel methods, 106–116, 119primary monotone condition, 349
principal components analysis, see feature extraction, principal components93 discrimination, normal-based
normal distribution, 454 models, quadratic discriminant
EM algorithm, 42, 78 random variables
for RBF initialisation, 184 autocorrelation, 451
function, 35 ratio of uniforms method, 62
receiver operating characteristic, 15,
parameter estimation, 431–435 maximum likelihood, 433
regularisation, 155, 174–175
regularised discriminant analysis, 37, 78 reject option, 6, 9, 13
rejection sampling, 62
reliability, see performance assessment,
perceptron, see linear discriminant analysis,
perceptron criterion sampling