Pro JavaScript with MooTools

Go beyond JavaScript basics-learn advanced JavaScript features and techniques, as well as how...

Learn Objective-C for Java Developers

Learn Objective-C for Java Developers will guide experienced Java developers into the world of...

JavaFX 2.0: Introduction by Example

JavaFX 2.0: Introduction by Example provides a quick start to programming the JavaFX 2.0...

CentOS 6 Linux Server Cookbook

CentOS is a community-based enterprise class operating system and this book will provide a...

Linux Network Administrator's Guide, 3rd Edition

The Linux Network Administrator's Guide, 3rd Edition dispenses all the practical advice...

Categories Navigation

What category are you looking for?


In this book, we develop and evaluate machine learning algorithms that can learn effectively from data with complex interactions and ambiguous labels. The need for such algorithms is motivated by such problems as protein-protein binding and drug activity prediction. In the rest part of the thesis, we focus on the problem of myopia. This problem arises when greedy learning strategies are applied to learn from data with complex interactions.
We present skewing, our approach to alleviating myopia. We describe theoretical results and empirical results on Boolean data that show that our approach can learn effectively from data with complex interactions. We investigate the effects of various parameter choices on our approach, and the effects of dimensionality and class-label noise. We then propose and evaluate a variant that scales better to high-dimensional data. Finally, we propose and evaluate an extension that is able to learn from non-Boolean data with similar complex interactions as in the Boolean case.
In the second part of the thesis, we focus on the multiple-instance (MI) problem. This problem arises when the class labels or responses of individual instances are unknown, but there are constraints relating the labels of collections of instances (bags). We first describe an empirical evaluation of several multiple-instance and supervised learning methods on several MI datasets. From our study, we derive several useful observations about the accuracy of supervised and MI methods on MI data. We next design and evaluate an approach to learning combining functions from data. These functions are used to combine predictions on each instance into a prediction for a bag. Finally, we consider the problem of regression in a multiple-instance setting. We show that an exact solution to this problem is NP-hard, and develop and evaluate approximation algorithms for MI regression on synthetic and real-world drug activity prediction problems. Our experiments show that there is value in considering the MI setting in regression as well as in learning combining functions from data. We proceed by presenting the Gaussian processes for global optimization (gpgo) algorithm, which provides a Bayesian decision-theoretical framework for global function optimization.


Machine Learning / Artificial Intelligence / Computer Science
Added on
Apr 1, 2014 
Read This eBook

Leave Comment

characters left:

captchaPlease input letters you see on the image.
Click on image to redraw.


Rating: 0.00 / 10 (0 Vote cast)

Latest Comments

a / Oct 23, 2014
This book provides one of the best primers on Big Data that I've seen for a general business and...

Asher / Sep 4, 2014
This book skips so many intermediate steps that it is not suitable for beginners.

Asher / Sep 4, 2014
By far the best intro to Java I have ever encountered,this book was all I needed to learn Java....