Relational concepts and the fourier transform: An empirical study

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1418, Issue , 1998, Pages 411-425

  Pérez, Eduardo ^a   Rendell, Larry ^b  

^a UNIVERSIDAD AUTÓNOMA DE MADRID   (Spain)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

APPROACHES TO LEARNING; CONTROLLED EXPERIMENT; DATA REPRESENTATIONS; DOMAIN KNOWLEDGE; EMPIRICAL STUDIES; LEARNING METHODS; REAL WORLD DOMAIN; RELATIONAL STRUCTURES;

FOURIER TRANSFORMS;

EID: 84958606722     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-64575-6_67     Document Type: Conference Paper

References (18)

1. Yaser S. Abu-Mostafa. Complexity of random problems. In Yaser S. Abu-Mostafa, editor, Complexity in Information Theory, chapter VI, pages 115-131. Springer-Verlag, NY, 1988.
2. Mihir Bellare. A technique for upper bounding the spectral norm with applications to learning. In Proc. of the Fifth Annual Conf. on Computational Learning Theory, pages 62-70, 1992.
3. Peter Y. Chou and Gerald D. Fasman. Prediction of protein conformation. Biochemistry, 13(2):222-245, 1974.
4. Li-Min Fu and Bruce G. Buchanan. Learning intermediate concepts in constructing a hierarchical knowledge base. In Proc. of the Ninth Int. Joint Conf. on Artificial Intelligence, pages 659-666, 1985.
5. Eyal Kushilevitz and Yishay Mansour. Learning decision trees using the fourier transform. In Proc. of the 23rd Annual ACM Symp. on Theory of Computing, pages 455-464. ACM Press, 1991.
6. Yishay Mansour. Learning boolean functions via the fourier transform. In V. P. Roychodhury, K-Y. Siu, and A. Orlitsky, editors, Advances in Neural Computation, pages 151-155. Kluwer Academic Publishers, 1994.
7. Yishay Mansour and Sahar Sigal. Implementation isssues in the fourier transform algorithm. In Proc. of the Neural Information Processing Systems, Natural and Synthetic, 1995.
8. Tom M. Mitchell. The need for biases in learning generalizations. Technical Report CBM-TR-117, Computer Science Department, Rutgers University, New Brunswick, NJ 08903, May 1980.
9. Giulia Pagallo and David Haussler. Boolean feature discovery in empirical learning. Machine Learning, 5:71-99, 1990.
10. Eduardo Perez and Larry A. Rendell. Using multidimensional projection to find relations. In Proc. of the 12th Int. Conf. on Machine Learning, pages 447-455. Morgan Kaufmann Publishers, Inc., 1995.
11. Eduardo Perez and Larry A. Rendell. Learning despite concept variation by finding structure in attribute-based data. In Proc. of the 13th Int. Conf. on Machine Learning, pages 391-399. Morgan Kaufmann Publishers, Inc., 1996.
12. Leonard Pitt and Leslie G. Valiant. Computational limitations of learning from examples. Journal of the Association for Computing Machinery, 35(4):965-984, October 1988.
13. J. Ross Quinlan. C’4.5: Programs for Machine Learning. Morgan Kaufmann Publishers, Inc., Palo Alto, CA, 1993.
14. Larry Rendell. A general framework for induction and a study of selective induction. Machine Learning, 1(2): 177–226, 1986.
15. Larry A. Rendell and Raj Seshu. Learning hard concepts through constructive induction: Framework and rationale. Computational Intelligence, 6:247-270, 1990.
16. Cullen Schaffer. A conservation law for generalization performance. In Proc. of the Eleventh Int. Conf. on Machine Learning, pages 259-265, 1994.
17. Raj Seshu. Solving the parity problem. In Proc. of the 4th European Working Session on Learning, pages 263-271, Montpellier, France, December 1989.
18. Satosi Watanabe. Knowing and Guessing. John Wiley & Sons, New York, 1969.