JiscMail Logo
Email discussion lists for the UK Education and Research communities

Help for SUPPORT-VECTOR-MACHINES Archives


SUPPORT-VECTOR-MACHINES Archives

SUPPORT-VECTOR-MACHINES Archives


SUPPORT-VECTOR-MACHINES@JISCMAIL.AC.UK


View:

Message:

[

First

|

Previous

|

Next

|

Last

]

By Topic:

[

First

|

Previous

|

Next

|

Last

]

By Author:

[

First

|

Previous

|

Next

|

Last

]

Font:

Proportional Font

LISTSERV Archives

LISTSERV Archives

SUPPORT-VECTOR-MACHINES Home

SUPPORT-VECTOR-MACHINES Home

SUPPORT-VECTOR-MACHINES  2004

SUPPORT-VECTOR-MACHINES 2004

Options

Subscribe or Unsubscribe

Subscribe or Unsubscribe

Log In

Log In

Get Password

Get Password

Subject:

Re: kernel map

From:

Peter Sollich <[log in to unmask]>

Reply-To:

The Support Vector Machine discussion list <[log in to unmask]>

Date:

Fri, 4 Jun 2004 09:55:34 +0100

Content-Type:

TEXT/PLAIN

Parts/Attachments:

Parts/Attachments

TEXT/PLAIN (126 lines)

On the general issues of how to choose SVM kernels - it may be useful to
bear in mind that, if one interprets SVM classifiers (or indeed SVM
regression) from a Bayesian perspective, the kernel is just the covariance
function of a Gaussian process prior. Much is known about how such
covariance functions encode prior assumptions about a problem, and this
can be used as a guide in selecting appropriate kernels. See e.g. the
"Bayesian methods for SVMs" paper on
http://www.mth.kcl.ac.uk/~psollich/publications/node20.html - blatant
self-advertisement here but the paper also has lots of references to
related work by other people.

Regards,
Peter

--------------------------------------------------------------------------
 Dr. Peter Sollich                           Department of Mathematics
 Phone:  +44 - (0)20 - 7848 2875             King's College
 Fax:    +44 - (0)20 - 7848 2017             University of London
 E-mail: [log in to unmask]             Strand
 WWW:    http://www.mth.kcl.ac.uk/~psollich  London WC2R 2LS, U.K.
--------------------------------------------------------------------------

On Thu, 3 Jun 2004, Balaji Krishnapuram wrote:

> The following paper is relevant to the discussion on feature scaling, and
> what is the "right way" to do it: Please notice that I dont think there is a
> universal right way, but if you operate in an SVM kind of environment this
> might be a sensible thing to consider.
>
> http://research.microsoft.com/users/rherb/pubs/HerGrae02.htm
>
> In this paper Hrbrich and Graepel develop some interesting theoretical
> results (validated on some experiments) which show the benefits of scaling
> feature vectors to make each sample (x_i)  of unit norm.
>
> Regarding the selection of the right kernel, it has been stated in the
> previous discussion that the linear kernel, RBF and (low order) polynomial
> kernel are the right candidates to consider. While notdisagreeing about the
> utility of these kernels I believe that the kernel really should reflect our
> intuition about what is a good feature space for representing the data. The
> appropriate feature space is thus very much a function of the application
> and the data used. For example what is applicable in signal/image processing
> contexts in representing images is clearly not sensible on say
> bio-informatics datasets.
>
> Thus while the SVM gives a good solution for designing classifiers once the
> feature space (and thus the kernel) has been fixed, the decision about what
> is the right feature space has been brushed under the carpet so to speak.
> After you get the right feature space the kerne itself is just a dot product
> in that space, and even simple nonlinear transformations such as that
> afforded by RBF kernels would probably help a bit more. However what I mean
> to point out is that there is no substitute for choosing a good way to
> represent the data in such a way that the classes can be disambiguated
> easily. We can summarize the intuition this way: if we try to discriminate
> between people based on their height you can only achieve a certain error
> rate, but if you use finer details such as their voice or picture of their
> face, you can do better.
>
> This realization has spawned a spate of papers that explain the design of
> kernels that are appropriate to specific problems (see for example the book
> "Kernel methods in computational biology" (Edited by B. Scholkopf, J-P. Vert
> and K. Tsuda, MIT Press, 2004) which has several examples of kernels
> specificallyt designed to exploit characteristics of specific types of
> data(such as graphs, protein sequences, etc).
>
> In a word I only want to point out that the SVM cant do magic and
> distinguish classes when the class conditional distributions completely
> overlap in the feature space induced by the kernel. We do still have to
> think carefully about the physics of the problem we are trying to solve:
> that is the right way to think about how to choose kernels, and it is the
> responsibility of the user of the SVM!
>
> Finally, the SVM is only one way to think of classifiers, and to be very
> clear it encodes a certain prior intuition that large margin separation
> helps improve classification. This is still just intuition. Even though we
> can use this intuition to prove large margin (so called radius/margin) bouns
> for the generalization, other intuitions (for example that sparseness leads
> to good classification, or that minimizing the 1-norm of the resulting
> classifier,w, leads to good classification) can also be used to derive
> equally good bounds.
>
> Thus the common *misconception* that the SVM is somehow superior to all
> other algorithms is clearly not justifiable. In a Bayesian sense each type
> of intuition is just a prior(though the SVM cant be encoded fully as a
> probabilistic system), and no prior is universally the best for all
> datasets! The responsibility still resides with the end user to encode the
> intuition that is appropriate. Statistically rigorous methods allow us to
> even compare which intuition (prior) is more sensible and validated in a
> specific example dataset (for example by comparing the "evidence" or
> marginal likelihood). What we can't do is to claim that we can skip this
> step and declare that there is a universally superior algorithm (such as the
> SVM) or a feature representation (kernel) which will work best in all
> circumstances.
>
> I hope that helps clarify things somewhat, but if you need specific
> references on any of the points I mentioned I can point to papers on that
> topic. I think this is a discussion that needs to be clearly explained and
> argued; all too often it has been ignored, and practitioners tend to
> overlook better alternatives for their own problems.
>
> Balaji
> ----------------------------------------------------------------
> Phone (home): 919-383-2069       | Off : 919-660-5233
> Email       : [log in to unmask] | http://www.duke.edu/~balaji/
> ----------------------------------------------------------------
>
> --
> This message has been scanned on otto for
> viruses and dangerous content by MailScanner,
> and is believed to be clean.
>
>

--------------------------------------------------------------------------
 Dr. Peter Sollich                           Department of Mathematics
 Phone:  +44 - (0)20 - 7848 2875             King's College
 Fax:    +44 - (0)20 - 7848 2017             University of London
 E-mail: [log in to unmask]             Strand
 WWW:    http://www.mth.kcl.ac.uk/~psollich  London WC2R 2LS, U.K.
--------------------------------------------------------------------------

--
This message has been scanned on otto for
viruses and dangerous content by MailScanner,
and is believed to be clean.

Top of Message | Previous Page | Permalink

JiscMail Tools


RSS Feeds and Sharing


Advanced Options


Archives

May 2024
April 2024
March 2024
February 2024
January 2024
December 2023
November 2023
October 2023
September 2023
August 2023
July 2023
June 2023
May 2023
April 2023
March 2023
February 2023
January 2023
December 2022
November 2022
October 2022
September 2022
August 2022
July 2022
June 2022
May 2022
April 2022
March 2022
February 2022
January 2022
December 2021
November 2021
October 2021
September 2021
August 2021
July 2021
June 2021
May 2021
April 2021
March 2021
February 2021
January 2021
December 2020
November 2020
October 2020
September 2020
August 2020
July 2020
June 2020
May 2020
April 2020
March 2020
February 2020
January 2020
December 2019
October 2019
September 2019
August 2019
July 2019
June 2019
May 2019
April 2019
March 2019
February 2019
January 2019
December 2018
November 2018
October 2018
September 2018
August 2018
July 2018
June 2018
May 2018
April 2018
March 2018
February 2018
January 2018
December 2017
November 2017
October 2017
September 2017
August 2017
July 2017
June 2017
May 2017
April 2017
March 2017
February 2017
January 2017
December 2016
November 2016
October 2016
September 2016
August 2016
July 2016
June 2016
May 2016
April 2016
March 2016
February 2016
January 2016
December 2015
November 2015
October 2015
September 2015
August 2015
July 2015
June 2015
May 2015
April 2015
March 2015
February 2015
January 2015
December 2014
November 2014
October 2014
September 2014
August 2014
July 2014
June 2014
May 2014
April 2014
March 2014
February 2014
January 2014
December 2013
November 2013
October 2013
September 2013
August 2013
July 2013
June 2013
May 2013
April 2013
March 2013
February 2013
January 2013
December 2012
November 2012
October 2012
September 2012
August 2012
July 2012
June 2012
May 2012
April 2012
March 2012
February 2012
January 2012
December 2011
November 2011
October 2011
September 2011
August 2011
July 2011
June 2011
May 2011
April 2011
March 2011
February 2011
January 2011
December 2010
November 2010
October 2010
September 2010
August 2010
July 2010
June 2010
May 2010
April 2010
March 2010
February 2010
January 2010
December 2009
November 2009
October 2009
September 2009
August 2009
July 2009
June 2009
May 2009
April 2009
March 2009
February 2009
January 2009
December 2008
November 2008
October 2008
September 2008
August 2008
July 2008
June 2008
May 2008
April 2008
March 2008
February 2008
January 2008
December 2007
November 2007
October 2007
September 2007
August 2007
July 2007
June 2007
May 2007
April 2007
March 2007
February 2007
January 2007
2006
2005
2004
2003
2002
2001
2000


JiscMail is a Jisc service.

View our service policies at https://www.jiscmail.ac.uk/policyandsecurity/ and Jisc's privacy policy at https://www.jisc.ac.uk/website/privacy-notice

For help and support help@jisc.ac.uk

Secured by F-Secure Anti-Virus CataList Email List Search Powered by the LISTSERV Email List Manager