k-Fold unions of low-dimensional concept classes

DOI10.1016/J.IPL.2009.09.005MaRDI QIDQ990081zbMATH OpenOpenAlexFDO

Authors David Eisenstat

Publication date 2 September 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2009.09.005

zbMATH Keywords

combinatorial problemsconcept classintersection of conceptsunion of conceptsVC dimension

Mathematics Subject Classification ID

Combinatorics in computer science (68R05)

Recommendations

• scientific article; zbMATH DE number 1983146
• Learning concepts and their unions from positive data with refinement operators
• The optimal PAC bound for intersection-closed concept classes
• A new PAC bound for intersection-closed concept classes
• Learning Theory
• Unifying reducts in formal concept analysis and rough set theory
• Unions of subspaces for data modeling and subspace clustering
• On approximately identifying concept classes in the limit
• Optimal unions of hidden classes

Cites work

• -nets and simplex range queries
• Learnability and the Vapnik-Chervonenkis dimension
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Some special Vapnik-Chervonenkis classes
• The VC dimension of \(k\)-fold union

Cited in

(3)

• Exploiting label dependencies for improved sample complexity
• Tight lower bounds on the VC-dimension of geometric set systems
• Near-tight closure bounds for the Littlestone and threshold dimensions

This page was built for publication: \(k\)-Fold unions of low-dimensional concept classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q990081)