Learning nearly monotone k-term DNF

Information Processing Letters

Volumn 67, Issue 2, 1998, Pages 75-79

  Castro, Jorge ^a   Guijarro, David ^a   Lavín, Víctor ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Algorithms; Concept learning; Kolmogorov complexity; Query learning

Indexed keywords

COMPUTATIONAL COMPLEXITY; LEARNING ALGORITHMS; MEMBERSHIP FUNCTIONS; POLYNOMIALS;

KOLMOGOROV COMPLEXITY;

LEARNING SYSTEMS;

EID: 0032114456     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00090-8     Document Type: Article

References (10)

1. D. Angluin, Learning k-term DNF formulas using queries and counter-examples, Technical Report YALEU/DCS/RR-559, Yale University, 1987.
2. D. Angluin, Learning regular sets from queries and counterexamples, Inform. and Comput. 75 (1987) 87-106.
3. D. Angluin, Queries and concept learning, Mach. Learning 2 (4) (1988) 319-342.
4. D. Angluin, Negative results for equivalence queries. Mach. Learning 5 (1990) 319-342.
5. U. Berggren, Linear time deterministic learning of k-term DNF, in: Proc. 6th Annual Workshop on Comput. Learning Theory, ACM Press, New York, 1993, pp. 37-40.
6. A. Blum, S. Rudich, Fast learning of k-term DNF formulas with queries, J. Comput. System Sci. 51 (1995) 367-373.
7. N. Bshouty, Simple learning algorithms using divide and conquer, in: Proc. 8th Annual ACM Workshop on Comput. Learning Theory, 1995, pp. 447-453.
8. N. Bshouty, R. Cleve, R. Gavaldà, S. Kannan, C. Tamon, Oracles and queries that are sufficient for exact learning, J. Comput. System Sci. 52 (1996) 421-433.
9. N. Bshouty, S. Goldman, T. Hancock, S. Matar, Asking queries to minimize errors, in: Proc. 6th Annual Workshop on Comput. Learning Theory, ACM Press, New York, 1993, pp. 41-50.
10. M. Li, P. Vitányi, Learning simple concepts under simple distributions, SIAM J. Comput. 20 (1991) 911-935.