Learning with Multiple Similarities
| dc.contributor.advisor | Daume III, Hal | en_US |
| dc.contributor.author | Kumar, Abhishek | en_US |
| dc.contributor.department | Computer Science | en_US |
| dc.contributor.publisher | Digital Repository at the University of Maryland | en_US |
| dc.contributor.publisher | University of Maryland (College Park, Md.) | en_US |
| dc.date.accessioned | 2013-10-09T05:34:31Z | |
| dc.date.available | 2013-10-09T05:34:31Z | |
| dc.date.issued | 2013 | en_US |
| dc.description.abstract | The notion of similarities between data points is central to many classification and clustering algorithms. We often encounter situations when there are more than one set of pairwise similarity graphs between objects, either arising from different measures of similarity between objects or from a single similarity measure defined on multiple data representations, or a combination of these. Such examples can be found in various applications in computer vision, natural language processing and computational biology. Combining information from these multiple sources is often beneficial in learning meaningful concepts from data. This dissertation proposes novel methods to effectively fuse information from these multiple similarity graphs, targeted towards two fundamental tasks in machine learning - classification and clustering. In particular, I propose two models for learning spectral embedding from multiple similarity graphs using ideas from co-training and co-regularization. Further, I propose a novel approach to the problem of multiple kernel learning (MKL), converting it to a more familiar problem of binary classification in a transformed space. The proposed MKL approach learns a ``good'' linear combination of base kernels by optimizing a quality criterion that is justified both empirically and theoretically. The ideas of the proposed MKL method are also extended to learning nonlinear combinations of kernels, in particular, polynomial kernel combination and more general nonlinear kernel combination using random forests. | en_US |
| dc.identifier.uri | http://hdl.handle.net/1903/14600 | |
| dc.subject.pqcontrolled | Computer science | en_US |
| dc.subject.pquncontrolled | co-regularization | en_US |
| dc.subject.pquncontrolled | co-training | en_US |
| dc.subject.pquncontrolled | machine learning | en_US |
| dc.subject.pquncontrolled | multiple kernel learning | en_US |
| dc.subject.pquncontrolled | multiview | en_US |
| dc.subject.pquncontrolled | spectral clustering | en_US |
| dc.title | Learning with Multiple Similarities | en_US |
| dc.type | Dissertation | en_US |
Files
Original bundle
1 - 1 of 1