conftrace_
← Core Methods
Machine Learning › Core Methods ›

Classification

15,805 papers

Papers per year

2
26
134
262
1678
1390
'00
'05
'10
'15
'20
'25

Papers

Part & Clamp: Efficient Structured Output Learning AISTATS 2012
Informative Priors for Markov Blanket Discovery AISTATS 2012
Local Anomaly Detection AISTATS 2012
Multi-armed Bandit Problems with History AISTATS 2012
Joint Estimation of Structured Sparsity and Output Structure in Multiple-Output Regression via Inverse-Covariance Regularization AISTATS 2012
Fast Learning Rate of Multiple Kernel Learning: Trade-Off between Sparsity and Smoothness AISTATS 2012
Structured Output Learning with High Order Loss Functions AISTATS 2012
Randomized Optimum Models for Structured Prediction AISTATS 2012
Transductive Learning of Structural SVMs via Prior Knowledge Constraints AISTATS 2012
Efficient Distributed Linear Classification Algorithms via the Alternating Direction Method of Multipliers AISTATS 2012
A Composite Likelihood View for Multi-Label Classification AISTATS 2012
Scaling up Kernel SVM on Limited Resources: A Low-rank Linearization Approach AISTATS 2012
Sparse Additive Machine AISTATS 2012
Multi-label Subspace Ensemble AISTATS 2012
Unsupervised SVMs: On the Complexity of the Furthest Hyperplane Problem COLT 2012
Generalization Bounds for Online Learning Algorithms with Pairwise Loss Functions COLT 2012
Consistency of Nearest Neighbor Classification under Selective Sampling COLT 2012
Competitive Classification and Closeness Testing COLT 2012
A Characterization of Scoring Rules for Linear Properties COLT 2012
Divergences and Risks for Multiclass Experiments COLT 2012
A Conjugate Property between Loss Functions and Uncertainty Sets in Classification Problems COLT 2012
Open Problem: Better Bounds for Online Logistic Regression COLT 2012
Open Problem: Does AdaBoost Always Cycle? COLT 2012
Conditional Likelihood Maximisation: A Unifying Framework for Information Theoretic Feature Selection JMLR 2012
An Active Learning Algorithm for Ranking from Pairwise Preferences with an Almost Optimal Query Complexity JMLR 2012