scientific article; zbMATH DE number 6253915
From MaRDI portal
Publication:5396650
zbMath1280.68162MaRDI QIDQ5396650
Ben Sapp, Timothee Cour, Ben Taskar
Publication date: 3 February 2014
Full work available at URL: http://www.jmlr.org/papers/v12/cour11a.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
weakly supervised learninggeneralization boundsmulticlass classificationconvex learningnames and faces
Nonparametric regression and quantile regression (62G08) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (17)
V-shaped interval insensitive loss for ordinal classification ⋮ Partial data querying through racing algorithms ⋮ Maximum margin partial label learning ⋮ Non-linear dictionary learning with partially labeled data ⋮ Parametric classification with soft labels using the evidential EM algorithm: linear discriminant analysis versus logistic regression ⋮ Addressing label ambiguity imbalance in candidate labels: measures and disambiguation algorithm ⋮ Semisupervised, Multilabel, Multi-Instance Learning for Structured Data ⋮ Instance weighting through data imprecisiation ⋮ Rough set-based feature selection for weakly labeled data ⋮ Unnamed Item ⋮ Learning from imprecise and fuzzy observations: data disambiguation through generalized loss minimization ⋮ The three-way-in and three-way-out framework to treat and exploit ambiguity in data ⋮ Noisy label tolerance: a new perspective of partial multi-label learning ⋮ Ground truthing from multi-rater labeling with three-way decision and possibility theory ⋮ On the relative value of weak information of supervision for learning generative models: an empirical study ⋮ Unnamed Item ⋮ Racing trees to query partial data
This page was built for publication:
