English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  Building Sparse Large Margin Classifiers

Wu, M., Schölkopf, B., & BakIr, G. (2005). Building Sparse Large Margin Classifiers. In S. Dzeroski, L. de Raedt, & S. Wrobel (Eds.), ICML '05: 22nd international conference on Machine learning (pp. 996-1003). New York, NY, USA: ACM.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0013-D4B1-9 Version Permalink: https://hdl.handle.net/21.11116/0000-0005-0DEF-1
Genre: Conference Paper

Files

show Files

Locators

show
hide
Locator:
https://dl.acm.org/citation.cfm?doid=1102351.1102477 (Publisher version)
Description:
-
OA-Status:

Creators

show
hide
 Creators:
Wu, M1, 2, Author           
Schölkopf, B1, 2, Author           
BakIr, G1, 2, Author           
Affiliations:
1Department Empirical Inference, Max Planck Institute for Biological Cybernetics, Max Planck Society, ou_1497795              
2Max Planck Institute for Biological Cybernetics, Max Planck Society, Spemannstrasse 38, 72076 Tübingen, DE, ou_1497794              

Content

show
hide
Free keywords: -
 Abstract: This paper presents an approach to build Sparse Large Margin Classifiers (SLMC) by adding one more constraint to the standard Support Vector Machine (SVM) training problem. The added constraint explicitly controls the sparseness of the classifier and an approach is provided to solve the formulated problem. When considering the dual of this problem, it can be seen that building an SLMC is equivalent to constructing an SVM with a modified kernel function. Further analysis of this kernel function indicates that the proposed approach essentially finds a discriminating subspace that can be spanned by a small number of vectors, and in this subspace different classes of data are linearly well separated. Experimental results over several classification benchmarks show that in most cases the proposed approach outperforms the state-of-art sparse learning algorithms.

Details

show
hide
Language(s):
 Dates: 2005-08
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: DOI: 10.1145/1102351.1102477
BibTex Citekey: 3385
 Degree: -

Event

show
hide
Title: 22nd International Conference on Machine Learning (ICML 2005)
Place of Event: Bonn, Germany
Start-/End Date: 2005-08-07 - 2005-08-11

Legal Case

show

Project information

show

Source 1

show
hide
Title: ICML '05: 22nd international conference on Machine learning
Source Genre: Proceedings
 Creator(s):
Dzeroski, S, Editor
de Raedt, L, Editor
Wrobel, S, Editor
Affiliations:
-
Publ. Info: New York, NY, USA : ACM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 996 - 1003 Identifier: ISBN: 1-59593-180-5