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  2002

SUPPORT-VECTOR-MACHINES 2002

Options

Subscribe or Unsubscribe

Subscribe or Unsubscribe

Log In

Log In

Get Password

Get Password

Subject:

A high-performance SVM DLL

From:

Dong Jianxiong <[log in to unmask]>

Reply-To:

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

Date:

Tue, 20 Aug 2002 22:41:13 -0400

Content-Type:

TEXT/PLAIN

Parts/Attachments:

Parts/Attachments

TEXT/PLAIN (124 lines)

Hello,
    Support vector machine represents the state-of-the-art technique for
classification. But training SVM on a large training set has become a
bottleneck. At the beginning of this year I proposed a fast SVM training
algorithm to successfully sovle this problem. For example, the total time
for training ten binary Svms on MNIST handwritten digit database (60,000
training samples) just needs 0.75hours

Recently I designed a high-performance SVM package called HeroSvm which is
designed using object-oriented method in order to facilitate the
maintainness and portability. Also, I also add error handling to make
software more robust. HeroSVM has no restriction of the size of training
set and dimension of feature vector. It is especially suitable for
training SVM on a very large training set. For example, I trained SVM on
non-public character database (1,380,000 training samples, 120 dimensional
feature vectors) on P4 1.7G just took about 6 hours.

HeroSVM can be used for research and is free of charge. Anybody who uses
it for a commercial purpose must get the permission from the author. If
you like to use this software, you need to send (or fax) me a letter with
an official title including affiliation information to request it. Then I
can send HeroSVM package to you by email.

If you like to know more information about this package, please visit the
website:

http://www.cenparmi.concordia.ca/~people/jdong/HeroSvm.html

I expect that people can use this package to solve real-world problems in
various engineering fields.


> Date: Fri, 16 Aug 2002 13:46:44 +0200
> From: Goekhan Bakir <[log in to unmask]>
> Reply-To: The Support Vector Machine discussion list
>     <[log in to unmask]>
> To: [log in to unmask]
> Subject: Re: calculating dot products with mmx oder isse routines
>
> Hi,
>
> If I got you right, you are interested in faster evaluation of the
> decision function.
> Hence training is offline, the kernel computation is mostly cached and not
> the main computing factor in training svm.
> In evaluation the decision function, the mean cost factor is always
> the number of support vectors.
>
> If you reduced this via your desired method, ( v-svm / reduces set method)
> there are several things which are possible to speed up classification
> time.
>
> If you have large input vectors, you can try to implement faster
> products. ( unrolling the loop , etc.  see for example "ODE" under
> sourceforge.net ) Then indeed ( for large input vectors) mmx could bring
> some tiny benefit. ( Thats an issue of the optimizer normally)
>
>
> Another issue is that if you only want to classify, you could
> instead evaluating sign(\sum_i^n ... ), order the sum into two parts
> (positive and negative) and check which one has larger value.
> There exist a way to answer this decision without calculating dot product
> with every support vector. But I dont know if the approach is working for
> any case or only approximately.
>
> ciao goekhan.
>
>
>
> On Fri, 16 Aug 2002, Martin Schulze wrote:
>
> > Hello together,
> >
> > i wanted to know, if someone knows, wheater small assembler routines to the
> > multimedia extensions of mmx or isse can be
> > applied to compute dot products in the svm kernel.
> >
> > i mean in a efficient way?
> > (only a vew word can be computed at once,
> > so there might be a overload for loading the registers over and over,
> > especially for large feature vectors..)
> >
> > for instance in the linear kernel, dot products are computed only.
> >
> > hence, i do not know exactly, how much time is spend in the dot product
> > computation, in comparison to the whole problem solving.
> > but i should be quite a lot...
> >
> > i have got libsvm, and it takes me about a day to compute a trainingset of
> > the size of 7 Megabytes.
> > it is the linear and polynomial case.
> > the rbf-kernel works fast, but produces a large amount of support vectors.
> >
> > but i want a fast prediction, since my classification should be realtime.
> >
> > so i wanted to speed the training up, to use the linear and polynomial kernel.
> >
> > is there a svm-implementation out, which is does this fast?
> > or does someone know functions to use in c++ (assembler or library) which
> > compute sparse feature vectors,
> > so i could put it into libsvm?
> >
> > thanks
> >
> > Martin
> >
>

--
//////////////////////////////////////////////////////////////
 DONG JIANXIONG

 Centre for Pattern Recognition and Machine Intelligence
 GM606, Concordia University
 1455 de Maisonneuve Blvd. West
 Montreal Quebec H3G 1M8, Canada

 Tel: (Office) (514)848-7953
 Fax:          (514)848-4522

 E-mail: [log in to unmask]
 homepage: http://www.cenparmi.concordia.ca/~people/jdong

//////////////////////////////////////////////////////////////

Top of Message | Previous Page | Permalink

JiscMail Tools


RSS Feeds and Sharing


Advanced Options


Archives

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

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