Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/77176
Authors: 
Rüping, Stefan
Year of Publication: 
2002
Series/Report no.: 
Technical Report, SFB 475: Komplexitätsreduktion in Multivariaten Datenstrukturen, Universität Dortmund 2002,52
Abstract: 
Today, most of the data in business applications is stored in relational database systems or in data warehouses built on top of relational database systems. Often, for more data is available than can be processed by standard learning algorithms in reasonable time. This paper presents an extension to kernel algorithms that makes use of the more compact relational representation of data instead of the usual attribute-value representation to significantly speed up the kernel calculation.
Subjects: 
Support Vector Machines
Efficiency
Document Type: 
Working Paper

Files in This Item:
File
Size
69.09 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.