Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Kernel Methods: Feature Mapping and Kernel Matrix

In course

MGT-448: Statistical inference and machine learning

This course aims to provide graduate students a thorough grounding in the methods, theory, mathematics and algorithms needed to do research and applications in machine learning. The course covers topics from machine learning, classical statistics, and data ...

Description

This lecture covers the concept of feature mapping in Kernel Methods, discussing the transformation of original variables into feature space. It also delves into the construction and properties of the Kernel matrix, emphasizing symmetry and positive semi-definiteness.

Instructor

Negar Kiyavash

Official source

Related concepts (19)

Kernel method

In machine learning, kernel machines are a class of algorithms for pattern analysis, whose best known member is the support-vector machine (SVM). These methods involve using linear classifiers to solve nonlinear problems. The general task of pattern analysis is to find and study general types of relations (for example clusters, rankings, principal components, correlations, classifications) in datasets.

Positive-definite kernel

In operator theory, a branch of mathematics, a positive-definite kernel is a generalization of a positive-definite function or a positive-definite matrix. It was first introduced by James Mercer in the early 20th century, in the context of solving integral operator equations. Since then, positive-definite functions and their various analogues and generalizations have arisen in diverse parts of mathematics.

Geometric transformation

In mathematics, a geometric transformation is any bijection of a set to itself (or to another such set) with some salient geometrical underpinning. More specifically, it is a function whose domain and range are sets of points — most often both or both — such that the function is bijective so that its inverse exists. The study of geometry may be approached by the study of these transformations. Geometric transformations can be classified by the dimension of their operand sets (thus distinguishing between, say, planar transformations and spatial transformations).

Transformation matrix

In linear algebra, linear transformations can be represented by matrices. If is a linear transformation mapping to and is a column vector with entries, then for some matrix , called the transformation matrix of . Note that has rows and columns, whereas the transformation is from to . There are alternative expressions of transformation matrices involving row vectors that are preferred by some authors. Matrices allow arbitrary linear transformations to be displayed in a consistent format, suitable for computation.

Symmetry

Symmetry () in everyday language refers to a sense of harmonious and beautiful proportion and balance. In mathematics, the term has a more precise definition and is usually used to refer to an object that is invariant under some transformations, such as translation, reflection, rotation, or scaling. Although these two meanings of the word can sometimes be told apart, they are intricately related, and hence are discussed together in this article.

Related lectures (34)

Symmetry in Modern Topology

Explores the concept of symmetry in various geometric transformations.

Isometries in Euclidean Spaces

Explores isometries in Euclidean spaces, including translations, rotations, and linear symmetries, with a focus on matrices.

Symmetries of Navier-Stokes Equations

Explores the symmetries of Navier-Stokes equations in periodic boxes, including translations, transformations, rotations, and scaling.

Isometries: Transformations Preserving Distances in the Plane

Introduces isometries as transformations preserving distances in the plane, focusing on symmetry and geometric relationships.

Geometry: Modern Interpretation of Symmetry