{"id":261202,"date":"2026-07-13T18:12:03","date_gmt":"2026-07-13T15:12:03","guid":{"rendered":"https:\/\/1kitap1.com\/en\/gaussian-processes-for-machine-carl-edward-rasmussen-1\/"},"modified":"2026-07-13T18:12:03","modified_gmt":"2026-07-13T15:12:03","slug":"gaussian-processes-for-machine-carl-edward-rasmussen-1","status":"publish","type":"post","link":"https:\/\/1kitap1.com\/en\/gaussian-processes-for-machine-carl-edward-rasmussen-1\/","title":{"rendered":"Gaussian Processes For Machine – Carl Edward Rasmussen (1)"},"content":{"rendered":"
\"<\/figure>\n

Work on string kernels was started by Watkins [1999] and Haussler [1999]. There are many further developments of the methods we have described above; for example Lodhi et al. [2001] go beyond substrings to consider subsequences of x which are not necessarily contiguous, and Leslie et al.<\/p>\n

[2003] describe mismatch string kernels which allow substrings s and s\u2032 of x and x\u2032 respectively to match if there are at most m mismatches between them. We expect further developments in this area, tailoring (or engineering) the string kernels to have properties that make sense in a particular domain. The idea of string kernels, where we consider matches of substrings, can easily be extended to trees, e.g. by looking at matches of subtrees [Collins and Du\ufb00y, 2002].<\/p>\n

Leslie et al. [2003] have applied string kernels to the classi\ufb01cation of protein domains into SCOP12 superfamilies. The results obtained were signi\ufb01cantly better than methods based on either PSI-BLAST13 searches or a generative hidden Markov model classi\ufb01er. Similar results were obtained by Jaakkola et al. [2000] using a Fisher kernel (described in the next section).<\/p>\n

Saunders et al. [2003] have also described the use of string kernels on the problem of classifying natural language newswire stories from the Reuters-2157814 database into ten classes. 4.4.2 Fisher Kernels As explained above, our problem is that the input x is a structured object of arbitrary size e.g. a string, and we wish to extract features from it. The Fisher kernel (introduced by Jaakkola et al., 2000) does this by taking a generative model p(x|\u03b8), where \u03b8 is a vector of parameters, and computing the feature vector \u03c6\u03b8(x) = \u2207\u03b8 log p(x|\u03b8).<\/p>\n

\u03c6\u03b8(x) is sometimes called the score vector. score vector Take, for example, a Markov model for strings. Let xk be the kth symbol in string x. Then a Markov model gives p(x|\u03b8) = p(x1|\u03c0)Q|x|\u22121 i=1 p(xi+1|xi, A), where \u03b8 = (\u03c0, A). Here (\u03c0)j gives the probability that x1 will be the jth symbol in the alphabet A, and A is a |A| \u00d7 |A| stochastic matrix, with ajk giving the probability that p(xi+1 = k|xi = j). Given such a model it is straightforward to compute the score vector for a given x.<\/p>\n

It is also possible to consider other generative models p(x|\u03b8). For example we might try a kth-order Markov model where xi is predicted by the preceding k symbols. See Leslie et al. [2003] and Saunders et al.<\/p>\n

\n

Carl Edward Rasmussen and Christopher K. I. Williams Gaussian Processes for Machine Learning Adaptive Computation and Machine Learning Thomas Dietterich, Editor Christopher Bishop, David Heckerman, Michael Jordan, and Michael Kearns, Associate Editors Bioinformatics: The Machine Learning Approach, Pierre Baldi and S\u00f8ren Brunak Reinforcement Learning: An Introduction, Richard S. Sutton and Andrew G. Barto Graphical Models for Machine Learning and Digital Communication, Brendan J.<\/p>\n

Frey Learning in Graphical Models, Michael I. Jordan Causation, Prediction, and Search, second edition, Peter Spirtes, Clark Glymour, and Richard Scheines Principles of Data Mining, David Hand, Heikki Mannila, and Padhraic Smyth Bioinformatics: The Machine Learning Approach, second edition, Pierre Baldi and S\u00f8ren Brunak Learning Kernel Classi\ufb01ers: Theory and Algorithms, Ralf Herbrich Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond, Bernhard Sch\u00a8olkopf and Alexander J.<\/p>\n

Smola Introduction to Machine Learning, Ethem Alpaydin Gaussian Processes for Machine Learning, Carl Edward Rasmussen and Christopher K. I. Williams Gaussian Processes for Machine Learning Carl Edward Rasmussen Christopher K. I. Williams The MIT Press Cambridge, Massachusetts London, England c\u20dd2006 Massachusetts Institute of Technology All rights reserved.<\/p>\n

No part of this book may be reproduced in any form by any electronic or mechanical means (including photocopying, recording, or information storage and retrieval) without permission in writing from the publisher. MIT Press books may be purchased at special quantity discounts for business or sales promotional use. For information, please email special sales@mitpress.mit.edu or write to Special Sales Department, The MIT Press, 55 Hayward Street, Cambridge, MA 02142.<\/p>\n

Typeset by the authors using LATEX2\u03b5. This book printed and bound in the United States of America. Library of Congress Cataloging-in-Publication Data Rasmussen, Carl Edward. Gaussian processes for machine learning \/ Carl Edward Rasmussen, Christopher K. I. Williams. p. cm. \u2014(Adaptive computation and machine learning) Includes bibliographical references and indexes. ISBN 0-262-18253-X 1. Gaussian processes\u2014Data processing. 2. Machine learning\u2014Mathematical models. I. Williams, Christopher K. I. II. Title. III. Series.<\/p>\n

QA274.4.R37 2006 519.2\u20193\u2014dc22 2005053433 10 9 8 7 6 5 4 3 2 1 The actual science of logic is conversant at present only with things either certain, impossible, or entirely doubtful, none of which (fortunately) we have to reason on. Therefore the true logic for this world is the calculus of Probabilities, which takes account of the magnitude of the probability which is, or ought to be, in a reasonable man\u2019s mind. \u2014 James Clerk Maxwell [1850] Contents Series Foreword . . . . . . . .<\/p>\n

. . . . . . . . . . . . . . . . . . . . . . . . . . . . xi Preface . . . . . . . . . . . . . . . . .<\/p>\n

. . . . . . . . . . . . . .<\/p>\n<\/blockquote>\n

This is a short excerpt from the opening of “” by Unknown, quoted for review and introduction purposes. All rights belong to the copyright holders.<\/em><\/p>\n

\n
\n

Table of Contents<\/p>\nToggle<\/span><\/path><\/svg><\/svg><\/span><\/span><\/span><\/a><\/span><\/div>\n