Learning to Predict Combinatorial Structures
Learning to Predict Combinatorial Structures
dc.contributor.advisor | Wrobel, Stefan | |
dc.contributor.author | Vembu, Shankar | |
dc.date.accessioned | 2020-04-15T16:39:42Z | |
dc.date.available | 2020-04-15T16:39:42Z | |
dc.date.issued | 07.07.2010 | |
dc.identifier.uri | https://hdl.handle.net/20.500.11811/4608 | |
dc.description.abstract | The major challenge in designing a discriminative learning algorithm for predicting structured data is to address the computational issues arising from the exponential size of the output space. Existing algorithms make different assumptions to ensure efficient, polynomial time estimation of model parameters. For several combinatorial structures, including cycles, partially ordered sets, permutations and other graph classes, these assumptions do not hold. In this thesis, we address the problem of designing learning algorithms for predicting combinatorial structures by introducing two new assumptions: (i) The first assumption is that a particular counting problem can be solved efficiently. The consequence is a generalisation of the classical ridge regression for structured prediction. (ii) The second assumption is that a particular sampling problem can be solved efficiently. The consequence is a new technique for designing and analysing probabilistic structured prediction models. These results can be applied to solve several complex learning problems including but not limited to multi-label classification, multi-category hierarchical classification, and label ranking. | en |
dc.language.iso | eng | |
dc.rights | In Copyright | |
dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | |
dc.subject | Machine learning | |
dc.subject | Structured prediction | |
dc.subject | Kernel methods | |
dc.subject | Graph theory | |
dc.subject | Markov chain | |
dc.subject | Monte Carlo Theory | |
dc.subject.ddc | 004 Informatik | |
dc.title | Learning to Predict Combinatorial Structures | |
dc.type | Dissertation oder Habilitation | |
dc.publisher.name | Universitäts- und Landesbibliothek Bonn | |
dc.publisher.location | Bonn | |
dc.rights.accessRights | openAccess | |
dc.identifier.urn | https://nbn-resolving.org/urn:nbn:de:hbz:5N-22002 | |
ulbbn.pubtype | Erstveröffentlichung | |
ulbbnediss.affiliation.name | Rheinische Friedrich-Wilhelms-Universität Bonn | |
ulbbnediss.affiliation.location | Bonn | |
ulbbnediss.thesis.level | Dissertation | |
ulbbnediss.dissID | 2200 | |
ulbbnediss.date.accepted | 18.05.2010 | |
ulbbnediss.fakultaet | Mathematisch-Naturwissenschaftliche Fakultät | |
dc.contributor.coReferee | Clausen, Michael |
Dateien zu dieser Ressource
Das Dokument erscheint in:
-
E-Dissertationen (4168)