Exploiting label dependencies for improved sample complexity
type: Item
instance of: scholarly article
title: Exploiting label dependencies for improved sample complexity
zbMATH Open document ID: 1273.68294
author: Lena Chekina
author: Dan Gutfreund
author: Lior Rokach
author: Bracha Shapira
author: Aryeh Kontorovich
published in: Machine Learning
publication date: 2013-10-22T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 62H30
zbMATH DE Number: 6217885
zbMATH Keywords: multi-label classification
zbMATH Keywords: conditional and unconditional label dependence
zbMATH Keywords: generalization bounds
zbMATH Keywords: multi-label evaluation measures
zbMATH Keywords: ensemble learning algorithms
zbMATH Keywords: ensemble models diversity
zbMATH Keywords: empirical experiment
zbMATH Keywords: artificial datasets
describes a project that uses: BoosTexter
describes a project that uses: MULAN
MaRDI profile type: Publication
full work available at URL: s10994-012-5312-9
OpenAlex ID: W2034845197
cites work: Learnability and the Vapnik-Chervonenkis dimension
cites work: On label dependence and loss minimization in multi-label classification
cites work: Q3093335
cites work: The VC dimension of \(k\)-fold union
cites work: \(k\)-Fold unions of low-dimensional concept classes
cites work: Toward efficient agnostic learning
cites work: Wrappers for feature subset selection
cites work: Convergence of stochastic processes
cites work: Genetic algorithm-based feature set partitioning for classification problems
cites work: Q3631310
cites work: BoosTexter: A boosting-based system for text categorization
cites work: On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
cites work: Q4856771
cites work: Feature selection for multi-label naive Bayes classification
DOI: 10.1007/S10994-012-5312-9
description: scientific article; zbMATH DE number 6217885