Book contents
- Frontmatter
- Contents
- List of code fragments
- Preface
- Part I Basic concepts
- Part II Pattern analysis algorithms
- 5 Elementary algorithms in feature space
- 6 Pattern analysis using eigen-decompositions
- 7 Pattern analysis using convex optimisation
- 8 Ranking, clustering and data visualisation
- Part III Constructing kernels
- Appendix A Proofs omitted from the main text
- Appendix B Notational conventions
- Appendix C List of pattern analysis methods
- Appendix D List of kernels
- References
- Index
5 - Elementary algorithms in feature space
from Part II - Pattern analysis algorithms
Published online by Cambridge University Press: 29 March 2011
Book contents
- Frontmatter
- Contents
- List of code fragments
- Preface
- Part I Basic concepts
- Part II Pattern analysis algorithms
- 5 Elementary algorithms in feature space
- 6 Pattern analysis using eigen-decompositions
- 7 Pattern analysis using convex optimisation
- 8 Ranking, clustering and data visualisation
- Part III Constructing kernels
- Appendix A Proofs omitted from the main text
- Appendix B Notational conventions
- Appendix C List of pattern analysis methods
- Appendix D List of kernels
- References
- Index
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Kernel Methods for Pattern Analysis , pp. 111 - 139Publisher: Cambridge University PressPrint publication year: 2004