ACM Home Page
Please provide us with feedback. Feedback
Selecting parameters of SVM using meta-learning and kernel matrix-based meta-features
Full text PdfPdf (176 KB)
Source Symposium on Applied Computing archive
Proceedings of the 2006 ACM symposium on Applied computing table of contents
Dijon, France
SESSION: Data mining (DM) table of contents
Pages: 564 - 568  
Year of Publication: 2006
ISBN:1-59593-108-2
Authors
Carlos Soares  University of Porto, Porto, Portugal
Pavel B. Brazdil  University of Porto, Porto, Portugal
Sponsor
SIGAPP: ACM Special Interest Group on Applied Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 58,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1141277.1141408
What is a DOI?

ABSTRACT

The Support Vector Machine (SVM) algorithm is sensitive to the choice of parameter settings, which makes it hard to use by non-experts. It has been shown that meta-learning can be used to support the selection of SVM parameter values. Previous approaches have used general statistical measures as meta-features. Here we propose a new set of meta-features that are based on the kernel matrix. We test them on the problem of setting the width of the Gaussian kernel for regression problems. We obtain significant improvements in comparison to earlier meta-learning results. We expect that with better support in the selection of parameter values, SVM becomes accessible to a wider range of users.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
 
4
 
5
 
6
N. Cristianini, J. Shawe-Taylor, A. Elisseeff, and J. Kandola. On kernel-target alignment. In T. G. Dietterich, S. Becker, and Z. Ghahramani, editors, Advances in Neural Information Processing Systems 14, Cambridge, MA, 2002. MIT Press.
 
7
R. Ihaka and R. Gentleman. R: A language for data analysis and graphics. J. of Computational and Graphical Statistics, 5(3):299--314, 1996.
 
8
 
9
J. Kandola and J. Shawe-Taylor. Refining kernels for regression and uneven classification problems. In C. M. Bishop and B. J. Frey, editors, Proc. of the Ninth Int. Workshop on Artificial Intelligence and Statistics, 2003.
 
10
METAL Project. Esprit project METAL (#26.357). http://www.metal-kdd.org, 2002.
 
11
K.-R. Müller, S. Mika, G. Rätsch, K. Tsuda, and B. Schölkopf. An introduction to kernel-based learning algorithms. IEEE Transactions on Neural Networks, 12(2):181--201, 2001.
 
12
H. Neave and P. Worthington. Distribution-Free Tests. Routledge, 1992.
 
13
J. Petrak. MLEE: Machine Learning Experimentation Environment. Austrian Institute for Artificial Intelligence, 2002. http://www.ai.univie.ac.at/~johann/mlee.html.
 
14
 
15

Collaborative Colleagues:
Carlos Soares: colleagues
Pavel B. Brazdil: colleagues