• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

A greedy algorithm for optimizing the kernel alignment and the performance of kernel machines (0)

by J-B Pothin, C Richard
Venue:In Proc. EUSIPCO ’06
Add To MetaCart

Tools

Sorted by:
Results 1 - 3 of 3

Optimizing kernel alignment by data translation in feature space

by Jean-baptiste Pothin, Cédric Richard - In ICASSP , 2008
"... Kernel-target alignment is commonly used to predict the behavior of reproducing kernels in a classification context, without training any kernel machine. In this paper, we show that a poor position of training data in feature space can drastically reduce the value of alignment. This implies that, in ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
Kernel-target alignment is commonly used to predict the behavior of reproducing kernels in a classification context, without training any kernel machine. In this paper, we show that a poor position of training data in feature space can drastically reduce the value of alignment. This implies that, in a kernel selection setting, the best kernel of a given collection may be characterized by a low alignment. To overcome this situation, we present a gradient ascent algorithm for maximizing the alignment by data translation in feature space. The aim is to reduce the biais introduced by the translation non-invariance of this criterion. Experimental results on multidimensional benchmarks show the effectiveness of our approach. Index Terms — kernel alignment, data translation, SVM 1.
(Show Context)

Citation Context

...ee of agreement between a reproducing kernel and a learning task [2]. Previous works on KTA focused mainly on its optimization by linear combination of kernels in a transductive or inductive settings =-=[3, 4, 5, 6]-=-. More recently, we proposed in [7] a gradient ascent algorithm for maximizing KTA over a linear transform in input space. In all these references, the effect of translation in feature space was not s...

Multiclass Feature Selection with Kernel Gram-matrix-based criteria

by Mathieu Ramona, Gaël Richard, Bertrand David , 2012
"... Feature selection has been an important issue during the last decades to determine the most relevant features according to a given classification problem. Numerous methods emerged that take into account Support Vector Machines in the selection process. Such approaches are powerful but often complex ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
Feature selection has been an important issue during the last decades to determine the most relevant features according to a given classification problem. Numerous methods emerged that take into account Support Vector Machines in the selection process. Such approaches are powerful but often complex and costly. In this paper, we propose new feature selection methods based on two criteria designed for the optimization of SVM: Kernel Target Alignment and Kernel Class Separability. We demonstrate how these two measures, when fully expressed, can build efficient and simple methods, easily applicable to multiclass problems, and iteratively computable with minimal memory requirements. An extensive experimental study is conducted both on artificial and real-world data sets to compare the proposed methods to state of the art feature selection algorithms. The results demonstrate the relevance of the proposed methods both in terms of performance and computational cost.

COMPARISON OF DIFFERENT STRATEGIES FOR A SVM-BASED AUDIO SEGMENTATION

by Mathieu Ramona, Gaël Richard
"... We compare in this paper diverse hierarchical and multi-class approaches for the speech/music segmentation task, based on Support Vector Machines, combined with a median filter post-processing. We show the efficiency of kernel tuning through the novel Kernel Target Alignment criterion. Quantitative ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
We compare in this paper diverse hierarchical and multi-class approaches for the speech/music segmentation task, based on Support Vector Machines, combined with a median filter post-processing. We show the efficiency of kernel tuning through the novel Kernel Target Alignment criterion. Quantitative results provide an F-measure of 96.9%, that represents an error reduction of about 50 % compared to the results gathered by the French ESTER evaluation campaign. We also show the relevance of the SVM with very low feature vector dimension on this task. 1.
(Show Context)

Citation Context

...of a Kernel and the target matrix, and thus allows the tuning of the kernels parameters (such as σ for the Gaussian kernel), without any training of the SVM. Pothin and Richard have later observed in =-=[11]-=- that the KTA of a kernel Kθ can easily be differenciated with respect to the kernel parameter θ. Indeed, if we define the matrix ∂θKθ = [∂θκθ(xi, xj)], then ∂θ 〈Kθ, K ∗ 〉 F = 〈∂θKθ, K ∗ 〉 F ∂θ||Kθ||F...

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University