Rademacher Complexity Bounds for a Penalized Multi-class Semi-supervised Algorithm

DOI10.1613/jair.5638zbMath1443.68150arXiv1607.00567OpenAlexW2472087060MaRDI QIDQ4639035

Yury Maximov, Zaid Harchaoui, Massih-Reza Amini

Publication date: 2 May 2018

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1607.00567

zbMATH Keywords

clusteringmulti-class classifierssemi-supervised model

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Related Items (1)

On uniform concentration bounds for bi-clustering by using the Vapnik-Chervonenkis theory

This page was built for publication: Rademacher Complexity Bounds for a Penalized Multi-class Semi-supervised Algorithm