A general dimension for query learning

DOI10.1016/J.JCSS.2007.03.003zbMATH Open1121.68059OpenAlexW2126224160MaRDI QIDQ2641869FDOQ2641869

Authors: José L. Balcázar, David Guijarro, Johannes Köbler, Jorge Castro, Wolfgang Lindner 

Publication date: 23 August 2007

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2007.03.003

Recommendations

• scientific article; zbMATH DE number 1966612
• scientific article; zbMATH DE number 1804113
• The complexity of learning concept classes with polynomial general dimension
• A new abstract combinatorial dimension for exact learning via queries
• Queries revisited.

zbMATH Keywords

query learninglearning DNF formulasstatistical querieslearning by distancesUAV queries

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Cites Work

• Queries and concept learning
• Boosting a weak learning algorithm by majority
• An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
• Efficient noise-tolerant learning from statistical queries
• Weakly learning DNF and characterizing statistical query learning using Fourier analysis
• How many queries are needed to learn?
• General bounds on statistical query learning and PAC learning with noise via hypothesis boosting
• 10.1162/153244302760200669
• On the complexity of teaching
• Learning from examples with unspecified attribute values.
• A new abstract combinatorial dimension for exact learning via queries
• The complexity of learning concept classes with polynomial general dimension
• Learning by distances
• Algorithmic Learning Theory
• A theoretical analysis of query selection for collaborative filtering
• Structural results about exact learning with unspecified attribute values
• The consistency dimension and distribution-dependent learning from queries.

Cited In (14)

• A new abstract combinatorial dimension for exact learning via queries
• Title not available (Why is that?)
• Algorithmic Learning Theory
• Title not available (Why is that?)
• The consistency dimension and distribution-dependent learning from queries.
• A complete characterization of statistical query learning with applications to evolvability
• Queries revisited.
• Title not available (Why is that?)
• On the Power of Learning from k-Wise Queries
• LAQP: learning-based approximate query processing
• Title not available (Why is that?)
• Title not available (Why is that?)
• Learning definite Horn formulas from closure queries
• The complexity of learning concept classes with polynomial general dimension

This page was built for publication: A general dimension for query learning

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