← Core Methods
Machine Learning › Core Methods ›

Classification

15289 directly classified papers

Papers per year

Papers

Discriminative Clustering by Regularized Information Maximization NIPS 2010
A Theory of Multiclass Boosting NIPS 2010
Efficient Optimization for Discriminative Latent Class Models NIPS 2010
Universal Kernels on Non-Standard Input Spaces NIPS 2010
Worst-Case Linear Discriminant Analysis NIPS 2010
Learning Multiple Tasks with a Sparse Matrix-Normal Penalty NIPS 2010
Active Learning by Querying Informative and Representative Examples NIPS 2010
Feature Set Embedding for Incomplete Data NIPS 2010
Improving Human Judgments by Decontaminating Sequential Dependencies NIPS 2010
Subgraph Detection Using Eigenvector L1 Norms NIPS 2010
Energy Disaggregation via Discriminative Sparse Coding NIPS 2010
Probabilistic Multi-Task Feature Selection NIPS 2010
Predictive Subspace Learning for Multi-view Data: a Large Margin Approach NIPS 2010
Multivariate Dyadic Regression Trees for Sparse Learning Problems NIPS 2010
t-logistic regression NIPS 2010
Tight Sample Complexity of Large-Margin Learning NIPS 2010
Online Classification with Specificity Constraints NIPS 2010
Multiple Kernel Learning and the SMO Algorithm NIPS 2010
Static Analysis of Binary Executables Using Structural SVMs NIPS 2010
Joint Cascade Optimization Using A Product Of Boosted Classifiers NIPS 2010
MAP estimation in Binary MRFs via Bipartite Multi-cuts NIPS 2010
Gaussian processes with monotonicity information AISTATS 2010
Convexity of Proper Composite Binary Losses AISTATS 2010
Nonparametric prior for adaptive sparsity AISTATS 2010
Fluid Dynamics Models for Low Rank Discriminant Analysis AISTATS 2010