Kernel Methods for Pattern AnalysisCambridge University Press, 28 jun 2004 - 462 páginas Pattern analysis is the process of finding general relations in a set of data, and forms the core of many disciplines, from neural networks to so-called syntactical pattern recognition, from machine learning to data mining. Applications of pattern analysis range from bioinformatics to document retrieval. The kernel methodology described here provides a powerful and unified framework for all of these disciplines, motivating algorithms that can act on general types of data (e.g. strings, vectors, text etc.) and look for general types of relations (e.g. rankings, classifications, regressions clusters etc.) |
Índice
IV | 3 |
V | 4 |
VI | 10 |
VII | 15 |
VIII | 20 |
IX | 21 |
X | 23 |
XI | 24 |
LIV | 217 |
LV | 227 |
LVI | 235 |
LVII | 236 |
LVIII | 238 |
LX | 239 |
LXI | 249 |
LXII | 262 |
XII | 25 |
XIII | 34 |
XIV | 40 |
XV | 41 |
XVI | 42 |
XVII | 43 |
XVIII | 43 |
XIX | 44 |
XX | 55 |
XXI | 62 |
XXII | 68 |
XXIII | 76 |
XXV | 79 |
XXVI | 80 |
XXVII | 87 |
XXVIII | 91 |
XXIX | 98 |
XXX | 99 |
XXXI | 100 |
XXXII | 103 |
XXXIV | 105 |
XXXV | 106 |
XXXVI | 116 |
XXXVII | 120 |
XXXVIII | 124 |
XXXIX | 129 |
XL | 130 |
XLI | 132 |
XLIII | 133 |
XLIV | 135 |
XLV | 147 |
XLVI | 153 |
XLVII | 156 |
XLVIII | 166 |
XLIX | 180 |
L | 181 |
LI | 183 |
LII | 184 |
LIII | 199 |
LXIII | 268 |
LXV | 271 |
LXVI | 273 |
LXVIII | 274 |
LXIX | 279 |
LXX | 286 |
LXXI | 292 |
LXXII | 296 |
LXXIII | 298 |
LXXIV | 300 |
LXXV | 302 |
LXXVI | 304 |
LXXVII | 305 |
LXXVIII | 307 |
LXXX | 308 |
LXXXI | 311 |
LXXXII | 321 |
LXXXIII | 322 |
LXXXIV | 324 |
LXXXVI | 325 |
LXXXVII | 327 |
LXXXVIII | 331 |
LXXXIX | 337 |
XC | 340 |
XCI | 352 |
XCII | 360 |
XCIII | 373 |
XCIV | 375 |
XCVI | 376 |
XCVII | 399 |
XCVIII | 413 |
XCIX | 414 |
C | 415 |
CII | 422 |
CIII | 424 |
CV | 426 |
CVI | 428 |
CVII | 438 |
Otras ediciones - Ver todo
Kernel Methods for Pattern Analysis John Shawe-Taylor,Nello Cristianini Vista previa restringida - 2004 |
Términos y frases comunes
ANOVA kernel apply approach bound centre of mass Chapter Cholesky decomposition classification clustering co-rooted Code Fragment complexity computation consider corresponding covariance data items dataset decomposition defined Definition denote dimension distribution dual eigenvalues eigenvectors embedding entries equation evaluation example feature space finite Fisher kernel function f gap-weighted generalisation given graph Hence hidden Markov model hypersphere inner product kernel function kernel matrix kernel methods kernel PCA kernel-defined feature space labelled learning linear function loss function maximise minimising node norm normalised novelty-detection obtain optimisation problem orthogonal output pair parameters pattern analysis algorithm pattern function positive semi-definite probability projection properties Pseudocode random rank recursion regularisation relations Remark representation result ridge regression semantic sequence slack variables solution statistical strings subsequences kernel subset subspace substrings subtree support vector machine support vector regression Theorem training set tree weight vector
Referencias a este libro
Signal Processing of Power Quality Disturbances Math H. J. Bollen,Irene Y. H. Gu Vista previa restringida - 2006 |
Reviews in Computational Chemistry, Volume 23 Kenny B. Lipkowitz,Thomas R. Cundari,Donald B. Boyd No hay ninguna vista previa disponible - 2007 |
