Efficient Semi-supervised and Active Learning of Disjunctions
نویسندگان
چکیده
We provide efficient algorithms for learning disjunctions in the semi-supervised setting under a natural regularity assumption introduced by (Balcan & Blum, 2005). We prove bounds on the sample complexity of our algorithms under a mild restriction on the data distribution. We also give an active learning algorithm with improved sample complexity and extend all our algorithms to the random classification noise setting.
منابع مشابه
Efficient Semi-supervised and Active Learning of Disjunctions: Supplementary Material
To complete the proof, it is sufficient to show that CU,χ(0) ⊆ CD,χ( ). Since any hypothesis in CU,χ(0) is compatible with any example containing variables from only one component, we only need to show that there is at most probability mass of examples that contain variables from multiple components. All such examples correspond to edges that are absent from Gcom(U), so we only need to show tha...
متن کاملEfficient Active Learning with Boosting
This paper presents an active learning strategy for boosting. In this strategy, we construct a novel objective function to unify semi-supervised learning and active learning boosting. Minimization of this objective is achieved through alternating optimization with respect to the classifier ensemble and the queried data set iteratively. Previous semi-supervised learning or active learning method...
متن کاملSemi-Supervised Learning Based Prediction of Musculoskeletal Disorder Risk
This study explores a semi-supervised classification approach using random forest as a base classifier to classify the low-back disorders (LBDs) risk associated with the industrial jobs. Semi-supervised classification approach uses unlabeled data together with the small number of labelled data to create a better classifier. The results obtained by the proposed approach are compared with those o...
متن کاملAn Efficient Iterative Framework for Semi- Supervised Clustering Based Batch Sequential Active Learning Approach
Semi-supervised is the machine learning field. In the previous work, selection of pairwise constraints for semi-supervised clustering is resolved using active learning method in an iterative manner. Semi-supervised clustering derived from the pairwise constraints. The pairwise constraint depends on the two kinds of constraints such as must-link and cannot-link.In this system, enhanced iterative...
متن کاملAn Efficient Iterative Framework for Semi-supervised Clustering Based Batch Sequential Active Learning Approach
Semi-supervised is the machine learning field. In the previous work, selection of pairwise constraints for semi-supervised clustering is resolved using active learning method in an iterative manner. Semi-supervised clustering derived from the pairwise constraints. The pairwise constraint depends on the two kinds of constraints such as must-link and cannot-link.In this system, enhanced iterative...
متن کامل