Struct PolynomialKernel 

pub struct PolynomialKernel {
    pub degree: u32,
    pub c: f32,
}

Polynomial kernel function, defined as $(x_1 \cdot x_2 + c)^d$.

Examples

use pr_ml::{RowVector, svm::{Kernel, PolynomialKernel}};

let kernel = PolynomialKernel::new(2, 1.0);
let x1 = RowVector::from([1.0, 2.0]);
let x2 = RowVector::from([3.0, 4.0]);
let result = kernel.compute(&x1, &x2);
assert_eq!(result, 144.0); // (1*3 + 2*4 + 1)^2 = (3 + 8 + 1)^2 = 12^2 = 144

Fields

degree: u32

Degree of the polynomial.

c: f32

Constant term.

Implementations

impl PolynomialKernel

pub fn new(degree: u32, c: f32) -> Self

Creates a new PolynomialKernel with the given degree and constant term.

Trait Implementations

impl Clone for PolynomialKernel

fn clone(&self) -> PolynomialKernel

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for PolynomialKernel

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for PolynomialKernel

fn default() -> Self

Returns the “default value” for a type.

impl<const D: usize> Kernel<D> for PolynomialKernel

fn compute(&self, x1: &RowVector<D>, x2: &RowVector<D>) -> f32

Computes the kernel function between two vectors.

impl PartialEq for PolynomialKernel

fn eq(&self, other: &PolynomialKernel) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for PolynomialKernel

impl StructuralPartialEq for PolynomialKernel