Corrigendum: Corrigendum to “Shifting: One-inclusion mistake bounds and sample compression” [J. Comput. System Sci. 75 (1) (2009) 37--59]

  • Authors:

  • Benjamin I. P. Rubinstein;Peter L. Bartlett;J. Hyam Rubinstein

  • Affiliations:

  • Computer Science Division, University of California, Berkeley, 387 Soda Hall #1776, Berkeley, CA 94720-1776, United States;Computer Science Division, University of California, Berkeley, 387 Soda Hall #1776, Berkeley, CA 94720-1776, United States and Department of Statistics, University of California, Berkeley, 367 Eva ...;Department of Mathematics & Statistics, University of Melbourne, Parkville, VIC 3010, Australia

  • Venue:
  • Journal of Computer and System Sciences
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

H. Simon and B. Szorenyi have found an error in the proof of Theorem 52 of ''Shifting: One-inclusion mistake bounds and sample compression'', Rubinstein et al. (2009) [3]. In this note we provide a corrected proof of a slightly weakened version of this theorem. Our new bound on the density of one-inclusion hypergraphs is again in terms of the capacity of the multilabel concept class. Simon and Szorenyi have recently proved an alternate result in Simon and Szorenyi (2009) [4].