Documentation of 'smile.math.kernel.BinarySparsePolynomialKernel' Java class
BinarySparsePolynomialKernel
smile.math.kernel

Class BinarySparsePolynomialKernel

  • All Implemented Interfaces:
    java.io.Serializable, MercerKernel<int[]>


    public class BinarySparsePolynomialKernel
    extends java.lang.Object
    implements MercerKernel<int[]>, java.io.Serializable
    The polynomial kernel. k(u, v) = (γ uTv - λ)d, where γ is the scale of the used inner product, λ the offset of the used inner product, and d the order of the polynomial kernel. The kernel works on sparse binary array as int[], which are the indices of nonzero elements.
    See Also:
    Serialized Form
    • Method Summary

      All Methods Instance Methods Concrete Methods 
      Modifier and Type Method and Description
      double k(int[] x, int[] y)
      Kernel function.
      java.lang.String toString() 
      • Methods inherited from class java.lang.Object

        equals, getClass, hashCode, notify, notifyAll, wait, wait, wait
    • Constructor Detail

      • BinarySparsePolynomialKernel

        public BinarySparsePolynomialKernel(int degree)
        Constructor with scale 1 and bias 0.
      • BinarySparsePolynomialKernel

        public BinarySparsePolynomialKernel(int degree,
                                            double scale,
                                            double offset)
        Constructor.
    • Method Detail

      • toString

        public java.lang.String toString()
        Overrides:
        toString in class java.lang.Object
      • k

        public double k(int[] x,
                        int[] y)
        Description copied from interface: MercerKernel
        Kernel function.
        Specified by:
        k in interface MercerKernel<int[]>

DataMelt 3.0 © DataMelt by jWork.ORG

You see the box below because you did not login.