Results 1 to 1 of 1

Thread: Kernel Perceptron for inseparable data query

  1. #1
    Junior Member
    Joined
    Dec 2010
    Posts
    63

    Kernel Perceptron for inseparable data query

    Any clues as to the following would be appreciated.

    For inseparable data the Perceptron algorithm will go into an infinite loop.
    Assuming the training examples are distinct, consider the modification of
    a normalised kernel k to
    k(x; z) = k(x; z) + a.g(x; z);
    where a > 0 and

    g(x; z) =

    1 if x = z;
    0 otherwise:

    Show we can find a such that K.a = y for the label vector y, where K is
    the kernel matrix of the modied kernel k. Hence, argue that the training
    set is separable in the feature space defined by the kenel mapping phi(x).
    Last edited by Mathsdog; Dec 27th 2010 at 03:43 AM.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. [SOLVED] Galois Theory: Inseparable and Separable elements of a field K.
    Posted in the Advanced Algebra Forum
    Replies: 2
    Last Post: Sep 23rd 2011, 09:29 PM
  2. [SOLVED] Interpolating z(x,y) data point from 4 data points (rectangular)?
    Posted in the Advanced Applied Math Forum
    Replies: 2
    Last Post: Jun 20th 2011, 07:04 PM
  3. Replies: 2
    Last Post: Jul 6th 2010, 07:33 PM
  4. Irreducible, inseparable polynomials
    Posted in the Advanced Algebra Forum
    Replies: 2
    Last Post: Mar 15th 2009, 01:50 PM
  5. [SOLVED] [SOLVED] Help!! This ones tough! (inseparable events, multiple trials)
    Posted in the Advanced Statistics Forum
    Replies: 0
    Last Post: Jun 11th 2006, 11:04 PM

Search Tags


/mathhelpforum @mathhelpforum