Efficient Kernel Calculation for Multirelational Data

Full metadata record

DC Field	Value	Language
dc.contributor.author	Rüping, Stefan	de
dc.date.accessioned	2004-12-06T18:49:52Z	-
dc.date.available	2004-12-06T18:49:52Z	-
dc.date.issued	2002	de
dc.identifier.uri	http://hdl.handle.net/2003/5209	-
dc.identifier.uri	http://dx.doi.org/10.17877/DE290R-5271	-
dc.description.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.	en
dc.format.extent	70751 bytes	-
dc.format.mimetype	application/pdf	-
dc.language.iso	en	de
dc.publisher	Universitätsbibliothek Dortmund	de
dc.subject	support vector machines	en
dc.subject	efficiency	en
dc.subject.ddc	310	de
dc.title	Efficient Kernel Calculation for Multirelational Data	en
dc.type	Text	de
dc.type.publicationtype	report	en
dcterms.accessRights	open access	-
Appears in Collections:	Sonderforschungsbereich (SFB) 475

Files in This Item:

File	Description	Size	Format
tr52-02.pdf	DNB	69.09 kB	Adobe PDF	View/Open

This item is protected by original copyright

Show simple item record

This item is protected by original copyright rightsstatements.org