Kernels for structured data
- Responsibility
- Thomas Gärtner.
- Imprint
- Singapore ; Hackensack, N.J. : World Scientific Pub. Co., ©2008.
- Physical description
- 1 online resource
- Series
- Series in machine perception and artificial intelligence ; v. 72.
Online
Available online
More options
Description
Creators/Contributors
- Author/Creator
- Gärtner, Thomas.
Contents/Summary
- Bibliography
- Includes bibliographical references (pages 179-190) and index.
- Contents
-
- 1. Why kernels for structured data? 1.1. Supervised machine learning. 1.2. Kernel methods. 1.3. Representing structured data. 1.4. Goals and contributions. 1.5. Outline. 1.6. Bibliographical notes
- 2. Kernel methods in a nutshell. 2.1. Mathematical foundations. 2.2. Recognising patterns with kernels. 2.3. Foundations of kernel methods. 2.4. Kernel machines. 2.5. Summary
- 3. Kernel design. 3.1. General remarks on kernels and examples. 3.2. Kernel functions. 3.3. Introduction to kernels for structured data. 3.4. Prior work. 3.5. Summary
- 4. Basic term kernels. 4.1. Logics for learning. 4.2. Kernels for basic terms. 4.3. Multi-instance learning. 4.4. Related work. 4.5. Applications and experiments
- 5. Graph kernels. 5.1. Motivation and approach. 5.2. Labelled directed graphs. 5.3. Complete graph kernels. 5.4. Walk kernels. 5.5. Cyclic pattern kernels. 5.6. Related work. 5.7. Relational reinforcement learning. 5.8. Molecule classification. 5.9 Summary
- 6. Conclusions.
- Summary
- This book provides a unique treatment of an important area of machine learning and answers the question of how kernel methods can be applied to structured data. Kernel methods are a class of state-of-the-art learning algorithms that exhibit excellent learning results in several application domains. Originally, kernel methods were developed with data in mind that can easily be embedded in a Euclidean vector space. Much real-world data does not have this property but is inherently structured. An example of such data, often consulted in the book, is the (2D) graph structure of molecules formed by their atoms and bonds. The book guides the reader from the basics of kernel methods to advanced algorithms and kernel design for structured data. It is thus useful for readers who seek an entry point into the field as well as experienced researchers.
Subjects
Bibliographic information
- Publication date
- 2008
- Series
- Series in machine perception and artificial intelligence ; v. 72
- ISBN
- 9789812814562 (electronic bk.)
- 9812814566 (electronic bk.)
- 9812814558
- 9789812814555
