loading...
Tangent Distance Kernels for Support Vector Machines
Quebec City, QC, Canada August 11-August 15
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICPR.2002.104843916th International Conference on Patt ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Bernard Haasdonk, Albert-Ludwigs-University Freiburg
Daniel Keysers, RWTH Aachen - University of Technology
When dealing with pattern recognition problems one encounters different types of a-priori knowledge. It is important to incorporate such knowledge into the classification method at hand. A very common type of a-priori knowledge is transformation invariance of the input data, e.g. geometric transformations of image-data like shifts, scaling etc. Distance based classification methods can make use of this by a modified distance measure called tangent distance [13, 14]. We introduce a new class of kernels for support vector machines which incorporate tangent distance and therefore are applicable in cases where such transformation invariances are known. We report experimental results which show that the performance of our method is comparable to other state-of-the-art methods, while problems of existing ones are avoided.
Citation:
Bernard Haasdonk, Daniel Keysers, "Tangent Distance Kernels for Support Vector Machines," icpr, vol. 2, pp.20864, 16th International Conference on Pattern Recognition (ICPR'02) - Volume 2, 2002
Usage of this product signifies your acceptance of the Terms of Use.