Combining labeled and unlabeled data with co-training
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Learning to remove Internet advertisements
Proceedings of the third annual conference on Autonomous Agents
Analyzing the effectiveness and applicability of co-training
Proceedings of the ninth international conference on Information and knowledge management
Bayesian Averaging of Classifiers and the Overfitting Problem
ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
Multi-task feature and kernel selection for SVMs
ICML '04 Proceedings of the twenty-first international conference on Machine learning
ICDM '04 Proceedings of the Fourth IEEE International Conference on Data Mining
An RKHS for multi-view learning and manifold co-regularization
Proceedings of the 25th international conference on Machine learning
Laplace maximum margin Markov networks
Proceedings of the 25th international conference on Machine learning
Maximum Entropy Discrimination Markov Networks
The Journal of Machine Learning Research
Sparse Semi-supervised Learning Using Conjugate Functions
The Journal of Machine Learning Research
Multitask Sparsity via Maximum Entropy Discrimination
The Journal of Machine Learning Research
Feature selection and dualities in maximum entropy discrimination
UAI'00 Proceedings of the Sixteenth conference on Uncertainty in artificial intelligence
The Journal of Machine Learning Research
Multi-view laplacian support vector machines
ADMA'11 Proceedings of the 7th international conference on Advanced Data Mining and Applications - Volume Part II
Hi-index | 0.00 |
Maximum entropy discrimination (MED) is a general framework for discriminative estimation based on the well known maximum entropy principle, which embodies the Bayesian integration of prior information with large margin constraints on observations. It is a successful combination of maximum entropy learning and maximum margin learning, and can subsume support vector machines (SVMs) as a special case. In this paper, we present a multi-view maximum entropy discrimination framework that is an extension of MED to the scenario of learning with multiple feature sets. Different from existing approaches to exploiting multiple views, such as co-training style algorithms and co-regularization style algorithms, we propose a new method to make use of the distinct views where classification margins from these views are required to be identical. We give the general form of the solution to the multi-view maximum entropy discrimination, and provide an instantiation under a specific prior formulation which is analogical to a multi-view version of SVMs. Experimental results on real-world data sets show the effectiveness of the proposed multi-view maximum entropy discrimination approach.