Learning from examples and membership queries with structured determinations

Machine Learning

Volumn 32, Issue 3, 1998, Pages 245-295

  Tadepalli, Prasad ^a   Russell, Stuart ^b  

^a Oregon State University   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Controlled experimentation; Declarative bias; Determinations; Pac learning; Prior knowledge; Queries; Read once formulas; Tree structured bias

Indexed keywords

CONTROLLED EXPERIMENTATION; DECLARATIVE BIAS; DETERMINATIONS; PAC-LEARNING; PRIOR KNOWLEDGE; QUERIES; READ-ONCE FORMULAS; TREE-STRUCTURED BIAS;

ALGORITHMS; BOOLEAN FUNCTIONS; GRAPH THEORY; KNOWLEDGE ACQUISITION; QUERY LANGUAGES; RANDOM PROCESSES; TREES (MATHEMATICS); LEARNING ALGORITHMS;

LEARNING SYSTEMS;

DECLARATIVE BIAS; TREE-STRUCTURED BIAS;

EID: 0032157958     PISSN: 08856125     EISSN: 15730565     Source Type: Journal    
DOI: 10.1023/A:1007421315813     Document Type: Article

References (40)

1. nd Annual IEEE Symposium on Foundations of Computer Science, (pp. 170-179). Washington, D.C.: IEEE Computer Society Press.
2. Angluin, D. (1988). Queries and concept learning. Machine Learning, 2(4), 319-342.
3. Angluin, D., Hellerstein, L., & Karpinski, M. (1993). Learning read-once formulas with queries. Journal of the ACM, 40(1), 185-210.
4. Angluin, D., & Kharitonov, M. (1995). When won't membership queries help?. Journal of Computer and Systems Sciences, 50(2), 336-355.
5. Baffes, P., & Mooney, R. (1993). Extending theory refinement to m-of-n rules. Informatica, 17, 387-397.
6. Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. (1989). Learnability and the Vapnik-Chervonenkis dimension. Journal of the ACM, 36(4), 929-965.
7. Bshouty, N., Hancock, T., & Hellerstein, L. (1992). Learning Boolean read-once formulas with arbitrary symmetric and constant fan-in gates. In Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory, (pp. 1-15). Pittsburgh, PA: ACM Press.
8. Bshouty, N., Hancock, T., & Hellerstein, L. (1995). Learning Boolean read-once formulas over generalized bases. Journal of Computer and Systems Sciences, 50(3), 521-542.
9. Bshouty, N., Hancock, T., & Hellerstein, L. (1995). Learning arithmetic read-once formulas. SIAM Journal on Computing, 24(4), 706-35.
10. Cohen, W. (1991). The generality of overgenerality. In Proceedings of the Eighth International Workshop on Machine Learning, (pp. 490-494). Evanston, IL: Morgan Kaufmann.
11. Cohen, W. (1992). Compiling prior knowledge into an explicit bias. In Proceedings of the Ninth International Conference on Machine Learning, (pp. 102-110). Austin, TX: Morgan Kaufmann.
12. Cooper, G., & Herskovits, E. (1992). A Bayesian method for the induction of probabilistic networks from data. Machine Learning, 9(4), 309-348.
13. Davies, T. (1985). Analogy. Informal note IN-CSLI-85-4, CSLI, Stanford University.
14. Friedman, N. (1997). Learning belief networks in the presence of missing values and hidden variables. In Proceedings of International Conference on Machine Learning, (pp. 125-133). Nashville, TN: Morgan Kaufmann.
15. Getoor, L. (1989). The instance description: How it can be derived and the use of its derivation. Unpublished ms report, Computer Science Division, University of California, Berkeley, CA. Later published as NASA Ames Research Center Technical Report IC-94-04.
16. Hancock, T. (1991). Learning 2μDNF formulas and kμ decision trees. In Proceedings of the Fourth Annual Workshop on Computational Learning Theory, (pp. 199-209). San Mateo, CA: Morgan Kaufmann.
17. Hancock, T., & Hellerstein, L. (1991). Learning read-once formulas over fields and extended bases. In Proceedings of the Fourth Annual Workshop on Computational Learning Theory, (pp. 326-336). Santa Cruz, CA: Morgan Kaufmann.
18. Hirsh, H. (1990). Knowledge as bias. In Benjamin, D. (Ed.), Change of Representation and Inductive Bias, pp. 209-221. Kluwer, Norwell, MA.
19. Kèarns, M., & Valiant, L. (1994). Cryptographic limitations on learning Boolean formulae and finite automata. Journal of the ACM, 41(1), 67-95.
20. Kohavi, R., & Benson, S. (1993). Research note on decision lists. Machine Learning, 13(1), 131-134.
21. Mahadevan, S., & Tadepalli, P. (1994). Quantifying prior determination knowledge using PAC learning model. Machine Learning, 17(1), 69-105.
22. Mitchell, T. (1980). The need for biases in learning generalizations. In Shavlik, J., & Dietterich, T. (Eds.), Readings in Machine Learning, pp. 184-191. Morgan Kaufmann, San Mateo, CA. Originally published as Rutgers University technical report.
23. Muggleton, S., & Feng, C. (1990). Efficient induction of logic programs. In Proceedings of the First Conference on Algorithmic Learning Theory, (pp. 369-381). Tokyo, Japan: Ohmsha.
24. Pagallo, G., & Haussler, D. (1990). Boolean feature discovery in empirical learning. Machine Learning, 5, 71-99.
25. Pazzani, M., & Kibler, D. (1992). The utility of knowledge in inductive learning. Machine Learning, 9(1), 57-94.
26. Pearl, J. (1988). Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Mateo, CA.
27. Pillaipakkamnatt, K., & Raghavan, V. (1995). Read-twice DNF formulas are properly learnable. Information and Computation, 122(2), 236-267.
28. Quinlan, R. (1986). Induction of decision trees. Machine Learning, 1(1), 81-106.
29. Quinlan, R. (1990). Learning logical definitions from relations. Machine Learning, 5, 239-266.
30. Rivest, R. (1987). Learning decision lists. Machine Learning, 2(3), 229-246.
31. Russell, S. (1988). Tree-structured bias. In Proceedings of the Seventh National Conference on Artificial Intelligence, (pp. 641-645). Saint Paul, MN: Morgan Kaufmann.
32. Russell, S. (1989). The Use of Knowledge in Analogy and Induction. Morgan Kaufmann, San Mateo, CA.
33. th International Conference on Artificial Intelligence, (pp. 1146-1152). Montreal, Canada: Morgan Kaufmann.
34. Russell, S., & Grosof, B. (1987). A declarative approach to bias in concept learning. In Proceedings of the National Conference on Artificial Intelligence, (pp. 505-510). Seattle, WA: Morgan Kaufmann.
35. Russell, S., & Grosof, B. (1990). Declarative bias: An overview. In Benjamin, D. (Ed.), Change of Representation and Inductive Bias, pp. 267-308. Kluwer, Norwell, MA.
36. Shavlik, J., & Towell, G. (1989). An approach to combining explanation-based and neural learning algorithms. Connection Science, 3(1), 231-53.
37. Tadepalli, P. (1993). Learning from queries and examples with tree-structured bias. In Proceedings of the Tenth International Conference on Machine Learning, (pp. 322-329). Amherst, MA: Morgan Kaufmann.
38. Valiant, L. (1984). A theory of the learnable. Communications of the ACM, 27(11), 1134-1142.
39. Wegener, I. (1987). The Complexity of Boolean Functions. John Wiley & Sons, New York, NY.
40. Wilkins, D., Clancey, W., & Buchanan, B. (1987). Knowledge base refinement by monitoring abstract control knowledge. International Journal of Man-Machine Studies, 27(3), 281-293.