A simple algorithm for learning O(log n)-term DNF
暂无分享,去创建一个
[1] Avrim Blum,et al. Fast learning of k-term DNF formulas with queries , 1992, STOC '92.
[2] Dana Angluin,et al. Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..
[3] Umesh V. Vazirani,et al. An Introduction to Computational Learning Theory , 1994 .
[4] Eyal Kushilevitz,et al. On learning Read-k-Satisfy-j DNF , 1994, COLT '94.
[5] D. Angluin. Queries and Concept Learning , 1988 .
[6] Linda Sellie,et al. Learning sparse multivariate polynomials over a field with queries and counterexamples , 1993, COLT '93.
[7] Nader H. Bshouty. Simple learning algorithms using divide and conquer , 1995, COLT '95.
[8] Leonard Pitt,et al. Exact learning of read-k disjoint DNF and not-so-disjoint DNF , 1992, COLT '92.
[9] Francesco Bergadano,et al. Learning Sat-k-DNF formulas from membership queries , 1996, STOC '96.
[10] Thomas R. Hancock,et al. Learning 2u DNF formulas and ku decision trees , 1991, COLT 1991.
[11] Francesco Bergadano,et al. Learning Behaviors of Automata from Multiplicity and Equivalence Queries , 1994, SIAM J. Comput..
[12] H. Aizenstein,et al. Exact learning of read-twice DNF formulas , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[13] Ronald L. Rivest,et al. Inference of finite automata using homing sequences , 1989, STOC '89.