Efficient Kernel Calculation for Multirelational Data

dc.contributor.authorRüping, Stefande
dc.date.accessioned2004-12-06T18:49:52Z
dc.date.available2004-12-06T18:49:52Z
dc.date.issued2002de
dc.description.abstractToday, 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.en
dc.format.extent70751 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/2003/5209
dc.identifier.urihttp://dx.doi.org/10.17877/DE290R-5271
dc.language.isoende
dc.publisherUniversitätsbibliothek Dortmundde
dc.subjectsupport vector machinesen
dc.subjectefficiencyen
dc.subject.ddc310de
dc.titleEfficient Kernel Calculation for Multirelational Dataen
dc.typeTextde
dc.type.publicationtypereporten
dcterms.accessRightsopen access

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
tr52-02.pdf
Size:
69.09 KB
Format:
Adobe Portable Document Format
Description:
DNB