Bootstrap learning via modular concept discovery

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2013, Pages 1302-1309

  Dechter, Eyal ^a   Malmaud, Jon ^a   Adams, Ryan P ^b   Tenenbaum, Joshua B ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN CIRCUIT; COMMON STRUCTURES; FINITE SUBSETS; FUNCTIONAL PROGRAMS; MODULAR CONCEPTS; SOLUTION SPACE; STOCHASTIC GRAMMARS; SYMBOLIC REGRESSION;

ARTIFICIAL INTELLIGENCE;

PROBLEM SOLVING;

EID: 84896061120     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Andrew R. Barron, Jorma Rissanen, and Bin Yu. The minimum description length principle in coding and modeling. IEEE Transactions on Information Theory, 44(6):2743-2760, 1998.
2. Forrest Briggs and Melissa O'Neill. Functional genetic programming with combinators. In Proceedings of the Third Asian-Pacific workshop on Genetic Programming, ASPGP, pages 110-127, 2006.
3. Jerome A. Feldman, James Gips, James J. Horning, and Stephen Reder. Grammatical complexity and inference. Stanford University, 1969.
4. Patrick A. V. Hall. Equivalence between AND/OR graphs and context-free grammars. Commun. ACM, 16(7):444-445, 1973.
5. Susumu Katayama. Systematic search for lambda expressions. In Marko C. J. D. van Eekelen, editor, Trends in Functional Programming, volume 6 of Trends in Functional Programming, pages 111-126. Intellect, 2005.
6. Khalid Khan, Stephen Muggleton, and Rupert Parson. Repeat learning using predicate invention. In David Page, editor, ILP, volume 1446 of Lecture Notes in Computer Science, pages 165-174. Springer, 1998.
7. John R. Koza, Forrest H. Bennett III, David Andre, and Martin A. Keane. Reuse, parameterized reuse, and hierarchical reuse of substructures in evolving electrical circuits using genetic programming. In Tetsuya Higuchi, Masaya Iwata, and Weixin Liu, editors, ICES, volume 1259 of Lecture Notes in Computer Science, pages 312-326. Springer, 1996.
8. John R. Koza. Hierarchical automatic function definition in genetic programming. In L. Darrell Whitley, editor, FOGA, pages 297-318. Morgan Kaufmann, 1992.
9. John R. Koza. Genetic programming - on the programming of computers by means of natural selection. Complex adaptive systems. MIT Press, 1993.
10. Percy Liang, Michael I. Jordan, and Dan Klein. Learning programs: A hierarchical Bayesian approach. In International Conference on Machine Learning (ICML), pages 639-646, 2010.
11. Stephen Muggleton. Duce, an oraclebased approach to constructive induction. In John P. Mc- Dermott, editor, IJCAI, pages 287-292. Morgan Kaufmann, 1987.
12. Craig G. Nevill- Manning and Ian H. Witten. Identifying hierarchical structure in sequences: A linear-time algorithm. Journal of Artificial Intelligence Research, 7:67-82, 1997.
13. N.J. Nilsson. Principles of artificial intelligence. Symbolic Computation, Berlin: Springer, 1982, 1, 1982.
14. Benjamin C. Pierce. Types and Programming Languages. The MIT Press, 1 edition, 2002.
15. Larry A. Rendell. Substantial constructive induction using layered information compression: Tractable feature formation in search. In Aravind K. Joshi, editor, IJCAI, pages 650-658. Morgan Kaufmann, 1985.
16. Herbert A. Simon. The Sciences of the Artificial. MIT Press, 1996.
17. Alexey Rodriguez Yakushev and Johan Jeuring. Enumerating well-typed terms generically. In Ute Schmid, Emanuel Kitzelmann, and Rinus Plasmeijer, editors, AAIP, volume 5812 of Lecture Notes in Computer Science, pages 93-116. Springer, 2009.