A Simple Algorithm for Learning O (log n)-Term DNF
暂无分享,去创建一个
[1] Eyal Kushilevitz,et al. On the applications of multiplicity automata in learning , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[2] Francesco Bergadano,et al. Learning Sat-k-DNF formulas from membership queries , 1996, STOC '96.
[3] Aravind Srinivasan,et al. Splitters and near-optimal derandomization , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[4] Nader H. Bshouty,et al. Simple learning algorithms using divide and conquer , 1995, COLT '95.
[5] Eyal Kushilevitz,et al. On learning Read-k-Satisfy-j DNF , 1994, COLT '94.
[6] Francesco Bergadano,et al. Learning Behaviors of Automata from Multiplicity and Equivalence Queries , 1994, SIAM J. Comput..
[7] Umesh V. Vazirani,et al. An Introduction to Computational Learning Theory , 1994 .
[8] Nader H. Bshouty,et al. Exact learning via the Monotone theory , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[9] Linda Sellie,et al. Learning sparse multivariate polynomials over a field with queries and counterexamples , 1993, COLT '93.
[10] Leonard Pitt,et al. Exact learning of read-k disjoint DNF and not-so-disjoint DNF , 1992, COLT '92.
[11] Avrim Blum,et al. Fast learning of k-term DNF formulas with queries , 1992, STOC '92.
[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.
[14] Dana Angluin,et al. Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..